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()
while len(w) > 0:
    a = w[0]
    if w.count(a)%2 != 0:
        print("No")
        exit()
    w = w.replace(a,"")
    print(w)
print("Yes")

Submission status: Wrong Answer

Solution code:
w = input()
while len(w) > 0:
    a = w[0]
    if w.count(a)%2 != 0:
        print("No")
        exit()
    w = w.strip(a)
print("Yes")

Submission status: Wrong Answer

Solution code:
w = input()
wl = []

for i in range(len(w)):
  wl.append(w[i])
  
wl.sort()

a = 1
judge = 1
for n in range(len(w)-1):
  if wl[a+n] == wl[a+n-1]:
    judge += 1
  else:
    if judge%2 != 0:
      print("No")
      exit()
    else:
      judge = 1
  if n == len(w)-2:
    if judge%2 == 0:
      print("Yes")
    else:
      print("No")

Submission status: Wrong Answer

Solution code:
data = ['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 = input()
if len(w) % 2 !=0:
    print('No')
else:
    for i in range(26):
        if w.count(data[i]) % 2 != 0:
            print('No')
            exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
import collections
w=list(input())
W=collections.Counter(w)
ans="Yes"
for i in W.values():
    if i%2!=0:
        ans="NO"
        break

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
from collections import deque 

input = sys.stdin.readline

def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
def dbg(o):
    print(o, file=sys.stderr)

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

def main():
    s = input()
    dc = {}
    for st in s:
        if not st in dc:
            dc[st] = 1
        else:
            dc[st] += 1
    dbg(dc)
    ans = "Yes"
    for k, v in dc.items():
        if v % 2 == 1:
            ans = "No"
            break
    print(ans)

main()

Submission status: Wrong Answer

Solution code:
import sys
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
from collections import deque 

input = sys.stdin.readline

def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
def dbg(o):
    print(o, file=sys.stderr)

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

def main():
    s = input()
    dc = {}
    for st in s:
        if not st in dc:
            dc[st] = 1
        else:
            dc[st] += 1
    dbg(dc)
    ans = 'Yes'
    for k, v in dc.items():
        if v % 2 == 1:
            ans = "No"
            break
    print(ans)

main()

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
def dbg(o):
    print(o, file=sys.stderr)

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

def main():
    s = input()
    dc = {}
    for st in s:
        if not st in dc:
            dc[st] = 1
        else:
            dc[st] += 1
    dbg(dc)
    for k, v in dc.items():
        if v % 2 == 1:
            print("No")
            exit()
    print("Yes")

main()

Submission status: Wrong Answer

Solution code:
import sys
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
from collections import deque 

input = sys.stdin.readline

def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))

INF = 1001001001

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

def main():
    s = input()
    dc = {}
    for st in s:
        if not st in dc:
            dc[st] = 1
        else:
            dc[st] += 1
    print(dc, file=sys.stderr)
    for k, v in dc.items():
        if v % 2 == 1:
            print("No")
            return
    print("Yes")

main()

Submission status: Wrong Answer

Solution code:
import sys
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
from collections import deque 

input = sys.stdin.readline

def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))

INF = 1001001001

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

def main():
    s = input()
    dc = {}
    for st in s:
        if not st in dc:
            dc[st] = 1
        else:
            dc[st] += 1
    for k, v in dc.items():
        if v % 2 == 1:
            print("No")
            return
    print("Yes")

main()

Submission status: Wrong Answer

Solution code:
w=input()
list_w=list(w)
count1=0
if(len(list_w)==1):
	print("No")
elif(len(list_w)!=1):		
	for i in range(0,len(w)):
		a=w.count(w[i])
		if(a%2==0):
			count1+=1
		elif(a%2 != 0):
			count1-=1
if(count1>0):
	print("Yes")
elif(count1<0):
	print("No")

Submission status: Wrong Answer

Solution code:
w=input()
count1=0
if(len(w)==1):
	count1+=0
	
for i in range(0,len(w)):
	a=w.count(w[i])
	if(a%2==0):
		count1+=1
	elif(a%2 != 0):
		count1-=1
		
if(count1>0):
	print("Yes")
elif(count1<0):
	print("No")
elif(count==0):
	print("Yes")

Submission status: Wrong Answer

Solution code:
w=input()
count1=0
if(len(w)==1):
	count1+=0
	
for i in range(0,len(w)):
	a=w.count(w[i])
	if(a%2==0):
		count1+=1
	elif(a%2 != 0):
		count1-=1
		
if(count1>0):
	print("Yes")
elif(count1<0):
	print("No")
