s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s066651328 | p04011 | u760794812 | 1529431131 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 118 | n = input()
k= input()
X = input()
y = input()
if n<=k:
total = n*x
else:
total = k*x + (n-k) * y
print(total) |
s557434214 | p04011 | u444856278 | 1528933605 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38640 | 610 | from sys import stderr
from functools import reduce
from operator import add
def f(): return [int(i) for i in input().split()]
def debug(*x): stderr.write(reduce(add, repr(x)).strip("()\',") + '\n')
n, a = f()
x = f()
s = sum(x)
dp = [[[0 for i in range(n + 1)] for j in range(s + 1)] for k in range(n + 1)]
for i in range(n + 1):
dp[i][0][0] = 1
for i in range(1, n + 1):
for j in range(1, s + 1):
for k in range(1, n + 1):
dp[i][j][k] = dp[i - 1][j][k] + dp[i - 1][j - x[i - 1]][k - 1]
ans = 0
k = 1
while a * k <= s and k <= n:
ans += dp[n][a*k][k]
k += 1
print(ans)
|
s199302807 | p04011 | u443569380 | 1528070031 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 98 | N,K,X,Y = map(int,input().split())
if N < K:
print(X * N)
else:
print(K * X + (N - K) * Y) |
s936403394 | p04011 | u443569380 | 1528069117 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 143 | N,K,X,Y = map(int,input().split())
price = 0
for i in range(1,N+1):
if i <= K:
price += X
else:
price += Y
print(price) |
s589049233 | p04011 | u650245944 | 1503613222 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 63 | n, k, x, y = map(int, input())
print(x*min(n, k)+y*max(0, n-k)) |
s843276258 | p04011 | u999536956 | 1501442572 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 132 | N = input()
K = input()
X = input()
Y = input()
if N > K:
s = N - K
r = (K * X) + (s * Y)
print(r)
else:
print(N*X) |
s348499899 | p04011 | u149051097 | 1491932241 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 169 | #!/usr/bin/env python
# coding:utf-8
import os, sys
import math
N = input()
K = input()
X=input()
Y=input()
if N-K >= 0:
print X*K + Y*(N-K)
else:
pritn X*K
|
s496699735 | p04011 | u559722042 | 1490073794 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 147 | a = [int(input()) for i in range(4)]
sum = 0
for i in range(a[0]):
if i + 1 <= K:
sum += a[2]
else:
sum += a[3]
print(sum)
|
s709295397 | p04011 | u359930418 | 1479473912 | Python | PyPy3 (2.4.0) | py | Runtime Error | 215 | 38768 | 88 | >>> N = 5
>>> K = 1000
>>> K = 2
>>> X = 1000
>>> Y = 1200
>>> print(K*X + Y*3)
5600
>>> |
s368335079 | p04011 | u425448230 | 1473179300 | Python | Python (3.4.3) | py | Runtime Error | 37 | 3064 | 97 | N, K, X, Y = [input() for i in range(4)]
if N <= K:
print(N*X)
else:
print((N-K)*Y + K*X) |
s869109748 | p04011 | u514826602 | 1473170607 | Python | Python (3.4.3) | py | Runtime Error | 39 | 3064 | 117 | n = int(input())
k = int(input())
x = int(input())
y = int(input())
return x * n if n < k
return x * k + y * (n - k) |
s953436680 | p04011 | u514826602 | 1473170552 | Python | Python (3.4.3) | py | Runtime Error | 37 | 3064 | 97 | n = input()
k = input()
x = input()
y = input()
return x * n if n < k
return x * k + y * (n - k) |
s247224769 | p04011 | u212829728 | 1473093114 | Python | Python (3.4.3) | py | Runtime Error | 42 | 3188 | 1082 | def app(numlist, A ):
counter = 0
N = len(numlist)
for i in range(1,N):
counter += f(numlist, i, A*i)
return int(counter)
def f(numlist, rest, sum):
result = 0
numset = set(numlist)
if rest == 1:
return numlist.count(sum)
elif rest == 2:
for big in numset:
if (sum - big in numset) and (big >= sum - big):
result += counter(numlist, big, sum-big)
return result
else:
for i in numset:
i_place = numlist.index(i)
result += f(numlist[i_place+1:], rest-1, sum-i)
return result
def counter(numlist, big, small):
hist = mkhist(numlist)
if big == small:
N = hist[big]
return N * (N - 1) / 2
else:
big_N = hist[big]
small_N = hist[small]
return big_N * small_N
def mkhist(numlist):
hist = dict()
for char in numlist:
if not char in hist.keys():
hist[char] = 1
else:
hist[char] += 1
return hist
N, A = map(int, input().split(' '))
inputs = input()
inputnum = map(int, inputs.split(' '))
inputnum = sorted(list(inputnum))
print (app(inputnum, A)) |
s715374284 | p04011 | u212829728 | 1473049518 | Python | Python (3.4.3) | py | Runtime Error | 37 | 2940 | 239 | n = 4
input_list = []
for i in range(4):
input_list.append(int(input()))
N = input_list[0]
K = input_list[1]
X = input_list[2]
Y = input_list[3]
if N > K :
result = K * X + (N-K) * Y
else:
result = K * X
print ( result ) |
s330680369 | p04011 | u283229916 | 1472931704 | Python | Python (3.4.3) | py | Runtime Error | 39 | 3188 | 94 | n=input()
k=input()
x=input()
y=input()
if n>k:
n-=k
else:
k=n
n=0
print(k*x+n*y)
|
s822818878 | p04011 | u830390742 | 1472751510 | Python | Python (2.7.6) | py | Runtime Error | 28 | 2568 | 397 | N, A = map(int, raw_input().split())
a = sorted(map(lambda x:int(x)-A, raw_input().split()))
mem = {}
def rec(p, acm):
if (p, acm) in mem:
return mem[(p, acm)]
if p >= N:
return 0
if a[p] > 0 and acm > 0:
return 0
mem[(p, acm)] = rec(p+1, acm+a[p]) + rec(p+1, acm)
if acm+a[p] == 0:
mem[(p, acm)] += 1
return mem[(p, acm)]
print rec(0, 0)
|
s438988947 | p04011 | u991506065 | 1472675996 | Python | Python (2.7.6) | py | Runtime Error | 26 | 2568 | 155 | if __name__ == '__main__':
N,K,X,Y = map(int, raw_input().split())
if(N <= K):
print (N * X)
else :
print (K * X) + ((N-K) * Y) |
s773785421 | p04011 | u044720634 | 1472504628 | Python | Python (2.7.6) | py | Runtime Error | 26 | 2568 | 208 | #!/usr/bin/env python
#coding:UTF-8
N = int(raw_input())
K = int(raw_input())
X = long(raw_input())
Y = long(raw_inpuit())
sum = 0
if N >= K:
sum = X * K + Y * (N - K)
else:
sum = X * N
print sum |
s876159981 | p04011 | u171720157 | 1472440021 | Python | Python (3.4.3) | py | Runtime Error | 38 | 3064 | 122 | N = input()
K = input()
X = input ()
Y = input()
if N > K:
for K:
X += X
for (N - K):
X += Y
else:
for N:
X =+ X
|
s122360080 | p04011 | u429995021 | 1472435322 | Python | Python (2.7.6) | py | Runtime Error | 26 | 2568 | 115 | N = input()
K = input()
X = input()
Y = input()
if N > K:
res = K*X + (N-K)*Y
else
res = N*X
print(res)
|
s039776872 | p04011 | u177721681 | 1472432723 | Python | Python (2.7.6) | py | Runtime Error | 28 | 2568 | 217 | import sys
N = sys.readline()
K = sys.readline()
X = sys.readline()
Y = sys.readline()
#X* K + Y * (N-K)
# if N > K
#X * K
# if N < K
if N > K :
print X* K + Y *(N-K)
else:
print X*K |
s006194635 | p04012 | u035210736 | 1601313379 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9012 | 263 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (char c = 97; c <= 122; c++) {
if (count(s.begin(), s.end(), c) % 2 != 0) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} |
s338013192 | p04012 | u666550725 | 1599882494 | Python | PyPy3 (7.3.0) | py | Runtime Error | 99 | 74640 | 137 | w = input()
X = [0 for i in range(26)]
for i in range(len(w)):
X[ord(w[i]) - 97] ^= 1
if sum(X) == 0:
print("Yes")
else:
print("No) |
s549692934 | p04012 | u242580186 | 1599873968 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9020 | 451 |
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()
|
s810473903 | p04012 | u863850961 | 1599582200 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8952 | 256 | w=input()
list_w=list(w)
count1=0
if(len(list_w)==1):
print("No")
else:
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")
|
s673250618 | p04012 | u796563423 | 1599553113 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9032 | 165 | w=sorted(input())
total=False
for i in range(0,len(w),2):
if w[i]!=w[i+1]:
print("No")
total=True
break
if total==False:
print("Yes") |
s632561573 | p04012 | u239368018 | 1599503681 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9004 | 186 | s = input()
di = {}
for c in s:
di[c] = 0
for c in s:
di[c] +=1
is_beautiful = True
for c in s:
if di[c] %2 ==1:
is_beautiful = False
print('Yes' is is_beautiful else 'No') |
s464423927 | p04012 | u239368018 | 1599503492 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9100 | 75 | n = int(input())
A = [int(m) for m in input().split()]
print(max(A)-min(A)) |
s640413699 | p04012 | u620846115 | 1599425795 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9028 | 188 | n = input()
dic = [a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z]
for i in range(26):
if n.count(str(dic[i]))%2!=0:
print("No")
exit()
print("Yes") |
s207458401 | p04012 | u620846115 | 1599425751 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9028 | 183 | n = input()
dic = [a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z]
for i in range(26):
if n.count(dic[i])%2!=0:
print("No")
exit()
print("Yes") |
s436446110 | p04012 | u395620499 | 1598847199 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9048 | 150 | w = input()
s = {}
for c in w:
s[c] += 1
b = True
for k,v in s.items():
b = b and v % 2 == 0
if b:
print("Yes")
else:
print("No")
|
s437773252 | p04012 | u468972478 | 1598144235 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9000 | 139 | n = input()
ans = 0
for i ih set(n):
if n.count(i) % 2 == 0:
ans += 1
if ans == len(set(n)):
print("Yes")
else:
print("No")
|
s955872433 | p04012 | u190195462 | 1597979807 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8968 | 183 | w =str(input())
length = len(w)
z = sorted(w)
i=0
while i < length:
if z[i]==z[i+1]:
i += 2
else:
print("No")
break
if i >= length-1:
print("Yes") |
s119742169 | p04012 | u378299699 | 1597281130 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8888 | 176 | W = input()
W_list = set(list(s for s in W))
ans = True
for s in W_list:
if W.count(s) % 2 != 0
False
break
if ans:
print("Yes")
else
print("No") |
s338335959 | p04012 | u039860745 | 1596079051 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8840 | 186 | w = input()
A = [0] * 26
for in in w:
A[ord(i) - 97] += 1
flag = True
for a in A:
if a % 2 == 1:
flag = False
if flag == False:
print("No")
else:
print("Yes") |
s658873306 | p04012 | u746428948 | 1595882110 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8984 | 215 | s = input()
alphabets = [0] * 26
for i in range(len(s)):
x = ord(s[i])
alphabets[x-97] += 1
flag = True
for x in alphabets:
if x % 2 != 0:
ok = False
if ok:
print('Yes')
else:
print('No') |
s384414749 | p04012 | u980503157 | 1595866979 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8952 | 139 | s = input()
d = {}
for i in s:
if i in d:
d[i] += 1
else:
d[i] = 1
for key in d:
if d[key] %2 != 0
print("No")
break
|
s986780219 | p04012 | u593567568 | 1595211904 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9100 | 189 | from collection import Counter
S = list(input())
C = Counter(S)
ok = True
for s,x in list(C.items()):
if x % 2 != 0:
ok = False
break
if ok:
print("Yes")
else:
print("No")
|
s645574995 | p04012 | u593567568 | 1595211850 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8852 | 182 | from collection import Counter
S = list(input())
C = Counter(S)
ok = True
for s,x in C.items():
if x % 2 != 0:
ok = False
break
if ok:
print("Yes")
else:
print("No") |
s233039556 | p04012 | u970198631 | 1594751333 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9004 | 153 | NN = input()
total = 0
for i in NN:
a = NN.count(i)
if a%2 ==0:
pass
else:
totaL +=1
if total ==0:
print('Yes')
else:
print('No')
|
s601312534 | p04012 | u684743124 | 1594246056 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9012 | 123 | s=input()
d={}
for i in s:
d.get(i,0)+=1
for i in set(s):
if d[i]%2==1:
print("No")
break
else:
print("Yes")
|
s237881373 | p04012 | u684743124 | 1594246018 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8988 | 119 | s=input()
d={}
for i in s:
d.get(i,0)+=1
for i in set(s):
if i%2==1:
print("No")
break
else:
print("Yes") |
s310180785 | p04012 | u634046173 | 1593900361 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8956 | 64 | print('Yes'if all(input().count(i)%2==0for i in set(s))else'No') |
s877773683 | p04012 | u697615293 | 1593285393 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9012 | 146 | a = list(input())
even_number = range(0,101,2)
values,count = *zip(a.most_common())
if even_number in count:
print("Yes")
else:
print("No")
|
s660245515 | p04012 | u088488125 | 1593279623 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9048 | 221 | w=input()
dict={}
alh="abcdefghijklmnopqrstuvwxyz"
for i in alh:
dict[i]=0
for i in w:
dict[i]+=1
flag=True
for j in range(len(dict)):
if dict[j]%2==1:
flag=False
if flag:
print("Yes")
else:
print("No")
|
s798482593 | p04012 | u088488125 | 1593279356 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9024 | 161 | w=input()
dict={}
for i in w:
dict[i]+=1
flag=True
for j in range(len(dict)):
if dict[j]%2==1:
flag=False
if flag:
print("Yes")
else:
print("No")
|
s889873453 | p04012 | u559346857 | 1592322232 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 73 | s=input()
print("Yes" if all([s.count(i)%2==0 for i in set(s)] else "No") |
s746200627 | p04012 | u559346857 | 1592322186 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 74 | s=input()
print("Yes" if all([s.count(i)%2==0] for i in set(s)] else "No") |
s836538654 | p04012 | u037156014 | 1591994376 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38256 | 534 | /**
* winners never quit
**/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long Long;
void FastIO(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
}
const int N = 1e4;
int main()
{
FastIO();
int tc, ca = 0;
string s;
cin >> s;
vector <int> v(26, 0);
for (int i = 0;i < s.size();i++){
v[s[i]-97]++;
}
string ans = "Yes";
for (int i = 0;i < 26;i++){
if (v[i]%2){
ans = "No";
break;
}
}
cout << ans << '\n';
return 0;
}
|
s599294775 | p04012 | u046158516 | 1591531305 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 555 | s=input()
t=input()
letters=[]
count=[]
for i in range(len(s)):
if s[i] in letters:
count[letters.index(s[i])].append(i)
else:
count.append([i])
letters.append(s[i])
failflag=0
for i in count:
r=t[i[0]]
for j in i:
if t[j]!=r:
failflag=1
letters=[]
count=[]
for i in range(len(s)):
if t[i] in letters:
count[letters.index(t[i])].append(i)
else:
count.append([i])
letters.append(t[i])
for i in count:
r=s[i[0]]
for j in i:
if s[j]!=r:
failflag=1
if failflag==0:
print('Yes')
else:
print('No') |
s106180764 | p04012 | u492749916 | 1591516848 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 199 | import sys
w = str(input())
arr = []
for i in range(0,len(w)):
arr.append(w[i])
arr = sorted(arr)
for i in range(0,len(w),2):
if arr[i] != arr[i+1]:
print("No")
sys.exit()
print("Yes") |
s116391792 | p04012 | u730769327 | 1591177523 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38256 | 168 | s=list(input())
flag="Yes"
while(len(s)>0):
d=s[0]
if s.count(d)%2==1:
flag="No"
break
else:
for i in range(s.count(d)):
s.remove(d)
print(frag) |
s835042965 | p04012 | u991567869 | 1590625741 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 173 | w = list(input())
ans = "Yes"
for i in w:
cnt = 0
for j in w:
if i == j:
cnt += 1
if cnt%2 == 1:
ans = "No"
break
print(ans |
s465519456 | p04012 | u601575292 | 1590456488 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 132 | w = input()
f = True
for s in w:
a = w.count(s)
if a%2 != 0:
f = Flase
break
if f:
print("Yes")
else:
print("No") |
s035538722 | p04012 | u203669169 | 1589996014 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 505 | #! /usr/bin/env python3
# from fractions import gcd
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
S = input()
c = Counter(S)
for i in c:
if c[i] % 2 != 0:
print("No")
exit()
print("Yes")
|
s027470960 | p04012 | u102223485 | 1589857294 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 184 | w = list(input())
w.sort()
i = 0
if len(w) % 2 == 1:
print('No')
exit()
while i < len(w)-1:
if w[i] != w[i+1]:
print('No')
exit()
i += 2
else:
print('Yes') |
s240302144 | p04012 | u102223485 | 1589856905 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 121 | w = list(input())
w.sort()
i = 0
while i < len(w):
if w[i] != w[i+1]:
print('No')
exit()
i += 2
else:
print('Yes') |
s099338300 | p04012 | u991134049 | 1589692219 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38256 | 138 | S = list(input())
A = []
for i in S:
if i in A:
remove(i)
else:
A.append(i)
if len(A) == 0:
print("Yes")
else:
print("No") |
s562590060 | p04012 | u178432859 | 1589158665 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 112 | l = list(input)
s = set(l)
for i in s:
if l.count(i)%2 != 0:
print("No")
exit()
print("Yes") |
s590732286 | p04012 | u711238850 | 1589082095 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 126 | from collections import Counter
s = input()
c = Counter(s)
for i in c:
if i%2!=0:
print("No")
exit()
print("Yes") |
s269389877 | p04012 | u339503988 | 1588865655 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3444 | 116 | from collections import Counter
w=input()
c=Counter(c).values()
s="Yes"
for i in c:
if i%2==1:
s="No"
print(s) |
s577031511 | p04012 | u792512290 | 1588740893 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 165 | w = input()
ans = {}
for i in w:
if i in ans:
ans[i] += 1
else:
ans[i] = 1
if all[i % 2 == 0 for i in ans.values()]:
print('Yes')
else:
print('No') |
s992922089 | p04012 | u792512290 | 1588740856 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 165 | w = input()
ans = {}
for i in w:
if i in ans:
ans[i] += 1
else:
ans[i] = 1
if all[i % 2 == 0 in i for ans.values()]:
print('Yes')
else:
print('No') |
s750479677 | p04012 | u840570107 | 1588650277 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 1 | q |
s043515355 | p04012 | u586206420 | 1588648390 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3444 | 286 | import copy
s = list(input())
def make1d(n):
return [copy.deepcopy(1) for i in range(0,n)]
t = make1d(26)
for i in range(0, len(s)):
t[ord(s[i]) - 97] = t[ord(s[i]) - 97] * (-1)
u = 0
for i in range(0, len(s)):
u = u + t[i]
if u == 26:
print('Yes')
else:
print('No') |
s889838751 | p04012 | u586206420 | 1588648226 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3444 | 285 | import copy
s = list(input())
def make1d(n):
return [copy.deepcopy(1) for i in range(0,n)]
t = make1d(26)
for i in range(0, len(s)):
t[ord(s[i]) - 97] = t[ord(s[i]) - 97] * (-1)
u = 1
for i in range(0, len(s)):
u = u * t[i]
if u == 1:
print('Yes')
else:
print('No') |
s240356398 | p04012 | u586206420 | 1588648179 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3444 | 294 | import copy
s = list(input())
def make1d(n):
return [copy.deepcopy(1) for i in range(0,n)]
t = make1d(26)
for i in range(0, len(s)):
t[ord(s[i]) - 97] = t[ord(s[i]) - 97] * (-1)
print(t)
u = 1
for i in range(0, len(s)):
u = u * t[i]
if u == 1:
print('Yes')
else:
print('No') |
s146474391 | p04012 | u586206420 | 1588647944 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3444 | 272 | import copy
s = list(input())
def make1d(n):
return [copy.deepcopy(1) for i in range(0,n)]
t = make1d(26)
for i in range(0, len(s)):
t[i] = t[ord(s[i]) - 97] * (-1)
u = 1
for i in range(0, len(s)):
u = u * t[i]
if u == 1:
print('Yes')
else:
print('No') |
s680170043 | p04012 | u437215432 | 1587669354 | Python | Python (3.4.3) | py | Runtime Error | 155 | 12504 | 147 | import numpy as np
w = input()
index, count = np.unique(list(w), return_counts=True)
if all(count % 2 == 0):
print('Yes')
else:
print('No') |
s215648507 | p04012 | u252964975 | 1587558811 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 281 | S=str(input())
s_list = "abcdefghijklmnopqrstuvwxyz"
n_list = []
for i in range(26):
n_list.append(0)
for i in range(len(S)):
n_list.index(S[i]) = n_list.index(S[i]) + 1
num = 1
for i in range(26):
num = num * (n_list[i]+1)
if num % 2 == 1:
print('Yes')
else:
print('No') |
s019144570 | p04012 | u512964959 | 1587540426 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 592 | # Most useful math functions
from math import gcd
# For sys.std*, sys.argv etc...
import sys
# For cases when input tokens are spread unevenly over many lines.
# This provides methods for reading tokens of various types.
class BufferedTokenizer:
pass
def read_ints():
return [int(token) for token in input().split()]
def read_tokens():
return input().split()
def main():
s = input()
counts = dict()
for c in s:
counts[c] = counts.get(c, 0) + 1
print("Yes" if all(v % 2 == 0 for v in counts.values()) else "No")
if __name__ == '__main__':
main()
|
s561526972 | p04012 | u512964959 | 1587540341 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 586 | # Useful data structures
from collections import Counter
# Most useful math functions
from math import gcd
# For sys.std*, sys.argv etc...
import sys
# For cases when input tokens are spread unevenly over many lines.
# This provides methods for reading tokens of various types.
class BufferedTokenizer:
pass
def read_ints():
return [int(token) for token in input().split()]
def read_tokens():
return input().split()
def main():
counts = Counter(input())
print("Yes" if all(v % 2 == 0 for v in counts.values()) else "No")
if __name__ == '__main__':
main()
|
s374797635 | p04012 | u512964959 | 1587540297 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 618 | # Useful data structures
from collections import Counter, defaultdict, deque, namedtuple
# Most useful math functions
from math import gcd
# For sys.std*, sys.argv etc...
import sys
# For cases when input tokens are spread unevenly over many lines.
# This provides methods for reading tokens of various types.
class BufferedTokenizer:
pass
def read_ints():
return [int(token) for token in input().split()]
def read_tokens():
return input().split()
def main():
counts = Counter(input())
print("Yes" if all(v % 2 == 0 for v in counts.values()) else "No")
if __name__ == '__main__':
main()
|
s269003149 | p04012 | u081784777 | 1587411217 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 200 | w = list(map(str,input()))
w.sort()
w = "".join(w)
flag = 0
w = [w[i*2:i*2+2] for i in range(-(-len(w)//2))]
for i in w:
if not i[0] == i[1]:
flag = 1
print("Yes") if not flag else print("No") |
s449621859 | p04012 | u081784777 | 1587410850 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 201 | w = list(map(str,input()))
w.sort()
w = "".join(w)
flag = 0
w = [w[i*2:i*2+2] for i in range(-(-len(w)//2))]
for i in w:
if not w[0] == w[1]:
flag = 1
print("Yes") if not flag else print("No")
|
s651138229 | p04012 | u306516971 | 1587159085 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 207 | 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") |
s858683721 | p04012 | u201802797 | 1587040147 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 112 | # solution
data = input()
for i in data:
if data.count(i) % 2:
print('No')
exit()
print('Yes') |
s348102036 | p04012 | u440161695 | 1586869142 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 144 | from collections import Counter
s=input()
d=Conter(s)
da=[i for i in d if d[i]%2==0]
if len(da)==len(set(s)):
print("Yes")
else:
print("No") |
s566989619 | p04012 | u731448038 | 1586559530 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3316 | 137 | import collections
s = input()
c = collections.Counter(s)
for i in c:
if c[i]%2!=0:
print('No')
sys.exit()
print('Yes') |
s483542052 | p04012 | u485319545 | 1586222017 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 196 | import collections
w=input()
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:
pritn('No')
|
s944948239 | p04012 | u536836760 | 1586185682 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 128 | words = input()
ans = 'No'
for word in words:
if words.count(word) %2 != 0:
breake
else:
ans ='Yes'
print(ans) |
s476429801 | p04012 | u536836760 | 1586185572 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 135 | words = input()
ans = 'No’
for word in words:
if words.count(word) %2 != 0:
breake
else:
ans = ('Yes’)
print(ans) |
s213344014 | p04012 | u536836760 | 1586185474 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 135 | words = input()
ans = 'No’
for word in words:
if words.count(word) %2 != 0:
breake
else:
ans = ('Ye’s)
print(ans) |
s987436427 | p04012 | u536836760 | 1586185411 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 131 | words = input()
ans = 'NO'
for word in words:
if words.count(word) %2 != 0:
breake
else:
ans = ('YES')
print(ans) |
s876331685 | p04012 | u080986047 | 1586015383 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 202 | li = list(input())
li.sort()
while True:
if len(li) == 0:
print("Yes")
break
elif li[0] == li[1]:
li.pop(0)
li.pop(0)
else:
print("No")
break
|
s765998482 | p04012 | u535659144 | 1586014251 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 198 | li=list(input())
li.sort()
while True:
if len(li)==0:
print("Yes")
break
elif li[0]==li[1]:
li.pop(0)
li.pop(0)
else:
print("No")
break |
s601583658 | p04012 | u086172144 | 1585972139 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 96 | w=sorted(list(input()));s="Yes"
for i in range(0,len(w),2):
if w[i]!=w[i+1]:s="No"
print(s) |
s481487615 | p04012 | u852790844 | 1585586246 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 136 | vimport sys
w = input()
checker = set(w)
for i in checker:
if w.count(i)%2 == 1:
print("No")
sys.exit()
print("Yes") |
s772812499 | p04012 | u395816772 | 1585529908 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 258 | w = input()
alp = 'abcdefghijklmnopqrstuvwxyz'
c = []
for i in range(26):
a = w.count(alp[i])
c.append(a)
d = 0
for i in range(len(w)):
if int(c[i]) % 2 == 0:
d = 1
else:
break
if d == 0:
print('No')
else:
print('Yes') |
s205710123 | p04012 | u969848070 | 1585001638 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 135 | a = input()
al = 'abcdefghijklmnopqrstuvwxyz'
for a in range(26):
if a.count(al[i]) % 2 != 0:
print('No')
exit()
print('Yes') |
s913410247 | p04012 | u078349616 | 1584758498 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 118 | S = input()
st = set(S)
for i in range(len(st)):
if S.count(st[i]) % 2 != 0:
print("No")
exit()
print("Yes") |
s353378798 | p04012 | u000123984 | 1583788246 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 226 | li = [0]*26
alpha2num = lambda c: ord(c) - ord("A")
w = input().upper()
for i in range(len(w)):
k = alpha2num(w[i])
li[k] += 1
else:
for j in li:
if(not j %= 2):
print("No")
break
else:
print("Yes") |
s359746794 | p04012 | u000123984 | 1583788188 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 230 | li = [0]*26
alpha2num = lambda c: ord(c) - ord("A") + 1
w = input().upper()
for i in range(len(w)):
k = alpha2num(w[i])
li[k] += 1
else:
for j in li:
if(not j %= 2):
print("No")
break
else:
print("Yes") |
s874523371 | p04012 | u000123984 | 1583788015 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 210 | li = [0]*26
alpha2num = lambda c: chr(c+64)
w = input()
for i in range(len(w)):
k = alpha2num(w[i])
li[k] += 1
else:
for j in li:
if(not j %= 2):
print("No")
break
else:
print("Yes") |
s167296577 | p04012 | u000123984 | 1583787957 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 209 | li = []*26
alpha2num = lambda c: chr(c+26)
w = input()
for i in range(len(w)):
k = alpha2num(w[i])
li[k] += 1
else:
for j in li:
if(not j %= 2):
print("No")
break
else:
print("Yes") |
s044753967 | p04012 | u096616343 | 1583360814 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 244 | w = input()
a = "abcdefghijklmnopqrstuvwxyz"
co = 0
ch = True
for i in a:
for j in w:
if i == j:
co += 1:
if co % 2:
ch = False
break
co = 0
if ch:
print("yes")
else:
print("No") |
s962452641 | p04012 | u096616343 | 1583360738 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 243 | w = input()
a = "abcdefghijklmnopqrstuvwxyz"
co = 0
ch = True
for i in a:
for j in w:
if i = j:
co += 1:
if co % 2:
ch = False
break
co = 0
if ch:
print("yes")
else:
print("No") |
s440786595 | p04012 | u096616343 | 1583360665 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 243 | w = input()
a = "abcdefghijklmnopqrstuvwxyz"
co = 0
ch = True
for i in a:
for j in w:
if i = j:
co += 1:
if co % 2:
ch = False
break
co = 0
if ch:
print("yes")
else:
print("No") |
s082714729 | p04012 | u096616343 | 1583360567 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 220 | w = input()
a = abcdefghijklmnopqrstuvwxyz
co = 0
ch = True
for i in a:
for j in w:
if i = j:
co += 1:
if co % 2:
ch = False
break
if ch:
print("yes")
else:
print("No") |
s193426742 | p04012 | u413165887 | 1582634595 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 155 | from collections import Counter
w = list(Counter(list(input())).items())
if all(w[i][1]%2== for i in range(len(w))):
print("Yes")
else:
print("No") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.