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: Wrong Answer

Solution code:
w = input()
lis = []
for a in set(w):
  b = w.count(a)
  if b % 2 == 1:
    print("No")
    break
  else:
    lis.append(b)
if len(lis) == set(w):
  print("Yes")

Submission status: Wrong Answer

Solution code:
s = input()
ss = list(set(s))
N = len(ss)

cnt = 0
for i in range(N):
    cnt=cnt+s.count(ss[i])
    
if cnt%2==0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys

input = sys.stdin.readline

alp = "abcdefghijklmnopqrstuvwxyz"
alp = list(alp)

w = sorted(input())
w = w[1:]

#print(w)
cnt = 1
for i in range(1,len(w)):
#    print( w[i],cnt)
    if w[i] ==w[i-1] :
        cnt +=1
    else:
        if cnt%2 == 1:
            print("No")
            exit()
        else:
            cnt = 1

print("Yes")

Submission status: Wrong Answer

Solution code:
c_list = list(input())
flag = True

for i in range(len(c_list)):
 if(c_list.count(c_list[i])%2 == 1):
  print("NO")
  flag = False
  break

if(flag):
 print("YES")

Submission status: Wrong Answer

Solution code:
import collections
c=collections.Counter(list(input()))
cv=list(c.values())
ans=0
for i in range(len(cv)):
    if cv[i]%2==1:
        ans+=1
print('YNeos'[ans%2==1::2])

Submission status: Wrong Answer

Solution code:
from collections import Counter
w=input()
c=Counter(w)
a=0
c=list(c.values())
for i in range(len(c)):
    a+=c[i]
if a%2==0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import collections
def calc_double(n):
    return n%2
a=input()
b=collections.Counter(a)
values=zip(*b.most_common())
c=list(values)
e=c[1]
d=list(map(int,e))
print(d)
if sum(map(calc_double,d))==0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
s = input()
n = len(s)

if n %2 != 0:
    print('No')
    sys.exit()
for i in range(26): 
    if s.count(chr(i)) %2 != 0:
        print('No')
        sys.exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
w = str(input())
List = [w[i] for i in range(len(w))]
lis = sorted(List)
#print(lis)
uni = list(set(lis))
#print(uni)
ans = []
q = 0
for i in range(len(uni)):
    p = lis.count(uni[i])
    ans.append(p)
for j in range(len(ans)):
    q += ans[j]%2
if q == 0:
    print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
def resolve():
	w = input()
	uniq = []
	cnt = 0
	for i in w:
		if i not in uniq:
			uniq.append(i)
	for i in uniq:
		cnt += w.count(i)
	if cnt % 2 == 0:
		print("Yes")
	else:
		print("No")
resolve()

Submission status: Wrong Answer

Solution code:
# solution

data = input()
for i in data:
    if data.count(i) % 2:
        print('No')
    exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

w = input()
li = []
c = [0]*len(w)
cnt = 0
for i in range(len(w)):
    cnt = 0
    for j in range(len(li)):
        if w[i] == li[j]:
            c[j] += 1
            break
        else:
            cnt += 1
    if cnt == len(li):
        li.append(w[i])
for i in range(len(c)):
    if c[i]>0:
        c[i] += 1
for i in range(len(c)):
    if c[i]%2 != 0:
        print("No")
        sys.exit()
print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
ec = 0
c = {}
for each in S:
    try:
        c[each] += 1
        if c[each] % 2 == 0:
            ec -= 1
        else:
            ec += 1
    except:
        c[each] = 1
        ec += 1
if (ec == 0):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
from sys import exit

w = list(input())

w_set = list(set(w))

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

Submission status: Wrong Answer

Solution code:
from sys import exit

w = list(input())

w_set = list(set(w))

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

Submission status: Wrong Answer

Solution code:
from sys import exit

w = input()

w_set = list(set(w))

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

Submission status: Wrong Answer

Solution code:
w = input()

w_set = set(w)

if len(w) / 2 == len(set(w)):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
w = list(map(str,input()))

