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:
from collections import Counter
w = input()
ww = Counter(w)
ans = "Yes"
for i in ww:
    if ww[i] % 2 != 0:
        ans = "No"
        break
print(ans)

Submission status: Accepted

Solution code:
from collections import Counter
w = input()
ww = Counter(w)
ans = "No"
for i in ww:
    if ww[i] % 2 == 0:
        ans = "Yes"
    else:
        ans = "No"
        break
print(ans)

Submission status: Accepted

Solution code:
w = input()
strlist = ["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"]
def search():
    for i in strlist:
        if w.count(i) % 2 == 1:
            return "No"
    return "Yes"
print(search())

Submission status: Accepted

Solution code:
w=input()
l=[0]*26

for i in range(len(w)):
    if w[i]=="a":
        l[0]+=1
    elif w[i]=="b":
        l[1]+=1
    elif w[i]=="c":
        l[2]+=1
    elif w[i]=="d":
        l[3]+=1
    elif w[i]=="e":
        l[4]+=1
    elif w[i]=="f":
        l[5]+=1
    elif w[i]=="g":
        l[6]+=1
    elif w[i]=="h":
        l[7]+=1
    elif w[i]=="i":
        l[8]+=1
    elif w[i]=="j":
        l[9]+=1
    elif w[i]=="k":
        l[10]+=1
    elif w[i]=="l":
        l[11]+=1
    elif w[i]=="m":
        l[12]+=1
    elif w[i]=="n":
        l[13]+=1
    elif w[i]=="o":
        l[14]+=1
    elif w[i]=="p":
        l[15]+=1
    elif w[i]=="q":
        l[16]+=1
    elif w[i]=="r":
        l[17]+=1
    elif w[i]=="s":
        l[18]+=1
    elif w[i]=="t":
        l[19]+=1
    elif w[i]=="u":
        l[20]+=1
    elif w[i]=="v":
        l[21]+=1
    elif w[i]=="w":
        l[22]+=1
    elif w[i]=="x":
        l[23]+=1
    elif w[i]=="y":
        l[24]+=1
    elif w[i]=="z":
        l[25]+=1
for i in range(26):
    if l[i]%2!=0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


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

    S = iss()
    st = set(S)
    ret = [False] * len(st)
    i = 0
    for s in st:
        if S.count(s) % 2 == 0:
            ret[i] = True
        i+=1
    print('Yes' if all(ret) else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import collections

w = input()
counter = collections.Counter(w)
ans = "Yes"
for x in counter.values():
    if x % 2 != 0:
        ans = "No"
        break

print(ans)

Submission status: Accepted

Solution code:
from collections import Counter

w = input()
dic = Counter(w)
if all(v%2==0 for v in dic.values()):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = input()

def f (w):
    for s in w:
        if w.count(s) % 2 != 0:
            return 0
    return 1

if f(w) == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
w = str(input())

n = int(0)

for i in w:
    if w.count(i) %2 == 1:
        n +=1

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

Submission status: Accepted

Solution code:
from collections import Counter

c = Counter(list(input()))

for k in c:
    if c[k]%2==1:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
n = len(w)

chrs = [chr(i) for i in range(97, 97+26)]
lis = [0]*26

for i in range(26):
  tmp = w.count(chrs[i])
  lis[i] = tmp

for i in range(26):
  if lis[i]%2!=0:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

from collections import Counter

w = ns()
c = Counter(w)
flag = True
for k, v in c.items():
    if v % 2 != 0:
        flag = False

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = list(input())
w.sort()
array = []
allset = list(set(w))
allset.sort()
index = 0
lettercount = 0
bad_letter = 0
indexs = []

for i in range(len(w) - 1):
    if w[i] != w[i+1]:
        indexs.append(i+1)
indexs.append(len(w))

for i in indexs:
    if i % 2 != 0:
        bad_letter += 1

print("No") if bad_letter > 0 else print("Yes")

Submission status: Accepted

Solution code:
s = input()
n = len(s)
key = dict()
for i in range(n):
  if s[i] not in key:
    key[s[i]] = 1
  else:
    key[s[i]] += 1
ans = True
for value in key.values():
  if value%2 == 1:
    print("No")
    ans = False
    break
if ans:
  print("Yes")

Submission status: Accepted

Solution code:
import sys
S = input()
alp = list(set(S))
cnts = [0] * len(alp)
for i in range(len(S)):
    cnts[alp.index(S[i])] += 1
    
for a in cnts:
    if a%2 == 1:
        print("No")
        sys.exit()
print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

flag = True
for k, v in w.items():
  if v % 2 != 0:
    flag = False
    break
print("Yes" if flag else "No")

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil,gcd
# from itertools import permutations as permus
from collections import deque,Counter
# import re
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

import numpy as np
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix

# slist = "abcdefghijklmnopqrstuvwxyz"
W = input()

count = Counter(W)
arr = np.array(list(count.values()))
arr = arr%2

ans = "Yes"
if 1 in arr:
    ans = "No"

print(ans)
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(ans))

