Problem:


Score : 200 points

Problem Statement

Let w be a string consisting of lowercase letters.
We will call w beautiful if the following condition is satisfied:

Each lowercase letter of the English alphabet occurs even number of times in w.

You are given the string w. Determine if w is beautiful.

Constraints

1 \leq |w| \leq 100

w consists of lowercase letters (a-z).

Input

The input is given from Standard Input in the following format:

w

Output

Print Yes if w is beautiful. Print No otherwise.

Sample Input 1

abaccaba

Sample Output 1

Yes

a occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.

Sample Input 2

hthth

Sample Output 2

No



Sample input:
abaccaba


Sample output:
Yes

Submission status: Accepted

Solution code:
w=[i for i in input()]
print('Yes' if all([True if w.count(ch)%2==0 else False for ch in 'abcdefghijklmnopqrstuvwxyz']) else 'No')

Submission status: Accepted

Solution code:
s = sorted(input())
count = 0

if len(s)%2 == 1:
    print('No')

else:
    for i in range(0, len(s), 2):
        if s[i] == s[i+1]:
            continue
        else:
            count += 1

    if count == 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
def main():
  w = input()
  
  for i in range(26):
    c = chr(ord('a') + i)
    
    if w.count(c) % 2 == 1:
      print('No')
      return
  print('Yes')
  

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
w=input()
s=[0]*123
for i in range(len(w)):
    s[ord(w[i-1])]+=1
c=1
for i in range(97,97+26):
    if s[i]%2==1:
        c=0
        break
if c==1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=input()
p=list(set(list(s)))
a=[]
for i in p:
    a.append(s.count(i))
for x in a:
    if x%2!=0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
wset = set(w)
for i in wset:
    if w.count(i) % 2 != 0:
        print("No")
        exit(0)
print("Yes")

Submission status: Accepted

Solution code:
w=str(input())
w2=set(w)
flag=0
for i in w2:
    cnt=0
    cnt=w.count(i)
    if cnt%2==1:
        print("No")
        flag=1
        break
if flag==0:
    print("Yes")

Submission status: Accepted

Solution code:
w = input()
x = set(w)
ans = 'Yes'
for i in x:
    if w.count(i) % 2 == 1:
        ans = 'No'
        break
print(ans)

Submission status: Accepted

Solution code:
w = input()
c={}
for i in range(len(w)):
    if not w[i] in c:
        c[w[i]] =0
    c[w[i]] +=1

ans = "Yes"
for k in c.keys():
    if c[k] %2 !=0:
        ans = "No"

print(ans)

Submission status: Accepted

Solution code:
w=sorted(input())
s=list(set(w))
for i in range(len(s)):
    if(w.count(s[i])%2 == 0):
        continue
    else:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
S = input()

SS = list(set(S))
num = []
for i in range(len(SS)):
    num.append(S.count(SS[i]))
if all(n%2==0 for n in num):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import collections
a=list(input())
d=collections.defaultdict(str)
for s in a:
    if s not in d:
        d[s]=1
    else:
        d[s]+=1
c=0
for t in dict(d).values():
    if t%2!=0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
lst=[]
for i in input():
    lst.append(i)
for j in Counter(lst).values():
    if j%2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
dic = {}
flag = True

for wd in w:
  if wd not in dic:
    dic[wd] = 0
  dic[wd] += 1
  
for dicw in dic:
  if dic[dicw] % 2 == 1:
    flag = False
    break
    
if flag == True:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
w = input()
d = {}
for i in range(len(w)):
    if w[i] in d:
        d[w[i]] += 1
    else:
        d[w[i]] = 1
        
res = 'Yes'
for key in d:
    if d[key]%2 != 0:
        res ='No'
print(res)

Submission status: Accepted

Solution code:
w=input()
w_list=list(w)
for a in w_list:
    if w_list.count(a)%2==0:
        ans=True
    else:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter
w = Counter(input())
print('Yes' if all(v % 2 == 0 for v in w.values()) else 'No')

Submission status: Accepted

Solution code:
w = input()

se = set()
for s in w:
    if s in se:
        se.remove(s)
    else:
        se.add(s)

ans = 'Yes' if len(se) == 0 else 'No'

print(ans)

Submission status: Accepted