elif(count==0):
	print("No")

Submission status: Wrong Answer

Solution code:
w=input()
count1=0
for i in range(0,len(w)):
	a=w.count(w[i])
	if(a%2==0):
		count1+=1
	elif(a%2 != 0):
		count1-=1
		
if(count1>0):
	print("Yes")
elif(count1<0):
	print("No")

Submission status: Wrong Answer

Solution code:
w=input()
list_w=list(w)
count1=0
for i in range(0,len(list_w)):
	a=list_w.count(list_w[i])
	if(a%2==0):
		count1+=1
	elif(a%2 != 0):
		count1-=1
		
if(count1>0):
	print("Yes")
elif(count1<0):
	print("No")

Submission status: Wrong Answer

Solution code:
import collections
a=input()
b=[]

for i in a:
  b.append(i)
  
b.sort()
c=collections.Counter(b)
c=list(c.values())

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

Submission status: Wrong Answer

Solution code:
from collections import Counter

w=input()

d=Counter(w)

ans="Yes"

for i in d.values():
  if i%2==0:
    ans="No"
    break

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

def solve():
    w = list(input())
    s = set(w)
    for i in s:
        if len([x for x in w if x == i]) % 2 == 1:
            print('No')
            exit()
    print('Yes')

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
def solve():
    w = list(input())
    s = set(w)
    print(w, s)
    for i in s:
        if len([x for x in w if x == i]) % 2 == 1:
            print('No')
            exit()
    print('Yes')

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

if all(elem%2 == 0 for elem in w_dict.values()):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
str_line = input()
str_line = list(str_line)
str_line.sort()
#print(str_line)
temp = 0
stnum_list = []

for i in range(1,len(str_line)-1):
    if str_line[i] == str_line[i-1]:
        temp += 1
        
    else:
        stnum_list.append(temp)
        temp = 0
        
rsult = 1        
for i in range(len(stnum_list)):
    rsult *= stnum_list[i]

if rsult%2 == 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
str_line = input()
str_line = list(str_line)
str_line.sort()
#print(str_line)
temp = 0
stnum_list = []

for i in range(1,len(str_line)-1):
    if str_line[i] == str_line[i-1]:
        temp += 1
        
    else:
        stnum_list.append(temp)
        temp = 0
        
rsult = 1        
for i in range(len(stnum_list)):
    rsult *= stnum_list[i]

if rsult%2 == 1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
w = str(input())
a =  sorted(w)
b = 0
count = 0
for i in range(len(a)):
    if i == 0:
        b = a[i]
        count = 1
    else:
        if a[i - 1] == a[i]:
            count += 1
        else:
            if count % 2 == 1:
                print('No')
                exit()
            else:
                count = 1
print('Yes')

Submission status: Wrong Answer

Solution code:
s=input()
l=0
for i in s:
    if(i>='a' and i<='z'):
        l+=1

if l%2==0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
w =str(input())

length = len(w)
z = sorted(w)
i=1
m=0
   
if length%2 == 1:
    m = 1
    pass
else:
    while i < length:        
        if z[i]==z[i-1]:
            i += 2
        else:
            m = 1
            break
        
if m == 1:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
W = input()
W_list = set(list(s for s in W))
ans = True 
for s in W_list:
    if W.count(s) % 2 != 0:
        ans = False
        break

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

Submission status: Wrong Answer

Solution code:
w = input()
if len(w)/len(set(w))==2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
w = list(input())

w.sort()
c = 1
p = w[0]
for i in range(1,len(w)):
    if p == w[i]:
        c += 1
    else:
        if c%2 == 1:
            print('No')
            exit()
        c = 1
        p = w[i]

print('Yes')

Submission status: Wrong Answer

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

w = input()
import collections
c = collections.Counter(w)
print(c)
for k, v in c.items():
    if v % 2 != 0:
        print('No')
        quit()
print('Yes')

Submission status: Wrong Answer

Solution code:
import math
import collections
import fractions
import itertools
import functools
import operator

def solve():
    w = input()
    c = collections.Counter()
    for i in c:
        if c[i] % 2 == 1:
            print("No")
            exit()
    print("Yes")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter
S = Counter(input())
flag = False
for c in S.values():
  if c % 2 == 1:
    flag = True
if flag:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