Submission status: Accepted

Solution code:
w = input()

a = {}

for i in w:
    if i not in a:
        a[i] = 1
    else:
        a[i] += 1

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

print('Yes')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read

from collections import Counter

print('Yes' if all(v % 2 == 0 for v in Counter(read().rstrip().decode()).values()) else 'No')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from collections import Counter

for check in list(Counter(read().rstrip().decode()).values()):
    if check % 2 == 1:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
W = input()
cnt = [0] * 300
for w in W:
    cnt[ord(w)] += 1

for c in cnt:
    if c % 2 != 0:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter
c = Counter(input())
for x in c:
    if c[x] % 2 == 1:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    import sys
    ws=input()
    w=list(ws)
    ww=set()
    for i in range(len(w)):
        if not w[i] in ww:
            ww.add(w[i])
    for www in ww:
        if ws.count(www)%2==1:
            print("No")
            sys.exit()
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
List="abcdefghijklmnopqrstuvwxyz"
num=[0]*26
flag=0
w=input()
for i in range(26):
  num[i]=w.count(List[i])
  if (num[i]%2==1):
    flag=1
print("Yes" if flag==0 else "No")

Submission status: Accepted

Solution code:
arg=list(input())
word=set(arg)
for i in word:
  n = sum(x==i for x in arg)
  if n%2!=0:
    print('No')
    break
else:
  print('Yes')

Submission status: Accepted

Solution code:
w=input()
L=len(w)
check=0
for i in range(0,L):
    a=w.count(w[i])
    if a%2==0:
        check+=1
    else:
        pass
if check==L:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

w = input()
c = Counter(w)
for k, v in c.items():
    if v % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
from collections import defaultdict

w = input()
d = defaultdict(int)

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

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

Submission status: Accepted

Solution code:
def myAnswer(w:list) -> str:
   dic = dict()
   for i in w:
      if(i in dic.keys()):
         dic[i]+=1
      else:
         dic[i]=1
   for value in dic.values():
      if(value%2 == 1):
         return "No"
   return "Yes"
         

def modelAnswer():
   tmp=1
def main():
   w = list(input())
   print(myAnswer(w))

if __name__ == '__main__':
   main()

Submission status: Accepted

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

c = Counter(w)
for k, v in c.items():
    if not v % 2 == 0:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
w = input()

W = set(w)

ans ='Yes'
for s in W:
    if w.count(s) % 2 != 0:
        ans = 'No'
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
import collections
dct = dict(collections.Counter(list(w)))
for val in dct.values():
    if val % 2 == 1:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

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()
c = collections.Counter(w)
li = []
for value in c.values():
    li.append(value)
for i in range(len(li)):
    if li[i]%2 != 0:
        print("No")
        sys.exit()
print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
s=input()
d=Counter(s)
da=[i for i in d if d[i]%2==0]
if len(da)==len(set(s)):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
w = input()

d = dict()
ans = 'Yes'

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

for k, v in d.items():
    if v % 2 == 1:
        ans = 'No'
        break

