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:
import collections
w = list(input())
w = collections.Counter(w)
b = True
for v in w.values():
    if v % 2 != 0:
        b = False
        break
if b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def f(w):
    cnt_dict = {}

    for s in w:
        if s not in cnt_dict.keys():
            cnt_dict[s] = 0
        cnt_dict[s] += 1

    for v in cnt_dict.values():
        if v % 2 != 0:
            print("No")
            return
    print("Yes")


w = input()
f(w)

Submission status: Accepted

Solution code:
w = str(input())
for i in range(26):
  if w.count(chr(i + 97)) % 2 == 0:
    pass
  else:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
import sys

w = input()

if len(w) % 2 == 1:
    print('No')
    sys.exit()

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

print('Yes')

Submission status: Accepted

Solution code:
S = input()

checker = 0
for i in range(len(S)):
  if S.count(S[i]) % 2 == 1:
    checker = 1
    break

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

Submission status: Accepted

Solution code:
w = input()

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

print(ans)

Submission status: Accepted

Solution code:
w = input()
flag = True
for i in set(w):
    if w.count(i)%2 == 1:
        flag = False
        break

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

Submission status: Accepted

Solution code:
w = input()
only = list(set(w))
count = 0
can = True
for i in only:
    if w.count(i) % 2 != 0:
        can = False
        break
if can:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
only = list(set(w))
count = 0
can = True
for i in only:
    if w.count(i) % 2 != 0:
        can = False
        break
if can:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()
c_dict = {}
for char in S:
  if char in c_dict:
    c_dict[char] += 1
  else:
    c_dict[char] = 1
for cnt in c_dict.values():
  if cnt%2 != 0:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

Solution code:
w = input()
w_sep = [i for i in w]
w_unqs = set(w_sep)
num_odd = 0
for w_unq in w_unqs:
    num = w_sep.count(w_unq)
    if num % 2 == 0:
        continue
    else:
        num_odd += 1

if  num_odd > 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter
r = 0
cnt = Counter(input())
for c in cnt:
    r += cnt[c] % 2
if r == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

Solution code:
word = input()

flag = True
if len(word)%2 == 1:
    flag = False

wordset = set(word)
leng = len(wordset)
for s in wordset:
    if word.count(s)%2 == 1:
        flag = False
        break
if flag:print("Yes")
else: print("No")

Submission status: Accepted

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

print( "Yes" )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
for i in range(len(s)):
  if s.count(s[i]) % 2 == 0:
    pass
  else:
    print('No')
    break
  if i == len(s) - 1:
  	print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 44, B - beautiful strings
import string
w = input()

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

Submission status: Accepted

Solution code:
def main():
  ans = func(input())
  print(ans)
  
  
def func(sentence):
  unique_list = set(sentence)
  for s in unique_list:
    if sentence.count(s) % 2 != 0:
      return('No')
      break
  return('Yes')

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
w=input()
w_list=list(w)
w_unique=list(set(w_list))
c=0
for x in w_unique:
    if w_list.count(x)%2==0:
        c=c
    else:
        c+=1
        
if c==0:
    print('Yes')
    
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
w=input()
w_unique=list(set(w))
#count=[0 for i in range(25)]
#print(count)				
count={i:0 for i in w_unique}
if len(w)%2 != 0:
  print("No")
  sys.exit()

for i in w:
  count[i]+=1

  
for i in w_unique:
  if count[i]%2 != 0:
    print("No")
    sys.exit()
print("Yes")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(w: str):
    count = [0] * 26
    for c in w:
        count[ord(c) - ord('a')] += 1
    for cnt in count:
        if cnt % 2:
            print(NO)
            return
    print(YES)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    w = next(tokens)  # type: str
    solve(w)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools, collections

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(w: str):
    c = collections.Counter(w)
    d = c.values()
    flag = True
    for dd in d:
        if dd % 2 != 0:
            flag = False
    if flag:
        print('Yes')
    else:
        print('No')
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    w = next(tokens)  # type: str
    solve(w)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

from  collections import Counter
import sys

def main():
    data = list(input())
    c_dic = Counter(data)
    for eord, count in c_dic.items():
        if count % 2 == 1:
            print('No')
            sys.exit()
    print('Yes')