def main():

    w = input()
    listW = list(w)
    n = len(listW)

    listW.sort()

    count = 0
    preChar = listW[0]
    flag = True

    for i in range(n):
        if listW[i] == preChar:
            count += 1
            preChar = listW[i]

        else:
            if count % 2 == 1:
                flag = False
                break
            
            preChar = listW[i]
            count = 1

    if flag == True:
        print('Yes')

    else:
        print('No')


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
import sys
input = sys.stdin.readline
w = list(input())
w_set = set(w)
for i in w_set:
  if w.count(i)%2==1:
    print("No")
    sys.exit()
  else:
    continue
print("Yes")

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
import sys
input = sys.stdin.readline
w = input()
w_set = set(w)
for i in w_set:
  if list(w).count(i)%2==1:
    print("No")
    sys.exit()
  else:
    continue
print("Yes")

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
import sys
input = sys.stdin.readline
w = input()
w_set = set(w)
for i in w_set:
  if w.count(i)%2==1:
    print("No")
    sys.exit()
  else:
    continue
print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
W = input()

for w in set(W):
    f = True
    if W.count(w) % 2 != 0:
        f = False
if f:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
w = input()
beau = {}
for i in range(len(w)):
    if not w[i] in beau:
        beau[w[i]] = 1
    else:
        beau[w[i]] += 1
num = sum(list(map(lambda x: x%2,list(beau.values()))))
if num == 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
w = input()
beau = {}
for i in range(len(w)):
    if not w[i] in beau:
        beau[w[i]] = 1
    else:
        beau[w[i]] += 1
num = sum(map(lambda x: x%2,list(beau.values())))
if num == 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
w = input()
beau = {}
for i in range(len(w)):
    if not w[i] in beau:
        beau[w[i]] = 1
    else:
        beau[w[i]] += 1
num = sum(list(beau.values()))%2
if num == 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
w = list(input())
w.sort()
c = 0
flag = 0
for i in range(round(len(w) / 2)):
    if w[c] != w[c + 1]:
        flag = 1
        break
    c += 2
if flag == 1:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict

w = input()
d = defaultdict(int)
for i in w:
    d[w] += 1
print("YNeos"[any(i % 2 > 0 for i in d.values())::2])

Submission status: Wrong Answer

Solution code:
if input().count('w')%2:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
w = list(input())

keys = list(set(w))
cnt = 0
for k in keys:
    kl = len([x for x in w if x == k])
    if kl % 2 != 0:
        cnt += 1
        print("No")

if cnt == 0:
    print("Yes")

Submission status: Wrong Answer

Solution code:
w = list(input())

keys = list(set(w))

for k in keys:
    kl = len([x for x in w if x == k])
    if kl % 2 != 0:
        print("No")

print("Yes")

Submission status: Wrong Answer

Solution code:
w = input()
wl = list(w)
wu = list(set(wl))
wu_len  = len(wu)
counter = 0
for wo in wu:
  if wl.count(wo) % 2 == 0:
    counter+=1
  else:
    print("No")
    break
if counter == int(wu_len):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s = input()
n = [0] * 26
for i in s:
    n[ord(i) - 97] += 1

if 1 in [x % 2 for x in n]:
    print('NO')
else:
    print("YES")

Submission status: Wrong Answer

Solution code:

w=input()
lst=[]
flag = 0
for i in w:
    lst.append(i)

for i in range(len(w)):
    if lst[i] == 99:
        continue
    c = 1
    j = i + 1
    while j < len(w):
        if lst[i] == lst[j]:
            lst[j] = 99
            c += 1
        j += 1
    if c % 2 != 0:
        print("NO")
        flag = 1
        break

if flag == 0:
    print("YES")

Submission status: Wrong Answer

Solution code:
flag=True
a=list(input())
a.sort
while len(a)>0 and flag:
    n=a.count(a[0])
    if n%2==0:
        a=a[n:]
    else:
        flag=False
if flag:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#ABC044B
n=input()
a=[]
for i in range(len(n)):
     a.append(n[i])
sum_=0
for i2 in range(len(a)):
    sum_=sum_+a.count(a[i2])%2

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

Submission status: Wrong Answer

Solution code:
w = input()
lower = w.lower()
if w == lower:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def beautifulstrings():
    w=str(input())
    if len(w)%2==0:
        print('Yes')
    else:
        print('No')

beautifulstrings()

Submission status: Wrong Answer

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

w = l()

cnt = 0
w.sort()
for i in range(len(w) - 1):
	if w[i] == w[i+1]:
		cnt += 1
		if  cnt%2 == 0 and i == len(w) - 2:
			print("No")
			exit()
	elif w[i] != w[i+1]:
		if cnt%2 == 0:
			print("No")
			exit()
		cnt = 0
	
print("Yes")

Submission status: Wrong Answer

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

w = l()