print(ans)

Submission status: Accepted

Solution code:
w = list(input())

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

Submission status: Accepted

Solution code:
w = str(input())

n = int(0)

for i in w:
    if w.count(i) % 2 == 1:
        n += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

cnt = {chr(i): 0 for i in range(97, 97 + 26)}
for _w in w:
    cnt[_w] += 1

ans = True
for v in cnt.values():
    if v % 2 != 0:
        ans = False
        break

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

Submission status: Accepted

Solution code:
s = input()
cnt = {}
for x in s:
    if x not in cnt:cnt[x] = 1
    else:cnt[x] +=1
ok = True
for key in cnt:
    if cnt[key] %2 !=0:
        ok = False
        break
if ok:print('Yes')
else:print('No')

Submission status: Accepted

Solution code:

w = list(input())
t = w.copy()
t = set(t)
t = list(t)

flg = True

for i in range(len(t)):
    if w.count(t[i]) % 2 == 0:
        pass
    else:
        flg = False
        break

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

Submission status: Accepted

Solution code:
s = input()

cnt = {}

for l in s :
    cnt.setdefault(l,0)
    cnt[l] += 1


flag = True
for v in cnt.values():
    if v % 2 == 1:
        flag = False
        break
        
if flag :
    print('Yes')
else :
    print('No')

Submission status: Accepted

Solution code:
def main():
    w = input()
    alphabet = set(w)

    is_beautiful = True

    for c in alphabet:
        if w.count(c) %2 != 0:
            is_beautiful = False
            break
    
    if is_beautiful:
        print("Yes")
    else:
        print("No")
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
dicts = {i:0 for i in range(ord('a'), ord('z') + 1)}

for i in w:
    dicts[ord(i)] += 1

print('Yes' if len(list(filter(lambda x:x[1]%2==0, dicts.items()))) == 26 else 'No')

Submission status: Accepted

Solution code:

import collections


def solve(s):
    counts = collections.Counter(s)

    for key, count in counts.items():
        if count & 1:
            return False

    return True


string = input().strip()

print("Yes" if solve(string) else "No")

Submission status: Accepted