Solution code:
a=list(input())
b=[]
for i in range(len(a)):
    if a[i] in b:
        b.remove(a[i])
    else:
        b.append(a[i])
print('Yes' if b==[] else 'No')

Submission status: Accepted

Solution code:
import collections
Sigma = list("abcdefghijklmnopqrstuvwxyz")
w = list(input())
c = collections.Counter(w)
for _ in Sigma:
    if c[_] % 2:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
char_cnt = {}
for c in input():
    if c in char_cnt:
        char_cnt[c] += 1
    else:
        char_cnt[c] = 1
print("Yes" if all([v % 2 == 0 for v in char_cnt.values()]) else "No")

Submission status: Accepted

Solution code:
w = input()

w_dict = {}
for a in range(len(w)):
    if w[a] not in w_dict:
        w_dict[w[a]] = 1
    else:
        w_dict[w[a]] += 1

checker = ''
for a in w_dict.values():
    if not a % 2 == 0:
        checker += '*'
        break

if checker == '':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
X=input()
counts={}
for I in X:
     counts[I]=counts.get(I,0)+1
items=list(counts.items())
for K in range(len(items)):
     word,count=items[K]
     if count%2!=0:
          print("No")
          break
else:
     print("Yes")

Submission status: Accepted

Solution code:
import string
import collections
w = input()
w2 = collections.Counter(w)
query = string.ascii_lowercase
ans = 'Yes'
for i in query:
  if w2[i]%2 == 1:
    ans ='No'
print(ans)

Submission status: Accepted

Solution code:
listW = list(input())
listW.sort()
counter=0
bef=0
index=0
flag=0
while index < len(listW):
    if index==0:
        bef=listW[index]
        counter=1
    elif listW[index]==bef:
        counter+=1
    else:
        if counter%2==0:
            bef=listW[index]
            counter=1
        else:
            flag=1
            break
    index+=1

if flag==0 and len(listW)%2==0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
w = input()
w_base = set(w)

for i in w_base:
    if w.count(i) % 2 == 1:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
w = input()
w_base = set(w)
for i in w_base:
    if w.count(i) % 2 == 1:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
alpha=[0]*26
w=input()
for i in range(len(w)):
    alpha[ord(w[i])-ord('a')]+=1
ans=0
for i in range(26):
    if alpha[i]%2!=0:
        ans=1
if ans==0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = input()
s = list(set(w))
ans = 'Yes'
for i in range(len(s)):
    if w.count(s[i]) % 2 != 0:
        ans = 'No'
        break
print(ans)

Submission status: Accepted

Solution code:
w = input()
dic = {}
for c in w:
    if c in dic:
        dic[c] += 1
    else:
        dic[c] = 1

flag = True
for v in dic.values():
    if v % 2 == 1:
        flag = False
        break

if flag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s=input();print('YNeos'[any(s.count(t)%2for t in s)::2])

Submission status: Accepted

Solution code:
w=str(input())
alpha='abcdefghijklmnopqrstuvwxyz'
def main(w):
    for j in range(len(alpha)):
        if w.count(alpha[j])%2==1:
            return 'No'
    return 'Yes'
print(main(w))

Submission status: Accepted

Solution code:
from collections import Counter
w = input()
c = Counter(w).values()
ans = "Yes"
for e in c:
    if e % 2 == 1:
        ans = "No"
        break
print(ans)

Submission status: Accepted

Solution code:
s=input()
c=0
for i in range(len(s)):
    if s.count(s[i])%2!=0:
        c=1
print("Yes"if c!=1else"No")

Submission status: Accepted

Solution code:
from collections import Counter
import sys
m =input()

m_list =  list(m)
#print(m_list)
m_dict = Counter(m_list)
#print(m_dict)
ans_list = m_dict.values()
for i,e in enumerate(ans_list):
    if e%2 !=0:
        print("No")
        sys.exit()
print("Yes")

Submission status: Accepted

Solution code:
import sys
# A,B,C = [int(n) for n in input().split()]
# N = int(input())
S = str(input())
# T = str(input())

t = {}
for s in S:
    if not(s in t):
        t[s] = 1
    else:
        t[s]+=1

ans = [n % 2 for n in t.values()]
print("Yes" if 1 not in ans else "No")

Submission status: Accepted

Solution code:
import collections

def mod(x):
  return x % 2

a = input()
b = list(a)

c = collections.Counter(b)

