problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02713 | s431560123 | Accepted | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
n=int(input())
ans = 0
for i in range(n):
for j in range(i,n):
for k in range(j,n):
if i==j==k:
ans+=gcd(i+1,j+1,k+1)
elif i<j<k:
ans+=6*(gcd(i+1,j+1,k+1))
else:
ans+=3*(gcd(i+1,j+1,k+1))
print(ans) |
p02783 | s874107020 | Wrong Answer | def get(text,n):
ans = [""]*n
i = 0
for x in text:
if x==" ":
i = i + 1
ans[i] = ans[i]+x
return ans
text = input()
H = int(get(text,2)[0])
A = int(get(text,2)[1])
print(H//A+1)
|
p02831 | s659341146 | Wrong Answer | a,b=map(int,input().split())
print(a*b) |
p03041 | s212643563 | Accepted | N,K = map(int,input().split())
S = list(input())
S[K-1] = S[K-1].lower()
print(''.join(S)) |
p02700 | s193687569 | Accepted | a, b, c, d = map(int, input().split())
while a > 0 and c > 0:
c -= b
if c <= 0:
print("Yes")
break
a -= d
if a <= 0:
print("No")
break |
p02972 | s065671987 | Accepted | N = int(input())
a = list(map(int, input().split()))
a = [0] + a
b = [0 for n in range(N + 1)]
for n in range(N):
m = N - n
q = N // m
r = 0
for q0 in range(2, q + 1):
r += b[m * q0] % 2
b[m] = (a[m] - r) % 2
print(sum(b))
ans = []
for n in range(N):
m = N - n
if b[m] == 1:
ans.append(m)
print(*ans)
|
p02708 | s534599708 | Wrong Answer | n, k = map(int, input().split())
ans = 0
for i in range(k, n+2):
ans += (i*(n - i + 1) + 1) %(10**9+7)
print(ans) |
p03163 | s569069656 | Accepted | N, W = map(int, input().split())
w = [0] * N
v = [0] * N
for i in range(N):
w[i], v[i] = map(int, input().split())
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(W + 1):
if j - w[i] >= 0:
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - w[i]] + v[i])
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
print(dp[N][W]) |
p02640 | s449370035 | Accepted | x,y = map(int, input().split())
flag = 0
for i in range(x+1):
if (2 * i + 4 * (x - i)) == y:
print("Yes")
flag = 1
if flag == 0:
print("No")
|
p03041 | s554483521 | Wrong Answer | n,k=map(int,input().split())
s=list(input())
s[k-1]=chr(ord(s[k-1])+26)
print(''.join(s)) |
p03387 | s253630178 | Accepted | l = list(map(int, input().split()))
l.sort()
t = l[2]-l[0] + l[2]-l[1]
if t%2 == 0:
print(t//2)
else:
print((t+3)//2) |
p02660 | s205785620 | Wrong Answer | n = int(input())
if n>1:
powers = {n}
else:
powers = set()
for i in range(2,int(n**0.5)):
for j in range(1,41):
if i**j>n**0.5:
break
else:
powers.add(i**j)
power = list(powers)
power.sort()
counter = 0
for s in power:
if n%s==0:
n = n/s
counter += 1
if n<s:
break
print(counter) |
p03721 | s554022084 | Accepted | N, K = map(int, input().split())
L = []
for i in range(10**5+1):
L.append(0)
for n in range(N):
a, b = map(int, input().split())
L[a] += b
a = 0
while K > 0:
a += 1
K -= L[a]
print(a) |
p03475 | s017811863 | Accepted | import math
ceil = math.ceil
def main():
N = int(input())
ans = [0]*N
for i in range(N-1):
C, S, F = map(int, input().split())
ans[i] = S + C
for j in range(i):
nxt = ceil((ans[j]-S)/F)
ans[j] = max(0, nxt)*F + S + C
for a in ans:
print(a)
if __name__ == "__main__":
main()
|
p02823 | s935030563 | Accepted | N,A,B = map(int,input().split())
if (B-A)%2 == 0:
print((B-A)//2)
else:
print((B-A)//2 + min(A,N-B+1)) |
p02724 | s534880476 | Accepted | X = int(input())
gohyaku = X//500
goen = (X - gohyaku*500)//5
ans = gohyaku * 1000 + goen * 5
print(ans) |
p02861 | s457728251 | Accepted | import itertools
import math
N = int(input())
x_y = {i : list(map(int, input().split())) for i in range(N)}
P = list(itertools.permutations(range(N)))
tmp = 0
for p in P:
for n in range(N-1):
#print(tmp)
tmp += math.sqrt((x_y[p[n]][0] - x_y[p[n+1]][0])**2 + (x_y[p[n]][1] - x_y[p[n+1]][1])**2)
print(tmp/len(P))
|
p02866 | s084914512 | Wrong Answer | from itertools import groupby
inputs = open(0).readlines()
n = int(inputs[0])
*D, = map(int, inputs[1].split())
D.sort()
mod = 998244353
keys, nodes = [], []
for k, g in groupby(D):
keys.append(k)
nodes.append(len(list(g)))
if nodes[0] == 1 and all(i == k for i, k in enumerate(keys)):
ans = 1
for n0, n1 in zip(nodes, nodes[1:]):
ans = ans * pow(n0, n1, mod) % mod
print(ans)
else:
print(0) |
p02642 | s988832455 | Accepted | def main():
n=int(input())
a=sorted(map(int,input().split()))
maxa=a[-1]+1
tf=[False]*maxa
r=0
n-=1
for i in range(n):
a_i=a[i]
if tf[a_i] ==False:
for j in range(a_i,maxa,a_i):
tf[j]=True
if a_i <a[i+1]:
#print(a_i)
r+=1
if tf[-1] ==False:
r+=1
print(r)
main()
|
p02970 | s146073277 | Accepted | n,d = (int(i) for i in input().split())
ans = (n-1)//(2*d+1) + 1
print(ans) |
p02584 | s488407325 | Wrong Answer | xkd = list(map(int,input().split()))
xkd[0] = abs(xkd[0])
x = xkd[0] // xkd[2]
xkd[0] -= xkd[2] * x
xkd[1] -= x
if xkd[1] < 1:
xkd[0] += abs(xkd[1]) * xkd[2]
ans = xkd[0]
if xkd[1] % 2 != 0:
ans -= xkd[2]
if abs(ans) > abs(xkd[0]) + xkd[2]:
ans += xkd[2] * 2
print(abs(ans)) |
p03627 | s025828304 | Accepted | from collections import deque
n=int(input())
a=list(map(int,input().split()))
b=sorted(a,reverse=True)
d=deque(b)
ans=0
tmp=0
flag1=False
flag2=False
while d:
if d[0]==tmp and flag1==False:
flag1=True
d.popleft()
h1=tmp
tmp=0
elif flag1 and d[0]==tmp:
h2=tmp
ans=h1*h2
break
elif d[0]!=tmp:
tmp=d.popleft()
print(ans) |
p02859 | s545624117 | Wrong Answer | import math
r = input("半径を入力してください")
r1 = int(r)
A = math.pi*r1**2
ratio = A/math.pi
print('{:.00f}'.format(ratio)) |
p02743 | s918583021 | Accepted | a, b, c = map(int, input().split())
if c > a + b:
left = 4*a*b
right = c**2 + (a+b)**2 - 2*c*(a+b)
if right > left:
print('Yes')
else:
print('No')
else:
print('No') |
p03836 | s724644575 | Accepted | sx,sy,tx,ty=map(int,input().split())
x,y=tx-sx,ty-sy
print('R'*x+'U'*y+'L'*x+'D'*(y+1)+'R'*(x+1)+'U'*(y+1)+'LU'+'L'*(x+1)+'D'*(y+1)+'R') |
p03281 | s465510729 | Accepted | N = int(input())
def get_divisor_num(n):
cnt = 0
for i in range(1, int(n**0.5)+1):
if n % i == 0:
cnt += 1
if n // i != i:
cnt += 1
return cnt
cnt = 0
for i in range(1, N+1, 2):
if get_divisor_num(i) == 8:
cnt += 1
print(cnt)
|
p03243 | s876819103 | Accepted | n = int(input())
i = int(n / 111)
if n % 111 != 0:
i += 1
print(i * 111)
|
p02547 | s133705075 | Wrong Answer | n = int(input())
flag= True
count = 0
for i in range(n):
a,b = list(map(int, input().split()))
if a==b:
count += 1
else:
count= 0
if count==3:
flag = True
if flag:
print("Yes")
else:
print("No") |
p03457 | s595695954 | Accepted | N = int(input())
P = [(0,0,0)] + [tuple(int(x) for x in input().split()) for _ in range(N)]
def travelable(p,q):
time = q[0] - p[0]
dist = abs(q[1]-p[1]) + abs(q[2]-p[2])
if dist <= time and time%2 == dist%2:
return True
else:
return False
from itertools import zip_longest
print('Yes' if all(travelable(p,q) for p,q in zip_longest(P[:N],P[1:])) else 'No') |
p04043 | s435485778 | Accepted | # -*- coding: utf-8 -*-
if __name__ == "__main__":
# str_list = [map(int, input().split())]
# if str_list.count(5) == 2 and str_list.count(7) == 1:
# print('YES')
# else:
# print('NO')
str_list = list(map(int, input().split()))
if sum(str_list) == 17:
print('YES')
else:
print('NO')
|
p02748 | s747277599 | Accepted | import sys
input = sys.stdin.readline
a, b, m = [int(w) for w in input().split()]
a_li = [int(w) for w in input().split()]
b_li = [int(w) for w in input().split()]
ans = min(a_li) + min(b_li)
for i in range(m):
x, y, c = [int(w) for w in input().split()]
t = a_li[x - 1] + b_li[y - 1] - c
ans = min(ans, t)
print(ans)
|
p03030 | s636846563 | Accepted | n = int(input())
d = {}
for i in range(n):
a,b = input().split()
if a in d:
d[a].append([int(b),i+1])
else:
d.setdefault(a,[[int(b),i+1]])
for k in sorted(d.keys()):
d[k].sort(reverse=True)
for i in d[k]:
print(i[1]) |
p02571 | s112781783 | Accepted |
st1 = input()
st2 = input()
li = []
count = 0
k = 0
for i in range(len(st1)-len(st2)+1):
for s2 in st2:
if s2 in st1[i+k]:
count += 1
k += 1
li.append(count)
count = 0
k = 0
print(len(st2) - max(li))
|
p03645 | s373762096 | Accepted | N,M = map(int,input().split())
I = set()
n = set()
for i in range(M):
a,b = map(int,input().split())
if a == 1:
I.add(b)
if b == 1:
I.add(a)
if a == N:
n.add(b)
if b == N:
n.add(a)
if I & n == set():
print("IMPOSSIBLE")
else:
print("POSSIBLE") |
p03696 | s337671265 | Accepted | N = int(input())
S = input()
nS = S
for i in range(50):
nS = nS.replace("()", "")
r = nS.count(")")
l = nS.count("(")
print("(" * r + S + ")" * l) |
p02783 | s283264631 | Accepted | h, a = map(int,input().split())
ans = h//a
if h%a!=0:
ans+=1
print(ans) |
p02983 | s414413472 | Wrong Answer | L, R = map(int, input().split())
L %= 2019
R = R % 2019 if R - L < 2019 else R % 2019 + 2019
print(L, R)
ans = float('inf')
for i in range(L, R):
for j in range(i+1, R+1):
ans = min(ans, (i*j) % 2019)
print(ans)
|
p04030 | s416519048 | Accepted | s = input()
ans = []
for key in s:
if key=='B':
if ans:
ans.pop()
else:
ans.append(key)
print(''.join(ans)) |
p03408 | s189633133 | Accepted | import sys
from collections import defaultdict
input = lambda: sys.stdin.readline().rstrip()
N = int(input())
d = defaultdict(int)
for i in range(N):
word = input()
d[word] += 1
M = int(input())
for i in range(M):
word = input()
d[word] -= 1
sorted_d = sorted(d.items(), key=lambda x:x[1], reverse=True)
if sorted_d[0][1] <= 0:
print(0)
else:
print(sorted_d[0][1]) |
p03435 | s807014057 | Accepted | a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
if a[0] - b[0] == a[1] - b[1] == a[2] - b[2]:
if b[0] - c[0] == b[1] - c[1] == b[2] - c[2]:
print("Yes")
exit()
else:
pass
print("No") |
p02880 | s201072145 | Wrong Answer | n = int, input()
for a in range(1, 10):
for b in range(1, 10):
if a * b == n:
print("Yes")
break
else:
print("No")
|
p03659 | s076496208 | Accepted | n = int(input())
A = list(map(int, input().split()))
S = sum(A)
from itertools import accumulate
C = [0]+A
C = list(accumulate(C))
ans = 10**18
for i in range(1, n):
s = C[i]
a = S-s
ans = min(ans, abs(s-a))
print(ans)
|
p02797 | s098539420 | Accepted | def main():
N,K,S=map(int,input().split())
MAX=10**9
ans=[]
if S!=MAX:
for i in range(K):
ans.append(str(S))
for i in range(K,N):
ans.append(str(MAX))
else:
for i in range(K):
ans.append(str(S))
for i in range(K,N):
ans.append(str(MAX-1))
print(" ".join(ans))
main() |
p03986 | s355326456 | Wrong Answer | import collections
def main():
x = input().replace("TS", "T S").split()
ans = 0
for i in x:
s = i.count("S")
t = i.count("T")
ans += abs(s-t)
print(ans)
if __name__ == "__main__":
main() |
p02854 | s907948544 | Accepted | N=int(input())
A=list(map(int,input().split()))
B=[A[0]] #累積和
C=[0]*N #ここで切った時の差分
for i in range(1,N):
B.append(B[-1]+A[i])
for j in range(N):
C[j]=abs((B[-1]-B[j])-B[j])
#print(C)
print(min(C)) |
p03435 | s139764428 | Wrong Answer | import sys
c11, c12, c13 = map(int, input().split())
c21, c22, c23 = map(int, input().split())
c31, c32, c33 = map(int, input().split())
N = 101
for i in range(N):
a1 = i
b1 = c11 - a1
b2 = c12 - a1
b3 = c13 - a1
a2 = c21 - b1
a3 = c31 - b1
if c22 == a2+b2 and c23 == a2 + b3 and c33 == a3+b3:
print("Yes")
sys.exit()
print("No") |
p02766 | s358492348 | Accepted | def f(N,K):
if N<K:
return 1
return f(N//K,K)+1
N,K=map(int,input().split())
print(f(N,K)) |
p03796 | s318678346 | Accepted | import math
N=int(input())
print(math.factorial(N)%(10**9+7)) |
p02682 | s325115593 | Wrong Answer | A, B, C, K = map(int, input().split())
t = K - A
if t <= 0 or t <= B:
print(A)
else:
print(A - (t - B)) |
p03472 | s613769765 | Wrong Answer | import sys
n, h = map(int, input().split())
a = []
b = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
b.append(y)
b.sort(reverse=True)
max_a = max(a)
b = [x for x in b if x > max_a]
for i, x in enumerate(b):
h -= x
if h <= 0:
print(i + 1)
sys.exit()
ans = int(i + 1 + (h + 0.5) // max_a)
print(ans) |
p02994 | s569015787 | Accepted | def solve():
n,l = map(int,input().split())
mn = 10**10
s = 0
for i in range(n):
s+=l+i
if abs(mn)>abs(l+i):
mn = l+i
print(s-mn)
if __name__=='__main__':
solve() |
p02754 | s371426954 | Accepted | n, a, b = map(int, input().split())
temp = n // (a + b)
amari = n % (a + b)
if amari > a:
print((temp + 1) * a)
else:
print(temp * a + amari)
|
p03761 | s172917652 | Accepted | def main():
n=int(input())
cnt=[50]*26
tmp=[0]*26
for i in range(n):
s=input()
for j in range(len(s)):
tmp[ord(s[j])-97]+=1
for j in range(26):
cnt[j]=min(cnt[j],tmp[j])
tmp[j]=0
ans=""
for i in range(26):
if cnt[i]!=0:
ans+=chr(97+i)*cnt[i]
print(ans)
if __name__=="__main__":
main() |
p03910 | s351339717 | Accepted | n = int(input())
ans = []
cnt = 0
for i in range(1, int(n**0.7)+3):
if n > cnt:
ans.append(i)
cnt += i
else:
if cnt - n in ans:
ans.remove(cnt - n)
break
for i in ans:
print(i) |
p03681 | s508073603 | Wrong Answer | n,m=map(int,input().split())
def perm(n):
a=1
for i in range(1,n+1):
a*=i*i
a%=10**9+7
return a
if n==m:
print((perm(n)*2)%(10**9+7))
elif abs(n-m)==1:
print(perm(n)%(10**9+7))
else:
print(0)
|
p03761 | s357880706 | Wrong Answer | # Hello World program in Python
from collections import Counter
d = int (input())
l = []
for k in range(d):
r = input()
l.append(Counter(r))
oi = l[0]
for g in range(1,d):
oi = oi & l[g]
print(oi)
print("".join(sorted(oi.elements())))
|
p02917 | s657836104 | Accepted | n = int(input())
b = list(map(int, input().split()))
a = [0] * n
a[0] = b[0]
a[-1] = b[-1]
for i in range(1, n-1):
a[i] = min(b[i], b[i - 1])
print(sum(a)) |
p03331 | s375695476 | Wrong Answer | num=int(input())
ans_list=[]
ans=40000
for i in range(2,num-1):
max_list=list(map(int,str(num-i)))
min_list=list(map(int,str(i)))
tot=sum(max_list)+sum(min_list)
ans=min(tot,ans)
print(ans) |
p02613 | s204921394 | Accepted | N,*S,=open(0).read().split()
N=int(N)
C0=S.count('AC')
C1=S.count('WA')
C2=S.count('TLE')
C3=S.count('RE')
print('AC x '+str(C0))
print('WA x '+str(C1))
print('TLE x '+str(C2))
print('RE x '+str(C3)) |
p03250 | s377515757 | Accepted | V = list(map(int, input().split()))
V = sorted(V, reverse=True)
ans = V[0] * 10 + V[1] + V[2]
print(ans)
|
p03043 | s309693930 | Accepted | n,k = map(int,input().split())
ans = 0
for i in range(n):
count = 0
j = i+1
while j < k:
j = j << 1
count += 1
ans += 1/n * (1/2)**count
print(ans)
|
p02694 | s709245459 | Accepted | X=int(input())
count=0
M=100
while M<X:
M=int(M*1.01)
count=count+1
print(count) |
p02897 | s350038731 | Accepted | #python3
from math import ceil
def main():
n = int(input())
a = ceil(n/2)
print("{0:.10f}".format(a/n))
main()
|
p02765 | s625027109 | Wrong Answer | n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r-100*(10-n))
|
p03814 | s395474121 | Accepted | def solve():
S = input()
a = S.find('A')
z = S.rfind('Z')
print(z - a + 1)
if __name__ == "__main__":
solve() |
p04031 | s143445090 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
ave=sum(a)/N
if ave%1>=0.5:
if ave>=0:
ave=int(ave)+1
else:
ave=int(ave)-1
else:
ave=int(ave)
ans=0
for i in a:
ans+=(ave-i)**2
print(ans)
|
p03478 | s077934022 | Accepted | n,a,b = map(int,input().split())
ans = 0
for i in range(1,n+1):
s = list(map(int,list(str(i))))
if a <= sum(s) <= b:
ans += i
print(ans) |
p03645 | s285815275 | Accepted | n,m = map(int,input().split())
edge = []
for i in range(n+1):
edge.append([])
for i in range(m):
a,b = map(int,input().split())
edge[a].append(b)
edge[b].append(a)
for i in edge[1]:
if n in edge[i]:
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
|
p03862 | s628399371 | Accepted | n, x = map(int, input().split())
a = [int(x) for x in input().split()]
ans = 0
for i in range(n-1):
if a[i]+a[i+1] > x:
k = min([a[i+1], a[i]+a[i+1]-x])
a[i+1] -= k
ans += k
if a[i] > x:
ans += a[i]-x
a[i] = x
print(ans) |
p03494 | s732921433 | Accepted | N =input()
A = list(map(int,input().split()))
cnt =0
while all(a%2==0 for a in A):
A = [a/2 for a in A]
cnt+=1
print(cnt) |
p02911 | s203438763 | Accepted | n,k,q = map(int,input().split())
a = list(int(input()) for i in range(q))
z = [0] * n
for i in range(q):
z[a[i]-1] += 1
for i in range(n):
if z[i] >= q - k + 1:
print('Yes')
else:
print('No') |
p02687 | s337714904 | Wrong Answer | last = input()
if last == "ABC":
print("ARC")
else:
print("ARC") |
p02933 | s647221005 | Accepted | from sys import stdin
a = int(stdin.readline().rstrip())
s = stdin.readline().rstrip()
print(s if a >= 3200 else "red")
|
p02814 | s755108754 | Accepted | n,m,*a=map(int,open(0).read().split())
c=[bin(i)[::-1].index("1") for i in a]
if sum(c)!=c[0]*n:
print(0)
exit()
import fractions
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
a=list(set(a))
b=a[0]
for i in a:
b=lcm(i,b)
if b>2*m:
print(0)
exit()
print((m-b//2)//b+1) |
p02838 | s773478785 | Wrong Answer | mod = 1000000007
n = int(input())
a = list(map(lambda x: format(int(x), 'b'), input().split()))
cnt = [0] * 65
for i in range(n):
a_len = len(a[i])
for j in range(a_len):
if a[i][j] == '1':
cnt[a_len-j-1] += 1
ans = 0
for i in range(len(cnt)-1, -1, -1):
ans *= 2
ans %= mod
ans += cnt[i] * (n-cnt[i])
print(ans) |
p02657 | s540878951 | Accepted | str = input()
str2 = str.split(" ")
res = 1
for str3 in str2:
res *= int(str3)
print(res) |
p02786 | s029993819 | Accepted | h=int(input())
count=0
num=h
while num!=1:
count+=1
num=num//2
print(2**(count+1)-1)
|
p03681 | s494089337 | Accepted | import sys
input = sys.stdin.readline
from math import factorial
mod=10**9+7
n,m=map(int,input().split())
if n>m:
n,m=m,n
if n+1==m:
n=factorial(n)%mod
m=factorial(m)%mod
print(n*m%mod)
elif n==m:
n=factorial(n)%mod
m=factorial(m)%mod
print(2*n*m%mod)
else:
print(0)
|
p03282 | s198991833 | Accepted | S = input()
K = int(input())
for s in S[:K]:
if s != '1':
print(s)
break
else:
print(1)
|
p03565 | s644351164 | Wrong Answer | def solve(sequence, term):
count = 0
for t in term:
count = 0
for i, s in enumerate(sequence):
if t == s or s == "?":
count += 1
else:
count = 0
if count == len(term):
return (sequence[:i - count+1] + term + sequence[i +2:]).replace("?", "a")
return "UNRESTORABLE"
S = input()
T = input()
print(solve(S, T)) |
p02640 | s955410882 | Wrong Answer | def main():
from builtins import int, map, list, print
import sys
sys.setrecursionlimit(10 ** 6)
input = (lambda: (sys.stdin.readline()).rstrip())
input_list = (lambda: input().split())
input_number = (lambda: int(input()))
input_number_list = (lambda: list(map(int, input_list())))
X, Y = input_number_list()
if X > 51:
print("No")
elif Y < 2:
print("No")
else:
print(['No', 'Yes'][2*X <= Y <= 4*X])
if __name__ == '__main__':
main()
|
p02612 | s654917044 | Accepted | a=input()
b=int(a[-3:])
if b==0:
ans=0
else:
ans=1000-b
print(ans) |
p02847 | s643093617 | Wrong Answer | week = {"SUN":7,"MON":1,"TUE":2,"WED":3,"THU":4,"FRI":5,"SAT":6}
print(week[input()]) |
p03627 | s886399132 | Accepted | from collections import defaultdict
n = int(input())
bars = list(map(int, input().split()))
bars.sort(reverse=True)
sides = defaultdict(int)
decided = []
ans = 0
for b in bars:
sides[b] += 1
if sides[b] == 2:
decided.append(b)
sides[b] -= 2
if len(decided) == 2:
ans = decided[0] * decided[1]
break
print(ans) |
p03434 | s945737976 | Accepted | N=int(input())
lst=list(map(int,input().split()))
lst.sort(reverse=True)
A=0
B=0
for i in range(N):
if i==0 or i%2==0:
A+=lst[i]
else:
B+=lst[i]
print(int(A)-int(B)) |
p03623 | s421972588 | Accepted | x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
print('A')
else:
print('B') |
p03457 | s418450347 | Accepted |
N = int(input())
t_prev=0
x_prev=0
y_prev=0
for i in range(N):
t_i, x_i, y_i = map(int, input().split())
if (x_i+y_i)> t_i:
print("No")
exit()
elif (x_i+y_i) %2 != t_i%2 :
print("No")
exit()
elif x_i-x_prev > t_i-t_prev or y_i-y_prev>t_i-t_prev:
print('No')
exit()
t_prev=t_i
x_prev=x_i
y_prev=y_i
print("Yes")
|
p02910 | s139850921 | Accepted | s = input()
L = ['R', 'U', 'D']
M = ['L', 'U', 'D']
lens = len(s)
cnt = 0
for i in range(lens):
if (i+1)%2 == 1 and s[i] in L:
cnt += 1
elif (i+1)%2 == 0 and s[i] in M:
cnt += 1
if cnt == lens:
print('Yes')
else :
print('No')
|
p03323 | s019108447 | Accepted | a,b = map(int,input().split())
if a<=8 and b <= 8:
print('Yay!')
else:
print(':(') |
p02773 | s529859491 | Wrong Answer | a=int(input())
b=[input() for i in range(a)]
b.sort()
for i in range(a):
print(b[i]) |
p02597 | s502838958 | Accepted | n = int(input())
m = str(input())
red = m.count('R')
con = 0;
for i in range(red):
if m[i] == 'W':
con += 1
print(con); |
p03127 | s893935913 | Accepted | N=int(input())
A=list(map(int,input().split()))
import functools
import fractions
gcd=functools.reduce(fractions.gcd,A)
print(gcd) |
p03785 | s034302401 | Accepted | n, c, k, *T = map(int, open(0).read().split())
T.sort()
ans = s = 0
while s < n:
t = T[s] + k
X = [T[s]]
for i in range(s+1, min(n, s+c)):
if T[i] <= t:
X.append(T[i])
else:
break
s += len(X)
ans += 1
print(ans) |
p02640 | s447407682 | Accepted | x,y=map(int,input().split())
if y%2==0 and y<=4*x and y>=2*x:
print('Yes')
else:
print('No') |
p03243 | s744248041 | Wrong Answer | n=int(input())
for i in range(9):
if n<=i*111:
print((i)*111)
break |
p03042 | s592425042 | Accepted | s = list(input())
a = int(s[0])
b = int(s[1])
c = int(s[2])
d = int(s[3])
mae = a*10 + b
ushiro = c*10 + d
if mae <= 12 and mae != 0:
if ushiro <= 12 and ushiro != 0:
print("AMBIGUOUS")
else:
print("MMYY")
else:
if ushiro <= 12 and ushiro != 0:
print("YYMM")
else:
print("NA") |
p02582 | s123502623 | Accepted | string = input()
result = string.count("R")
if(result == 2 and string[1] == "S"):
print("1")
else:
print(result) |
p03127 | s228653435 | Wrong Answer | N=int(input())
A=sorted(list(map(int,input().split(' '))))
l_tmp=A[1:]
tmp = A[0]
ans = A[0]
while True:
l_tmp_tmp=[]
for i in l_tmp:
if i%tmp:
l_tmp_tmp.append(i%tmp)
ans = min(ans,i%tmp)
if len(l_tmp_tmp):
tmp = ans
l_tmp=l_tmp_tmp
else:
break
print(ans) |
p02705 | s095817019 | Wrong Answer | PI = 3.1415
def circumference(r):
return (2* PI * r)
print ('%.3f' % circumference(5)) |
p02744 | s797401474 | Accepted | def rec(w, x, n):
if len(w) == n:
return print(w)
else:
for i in range(x + 1):
rec(w + chr(ord('a') + i), x + 1 if i == x else x, n)
n = int(input())
rec("", 0, n) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.