Solution code:
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


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

    N = list(iss())
    print('Yes' if all([N.count(n) % 2 == 0 for n in set(N)]) else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


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

    N = list(iss())
    for n in range(ord('a'), ord('z')+1):
        if N.count(chr(n)) % 2 != 0:
            print('No')
            exit()
    else:
        print('Yes')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
w=input()
cnt=0
for i in range(len(w)):
  if w.count(w[i])%2==0:
    cnt+=1
    continue
  else:
    cnt=0

if cnt==len(w):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import collections
w = str(input())
a = collections.Counter(w)
fr = 0
for k,v in a.items():
    if v % 2 == 1:
        fr += 1
if fr == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = input()
char = []
for w0 in w:
    if w0 not in char:
        char.append(w0)
    else:
        char.remove(w0)
if len(char) == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import Counter as co
l=co(input()).values()
s={i%2 for i in l}
if 1 in s:print("No")
else:print("Yes")

Submission status: Accepted

Solution code:
s=input()

s= list(s)
    
import collections

c = collections.Counter(s)

score_sorted = sorted(c.items(), key=lambda x:-x[1])

for k,i in score_sorted:
    if i%2 != 0:
       print('No')
       exit()
print('Yes')

Submission status: Accepted

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

for char in set_w:
    count_char = w.count(char)
    if count_char % 2 == 1:
        ans = "No"
    else:
        ans="Yes"
print(ans)

Submission status: Accepted

Solution code:
w = list(input())
set_w = set(w)
ans = "Yes"

for char in set_w:
    count_char = w.count(char)
    if count_char % 2 == 1:
        ans = "No"
        break
print(ans)

Submission status: Accepted

Solution code:
s = input()
ss = set(s)
a = set()
for i in ss:
    a.add(s.count(i) % 2 == 0)
if a == {True}:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import collections
import sys 

s = input()

c = collections.Counter(s)

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

Submission status: Accepted

Solution code:
import collections
w = str(input())
l = list()
for s in w:
    l.append(s)

c = collections.Counter(l)
for i in range(len(c)):
    s=c.most_common()[i]
    if s[1]%2!=0:
        print('No')
        exit()

print('Yes')

Submission status: Accepted

Solution code:
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:input()

"""========main code==============="""

d=defaultdict(int)
s=list(ip())
for i in s:
    d[i]+=1
f=0
for i in set(s):
    if(d[i]%2):
        f=1
        break
if f:
    print("No")
else:
    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()
print("YNeos"[any(s.count(i) % 2 for i in s)::2])

Submission status: Accepted

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

ans=0
while w:
    count=1
    check=w.pop()
    while check in w:
        count+=1
        w.pop()
    if count%2==1:
        ans+=1
        
if ans==0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import string
import sys

input = sys.stdin.readline
AL = string.ascii_lowercase


def main():
    w = input().rstrip()
    ans = "Yes"
    for s in AL:
        cnt = w.count(s)
        if cnt % 2 == 1:
            ans = "No"
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
w=list(input())
w.sort()
tmp=w[0]
cnt=1
flag=0
if len(w)%2==1:
    print("No")
    exit()
for i in range(1,len(w)):
    if tmp==w[i]:
        cnt+=1
    else:
        if cnt%2==0:
            tmp=w[i]
            cnt=1
        else:
            flag=1
            print("No")
            break
if flag==0:
    print("Yes")

Submission status: Accepted

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: Accepted

Solution code:
w = input()
from collections import Counter
c = Counter(w)
ans = 'Yes'
for i in c:
    if c[i]%2==1:
        ans = 'No'
print(ans)

Submission status: Accepted

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

ans='Yes'
for _, v in c.items():
    if v%2==0:
        continue
    else:
        ans='No'
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(str):
  alphabet_count = [0]*26
  for s in str:
    idx = ord(s) - ord('a')
    alphabet_count[idx] += 1
  for i in alphabet_count:
    if i % 2 != 0:
      return False
  return True

if __name__ == "__main__":
  w = input()
  if solve(w):
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
# python 3.4.3
import sys
input = sys.stdin.readline
# import numpy as np
from collections import Counter

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
W = input().rstrip()

C = Counter(W).most_common()

ans = "Yes"
for _,cnt in C:
    if cnt%2 == 1:
        ans = "No"
        break

print(ans)

Submission status: Accepted

Solution code:
x = input()
s = set(x)
ans = 'Yes'

for c in s:
    if x.count(c) % 2 != 0:
        ans = 'No'
        break

print(ans)

Submission status: Accepted

Solution code:
# ABC 044: B – 美しい文字列 / Beautiful Strings
w = input()
judgement = 'Yes'
for c in w:
    if w.count(c) % 2 == 1:
        judgement = 'No'
        break
print(judgement)

Submission status: Accepted

Solution code:
w = input()
cnt = 0
for i in w:
    if (w.count(i) % 2 != 0):
        cnt += 1

print("Yes" if cnt is 0 else "No")

Submission status: Accepted

Solution code:

w=input()

import collections 

l=collections.Counter(list(w))
l=list(l.values())

flg=0
for i in range(len(l)):
    if l[i]%2!=0:
        flg+=1

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

Submission status: Accepted

Solution code:
from collections import Counter

w = Counter(input())
result = 'Yes'

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())
b=1
var = list(set(s))

for i in var:
  if s.count(i)%2==0:
    pass
  else:
    b=0
    
if b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
url = "https://atcoder.jp/contests/abc044/tasks/abc044_b"

def main():
    param = list(input())
    count_d = {}
    for p in param:
        count_d.setdefault(p, 0)
        count_d[p] += 1

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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:
    if i == len(w_set)-1: print("Yes")

Submission status: Accepted

Solution code:
li = list(input())
li.sort()
while True:
    if len(li) == 0:
        print("Yes")
        break
    elif not len(li) % 2 == 0:
        print("No")
        break
    elif li[0] == li[1]:
        li.pop(0)
        li.pop(0)
    else:
        print("No")
        break