countc = c.values()

modc = map(mod, countc)

if 1 in modc:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
def execute(w):
    if len(w) % 2 == 1:
        return 'No'

    for i in range(len(w) // 2):
        if w.count(w[i]) % 2 == 1:
            return 'No'
    return 'Yes'


if __name__ == '__main__':
    print(execute(input()))

Submission status: Accepted

Solution code:
s=input()
print("Yes" if all([int(s.count(i))%2==0 for i in list(set(s))]) else "No")

Submission status: Accepted

Solution code:
w = input()
for c in w:
    if w.count(c) % 2 != 0:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
w=input()
wl=list(w)
ws=set(wl)
for i in ws:
    if w.count(i)%2==1:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
#B
w = input()
dic = {chr(i+ord('a')): 0 for i in range(0, 26)}
for c in w:
    dic[c] += 1
#print(dic) #
result = 'No'
for i in range(26):
    if dic[chr(i+ord('a'))] % 2 != 0: break
else: result = 'Yes'
print(result)

Submission status: Accepted

Solution code:
w = str(input())
count = 1
for i in range(len(w)):
    s = w.count(w[i])
    if s % 2 != 0:
        print("No")
        count -=1
        break
if count == 1:
    print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
W = input()

Ans = "Yes"

C = Counter(W).items()
for c in C:
    _x,cnt = c
    if cnt%2 != 0:
        Ans = "No"
        break

print(Ans)

Submission status: Accepted

Solution code:
w = input()
alpha_dict = {i: w.count(i) for i in w}
for i in alpha_dict.values():
    if i % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
alpha_dict = {}
for i in w:
    alpha_dict[i] = w.count(i)
for i in alpha_dict.values():
    if i % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
S = Counter(list(input()))
for k, v in S.items():
  if v % 2 == 1:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
import collections

f = list(filter(lambda n: n % 2 == 1, collections.Counter(input()).values()))
print('Yes' if len(f) == 0 else 'No')

Submission status: Accepted

Solution code:
w = list(input())
count=0
for i in range(97, 123):
    if(w.count(chr(i))%2!=0):
        print("No")
        count+=1
        break
if(count==0):
    print("Yes")

Submission status: Accepted

Solution code:
w = input()

if all([w.count(i) % 2 == 0 for i in set(w)]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import collections
w = input()
c = collections.Counter(w)
for i in c:
    if c[i] % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
d = dict()
for s in w:
    d[s] = 0

for s in w:
    d[s] += 1

for v in d.values():
    if v % 2 != 0:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    from collections import Counter

    w = Counter(list(input()))

    for value in w.values():
        if value % 2 != 0:
            print('No')
            exit()

    print('Yes')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import Counter as c
w=c(input())
f=0
for m in range(97,123):
  if(w[chr(m)]%2>0):f=1;break
print("YNeos"[f::2])

Submission status: Accepted

Solution code:
import collections
l = list(input())
c = collections.Counter(l)
a = list(c.items())
r = 1
for i in range(len(a)):
    if a[i][1]%2!=0:
        r = 0
if r:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
w = input()
print("Yes" if all(w.count(s)%2 == 0 for s in set(w)) else "No")

Submission status: Accepted

Solution code:
s=0
for c in input():s^=1<<ord(c)
print('YNeos'[s>0::2])

Submission status: Accepted

Solution code:
s=0
for c in input():s^=1<<(ord(c)-97)
print(['Yes','No'][s>0])

Submission status: Accepted

Solution code:
w = input()
s = 'qwertyuiopasdfghjklzxcvbnm'
for i in s:
    if w.count(i)%2 == 1:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
w = input()
mp = dict()

for c in w:
    if c in mp:
        mp[c] += 1
    else:
        mp[c] = 1

def check(w):
    c = "Yes"
    for i in w:
        if i % 2 == 0:
            continue
        else:
            c = "No"
            break
    return c

print(check(mp.values()))

Submission status: Accepted

Solution code:
w = input()
alp = "abcdefghijklmnopqrstuvwxyz"

def check(w):
    c = "Yes"
    for i in alp:
        if w.count(i)%2 == 0:
            continue
        else:
            c = "No"
            break
    return c

print(check(w))

Submission status: Accepted

Solution code:
w=list(input())
w.sort()
print("Yes" if w[::2]==w[1::2] else "No")

Submission status: Accepted

Solution code:
w = input()
n = len(w)
alpha = [chr(i) for i in range(ord('a'), ord('z')+1)]

all_even = True
for i in range(26):
    cnt = 0
    for j in range(n):
        if alpha[i] == w[j]:
            cnt += 1
    if cnt % 2 != 0:
        all_even = False

if all_even:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = list(input())
counter = 0
for _ in w:
    if w.count(_)%2 == 0:
        counter += 1
    else:
        print("No")
        break
    if counter == len(w):
        print("Yes")

Submission status: Accepted

Solution code:
s = input().rstrip()
s = sorted(s)
while True:
    if len(s) == 0:
        print("Yes")
        break
    l = s.count(s[0])
    if l % 2 != 0:
        print("No")
        break
    else:
        for i in range(l):
            s.remove(s[0])

Submission status: Accepted

Solution code:
w=list(input())
a=list(set(w))
for i in a:
  if w.count(i)%2:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

Solution code:
w=list(input())
s=set(w)
ans='Yes'
for i in s:
    if w.count(i) %2 !=0:
        ans='No'
        break
print(ans)

Submission status: Accepted

Solution code:
from collections import Counter

w = list(input())
count = Counter(w)

flag = True
for i in count.values():
    if i % 2 != 0:
        flag = False

if flag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import collections

w = input()
c = collections.Counter(w)
if all(i % 2 == 0 for i in c.values()):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys

l=list(input())

for i in range(97, 97+26):
  if l.count(chr(i))%2!=0:
    print("No")
    sys.exit()

print("Yes")

Submission status: Accepted

Solution code:
ws=list(input())
ws.sort()
print('Yes' if ws[::2] == ws[1::2] else 'No')

Submission status: Accepted

Solution code:
w = input()
for x in w:
    if w.count(x) % 2 == 0:
        pass
    else:
        break
else:
    print("Yes")
    exit()
print("No")

Submission status: Accepted

Solution code:
import collections
w = input()
c = collections.Counter(w)
result = 'Yes'
for v in c:
    if c[v] % 2 != 0:
        result = 'No'
print(result)

Submission status: Accepted

Solution code:
w = input()
words = list(set(w))
cnt = 0
for word in words:
  if(w.count(word)%2 == 0):
    cnt += 1 
if(cnt == len(words)):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    chars = dict()
    for c in input():
        if not c in chars:
            chars[c] = 1
        else:
            chars[c] += 1

    if all(v % 2 == 0 for v in chars.values()):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
char = [chr(ord('a')+i) for i in range(26)]
w = input()
for i in char:
  if w.count(i)%2==1:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

Solution code:
_w = input()
w = [_w[i] for i in range(len(_w))]
if len(w) % 2 == 1:
    print("No")
    exit()
w.sort()
for i in range(int(len(w)/2)):
    if w[i*2] != w[i*2+1]:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
s = input()

d = set()
for i in s:
  if i in d:
    d.remove(i)
  else:
    d.add(i)
if d == set():
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys

w=input()

from collections import Counter
counter=Counter(w)

for i in counter.values():
    if i%2==1:
        print("No")
        sys.exit()

print("Yes")

Submission status: Accepted

Solution code:
cnt = [0] * 26
s = input()
for c in s:
  cnt[ord(c) - ord('a')] += 1
ans = True
for c in range(26):
  if cnt[c] % 2 != 0:
    print('No')
    exit(0)
print('Yes')

Submission status: Accepted

Solution code:
w = input()
A = [0]*26
for v in w:
    A[ ord(v) - ord('a')] = ( A[ ord(v) - ord('a')] + 1)%2
if sum(A) > 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
s=input()
d={}
for i in s:
    if i in d: d[i]+=1
    else: d[i]=1
ans=0
for i in d:
    if d[i]%2:
        ans=1
print("No" if ans else "Yes")

Submission status: Accepted

Solution code:
w = list(input())
wd = {s:0 for s in w}
for s in w:
    wd[s] += 1
for d in wd.values():
    if d % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
import collections
import sys

line = input()
c = collections.Counter(line)

for i in c.values():
    if i % 2 != 0:
        print('No')
        sys.exit()

print('Yes')

Submission status: Accepted

Solution code:
import sys
W = input()

set_w = set(W)

for i in set_w:
    if W.count(i) % 2 != 0:
        print("No")
        sys.exit()

print("Yes")

Submission status: Accepted

Solution code:
w = input()
d = {}
for i in w:
	d[i] = d.get(i, 0) + 1
for i in d:
	if d[i] % 2 != 0:
		print("No")
		break
else:
	print("Yes")

Submission status: Accepted

Solution code:
import collections
w = list(input())
a = collections.Counter(w)
check = True
for i in a:
    if a[i]%2 != 0:
        check = False
if check:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=list(input())
s.sort()
t=set(s)
t=list(t)
flag=0
for i in range(len(t)):
  if s.count(t[i])%2==1:
    flag=1
print('Yes' if flag==0 else 'No')

Submission status: Accepted

Solution code:
count = [0] * 26
for c in input():
    count['abcdefghijklmnopqrstuvwxyz'.index(c)] += 1
for n in count:
    if n % 2:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
# input
w = input()

ans = 0

for c in list(set(w)):
    if w.count(c) % 2 == 1:
        ans += 1

if ans == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import collections
S = list(input())
counter = collections.Counter(S)

is_pretty = True
for v in counter.values() :
	if v % 2 != 0 :
		is_pretty = False

if (is_pretty) :
	print("Yes")
else :
	print("No")

Submission status: Accepted

Solution code:
moji = list(input())
mojiset = list(set(moji))

for moj in mojiset:
  if moji.count(moj) %  2 != 0:
    print("No")
    break
else:
  print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
w = Counter(input()).most_common()
for _, i in w:
  if i % 2 !=0:
    print('No')
    exit()
print("Yes")

Submission status: Accepted

Solution code:
import collections

w=input()
c=collections.Counter(w)

keys=[k for k , v in c.items() if v%2!=0]
#print(keys)

if(len(keys)==0):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from collections import Counter

flag = True
w = input()
c = Counter(w)

l = c.most_common()

for e in l:
    if e[1] % 2 != 0:
        flag = False
        break
        
if flag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = input()
al = dict([(chr(i),0) for i in range(97, 97+26)])
for i in range(len(w)):
    al[w[i]] += 1
for keys,valuse in al.items():
    if valuse%2 != 0:
        print("No")
        quit()
print("Yes")

Submission status: Accepted

Solution code:
w = list(input())
cnt = [0]*26
for wi in w:
    index = ord(wi)-ord("a")
    cnt[index] += 1
    
for i in range(26):
    if cnt[i]%2!=0:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v


# Width First Search (+ Distance)
def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk


# Depth First Search (+Distance)
def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False

# --------------------------------------------

dp = None


def main():
    S = input()

    for s in set(S):
        if S.count(s) % 2 != 0:
            print("No")
            return
    
    print("Yes")


main()

Submission status: Accepted

Solution code:
from collections import Counter

w = input()

counter = Counter(w)
bell = 'Yes'

for v in counter.values():
	if v%2==1: 
		bell = 'No'
		break

print(bell)

Submission status: Accepted

Solution code:
w = list(input())
a = list(set(w))

for i in range(len(a)):
  if w.count(a[i]) % 2 != 0:
    print("No")
    break
else:
  print("Yes")

Submission status: Accepted

Solution code:
w=input()
for X in ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]:
    if int(w.count(X))%2==1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
w = Counter(input())
ans = "Yes"
for i in w.values():
    if i % 2 != 0:
        ans = "No"
print(ans)

Submission status: Accepted

Solution code:
## ABC 044 b
import sys
from collections import Counter

w = list(input())

c = Counter(w)

for i in c.values():
    if(i%2 != 0):
        print('No')
        sys.exit()
    
print('Yes')

Submission status: Accepted

Solution code:
a = list(input())
b = list(set(a))

for i in range(len(b)):
  if a.count(b[i]) % 2 != 0:
    print("No")
    break
else:
  print("Yes")

Submission status: Accepted

Solution code:
# coding: utf-8
w = input()
print("Yes" if all(w.count(s)%2==0 for s in w) else "No")

Submission status: Accepted

Solution code:
# coding: utf-8
w = input()
print("No" if any(w.count(s)%2 for s in w) else "Yes")

Submission status: Accepted

Solution code:
# coding: utf-8
w = input()
print("No" if sum(w.count(s)%2 for s in w) else "Yes")

Submission status: Accepted

Solution code:
# coding: utf-8
w = input()

for s in w:
    if w.count(s) %2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
# coding: utf-8
w = input()
for s in w:
    val = w.count(s)
    if val%2!=0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
w = raw_input()
l = set([])
for i in w:
    if i in l:
        l.remove(i)
    else:
        l.add(i)
if l == set([]):
    print "Yes"
else:
    print "No"

Submission status: Accepted

Solution code:
w = input()
for i in "abcdefghijklmnopqrstuvwxyz0":
  if w.count(i)%2 ==1:
    break
if i == "0":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s=input()
t=set(s)
for i in t:
    if s.count(i)%2!=0:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
s = input()
a = set(s)
for i in a:
    if s.count(i) % 2 != 0:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
s = input()

if all(s.count(c) % 2 == 0 for c in set(s)):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
w = input()
for i in 'abcdefghijklmnopqrstuvwxyz':
    n = w.count(i)
    if n % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
w = list(input())
w_num = {}

for i in w:
    if i in w_num.keys():
        w_num[i] += 1
    else:
        w_num[i] = 0
        w_num[i] += 1

flag = True
for value in w_num.values():
    if value % 2 == 1:
        flag = False
        break

if flag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = list(input())

isBeautiful = True
for i in w:
    if w.count(i) % 2 is not 0:
        isBeautiful = False

if isBeautiful:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = input()
dif = ord('z') - ord('a')
flg = True
for i in range(dif + 1):
    cnt = w.count(chr(ord('a')+i))
    if cnt % 2 == 1:
        flg = False
print("Yes") if flg == True else print("No")

Submission status: Accepted

Solution code:
w=input()
flag="Yes"
for i in range (len(w)):
    if w.count(w[i])%2!=0:
        flag="No"
        break

print(flag)

Submission status: Accepted

Solution code:
import collections
w=collections.Counter(list(input()))
w=[x%2 for x in w.values()]
if not 1 in w:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a=sorted(list(input()))
b=[]
c=[]
d=0
if len(a)%2==0:
    for i in range(len(a)//2):
        b.append(a[2*i])
        c.append(a[2*i+1])
    for j in range(len(b)):
        if b[j]==c[j]:
            d+=1
    if d==len(a)//2:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Accepted

Solution code:
w =input()
for i in w:
  if w.count(i) % 2 != 0:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

Solution code:
w = input()

for i in w:
  count = 0
  for j in w:
    if i == j:
      count += 1
  if count % 2 != 0:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter


def main():
    w = input()
    cnt = list(Counter(w).values())
    s = list(filter(lambda x: x % 2 != 0, cnt))
    print("Yes" if len(s) == 0 else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
sS = input().strip()

d = {}
for s in sS:
    if s in d:
        d[s]+=1
    else:
        d[s] = 1
for k,v in d.items():
    if v % 2 == 1:
        print("No")
        exit()
print( "Yes")

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    w = next_str()
    dic = dict()

    ans = "Yes"

    for v in w:
        if v not in dic:
            dic[v] = 0

        dic[v] += 1

    for v in dic.values():
        if v % 2 != 0:
            ans = "No"
            break

    print(ans)


def next_str():
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
alp = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']

for i in alp:
        if s.count(i)%2 != 0:
                print('No')
                break
else:
        print('Yes')

Submission status: Accepted

Solution code:
W = input()

import collections

switch = 0
W_list = list(W)
W_dic = collections.Counter(W_list)
for num in W_dic.values():
    if num%2 != 0:
        switch = 1
        break

if switch == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = list(input())
br = []
for ar in a:
    br.append(a.count(ar))
x = 0
for b in br:
    if b % 2 == 1:
        x += 1
if x == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
w=input()
list1=[]
for i in range(len(w)):
    if w[i] in list1:
        pass
    else:
        if w.count(w[i])%2==0:
            list1.append(w[i])
        else:
            print("No")
            exit()
print("Yes")

Submission status: Accepted

Solution code:
def main():
    s = []
    for i in input():
        s.append(i)
    alpha = [chr(i) for i in range(97, 97 + 26)]
    for a in alpha:
        if s.count(a) % 2 != 0:
            print("No")
            return
    print("Yes")


if __name__ == "__main__":
    main()