if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#ABC044B
w = input()
l = len(w)
sig = 0

for i in range(l):
    if w.count(w[i])%2 !=0:
        sig = 1
        break

if sig == 1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = list(input())
w_unique = list(set(w))
w_unique_count = []

for i in range(len(w_unique)):
    w_unique_count.append(w.count(w_unique[i]))

check = 0

for i in range(len(w_unique)):
    if w_unique_count[i] % 2 == 1:
        check = 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
l = []
for char in s:
  l.append(char)
l.sort()
if len(l)%2 == 1:
  print('No')
else:
  flag = True
  for i in range(0,len(l),2):
    if l[i] != l[i+1]:
      flag = False
      break
  if flag:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
w = list(input())
s = list("abcdefghijklmnopqrstuvwxyz")
ans = "Yes"
for i in s:
  if (w.count(i) % 2) != 0:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
import collections
w=input()
li=collections.Counter(w)
li2=li.values()
if all([i%2==0 for i in li2]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

for i in c.values():
  if i%2!=0:
    f=1

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

Submission status: Accepted

Solution code:
w=input()
l=[]
c=0
for i in w:
  l.append(i)
l.sort()
if len(l)<2:
  print('No')
  exit()
for k in range(len(l)-1):
  if l[k]==l[k+1]:
    c+=1
  elif c%2==1:
    c=0
    continue
  else:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

Solution code:
w = input()
count = {}
for i in w:
    count.setdefault(i, 0)
    count[i] += 1
flag = True
for i in count.values():
    if i % 2 == 1:
        flag = False
        break
if flag == True:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#ABC044b
import sys
import re
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

w = input()
eimozi = "abcdefghijklmnopqrstuvwxyz"
flag = True
for i in eimozi:
    flag = w.count(i) % 2 == 0
    if (not flag):
        break
print("Yes" if flag else "No")

Submission status: Accepted

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

if len(x) % 2:
  print('No')

else:
  f = True
  for i in range(0, len(x), 2):
    if x[i] == x[i + 1]:
      continue
    else:
      f = False
      break
  
  print('Yes' if f else 'No')

Submission status: Accepted

Solution code:
a = input()
ans = "Yes"

char_list = list(a)
doubli = list(set(char_list))
#print(doubli)

for x in doubli:
    #print(char_list.count(x))
    if(char_list.count(x) % 2 == 1):
        ans = "No"
        break
print(ans)

Submission status: Accepted

Solution code:
import sys
W = input()
alpha = ["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 num in alpha:
    if W.count(num) %2 != 0:
        print("No")
        sys.exit()
print("Yes")

Submission status: Accepted

Solution code:
import numpy as np
import sys
w = input()
countn = np.zeros(26)
ew = "abcdefghijklmnopqrstuvwxyz"
i = 0
while i < 26:
    countn[i] = w.count(ew[i])
    if countn[i] %2 != 0:
        print("No")
        sys.exit()
    i +=1
  
print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = str(input())
letter = ['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']
A = 'Yes'
for letter in letter:
  if w.count(letter)%2 != 0:
    A = 'No'
    break
print(A)

Submission status: Accepted

Solution code:
#ABC -44 -B
w = input()
result = ""
for i in w:
    if w.count(i) % 2 ==0:
        result = "Yes"
    else :
        print("No")
        exit()
print(result)

Submission status: Accepted

Solution code:
a = list(input())
b = {}
for i in a:
    if i in b:
        b[i] += 1
    else:
        b[i] = 1
for i in b.values():
    if i % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

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

w_dict = {}
for i in range(len(w)):
    if w[i] not in w_dict:
        w_dict[w[i]] = True

isBeautiful = True

for k,v in w_dict.items():
    idx = w.index(k)
    if idx % 2 != 0:
        isBeautiful = False

if len(w_dict.items()) == 1:
    if len(w) % 2 != 0:
        isBeautiful = False

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n = II()
    k = II()
    x = II()
    y = II()
    ans = 0
    for i in range(n):
        if i >= k:
            ans += y
        else:
            ans += x
    print(ans)
    return

#B
def B():
    w = S()
    d = defaultdict(int)
    for s in w:
        d[s] += 1
    for di in d.values():
        if di % 2:
            print("No")
            return
    print("Yes")
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

Solution code:
W = input()
counters = []
for i in range(0, 26):
	counters.append(0)
for i in range(0, len(W)):
	counters[ord(W[i])-97] += 1
ans = 'Yes'
for i in range(0, 26):
	if counters[i]%2 == 1:
		ans = 'No'
		break
print(ans)

Submission status: Accepted

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

tmp = []
cnt = []
for l in w:
    if l not in tmp:
        tmp.append(l)
        cnt.append(1) 
    else:
        cnt[-1] += 1
flag = 0
for x in cnt:
    if x%2 != 0:
        flag = 1
        break
    else:
        pass
if flag == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = list(input())
flag = "Yes"

for x in s:
    if s.count(x) % 2 != 0:
        flag = "No"

print(flag)

Submission status: Accepted

Solution code:
w = input()

counts = dict()

for c in w:
  counts[c] = counts.get(c, 0) + 1

for s in counts.values():
  if s % 2 != 0:
    print("No")
    exit()

print("Yes")

Submission status: Accepted

Solution code:

w = input()

dic = {}


for i in w:

    if i in dic:
        dic[i] += 1

    else:
        dic[i] = 1


ans = "Yes"

for i in dic:

    if dic[i] % 2 == 1:
        ans = "No"
        break

print (ans)

Submission status: Accepted

Solution code:
W = input()

D = {}

flag = 0

for w in W:
    if w in D:
        D[w] += 1
    else:
        D[w] = 1


for v in D.values():
    if v % 2 == 1:
        flag = 1
        continue
    else:
        pass

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

Submission status: Accepted

Solution code:
S = input()
ss = set(list(S))
flag = True
for w in ss:
    if(S.count(w) % 2 == 1):
        flag = False

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

Submission status: Accepted

Solution code:
l='abcdefghijklmnopqrstuvwxyz'
w=input()
print('YNeos'[sum([w.count(x)%2 for x in l])!=0::2])

Submission status: Accepted

Solution code:
s=list(input())
flag="Yes"
for v in s:
    if s.count(v)%2!=0:
        flag="No"
print(flag)

Submission status: Accepted

Solution code:
from collections import Counter

w = list(input())
if len(w) % 2 == 1:
    print('No')
else:
    res = [0 if e % 2 == 0 else 1 for e in Counter(w).values()]
    if sum(res) == 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
import string
w = (stdin.readline().rstrip())
flag = True
for i in string.ascii_lowercase:
    if w.count(i) % 2 != 0:
        flag = False
if flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = {}
for i in range(len(a)):
    if a[i] in b:
        b[a[i]] += 1
    else:
        b[a[i]] = 1
for i in b:
    if b[i] % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input = input()
import string
al = string.ascii_lowercase
for a in al:
    tmp = ""
    for i in input:
        if i==a:
            tmp+=i
    if(len(tmp)%2 == 1):
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
s = input()
for it in range(ord('a'), ord('z') + 1):
  ch = chr(it)
  if s.count(ch) % 2:
    print("No")
    exit(0)
print("Yes")

Submission status: Accepted

Solution code:
ans = True
s = input()
for c in s:
    if s.count(c) % 2 == 1:
        ans = False
print('Yes' if ans else 'No')

Submission status: Accepted

Solution code:
import sys
w=input()
#wの要素を取得
w_set=set(w)
w_l=list(w_set)
for i in range(len(w_l)):
    if w.count(w_l[i])%2==0:
        pass
    else:
        print("No")
        sys.exit(0)
print("Yes")

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

Solution code:
w = input()
word = {}
l = len(w)

for i in range(l):
    n = word.get(w[i], 0)
    n = n+1
    word[w[i]] = n

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

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

Submission status: Accepted

Solution code:
s = list(input())
ans = {x: s.count(x) for x in s}
answer =[]
for k, v in ans.items():
  answer.append(v)
for i in range(len(answer)):
  if answer[i] % 2 != 0:
    print('No')
    exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC44 B

w = input()

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

Submission status: Accepted

Solution code:
import collections
l=list(str(input()))
c = collections.Counter(l)
values, counts = zip(*c.most_common())
if all([i%2==0 for i in counts]):
    print("Yes")
else:print("No")

Submission status: Accepted

Solution code:
w=input()
count={chr(i):0 for i in range(97,97+26)}
for c in w:
    count[c]+=1
flag=0
for i in range(97,97+26):
    if count[chr(i)]%2!=0:
        flag=1
print(['Yes','No'][flag])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
x = Counter(input()).values()
a = 0
for i in x:
    if i%2==1:
        a = 1

if a==1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
s=[1 for i in Counter(input()).values() if i%2 == 1]
if s:print("No")
else:print("Yes")

Submission status: Accepted

Solution code:
import sys
s = input()
ans = {}
for i in s:
  if i in ans:
    ans[i] +=1
  else:
    ans[i] = 1
for i in ans.values():
  if i%2!=0:
    print('No')
    sys.exit()
print('Yes')

Submission status: Accepted

Solution code:
s = list(input())
a = "".join(s)
flag = 0
for v in s:
  if(a.count(v)%2==1):
    flag=1

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

Submission status: Accepted

Solution code:
w = input()
lst = list(w)
lst_set = set(lst)
for t in lst_set:
    num = lst.count(t)
    if num%2!=0:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter
s = input()
ans = Counter(s).most_common()
ans = all(map(lambda x: x[1] % 2 == 0, ans))
print("Yes" if ans else "No")

Submission status: Accepted

Solution code:
from collections import Counter as c
w=input()
l=list(c(w).values())
x='Yes'
for i in range(len(l)):
  if l[i]%2!=0:
    x='No'
    break
print(x)

Submission status: Accepted

Solution code:
d = {}
S = input()
for s in S:
    if s in d:
        d[s] += 1
    else:
        d[s] = 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
a = input()
b = Counter(a)
c = 0

for i in b.values():
  if i%2!=0:
    c = 1
else:
  if c==0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
w = input()

ans = 'Yes'

for ch in w:
    if w.count(ch)%2:
        ans = 'No'
        break

print(ans)

Submission status: Accepted

Solution code:
w = input()
p = [0] * 256
for i in w:
    p[ord(i)] += 1
ans = "Yes"
for i in range(256):
    if p[i] % 2:
        ans = "No"
print(ans)

Submission status: Accepted

Solution code:
import os
import sys
from collections import Counter

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18

W = sys.stdin.readline().rstrip()

if any([w % 2 for w in Counter(list(W)).values()]):
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
import bisect
import heapq
import itertools
import math
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18

W = sys.stdin.readline().rstrip()

if any([w % 2 for w in Counter(list(W)).values()]):
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
s = set([i for i in w])

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

Submission status: Accepted

Solution code:
def main():
    word=input()
    for i in word:
        if word.count(i)%2!=0:
            print("No")
            return 
    print("Yes")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    word = list(input())
    word_set = list(set(word))
    # word = input()

    for str in word_set:
        if word.count(str) % 2 == 1:
            print('No')
            return

    # for str in word:
    #     if word.count(str) % 2 == 1:
    #         print('No')
    #         return

    print('Yes')


if __name__ == "__main__":

    main()

Submission status: Accepted

Solution code:
def main():
    word = input()

    for str in word:
        if word.count(str) % 2 == 1:
            print('No')
            return

    print('Yes')


if __name__ == "__main__":

    main()

Submission status: Accepted

Solution code:
def main():
    l = list(input())
    l_set = list(set(l))
    for i in l_set:
        n = l.count(i)
        if n%2 != 0:
            return 'No'

    return 'Yes'
if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import collections

w = input()
arr = list(w)
dic = collections.Counter(arr)
for i in dic.values():
    if i % 2 != 0:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
w_list = list(input())

w_dict = {}
for c in w_list:
    if( c not in w_dict ):
        w_dict[c] = 1
    else:
        w_dict[c] += 1

result = 'Yes'
for v in w_dict.values():
    if( v % 2 ):
        result = 'No'

print(result)

Submission status: Accepted

Solution code:
w = str(input())
alp =[]
judge = "True"
for i in w:
    if i not in alp:
        alp.append(i)
for x in alp:
    if w.count(x)%2 ==1:
        judge = "False"
if judge == "True":
    print("Yes") 
else:
    print("No")

Submission status: Accepted

Solution code:
w=list(input())
YN=True
 
for i in w:
  if w.count(i)%2!=0:
    YN=False
    break
 
print("Yes" if YN else "No")

Submission status: Accepted

Solution code:
w_str = str(input())

letter = 'abcdefghijklmnopqrstuvwxyz'
alphabet_count = [0]*len(letter)

for i in range(len(w_str)):
  for k in range(len(letter)):
    if letter[k] == w_str[i]:
      alphabet_count[k] += 1

count = 0
for j in range(len(alphabet_count)):
  if alphabet_count[j] % 2 == 0:
    count += 1

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

Submission status: Accepted

Solution code:
w=list(input())
for i in range(26):
  a=w.count(chr(97+i))
  if a%2==1:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
w_list = list(w)
alpha_list = [0] * 26
alpha_num = 0

alpha_fun = lambda c: ord(c) - ord('a')

for i in w_list:
    alpha_list[alpha_fun(i)] += 1

flg_num = 0
flg = False

for j in alpha_list:
    if j == 0 or j % 2 == 0:
        flg = True
    else:
        flg = False
        break

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

Submission status: Accepted

Solution code:
from collections import defaultdict

def main():

    W = input()
    d = defaultdict(int)

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

    for v in d.values():
        if v % 2 != 0:
            return 0

    return 1 


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

Submission status: Accepted

Solution code:
w = list(input())

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

print ('Yes')

Submission status: Accepted

Solution code:
S = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'

for c in alphabet:
    s = S.count(c)
    if s % 2 != 0:
        print('No')
        exit()

print('Yes')

Submission status: Accepted

Solution code:
S = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'
alpha_list = list(alphabet)

for c in alpha_list:
    s = S.count(c)
    if s % 2 != 0:
        print('No')
        exit()

print('Yes')

Submission status: Accepted

Solution code:
x=sorted(input())
ans="Yes"
for i in range(97,123):
    if x.count(chr(i))%2!=0:
        ans="No"
print(ans)

Submission status: Accepted

Solution code:
w = input()
l = []
for i in range(len(w)):
	if w[i] not in l:
		l.append(w[i])
cnts = [2] * len(l)
for i in range(len(w)):
	for j in range(len(l)):
		if w[i] == l[j]:
			cnts[j] += 1
			
if all(i%2 == 0 for i in cnts):
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
w = input()
a = {}
for i in w:
    a[i] = 1
x = 1
for i in a:
    if (w.count(i) & 1) == 1:
        x = 0
        break
if x:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

W = s()

from collections import defaultdict
counts = defaultdict(int)

for c in W:
    counts[c] += 1

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

Submission status: Accepted

Solution code:
from sys import exit, stdin
from collections import Counter
s = Counter(stdin.readline().rstrip())
for k, v in s.items():
  if v % 2 != 0:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

Solution code:
s=input().rstrip()
x=list(s)
G=0;
t=list(set(x))
for i in range(0,len(t)):
    if x.count(t[i])%2==0:
        continue;
    else:
        G=1;
        break;
if G==1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
w=input()
ans=0
d=[0]*30
for i in w:
    d[ord(i)-ord("a")]+=1
for i in d:
    if i%2: ans=1
print(["Yes","No"][ans])

Submission status: Accepted

Solution code:
w = input()

flag = True
for s in w:
    if not w.count(s) % 2 == 0:
        flag = False
        break
if flag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import Counter

W = input()
cnt = Counter(W)
for n in cnt.values():
    if n % 2 == 1:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())

w = str(input())

import collections
c = collections.Counter(w)
for key in c.keys():
    if c[key] % 2 == 0:
        pass
    else:
        break
else:
    print("Yes")
    exit()
print("No")

Submission status: Accepted

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

for s in S:
    if w.count(s) % 2 == 1:
        print("No")
        exit()

print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

ans = "Yes"

lst_A = list(input())

lst_A.sort()

if len(lst_A) % 2 == 1:
    ans = "No"

else:
    for i in range(0,len(lst_A)-1,2):
        if lst_A[i] != lst_A[i+1]:
            ans = "No"

print(ans)