Submission status: Accepted

Solution code:
li=list(input())
li.sort()
if len(li)%2:
    print("No")
    exit()
while True:   
    if len(li)==0:
        print("Yes")
        break
    elif li[0]==li[1]:
        li.pop(0)
        li.pop(0)
    else:
        print("No")
        break

Submission status: Accepted

Solution code:
li = list(input())
flag=1
for a in li:
    if li.count(a)%2:
        print("No")
        flag=0
        break
if flag:
    print("Yes")

Submission status: Accepted

Solution code:
w=sorted(list(input()))+["_"];s="Yes" 
for i in range(1,len(w),2):
    if w[i]!=w[i-1]:s="No"
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""

# Written by NoKnowledgeGG @YlePhan

#import math
#mod = 10**9+7
def main():
  w = input()
  dic = {}
  for i in range(len(w)):
    if w[i] in dic:
      dic[w[i]] +=1
    else:
      dic[w[i]] = 1
  for k,v in dic.items():
    if v % 2 != 0:
      print('No')
      exit()
  print('Yes')
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
import sys

s=input()

for i in range(len(s)):
  if s.count(s[i])%2==0:
    pass
  else:
    print("No")
    sys.exit()
    
print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter

w = list(input())

w = Counter(w)

for k,v in w.items():
    if v%2!=0:
        print("No")
        exit()

print("Yes")

Submission status: Accepted

Solution code:
import collections
l = list(input())
c = collections.Counter(l)

for x in c.values():
  if x%2 == 1:
    print("No")
    break
  else:
    continue
else:
  print("Yes")

Submission status: Accepted

Solution code:

import math
import itertools
import statistics
#import numpy as np
import collections

#n = int(input())
#n, m = list(map(int, input().split()))
w = input()
l = collections.Counter(w)
for i in l.values():
    if i%2!=0:
        print("No")
        exit()

print("Yes")

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
from decimal import *


def lcm(x, y):
    return (x * y) // math.gcd(x, y)


if __name__ == '__main__':
    s = input()
    ans ={}
    for i in s:
        if i in ans:
            ans[i] +=1
        else:
            ans[i] =1
    flg =0

    for i in ans.values():
        if i % 2 >0:
            flg =1
            break
    if flg == 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
w = input()
a = set(w)
flg = True
for i in a:
    if w.count(i) % 2 == 1:
        flg = False
        break
if flg:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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: Accepted

Solution code:
w = input()
count = {}
for s in w:
    try:
        count[s] += 1
    except:
        count[s] = 1
for s in count.values():
    if s&1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc044/tasks/abc044_b
w = list(input())

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

print("Yes")

Submission status: Accepted

Solution code:
w = list(input())

c = [0] * 26

for ch in w:
    c[ord(ch) - ord("a")] += 1

f = "Yes"
for cnt in c:
    if cnt % 2 == 1:
        f = "No"

print(f)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
import numpy as np
w=list(input())
k=[]
for i in range(97,97+26):
    k.append(w.count(chr(i)))
k1=np.mod(k,2)
if 1 in k1:print('No')
else:print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
aqui = []

for l in s:
	if l not in aqui:
		aqui.append(l)
		continue
	aqui.remove(l)

print('Yes') if len(aqui) == 0 else print('No')

Submission status: Accepted

Solution code:
w = str(input())
check = int(0)
c = int(0)

for a in [chr(i) for i in range(97,97+26)]:
  c = w.count(a)
#  print(str(w)+"チェック"+str(a))
  if(c%2 == 1):
    check = check + 1

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

Submission status: Accepted

Solution code:
w = input()
alp = 'abcdefghijklmnopqrstuvwxyz'
c = []
for i in range(26):
    a = w.count(alp[i])
    c.append(a)
d = 0
for i in range(26):
    if c[i] % 2 == 0:
        d = 1
    else:
        d = 0
        break
if d == 0:
    print('No')
else:
    print('Yes')