cnt = 0
w.sort()
for i in range(len(w) - 1):
	if w[i] == w[i+1]:
		cnt += 1
		if  i == len(w) - 2:
			print("No")
			exit()
	elif w[i] != w[i+1]:
		if cnt%2 == 0:
			print("No")
			exit()
		cnt = 0
	
print("Yes")

Submission status: Wrong Answer

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

w = l()

cnt = 0
w.sort()
for i in range(len(w) - 1):
	print(cnt)
	if w[i] == w[i+1]:
		cnt += 1
		if  i == len(w) - 2:
			print("No")
			exit()
	elif w[i] != w[i+1]:
		if cnt%2 == 0:
			print("No")
			exit()
		cnt = 0
	
print("Yes")

Submission status: Wrong Answer

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

w = l()

cnt = 0
w.sort()
for i in range(len(w) - 1):
	if w[i] == w[i+1]:
		cnt += 1
	elif w[i] != w[i+1]:
		if cnt%2 == 0:
			print("No")
			exit()
		cnt = 0
	
print("Yes")

Submission status: Wrong Answer

Solution code:
s = sorted(list(input()))

for i in range(97, 97 + 26):
  print(s.count(chr(i)))
  if s.count(chr(i)) %2 != 0:
    print('NO')
    exit()

print('YES')

Submission status: Wrong Answer

Solution code:
'''     ##     ##  #######  # #  ######
        ##     ##  ##   ##  ###    ##
        ##     ##  ##    #  # #    ##
        #########  #######  # #    ##    '''

import sys
import math
# sys.setrecursionlimit(10**6)

def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())

def printspx(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end=" \ ")

MODPRIME = int(1e9+7); BABYMODPR = 998244353;

ONLINE_JUDGE = 1
if not ONLINE_JUDGE:
    sys.stdin  = open("input.txt","r")
    sys.stdout = open("output.txt","w")
    sys.stderr = open("output.txt","w")

# for _testcases_ in range(int(input())):
ini = ord('a')
s = input()
ans = 0
for i in s:
    ans ^= (ord(i)-ini)
if not ans:
    print("Yes")
else:
    print("No")

'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS BY ME @luctivud ( UDIT GUPTA )
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
DO NOT PLAGIARISE.
TESTCASES:
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

Submission status: Wrong Answer

Solution code:
import collections
str=input().strip()
ans=True

for item, count in collections.Counter(str).items():
   if count%2!=0:
       ans=False
       
if ans==False:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
w = input()
for i in range(ord('a'), ord('z') + 1):
  c = str(i)
  if w.count(c) % 2 == 1:
    print('No')
    break
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
w = input()
c = w.count('w')
print('Yes' if c % 2 == 0 and c > 0 else 'No')

Submission status: Wrong Answer

Solution code:
N=input()
if N.count('a')%2==0:
    print('Yes')

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")
    exit()
    
print("Yes")

Submission status: Wrong Answer

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

w = input()

for i in w:
  if w.count(i) % 2 == 1:
    print("NO")
    exit()
    
print("Yes")

Submission status: Wrong Answer

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

w = str(input())

for i in w:
  if w.count(i) % 2 == 1:
    print("NO")
    exit()
    
print("Yes")

Submission status: Wrong Answer

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

english = {}

for ch in w:
    if ch in english:
        english[ch] += 1
    else:
        english[ch] = 1

beautiful = True
for value in english.values():
    if value%2 == 1:
        beautiful = False

if beautiful:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import collections
w = list(input())
tmp = collections.Counter(w)
ans = "YES"
for i in tmp.values():
    if i%2 != 0:
        ans = "NO"
        break
    else:
        pass
print(ans)

Submission status: Wrong Answer

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

w = str(input())

for i in w:
  if w.count(i) % 2 == 1:
    print("NO")
    exit()
    
print("Yes")

Submission status: Wrong Answer

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

w = str(input())

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

Submission status: Wrong Answer

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

w = str(input())

for i in range(len(w)):
  c = []
  c.append(w[i])
  for j in range(len(w)):
    if w[j] == w[i]:
      c.append(w[j])
  if len(c) %2 == 0:
    print("NO")
    exit()
  
print("Yes")

Submission status: Wrong Answer

Solution code:
w=input()
flag=True
for i in str(w):
  if str(w).count(i)==2:
    continue
  else:
    flag=False
print("Yes" if flag==True else "No")

Submission status: Wrong Answer

Solution code:
from collections import Counter
s = input()
ans = [False if i%2 else True for i in Counter(s).values()]
print(all(ans))

