problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02791 | s496127983 | Accepted | def main():
N = int(input())
P = [int(p) for p in input().split()]
mi = N + 1
cnt = 0
for i in range(N):
if P[i] < mi:
mi = P[i]
cnt += 1
print(cnt)
if __name__ == "__main__":
main() |
p02744 | s303545778 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
alpha = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k']
ans = []
def dfs(idx, cnt, lis):
if idx==N:
ans.append(''.join(lis))
return
for i in range(cnt):
dfs(idx+1, cnt, lis+[alpha[i]])
dfs(idx+1, cnt+1, lis+[alpha[cnt]])
return
dfs(0, 0, [])
ans.sort()
for a in ans:
print(a) |
p03623 | s189852244 | Accepted | x,a,b=map(int,input().split())
xa=abs(x-a)
xb=abs(x-b)
print('A' if xa<xb else 'B')
|
p02627 | s227255952 | Wrong Answer | if input().islower() == "True":
print("a")
else:
print("A") |
p03379 | s270919346 | Accepted | N=int(input())
X=list(map(int,input().split()))
Median_1_i=N//2-1
Median_2_i=N//2
X_=X[:]
X_.sort(reverse=True)
Median_1=X_[Median_1_i]
Median_2=X_[Median_2_i]
for x in X:
if x<Median_1:
print(Median_1)
else:
print(Median_2) |
p02690 | s198554635 | Accepted | #!/usr/bin/env python3
import sys
x = int(input())
for i in range(-10 ** 3, 10 ** 3):
for j in range(-10 **3, 10 ** 3):
if (i ** 5) - (j ** 5) == x:
print(i, j)
sys.exit()
|
p02866 | s558884411 | Accepted | #B
import sys
from collections import Counter
n=int(input())
d=list(map(int,input().split()))
e=Counter(d)
mod=998244353
if d[0]!=0 or e[0]!=1:
print(0)
sys.exit()
ans=1
for i in range(2,n):
ans*=pow(e[i-1],e[i],mod)
ans%=mod
print(ans%mod) |
p03352 | s357415938 | Wrong Answer | pow = [1]
for p in range(2,32):
i=1
while p**i<=1000:
pow.append(p**i)
i += 1
print(pow)
X = int(input())
x = X
while x>0:
if x in pow:
ans = x
break
x -= 1
print(ans) |
p02570 | s263772068 | Accepted | d,t,s=[int(x) for x in input().split()]
if d/s<=t:
print("Yes")
else:
print("No") |
p02802 | s213777557 | Accepted | n,m = map(int,input().split())
a = [0]*n
b = [0]*n
for i in range(m):
p,s = map(str,input().split())
p = int(p)
if s=='AC' and a[p-1]==0:
a[p-1]+=1
elif s=='WA' and a[p-1]==0:
b[p-1] +=1
for j in range(n):
if a[j]==0:
b[j]=0
print(sum(a),sum(b)) |
p03944 | s218885552 | Wrong Answer | W,H,N = map(int,input().split())
Ox,Oy = 0,0
Oxx,Oyy = 0,0
for i in range(N):
x,y,a = map(int,input().split())
if a ==1:
Oxx = Ox + x
elif a == 2:
W = W - (W - x)
elif a == 3:
Oyy = Oy + y
else:
H = H - (H - y)
print((W-Oxx)*(H-Oyy) if (W-Oxx)*(H-Oyy) > 0 else "0") |
p02601 | s026842253 | Accepted | a, b, c = map(int, input().split())
k = int(input())
cnt = 0
while a >= b:
cnt += 1
b *= 2
while b >= c:
cnt += 1
c *= 2
if cnt <= k: print("Yes")
else: print("No") |
p03075 | s439406057 | Wrong Answer | a = [int(input()) for _ in range(5)]
k = int(input())
flag = True
for i in range(4):
if k < a[i+1] - a[i]:
flag = False
break
print('Yay!' if flag else ':(') |
p02747 | s549913947 | Wrong Answer | S=input().strip()
for i,word in enumerate(S):
if (i%2==0 and word=="h") or (i%2==1 and word=="i"):
continue
else:
print("No")
break
else:
print("Yes")
|
p02911 | s899117712 | Accepted | N,K,Q=map(int,input().split())
l=[K-Q]*N
for n in range(Q):
A=int(input())
l[A-1]+=1
for n in range(N):
if l[n]<=0:
print('No')
else:
print('Yes')
|
p02823 | s748706275 | Accepted | N,A,B = map(int,input().split())
if abs(A-B)%2 == 1:
print(min(A-1,N-B)+1+(B-A-1)//2)
else:
print(abs(A-B)//2) |
p04029 | s831508915 | Accepted | N = int(input())
ans = 0
for i in range(N):
ans += i+1
print(ans) |
p03041 | s291327253 | Wrong Answer | n,k=list(map(int,input().split()))
S=list(input())
S[0]=chr(ord(S[k-1])+32)
print(''.join(S)) |
p02765 | s026577785 | Accepted | # import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
N,R = map(int,input().split())
if N >= 10:
res = R
else:
res = R + 100 * (10 - N)
print(res)
main()
|
p02681 | s191219591 | Wrong Answer |
import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def acinput():
return list(map(int, input().split(" ")))
S=input()
T=input()
if S in T:
print("Yes")
else:
print("No")
|
p02780 | s216841104 | Wrong Answer | n, k = map(int, input().split())
p_list = list(map(lambda x: (float(x) + 1) / 2, input().split()))
S_i = [0]
for i in range(n):
S_i.append(S_i[i] + p_list[i])
print(S_i)
result_max = 0
for j in range(3, n+1):
cad_max = S_i[j] - S_i[j-k]
result_max = max(cad_max, result_max)
print(result_max) |
p03289 | s270709574 | Accepted | import sys
S = input()
SL = list(S)
N = len(S)
if S[0] != "A":
print("WA")
sys.exit()
if S[2:-1].count("C") != 1:
print("WA")
sys.exit()
SL[0] = "a"
for i in range(2,N-1):
if SL[i] == "C":
SL[i] = "c"
break
S2 = "".join(SL)
if not S2.islower():
print("WA")
sys.exit()
print("AC")
|
p03210 | s215762486 | Accepted | a=int(input())
if a==7 or a==5 or a==3:
print("YES")
else:
print("NO") |
p04044 | s433644184 | Accepted | N, L = input().split()
inputs = [input() for i in range(int(N))]
inputs.sort()
result = "".join(inputs)
print(result) |
p02753 | s534726890 | Accepted | char_data = list(input())
if(char_data[0] == char_data[1] == char_data[2]):
print("No")
else:
print("Yes") |
p02972 | s046204220 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
b = [0]*N
bina = 0
M = 0
for i in reversed(range(1,N+1)):
next_num = i+i
while(next_num <= N):
bina ^= b[next_num-1]
next_num += i
b[i-1] = bina*a[i-1]
bina = 0
M = sum(b)
print(M)
for i in range(N):
if(b[i] == 1):
print(i+1) |
p04012 | s653492525 | Accepted | 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')
|
p03061 | s352198392 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
left = [A[0]] * N
right = [A[-1]] * N
import math
for i in range(1, N):
left[i] = math.gcd(left[i - 1], A[i])
for i in range(N - 2,-1,-1):
right[i] = math.gcd(right[i + 1], A[i])
ans = max(right[N - 2],left[1])
for i in range(1,N - 1):
g = math.gcd(left[i - 1],right[i + 1])
if ans < g:
ans = g
print(ans) |
p03012 | s739464315 | Accepted | input();l=list(map(int,input().split()));s=sum(l);a,t=s,0
for i in l:t+=i;a=min(a,abs(s-t*2))
print(a) |
p03377 | s077976332 | Wrong Answer | a,b,c=map(int,input().split())
if c-a<=b:
print('YES')
else:
print('No') |
p02771 | s173083503 | Wrong Answer | a, b, c = map(int, input().split())
if a==b or a==c or b==c:
print("No")
else:
print("Yes") |
p02994 | s774798333 | Wrong Answer | n,l=map(int,input().split())
ans=0
for i in range(1,n+1):
ans+=l+i-1
if l<0 and 0<l+n-1:
print(ans)
elif l+n-1<0:
print(ans-l-n+1)
elif 0<l:
print(ans-l) |
p03719 | s045641998 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b, c = map(int, readline().split())
ans = 'Yes' if a <= c <= b else 'No'
print(ans) |
p03062 | s606813921 | Accepted | def main():
n=int(input())
a=sorted(map(int,input().split()))
aa=sorted(abs(i) for i in a)
if sum(i<0 for i in a)%2==0:
print(sum(aa))
else:
print(-aa[0]+sum(aa[1:]))
if __name__ == "__main__":
main() |
p03623 | s896260203 | Accepted | x, a, b = map(int, input().split())
print("A" if abs(x - a) < abs(x - b) else "B")
|
p02554 | s795968609 | Wrong Answer | n = int(input())
mod=10**9+7
ans = pow(10,n,mod)
ans =- pow(9,n,mod)*2
ans =+ pow(8,n,mod)
print(ans%mod)
|
p04045 | s591501199 | Accepted | N,K=map(int,input().split())
D=list(map(int,input().split()))
dp=[0]*10
for i in range(K):
dp[D[i]]=1
for i in range(N,10**6+1):
a=str(i)
flag=True
for j in range(len(a)):
if dp[int(a[j])]==1:
flag=False
break
if flag:
print(i)
exit() |
p03623 | s594988062 | Accepted | x,a,b = map(int,input().split())
if abs(x - a) < abs(x - b):
print("A")
else:
print("B")
|
p03285 | s150298918 | Accepted | n = int(input())
cnt = 0
for i in range(100):
for j in range(100):
if 4*i + 7*j == n:
print('Yes')
exit()
print('No') |
p02843 | s572656452 | Accepted | X = int(input())
N = X//100
if X <= N*105:
print(1)
else:
print(0) |
p02922 | s322227638 | Wrong Answer | a,b=map(int,input().split())
if b>=a:
if (b-a)%(a-1)==0:
print((b-a)//(a-1)+1)
else:
print((b-a)//(a-1)+1+1)
else:
print(1) |
p03017 | s775002383 | Wrong Answer | def main():
N, A, B, C, D = (int(i) for i in input().split())
S = input()
if "##" in S[A:C] or "##" in S[B:D]:
return print("No")
if D < C and "..." not in S[B-2:D]:
return print("No")
print("Yes")
if __name__ == '__main__':
main()
|
p03779 | s075702364 | Accepted | x=int(input())
a=0
ans=0
i=1
while a<x:
a+=i
ans+=1
i+=1
print(ans)
|
p03838 | s369778809 | Wrong Answer | def main():
x,y = map(int,input().split())
ans = abs(abs(x) - abs(y))
if x == y:
ans = 0
elif abs(x) < abs(y):
if x*y < 0:
ans += 1
if x < 0 and y < 0:
ans += 2
else:
if x*y < 0:
ans += 1
if x > 0 and y > 0:
ans += 2
print(ans)
if __name__ == '__main__':
main() |
p03998 | s099242378 | Accepted | S = {i: list(input()) for i in "abc"}
n = "a"
while S[n]:
n = S[n].pop(0)
print(n.upper()) |
p03086 | s584772920 | Accepted | s=input()
tar="ACGT"
res=0
ans=0
for ch in s:
if ch in tar: ans+=1
else:
if ans>res: res=ans
ans=0
if ans>res: res=ans
print(res) |
p03456 | s767780770 | Accepted | a = int(''.join(list(input().split())))
print('Yes' if int(a**.5) == (a**.5) else 'No') |
p02959 | s142203696 | Accepted | n=int(input())
m=list(map(int,input().split()))
c=list(map(int,input().split()))
ans=0
for i in range(n):
if m[i]>c[i]:
ans+=c[i]
elif m[i]<=c[i]<m[i]+m[i+1]:
ans+=c[i]
m[i+1]=m[i]+m[i+1]-c[i]
else:
ans+=(m[i]+m[i+1])
m[i+1]=0
print(ans) |
p02881 | s848451098 | Wrong Answer | import math
N = int(input())
mini = float('inf')
for i in range(1, int(math.sqrt(N))):
if N%i == 0 and (N//i) + i - 2 < mini:
mini = (N//i) + i - 2
print(mini)
|
p03592 | s750980707 | Wrong Answer | N, M, K = map(int, input().split())
success = False
for x in range(M):
for y in range(N):
temp = (M - x) * y + (N - y) * x
if temp == K:
success = True
if success:
print('Yes')
else:
print('No') |
p03556 | s090973181 | Wrong Answer | n = int(input())
sq = 0
for i in range(n):
sq = i**2
if sq > n:
print((i - 1)**2)
break
else:
pass
|
p02760 | s984956056 | Accepted | l=[list(map(int,input().split())) for i in range(3)]
l=sum(l,[])
n=int(input())
li=set([int(input()) for ini in range(n)])
d=[0 for i in range(9)]
for g in range(9):
if l[g] in li:d[g]=1
for a,s,x in [(0,1,2),(3,4,5),(6,7,8),(0,4,8),(2,4,6),(0,3,6),(1,4,7),(2,5,8)]:
if d[a]==d[x]==d[s]==1:
print("Yes");exit()
print("No")
|
p02661 | s590889703 | Wrong Answer | N = int(input())
AB = [list(map(int, input().split())) for _ in range(N)]
A, B = zip(*AB)
def median(a):
n = N
return a[(n+1)//2-1] if n%2 else (a[n//2-1]+a[n//2])/2
A_mid = median(A)
B_mid = median(B)
r = int((B_mid-A_mid) * [2, 1][N%2]) + 1
print(r) |
p02773 | s883609227 | Wrong Answer | N = int(input())
S = []
for n in range(N):
S.append(input())
dic = {}
for n in range(N):
if S[n] not in dic:
dic[S[n]] = 1
else:
dic[S[n]] += 1
max = max(dic.values())
for key,val in dic.items():
if val == max:
print(key) |
p02596 | s621818311 | Accepted | k=int(input())
d=7%k
c=-1
for i in range(10**6+10):
if d==0:
c=i+1
break
d=(d*10+7)%k
print(c) |
p03434 | s661695518 | Accepted | N = int(input())
As = list(map(int, input().split()))
As.sort(reverse=True)
Alice = sum(As[::2])
Bob = sum(As[1::2])
print(Alice-Bob) |
p03469 | s252162900 | Accepted | S = input()
print('2018/01/'+S[-2:]) |
p03435 | s014209237 | Wrong Answer | c=0
for i in range(3):
c+=sum(list(map(int, input().split())))
if c%3==0:
print('Yes')
else:
print('No') |
p03282 | s652028182 | Accepted | S=input()
k=int(input())
for i in range(min(len(S),k)):
if S[i] != '1':
print(S[i])
break
else:
print(1) |
p04020 | s776736290 | Accepted | n,*a = map(int,open(0).read().split())
ans = a[0]//2
a[0] %= 2
for i in range(n-1):
if a[i] == 1 and a[i+1] != 0:
ans += 1
a[i+1] -= 1
if a[i+1] >1:
ans += a[i+1]//2
a[i+1] %= 2
print(ans) |
p02552 | s393429028 | Accepted | x=input()
if x=='0':
print('1')
if x=='1':
print('0') |
p03071 | s628525629 | Wrong Answer | A,B = map(int,input().split())
if A > B :
print( 2*A - 1 )
else :
print( 2*B - 1 )
|
p03331 | s167693946 | Accepted | N = int(input())
print(min([sum([ord(c) - 48 for c in str(A)]) + sum([ord(c) - 48 for c in str(N - A)]) for A in range(1, N)])) |
p03745 | s984766663 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = 0
f = 0
for i in range(1, n):
if a[i-1] < a[i]:
ff = 1
elif a[i-1] > a[i]:
ff = -1
else:
ff = 0
if f and ff and f != ff:
cnt += 1
f = 0
elif not f:
f = ff
print(cnt + 1) |
p03796 | s629705512 | Wrong Answer | N = int(input())
mod = int(10e9+7)
p = 1
for i in range(N):
p *= i + 1
p %= mod
print(p) |
p02768 | s032447725 | Wrong Answer | from math import factorial
n, a, b = map(int, input().split())
mod = 10 ** 9 + 7
ans = 0
for i in range(2, n + 1):
if i not in [a, b]:
ans += factorial(n) / factorial(i) / factorial(n - i)
print(int(ans % mod))
|
p02993 | s744471639 | Accepted | s=input();print("GBoaodd"[s[0]==s[1]or s[1]==s[2]or s[2]==s[3]::2]) |
p02594 | s855250265 | Wrong Answer | X = int()
if 40 >= X >= 30:
print("Yes")
else:
print("No") |
p03998 | s151341155 | Accepted | Sa = list(input())
Sb = list(input())
Sc = list(input())
s = Sa.pop(0)
while True:
if s == 'a':
if Sa ==[]:
print('A')
break
s = Sa.pop(0)
elif s == 'b':
if Sb ==[]:
print('B')
break
s = Sb.pop(0)
else:
if Sc ==[]:
print('C')
break
s = Sc.pop(0)
|
p02691 | s215781396 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
i = 0
key =0
while i <N:
j=0
if a[i] > N- i:
pass
else:
while j<N:
if abs(i-j) < a[i] or j < i:
j = i+a[i] +1
elif a[i] + a[j] == abs(i-j):
key +=1
j+=1
i += 1
print(key)
|
p03137 | s944751325 | Accepted | n, m = map(int, input().split())
x = list(map(int, input().split()))
x=sorted(x)
y=[]
for i in range(m-1):
y.append(x[i+1]-x[i])
y=sorted(y,reverse=True)
if m <= n:
print(0)
else:
print(sum(y[n-1:])) |
p03548 | s877685574 | Accepted | x, y, z = list(map(int, input().split()))
print((x - z) // (y + z)) |
p02756 | s032116372 | Wrong Answer | from sys import stdin
S = stdin.readline()[:-1]
Q = int(stdin.readline())
for _ in range(Q):
command = stdin.readline()[::-1]
if command[0] == '2':
a, b, char = command.split()
if b == '1': S = char + S
else: S = S + char
else: S = S[::-1]
print(S) |
p02553 | s468805966 | Accepted | a,b,c,d = map(int, input().split())
print(max(a*c,b*d,b*c,a*d)) |
p02572 | s144453463 | Wrong Answer | import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())), dtype=np.int64)
mod = 10**9 + 7
sq_sum = (A*A).sum()
sum_sq = A.sum() * A.sum()
answer = (sum_sq - sq_sum) / 2
print(int(answer % mod)) |
p03071 | s118637629 | Wrong Answer | s = list(input())
count = 0
for i in range(1, len(s)):
if s[i] == s[i-1]:
count += 1
if s[i] == '1':
s[i] = '0'
else:
s[i] = '1'
print(count) |
p03254 | s932408043 | Accepted | N, x = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
for i, a in enumerate(A):
x -= a
if x == 0:
print(i+1)
exit()
elif x < 0:
print(i)
exit()
print(N-1) |
p02676 | s656229591 | Accepted | n = int(input())
s = input()
if len(s) <= n:
print(s)
else:
print(s[:n] + '...')
|
p03427 | s555432818 | Wrong Answer | import sys
input = sys.stdin.readline
n = int(input())
n = str(n)
ans = (len(n) - 1) * 9
for i in range(1, len(n)):
if int(n[i]) != 9:
ans += int(n[i - 1]) - 1
break
print(ans)
|
p02663 | s387763553 | Accepted | o1, o2, n1, n2, k = map(int, input().split())
o_all = o1*60 + o2
n_all = n1*60 + n2
print(n_all-o_all-k) |
p02613 | s869453554 | Accepted | def main():
n = int(input())
c = [0,0,0,0]
for i in range(n):
s = input()
if s == 'AC':
c[0] += 1
elif s == 'WA':
c[1] += 1
elif s == 'TLE':
c[2] += 1
else:
c[3] += 1
print(f'AC x {c[0]}')
print(f'WA x {c[1]}')
print(f'TLE x {c[2]}')
print(f'RE x {c[3]}')
main() |
p02688 | s967084781 | Accepted | N, K = map(int, input().split())
d = []
A = []
for _ in range(K):
d.append(int(input()))
A.append(list(map(int, input().split())))
cnt = {}
for i in range(N):
cnt.setdefault(str(i + 1), 0)
for Ai in A:
for Aij in Ai:
cnt[str(Aij)] += 1
ans = 0
for key, val in cnt.items():
if val == 0: ans += 1
print(ans) |
p02572 | s624294127 | Accepted |
n = int(input())
a = list(map(int, input().split()))
MOD = 10 ** 9 + 7
sum = sum(a) % MOD
ans = 0
for i in range(len(a)):
sum -= a[i]
sum %= MOD
ans += a[i] * sum
ans %= MOD
print(ans)
|
p03680 | s451250096 | Wrong Answer | n=int(input())
x = [int(input()) for i in range(n)]
ans=1
visited=[False]*n
now=0
while(1):
visited[now]=True # 今のところをいったことにする
next=x[now]-1 # 次の行き先
if visited[next]:
print(-1)
break
if x[next]==2: # 次が2やったら終わる
print(ans+1)
break
else:
now=next
ans+=1
|
p02675 | s247450148 | Accepted | n=int(input())
a=[2,4,5,7,9]
x=n%10
if x in a:
print("hon")
elif x==3:
print("bon")
else:
print("pon")
|
p03543 | s176959105 | Accepted | n = input()
if n[0]==n[1]==n[2] or n[1]==n[2]==n[3]:
print("Yes")
else:
print("No")
|
p02866 | s938327279 | Wrong Answer | import sys
from collections import Counter
n = int(input())
arr = list(map(int, input().split()))
c = list(Counter(arr).items())
c.sort()
if c[0][0] != 0 or c[0][1] != 1:
print(0)
sys.exit()
prev_k = 0
prev_v = 1
ans = 1
for k, v in c[1:]:
if k - prev_k > 1 or prev_v * 2 < v:
print(0)
sys.exit()
else:
ans *= prev_v**v
prev_k = k
prev_v = v
print(ans % 998244353) |
p02621 | s746011879 | Accepted | a = int(input())
print(int(a+a**2+a**3)) |
p03971 | s080454469 | Accepted | N, A, B = map(int, input().split())
S = input()
a, b = 0, 0
for i in range(N):
if S[i] == 'a':
if a + b < A + B:
print('Yes')
a += 1
else:
print('No')
elif S[i] == 'b':
if a + b < A + B and b + 1 <= B:
print('Yes')
b += 1
else:
print('No')
else:
print('No')
|
p03042 | s237166446 | Accepted | x = int(input())
a = x // 100
b = x % 100
a_is_month = 0 < a & a <= 12
b_is_month = 0 < b & b <= 12
if a_is_month:
if b_is_month:
print("AMBIGUOUS")
else:
print("MMYY")
else:
if b_is_month:
print("YYMM")
else:
print("NA")
|
p02646 | s686770228 | Accepted | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
p = abs(a-b)
if p > (v-w)*t:
print("NO")
else:
print("YES") |
p03730 | s173919677 | Accepted | a, b, c = map(int, input().split())
answer = False
for i in range(b+1):
if (i*a)%b == c:
answer=True
break
if answer:
print("YES")
else:
print("NO") |
p02724 | s209266767 | Accepted | i = int(input())
ans = 0
ans+=(i//500)*1000
ans+=((i%500)//5)*5
print(ans) |
p03607 | s576935139 | Accepted | N = int(input())
d = {}
a = []
for _ in range(N):
A = int(input())
a.append(A)
if not(A in d):
d[A] = 1
continue
elif d[A]==1:
d[A] = 0
else:
d[A] = 1
ans = 0
for key in d:
if d[key]==1:
ans = ans + 1
print(ans)
|
p03434 | s181515741 | Accepted | input()
cards = sorted([int(x) for x in input().split()], reverse = True)
alice_point = sum([x for i, x in enumerate(cards) if i % 2 == 0])
bob_point = sum([x for i, x in enumerate(cards) if i % 2 != 0])
print(alice_point - bob_point)
|
p03250 | s850296594 | Wrong Answer | A, B, C = map(int, input().split())
t = sorted([A, B, C])
print(t[0] * 10 + t[1] + t[2]) |
p03387 | s353130250 | Accepted | n = list(map(int, input().split()))
cnt = 0
while True:
n.sort()
a, b, c = n[0], n[1], n[2]
if a == b == c:
break
if a + 2 <= c:
a += 2
else:
a += 1
b += 1
cnt += 1
n[0], n[1], n[2] = a, b, c
print(cnt)
|
p04005 | s943463233 | Accepted | a, b, c = map(int, input().split())
print(min(a * b, b * c, c * a) if a % 2 != 0 and b % 2 != 0 and c % 2 != 0 else 0) |
p03730 | s814330994 | Wrong Answer | A, B, C = map(int, input().split())
count=0
for i in range(1, 1000):
if B*i%A==0:
count=1
else:
count=0
print("No" if count==0 else "Yes") |
p03210 | s557781555 | Accepted | x = int(input())
if x in [3,5,7]:
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.