w_ord = []

for i in range(len(w)):
    w_ord.append(ord(w[i]))

w_ord.sort()

j = 1

if len(w) % 2 == 1:
    print("NO")
else:
    for i in range((len(w)+1)//2):
        if not w_ord[2*i] == w_ord[2*i + 1]:
            print("NO")
            break
        else:
            if i == (len(w)+1)//2 -1:
                print("YES")

Submission status: Wrong Answer

Solution code:
w = list(map(str,input()))

w_ord = []

for i in range(len(w)):
    w_ord.append(ord(w[i]))

w_ord.sort()

j = 1

if len(w) % 2 == 1:
    print("NO")
else:
    for i in range((len(w)+1)//2):
        if not w_ord[2*i] == w_ord[2*i + 1]:
            print("NO")
            break
        else:
            if i == (len(w)+1)//2 -1:
                print("YES")

Submission status: Wrong Answer

Solution code:
strlist = list(input())
findlist="qazwsxedcrfvtgbyhnujmikolp"
flist=list(findlist)
print(flist)
flag = "Yes"
for a in flist:
    if not strlist.count(a) % 2 == 0:
        flag = "No"
print(flag)

Submission status: Wrong Answer

Solution code:
strlist = list(input())
findlist="qazwsxedcrfvtgbyhnujmikolp"
flist=list(findlist)
flag = "Yes"
for a in flist:
    if not strlist.count(a) % 2:
        flag = "No"
print(flag)

Submission status: Wrong Answer

Solution code:
import collections

s = input()
cnt = collections.Counter()

for i in s:
    cnt[i] += 1


if all([True if i % 2 == 0 else False for i in cnt.values()]):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
line = input()

if line.count("a")==4 and line.count("b")==2 and line.count("c")==2 and len(line)==8:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
w = input()
A = []
a1 = []
a2 = []

if len(w) % 2 == 0:
    for i in range(len(w)):
        A.append(w[i])

    A.sort()
    for i in range(int(len(w) / 2)):
        if i % 2 == 0:
            a1.append(A[i])
        else:
            a2.append(A[i])

    if a1 == a2:
        print("Yes")
    else:
        print("No")

else:
    print("No")

Submission status: Wrong Answer

Solution code:
import collections
l=list(input())

if len(l)%2!=0:
            print('No')
            exit()

else:
            c=collections.Counter(l)
            c_item=list(c.values())
            for i in range(len(set(l))):
                         if c_item[i] %2 !=0:
                                    print('No')
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()

def isBeautiful(s):
  dict = {}
  for i in s:
    if i not in dict:
      dict[i] = 1
    else:
      dict[i] += 1
      
  for key in dict:
    if dict[key] % 2 != 0:
      return False
    
  return True
  
print(isBeautiful(s))

Submission status: Wrong Answer

Solution code:
from collections import Counter
w = input()
c = Counter(w)

s = "No"
while(True):
  for t in c.most_common():
    if (t[1]%2) == 0:
      s = "Yes"
    else:
      break
  break
print(s)

Submission status: Wrong Answer

Solution code:
s=input()
a=len(s)
b=len(set(s))
if int(a/2)==b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
w = list(input())
w = sorted(w)
flag = True
print(w)
for i in range(0,len(w)-1,2):
    print(i)
    if w[i]!=w[i+1]:
        flag = False
        break
if flag and len(w)%2==0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
w = list(input())
w = sorted(w)
flag = True
for i in range(0,len(w)-1,2):
    if w[i]!=w[i+1]:
        flag = False
        break
if flag:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
w = list(input())
ans = 'Yes'
for i in range(ord('a'),ord('z')):
	if int(w.count("chr(i)"))%2 == 1:
		ans = 'No'
		break
	if int(w.count("chr(i)"))%2 == 0:
		continue
print(ans)

Submission status: Wrong Answer

Solution code:
w = list(input())
for i in range(ord('a'),ord('z')):
	if int(w.count("chr(i)"))%2 == 1:
		print("No")
		break
	if int(w.count("chr(i)"))%2 == 0:
		continue
	print("Yes")

Submission status: Wrong Answer

Solution code:
li = [0]*26
alpha2num = lambda c: ord(c) - ord("A")
w = input().upper()
for i in range(len(w)):
  k = alpha2num(w[i])
  li[k] += 1
for j in li:
  if(not j % 2):
    print("No")
    break
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
s = input()
cnt = 0
for i in s:
    if s.count(i) % 2 == 0:
        cnt += 1
    
    else:
        print("No")
if cnt == len(s):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
w = input()
k = [0]*26
flag = 0
for i in range(len(w)):
  k[ord(w[i])-97] += 1
for i in range(len(k)):
  if k[i]%2 == 0:
    continue
  else:
    flag += 1
    print("No")
if flag == 0:
  print("Yes")

Submission status: Wrong Answer

Solution code:
text=input()
dic={}
for i in range(len(text)):
    if text[i] not in dic:
        dic[text[i]]=1
    else:
        dic[text[i]]=+1     
for i in dic.values():
    if not i%2==0:
        print('No')
        exit()
        
print('Yes')

Submission status: Wrong Answer

Solution code:
#abc044 b
s=input()
moji=dict()
flag=True
for i in range(len(s)):
    if i not in moji:
        moji[i]=1
    else:
        moji[i]+=1
for i in moji.values():
    if i%2==1:
        flag=False
        break
print("Yes" if flag else "No")

Submission status: Wrong Answer

Solution code:
w = input()
a = "abcdefghijklmnopqrstuvwxyz"
co = 0
ch = True
for i in a:
    for j in w:
        if i == j:
            co += 1
    if co % 2:
        ch = False
        break
    co = 0
    
    
if ch:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import collections
w=input()
words=[a for a in w]
c=collections.Counter(words)
values,counts=zip(*c.most_common())
for n in counts:
    if n%2==1:
        print('No')
        break
    else:
        print('Yes')
    break

Submission status: Wrong Answer

Solution code:
import collections
w=input()
words=[a for a in w]
c=collections.Counter(words)
values,counts=zip(*c.most_common())
a=sum(counts)
if a%2==0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#!/use/bin/env python3

from collections import defaultdict

a = input()

b = defaultdict(int)


for c in a:
    b[c] += 1

d = []

for c in b.values():
    d.append(c % 2)

e = set(d)

ans = 'Yes' if 1 in e else 'No'

print(ans)

Submission status: Wrong Answer

Solution code:
#!/use/bin/env python3

from collections import defaultdict

a = input()

b = defaultdict(int)


for c in a:
    b[c] += 1

a = []

for c in b.values():
    a.append(c % 2)

ans = 'Yes' if len(set(a)) == 1 else 'No'


print(ans)

Submission status: Wrong Answer

Solution code:
w=sorted(list(input()))
temp=0
ans="Yes"
for i in range(len(w)):
    if i>0 and w[i]!=w[i-1]:
        if temp%2==1:
            ans="No"
            break
        temp=0
    temp+=1
print(ans)
#print([["NA","YYMM"],["MMYY","AMBIGUOUS"]][cMMYY][cYYMM])

Submission status: Wrong Answer

Solution code:
w = input()

w = sorted(w, key = lambda x: x)
ans = 1
before = w[0]
for i in range(1, len(w)):
    if w[i] == before:
        ans += 1
    else:
        if ans % 2 != 0:
            print("No")
            exit()
        before = w[i]
        ans += 1
print("Yes")

Submission status: Wrong Answer

Solution code:
w=input()
l='abcdefghijklmnopqrstuvwxyz'
a=0
if len(w)%2!=0:
    print('No')
else:
    for i in range(26):
        if w.count(l[i])%2!=0:
            a+=1
            break
if a==0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
w=input()
l='thequickbrownfoxjumpsoverthelazydog'
a=0
if len(w)%2!=0:
    print('No')

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

Submission status: Wrong Answer

Solution code:
w=input()
l='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
if len(w)%2!=0:
    print('No')
else:
    for i in range(26):
        if w.count(l[i])%2!=0:
            print('No')
            break
        else:
            continue
    print('Yes')

Submission status: Wrong Answer

Solution code:
w=input()
x=dict()
for i in range(len(w)):
    if w[i] in x:
        x[w[i]]+=1
    else:
        x[w[i]]=1

for idx in x:
    if x[idx]!=2:
        print("No")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
#ABC044

import collections

w = input()

a = list(collections.Counter(w).values())
b = [a[i] for i in range(len(a)) if int(a[i]) % 2 == 0]

print(a,b)
if len(a) == len(b):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from collections import Counter

n = Counter(input())

for i in n.values():
  if i%2==1:
    print("No")
    break

print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import collections

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

#print(c)

for i in range(len(c)):
  if c[i]%2!=0:
    print('No')
    break
else:
  print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

n = 0
for i in range(len(count_w)):
  n += w.count(count_w[i])

print("Yes" if n % 2 == 0 else "No")

Submission status: Wrong Answer

Solution code:
n = list(input())

for i in n:
    if n.count(i)%2 != 0:
        print("N0")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
w = input()

sw = set(w)

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

print("Yes")

Submission status: Wrong Answer

Solution code:
import collections
 
s = input()
lst = []
for i in s:
    lst.append(i)
c = collections.Counter(lst)
if sum(c.values()) % 2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import collections

s =  input()
lst = []
for i in s:
    lst.append(i)
c = collections.Counter(lst)
if sum(c.values()) % 2 == 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
s = input()
s_list = [s[_] for _ in range(len(s))]

dic = dict()
for c in s_list:
  if c in dic:
    dic[c] += 1
  else:
    dic[c] = 1

flg = True
for key in dic:
  if dic[key] != 2:
    flg = False
    break
    
if flg:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input()
s_list = [s[_] for _ in range(len(s))]

dic = dict()
for c in s_list:
  if c in dic:
    dic[c] += 1
  else:
    dic[c] = 1

flg = True
for key in dic:
  if dic[key] != 2:
    flg = False
    
if flg:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print('Yes')

Submission status: Wrong Answer

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

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

print('Yes')

Submission status: Wrong Answer

Solution code:

from collections import Counter

w = input()
c = Counter(w)
for k, v in c.items():
    if v % 2 != 0:
        print("NO")
        exit()
        
print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
w = list(map(str,input()))
flg = 0
w.sort()
if len(w) % 2 == 1:
    flg == 1

else:
    for i in range(0, len(w)-1, 2):
        if w[i] != w[i+1]:
            flg += 1
            break

if flg == 1:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
w = input()
sum = 0
for i in set(w):
    sum += w.count(i)
if sum%2==0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
w = input()

flag = True
if not 1 <= len(w) <= 100:
    flag = False
for i in range(len(w)):
    if w[i] != "a" and w[i] != "z":
        flag = False
        break

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

Submission status: Wrong Answer

Solution code:
w = input()

flag = True
for i in range(len(w)):
    if w[i] != "a" and w[i] != "z":
        flag = False
        break

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

Submission status: Wrong Answer

Solution code:
s=list(input())
s.sort()

ans=0
for i in range(len(s)-1):
  if s[i]==s[i+1]:
    ans+=1
  else:
    if ans%2==0:
      print("No")
      break
    else:
      ans=0
      pass
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
a = str(input())
b =sorted(list(set(a)))
c = 0
for i in b:
  if b.count(i)%2 == 0:
    c += 0
  else:
    c += 1

if c == 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a = str(input())
b =sorted(list(set(a)))
c = 0
for i in b:
  if b.count(i)//2 == 0:
    c += 0
  else:
    c+= 1

if c == 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import collections
w = input()
w_counted = collections.Counter(w)
# print(len(w))
for v in w_counted.values():
    # print(v)
    if v % 2 != 0:
        print('NO')
        exit()
print('YES')

Submission status: Wrong Answer

Solution code:
w = input()
f = [False]*26

for c in w:
    f[ord(c)-ord('a')] = not f[ord(c)-ord('a')]
for b in f:
    if f:
        print("Yes")
        break
else:
    print("No")

Submission status: Wrong Answer

Solution code:
w=input()
flag=0
for i in list(set(w)):
    if w.count(i)%2==1:
        flag=1
        print(i)
if flag:print('No')
else:print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()

for i in s:
    count = s.count(i)
    if count % 2 != 0:
        print('NO')
        exit()

print('YES')

Submission status: Wrong Answer

Solution code:
w = list(input())
alp = list("abcdefghijklmnopqrstuvwxyz")
ans = 0

for i in alp:
    if w.count(i) % 2 != 0 :
        ans += 1

if ans == 0:
    print("YES")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
w = input()
alp = list("abcdefghijklmnopqrstuvwxyz")
ans = 0

for i in alp:
    if w.count(i) % 2 != 0 :
        ans += 1

if ans == 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
w = list(input())
alp = list("abcdefghijklmnopqrstuvwxyz")
ans = 0

for i in alp:
    if w.count(i) % 2 != 0 :
        ans = 1

if ans == 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
w = list(input())
alp = list("abcdefghijklmnopqrstuvwxyz")
ans = 0

for i in alp:
    if w.count(i) % 2 != 0 :
        ans += 1

if ans == 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys
w = input()

# すべての文字が偶数回出現する

# 文字数分ループする
for i in range(len(w)-1):
    # 1文字目の文字が偶数回出現するなら継続。奇数回なら終了
    if w.count(w[i])%2==0:
        continue
    else:
        print("No")
        sys.exit()

# 途中で終了しなかったら、wは美しい
print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
S = input()
A = set([i for i in S])
for j in A:
  if S.count(j) % 2 == 1:
    print("Yes")
    sys.exit()
  else:
    None
print("No")

Submission status: Wrong Answer

Solution code:
S = input()
str = []
result = ""
flg = 0
for i in range(len(S)):
    if S[i] == 'B':
        result = result[:-1]
    else:
        result += S[i]
print(result)
print(result[:-1])

Submission status: Wrong Answer

Solution code:
n = input()
# 文字列から文字の集合を作る
char_set = { x for x in n}
# 出現頻度を辞書で表す
char_freq = { x : n.count(x) for x in char_set }

judge = 'YES'
for v in char_freq.values():
    if(v % 2 != 0):
        judge = 'NO'


print(judge)

Submission status: Wrong Answer

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

for i in wset:
    wcount =w.count(i)

    if  wcount%2 == 1:
        print('NO')
        exit()

print('YES')

Submission status: Wrong Answer

Solution code:
import collections

w = input()
c = collections.Counter(w)
for k, v in c.items():
    if v % 2 == 1:
        print('NO')
        exit()
print('YES')

Submission status: Wrong Answer

Solution code:
w = str(input())

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

Submission status: Wrong Answer

Solution code:
w = str(input())

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

Submission status: Wrong Answer

Solution code:
w = str(input())

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

Submission status: Wrong Answer

Solution code:
w = input()
a = True

for letter in "abcdefghijklmnopqrstuvwxyz":
    c = w.count(letter)
    if c%2 != 0:
        print("No")
        a = False

if a:
    print("Yes")

Submission status: Wrong Answer

Solution code:
from collections import Counter

S = input()
C = Counter(S)
ans = "YES"
for c in C.values():
	if c % 2 == 1:
		ans = 'NO'
		break
print(ans)

Submission status: Wrong Answer

Solution code:
w = input()

f = True
for i in range(len(w)):
  if w.count(w[i]) % 2 == 1:
    print("No")
    f = False
if f:
  print("Yes")

Submission status: Wrong Answer

Solution code:
w=list(input())
w.sort()
c=[]
d=[]
for i in range(len(w)):
  k=i+1
  for k in range(k,len(w)):
    if w[i]!=w[k]:
      c.append(k)
      i=k
for n in range(len(c)):
  if c[n]%2==0:
    d.append(1)
if len(d)==len(c):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
w=list(input())
w.sort()
c=[]
for i in range(len(w)):
  k=i+1
  for k in range(len(w)):
    if w[i]==w[k]:
      c.append(1)
if len(c)%2==0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N = list(input())
N=sorted(N)
count = 1
flag = True
for i in range(1,len(N)):
  if N[i -1] == N[i] and (flag == True):
    count += 1
  elif flag == True:
    flag = (count % 2 == 0)
    count = 1
  else:
    break
if flag:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
N = list(input())
N=sorted(N)
count = 1
flag = True
for i in range(1,len(N)):
  if N[i -1] == N[i]:
    count += 1
  else:
    flag = (count % 2 == 0)
    count = 1
  if flag:
    pass
  else:
    break;
if flag:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
w = input()

alp_list = ['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']

w_list = []
for s in w:
    w_list.append(s)

print(w_list)

count_list = []
for i in alp_list:
    count = w_list.count(i)
    count_list.append(count)

print(count_list)

div_array = np.array(count_list) % 2
div_list = div_array.tolist()

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

Submission status: Wrong Answer

Solution code:
s = str(input())
t = list(s)
t.sort()
a = []
b = 1
for i in range(len(t)):
    if i >= 1:
        if t[i] == t[i-1]:
            b = b + 1
        else:
            a.append(b)
            b = 1
a.append(b)
for i in range(len(a)):
    if a[i] % 2 != 0:
        print("NO")
        break
    else:
        if i == len(a) - 1:
            print("YES")

Submission status: Wrong Answer

Solution code:
#2019/10/24
S = list(open(0).read())
set_S = list(set(S))
beautiful = [S.count(i)%2 for i in set_S]
print('Yes' if sum(beautiful)==0 else 'No')

Submission status: Wrong Answer

Solution code:
w = input()

if len(w)%2 == 1:
    print('No')
else:
    for i in range(len(w)):
        if w.count(w[i])%2 == 1:
            print('No')
            break
        else:
            continue
        print('Yes')        
        break

Submission status: Wrong Answer

Solution code:
w = input()

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

Submission status: Wrong Answer

Solution code:
w = input()

for i in range(len(w)):
    count = 0
    for j in range(len(w)):
        if w[i] == w[j]:
            count = count + 1
    if count%2 == 1:
        print('No')
        break
        
if i+1 == len(w):
    print('Yes')

Submission status: Wrong Answer

Solution code:
w = input()

for i in range(len(w)):
    count = 0
    for j in range(len(w)):
        if w[i] == w[j]:
            count = count + 1
            print(count)
    if count%2 == 1:
        print('No')
        break
    #else:
    #    continue
if i == len(w):
    print('Yes')

Submission status: Wrong Answer

Solution code:
w = input()

for i in range(len(w)):
    count = 0
    for j in range(len(w)):
        if w[i] == w[j]:
            count = count + 1
    if count%2 == 1:
        print('No')
        break
    else:
        continue
    print('Yes')

Submission status: Wrong Answer

Solution code:
s =input()
flag = 1
for i in set(s):
  if s.count(i)%2 != 0:
    print("NO")
    flag = 0
    break
if flag == 1:
  print("YES")

Submission status: Wrong Answer

Solution code:
s = input()
l = set(s)
flag = 1
for i in  l:
  if s.count(i)%2 == 0:
    pass
  else:
    flag  = 0
    break
print("NYOE S"[flag == 1::2])

Submission status: Wrong Answer

Solution code:
s = input()
l = set(s)
print(l)
flag = 1
for i in  l:
  if s.count(i)%2 == 0:
    pass
  else:
    flag  = 0
    break
print("NYOE S"[flag == 1::2])

Submission status: Wrong Answer

Solution code:
s = input()
l = set(s)
flag = 1
for i in  l:
  if s.count(i)%2 == 0:
    continue
  else:
    flag  = 0
    break
print("NYOE S"[flag == 1::2])

Submission status: Wrong Answer

Solution code:
s = input()
l = set(s)
flag = 1
for i in  l:
  if s.count(i)%2 == 0:
    continue
  else:
    flag  = 0
    break
print("NYOE S"[flag == 1::2])

Submission status: Wrong Answer

Solution code:
def a():
    S = input()
    s = list(S)
    s.sort()

    count = 0
    prec = 'A'
    for c in s:
        if(prec != c):
            prec = c
            if(count%2 == 1):
                print("No")
                return
            count = 0
        count += 1
    print("Yes")

a()

Submission status: Wrong Answer

Solution code:
w = input()
r = []
for s in w:
  if s not in r:
    r.append(s)
if len(r) - len(list(w)) % 2 != 0:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
w = input()
l = list(w)
if len(l) % 2 == len(sorted(l)) % 2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from collections import Counter
w=str(input())
li=Counter(w)
for i in range(len(w)):
    word=w[i]
    if i==len(w)-1:
        if li[word] % 2 == 0:
            print('YES')
            break
        else:
            print('NO')
            break
    if li[word]%2==0:
        continue
    else:
        print('NO')
        break

Submission status: Wrong Answer

Solution code:
from collections import Counter
w=str(input())
li=Counter(w)
for i in range(len(w)):
    word=w[i]
    if i==len(w)-1:
        if li[word] % 2 == 0:
            print('YES')
            break
        else:
            print('NO')
            break
    if li[word]%2==0:
        continue
    else:
        print('NO')
        break

Submission status: Wrong Answer

Solution code:
w=list(input())
ans=sorted(w)

if len(ans)==1:
  print('No')
else:
  while ans[-1]==ans[-2]:
    del ans[-2:]
    if len(ans)==0 or len(ans)==1:
      break

if len(ans)==0:
  print('Yes')
elif len(ans)==1:
  ans=[]
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
w=input()
c=0
if len(w)%2==1:
   print('No')
else:
   import string
   for _ in string.ascii_lowercase:
      if not w.count(_)%2==0:
         c+=1
if c==0:
   print('Yes')
else:
   print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
W=input()
count=1
w=[]

for j in range(len(W)):
    w.append(W[j])

w.sort()

w.append("")
print(w)

for i in range(len(w)-1):
    if w[i]==w[i+1]:
        count+=1
    else:
        if count %2 !=0:
            print("No")
            exit()
        else:
            count=1

print("Yes")

Submission status: Wrong Answer

Solution code:
W=input()
count=1
w=[]

for j in range(len(W)):
    w.append(W[j])

w.sort()

for i in range(len(w)-1):
    if w[i]==w[i+1]:
        count+=1
    else:
        if count %2 !=0:
            print("No")
            exit()
        else:
            count=1

print("Yes")

Submission status: Wrong Answer

Solution code:
W=input()
count=1
w=[]

for j in range(len(W)):
    w.append(W[j])

w.sort()

for i in range(len(w)-1):
    if w[i]==w[i+1]:
        count+=1
    else:
        if count %2 !=0:
            print("No")
            exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
w=input()
p=w
s=''
f=True
if w=='':
	print('No')
	f=False
while f:
	s=w[0]
	w=p
	if w.count(s)%2!=0:
		print('No')
		break
	p=w.replace(s,'')
	if w:
		print('Yes')
		break

Submission status: Wrong Answer

Solution code:
w=input()
p=w
s=''
f=True
if w=='':
	print(No)
	f=False
while f:
	s=w[0]
	w=p
	if w.count(s)%2!=0:
		print('No')
		break
	p=w.replace(s,'')
	if w:
		print('Yes')
		break

Submission status: Wrong Answer

Solution code:
w=input()
p=w
s=''
while True:
	s=w[0]
	w=p
	if w.count(s)%2!=0:
		print('No')
		break
	p=w.replace(s,'')
	if w:
		print('Yes')
		break