Submission status: Wrong Answer

Solution code:
#美しい文字列　044_B

w=input()
count=0
ans='Yes'
for i in range(len(w)):
    t=w[i]
    for e in range(len(w)):
        t==w[e]
        count=count+1
        if count%2==1:
            ans='No'
            break
        else:
            ans='Yes'

print(ans)

Submission status: Wrong Answer

Solution code:
#美しい文字列　044_B

w=input()
count=0
ans='Yes'
for i in range(len(w)):
    t=w[i]
    for e in range(len(w)):
        t==w[e]
        count=count+1
        if count%2==1:
            ans='No'
        else:
            ans='Yes'

print(ans)

Submission status: Wrong Answer

Solution code:
w = input()
cdict = {}
for c in w:
  if c in cdict:
    cdict[c] += 1
  else:
    cdict[c] = 0
    
if all(cdict[c]%2==0 for c in cdict):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
w = input()
duplex = set(w)
before_w = ''
diff = 0
for i in duplex:
    before_w = w.replace(i, '')
    diff = diff + (len(w) - len(before_w))
    w = before_w

if diff % 2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
w = input()
k=0

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

Submission status: Wrong Answer

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): return print(arg)
def Y(): print("Yes"); return
def N(): print("No"); return

#####Shorten#####
def DD(arg): return defaultdict(arg)

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############

S = S()
d = DD(int)
for s in S:
  d[s] += 1
for k in d:
  if d[k]%2:
    N()
Y()

Submission status: Wrong Answer

Solution code:
w = list(input())
w.sort()
i = 00
if len(w) % 2 == 1:
    print('No')
    exit()

while i < len(w)-1:
	if w[i] != w[i+1]:
	
		exit()
	i += 2
else:
	print('Yes')

Submission status: Wrong Answer

Solution code:
w = list(input())
w.sort()
i = 0
while i < len(w) -1:
	if w[i] != w[i+1]:
		print('No')
		exit()
	i += 2
else:
	print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

def S(): return stdin.readline().rstrip()
def I(): return int(stdin.readline().rstrip())
def LS(): return list(stdin.readline().rstrip().split())
def LI(): return list(map(int,stdin.readline().rstrip().split()))

w = S()

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

print('Yes')

Submission status: Wrong Answer

Solution code:
from sys import stdin

def S(): return stdin.readline().rstrip()

w = S()

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

Submission status: Wrong Answer

Solution code:
w = input()
ww = set(w)
check = []
ans = 0

for i in ww:
    check.append(w.count(i))

for i in check:
    if i % 2 != 0:
        print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
from sys import exit

w = input()
n = len(w)

cnt = 0
c = w[0]
sw = sorted(w)
for i in range(n):
    if sw[i] != c:
        if cnt%2 == 1:
            print("No")
            exit()
        else:
            print("Yes")
            exit()

        if cnt%2 == 1:
            print("No")
            exit()
        else:
            cnt = 1
            c = w[i]
    else:
        cnt += 1

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
w = input()
a = "abcdefghijklmnopqrstuvwxyz"
w_list = list(a)
hoge = 0
for word in w_list:
  s = w.count(word)
  if s%2 != 0:
    print('No')
    hoge += 1
if hoge == 0:
  print('Yes')

Submission status: Wrong Answer

Solution code:
w = input()
List = []
for k in range(len(w)):
  tmp = w[k]
  List.append(tmp)
num2alpha = lambda c: chr(c+64)
for i in range(1,27):
  tmp2 = List.count(num2alpha(i))
  if(tmp2 % 2 == 0):
    pass
  else:
    print("No")
    exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
w = list(input())
W = list(set(w))
cnt = [0]*len(W)

for i in w:
    cnt[W.index(i)] += 1

for i in cnt:
    if i%2!=0:
        print('NO')
        exit()
print('YES')

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    def main():
        w=list(input())
        w.sort()
        if len(w)%2!=0:
            print('No')
        else:
            for i in range(0,len(w)-1,2):
                if w[i]!=w[i+1]:
                    return 'No'
            return 'Yes'
    print(main())
resolve()

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    w=list(input())
    w.sort()
    if len(w)%2!=0:
        print('No')
    else:
        for i in range(0,len(w)-2,2):
            if w[i]!=w[i+1]:
                print('No')
                break
        print('Yes')
resolve()

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    w=list(input())
    w.sort()
    if len(w)%2!=0:
        print('No')
    else:
        for i in range(0,len(w)-1,2):
            if w[i]!=w[i+1]:
                print('No')
                break
        print('Yes')

resolve()