problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02933 | s171002780 | Accepted |
a=int(input())
s=str(input())
if a>=3200:
print(s)
else:
print("red") |
p03371 | s283226560 | Accepted | A,B,C,X,Y = map(int,input().split())
C *= 2
ax = 0
bx = 0
num = 0
while ax < X or bx < Y:
if ax < X and bx < Y:
if A+B < C:
num += A+B
else:
num += C
ax += 1
bx += 1
elif ax < X:
if A < C:
num += A
else:
num += C
ax += 1
else:
if B < C:
num += B
else:
num += C
bx += 1
print(num)
|
p03220 | s080793278 | Wrong Answer | from operator import itemgetter
N = int(input())
T, A = map(int, input().split())
*H, = map(int, input().split())
avg = [[i+1, abs((T - h) * 0.006) - A] for i, h in enumerate(H)]
avg.sort(key=itemgetter(1))
print(avg[0][0]) |
p03645 | s681157343 | Wrong Answer | def main():
n, m = input().split()
g1 = []
g2 = []
for _ in range(int(m)):
x, y = input().split()
if x == 1:
g1.append(y)
elif y == n:
g2.append(x)
sx = set(g1)
sy = set(g2)
sxy = sx.intersection(sy)
if len(sxy):
print('POSSIBLE')
else:
print('IMPOSSIBLE')
if __name__ == '__main__':
main() |
p02584 | s096305455 | Wrong Answer | X, K, D = map(int, input().split())
n = X // D
if K < n:
ans = X - K * D
elif (K - n) % 2:
ans = (n+1) * D - X
else:
ans = X - n * D
print(ans) |
p03943 | s384082800 | Accepted | a,b,c = map(int,input().split())
if a+b == c or a+c == b or b+c ==a:
print("Yes")
else:
print("No") |
p03059 | s052642739 | Accepted | A, B, T = list(map(int, input().split()))
ans = 0
cnt = 1
while cnt < T+0.5:
if cnt%A == 0:
ans = ans + B
cnt += 1
print(ans) |
p02787 | s678105461 | Wrong Answer | INF = 1000000000
h, n = map(int, input().split())
AB = [list(map(int, input().split())) for i in range(n)]
maxA = max(AB[:][0])
dp = [INF for i in range(h+maxA)]
dp[0] = 0
for i in range(1, h+maxA):
for ab in AB:
a, b = ab[0], ab[1]
if i-a >= 0:
dp[i] = min(dp[i], dp[i-a] + b)
ans = min(dp[h:])
print(ans)
|
p03944 | s829688451 | Accepted | import sys
def v():
W,H,N=tuple(map(int,sys.stdin.readline().split()))
lx,ux,ly,uy=0,W,0,H
for _ in [0]*N:
x,y,a=tuple(map(int,sys.stdin.readline().split()))
if a==1 and lx<x:lx=x
elif a==2 and ux>x:ux=x
elif a==3 and ly<y:ly=y
elif a==4 and uy>y:uy=y
if lx<ux and ly<uy:print((ux-lx)*(uy-ly))
else:print(0)
if __name__=='__main__':v()
|
p02700 | s221422738 | Wrong Answer | t_h, t_a, a_h, a_a = [int(i) for i in input().split()]
aoki = a_h // t_a
takahashi = t_h // a_a
if aoki <= takahashi:
print('No')
else:
print('Yes')
|
p04043 | s404969708 | Accepted | import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()
def resolve():
A, B, C = LI()
if (A, B, C).count(5) == 2 and (A, B, C).count(7) == 1:
print('YES')
else:
print('NO')
if __name__ == '__main__':
resolve()
|
p03251 | s930980130 | Accepted | n,m,x,y = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
for i in range(x,y+1):
if all([p < i for p in a]) and all([q >=i for q in b]) and x < i <= y:
print("No War")
exit()
print("War") |
p03041 | s861469001 | Accepted | N,K = map(int,input().split())
S = list(input())
x = S[K-1]
S[K-1] = x.lower()
print("".join(S)) |
p02660 | s662431403 | Wrong Answer | import math
n=int(input())
num=2
count=0
num2=int(math.sqrt(n))
while n!=1:
if n%num==0:
count+=1
n=n//num
num+=1
else:
num+=1
if num2<num:
if count==0:
count=1
break
num2=int(math.sqrt(n))
if num2<num and n>=num:
count+=1
break
elif num2<num:
break
print(count)
|
p02720 | s965684492 | Wrong Answer | N=int(input())
from collections import deque
q=deque([1,2,3,4,5,6,7,8,9])
a=0
for _ in range(N):
a=q.popleft()
if a%10==0:
q.append(a*10)
q.append(a*10+1)
if a%10==9:
q.append(a*10+8)
q.append(a*10+9)
else:
q.append(a*10+a%10-1)
q.append(a*10+a%10)
q.append(a*10+a%10+1)
print(a) |
p02972 | s996570861 | Wrong Answer | n=int(input())
a=[0] + list(map(int,input().split()))
state=[0]*(n+1)
m=0
b=[]
for i in reversed(range(n)):
if state[i] != a[i]:
m+=1
b.append(i)
j = 1
while j*j <= i:
if j % i == 0:
state[j]=state[j]^1
if j != i // j:
state[i//j]=state[i//j]^1
j += 1
print(m)
print(*b)
|
p02727 | s301343072 | Accepted | import collections
x,y,aa,bb,cc = map(int,raw_input().split(' '))
aas = map(int, raw_input().split(' '))
bbs = map(int, raw_input().split(' '))
ccs = map(int, raw_input().split(' '))
aas.sort(key = lambda x:-x)
bbs.sort(key = lambda x:-x)
ccs.sort(key = lambda x:-x)
aas = aas[:x]
bbs = bbs[:y]
r = (aas + bbs)
r.sort()
i = 0
j = 0
while(j < len(ccs) and i < len(r)):
if ccs[j] > r[i]:
r[i] = ccs[j]
i+=1
j+=1
print sum(r) |
p03449 | s259835544 | Wrong Answer | n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
ans = 0
for i in range(n-1):
m1 = a1[:i+1]
m2 = a2[i:]
a = sum(m1)+sum(m2)
ans = max(ans,a)
print(ans) |
p03433 | s312411856 | Wrong Answer | n = input()
a = int(input())
si = int(n[-2:])
if si > a:
print('No')
else:
print('Yes') |
p02701 | s395649876 | Accepted | n = int(input())
st = set()
for i in range(n):
s = input()
st.add(s)
print(len(st)) |
p03095 | s732999834 | Accepted | from collections import Counter
N = int(input())
S = list(input())
C = Counter(S)
MOD = 10 ** 9 + 7
ans = 1
for s,c in C.items():
ans *= c + 1
ans %= MOD
ans = (ans - 1) % MOD
print(ans)
|
p03379 | s169179191 | Accepted | # coding: utf-8
n = int(input())
x = list(map(int, input().split()))
xs = sorted(x)
left = xs[n // 2 - 1]
right = xs[n // 2]
for i in range(n):
if x[i] <= left:
print(right)
else:
print(left)
|
p02753 | s966577189 | Accepted | #文字列の入力
S = input()
#listを一文字ずつのlistに
S_list = list(S)
AorB = S_list[0]
counter = 0
for i in range(len(S_list)):
if(AorB == S_list[i]):
counter = counter + 1
if(counter == len(S_list)):
print("No")
else:
print("Yes") |
p03327 | s869866043 | Wrong Answer | print(["ABD","ABC"][len(input())==3]) |
p02755 | s584786712 | Wrong Answer | from math import floor
a, b = [int(i) for i in input().split()]
for i in range(0, 1011):
print(i, floor(i * 0.08), floor(i * 0.1))
if floor(i * 0.08) == a and floor(i * 0.1) == b:
print(i)
break
else:
print(-1)
|
p03672 | s373739430 | Accepted | S = input()
for i in range(1, len(S)-1):
s = S[:-i]
if len(s)%2 == 0 and s[:len(s)//2] == s[len(s)//2:]:
ans = len(s)
break
print(ans) |
p03672 | s010978455 | Wrong Answer | s=str(input())
# print(s)
List=list(s)
List.pop(-1)
# print(List)
ans=0
for i in range((len(List)//2)+1):
R=List[0:i]
L=List[i:i+len(R)]
# print("L",L,"R",R)
if(R==L):
print(i,i+1,R,L)
ans=len(R)*2
print(ans) |
p03592 | s458364532 | Wrong Answer | n,m,k = map(int,input().split())
ok = False
for i in range(1,n+1):
for j in range(1,m+1):
if i*(m-j)+(n-i)*j == k:
ok = True
break
if ok:print('Yes')
else:print('No') |
p03219 | s461836714 | Accepted | x,y=map(int,input().split())
print(int(x+y/2)) |
p03163 | s499274237 | Accepted | #!/usr/bin/env python3
def main():
import sys
import numpy as np
read = sys.stdin.read
N, W = map(int, input().split())
wv = np.array(read().split(), dtype=np.int64)
w = wv[::2]
v = wv[1::2]
dp = np.zeros(W + 1, dtype=np.int64)
for can_w, can_v in zip(w, v):
dp[can_w:] = np.maximum(dp[can_w:], dp[:-can_w] + can_v)
print(dp[-1])
if __name__ == '__main__':
main()
|
p03309 | s284126702 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
a=[a[i]-i-1 for i in range(n)]
x = sum(a) // n
y=x+1
p=[abs(i-x) for i in a]
q=[abs(i-y) for i in a]
print(min(sum(p),sum(q))) |
p02797 | s092513444 | Accepted | n,k,s=map(int,input().split())
ans=[s]*k+[197]*(n-k)
print(*ans) |
p03131 | s830252409 | Wrong Answer | K,A,B = map(int,input().split())
if K < A+2 or B <= A+2:
print(K+1)
exit(0)
K -= A - 1
p,q = divmod(K,2)
ans = (B-A) * p + q
print(ans)
|
p03219 | s789847183 | Wrong Answer | a,b=map(int, input().split())
print('{:.0f}'.format((a+b)/2)) |
p02582 | s459263165 | Accepted | s = input()
if s=="RRR":
print(3)
elif s=="RRS" or s=="SRR":
print(2)
elif s=="SSS":
print(0)
else:
print(1)
|
p02664 | s613158142 | Accepted |
def main():
T = list(input())
for i in range(len(T)):
if T[i] == '?':
T[i] = 'D'
print(''.join(T))
if __name__ == "__main__":
main()
|
p03419 | s126834767 | Accepted | n,m = map(int,input().split())
if(n==2)or(m==2):
print(0)
elif(n==1)or(m==1):
if(n==1)and(m==1):
print(1)
else:
print(max(0,max(n,m)-2))
else:
print((n-2)*(m-2))
|
p04029 | s015515573 | Wrong Answer | from functools import reduce
from operator import mul
n = int(input())
print(reduce(mul, range(1,n+1))) |
p02687 | s285625620 | Accepted | def main():
S = input()
if S == "ABC":
print("ARC")
else:
print("ABC")
if __name__ == '__main__':
main()
|
p02829 | s398228590 | Wrong Answer | print(6-int(input())+int(input())) |
p03001 | s339823990 | Accepted | W, H, x, y = map(int, input().split())
i = 0
if x*2 == W and y*2 == H:
i = 1
print(W*H/2, i) |
p03338 | s771442422 | Accepted | from collections import defaultdict
n = int(input())
s = input()
l=1
tmp = 0
while(l<n):
dd = set()
dd2 = set()
for i in range(0, l):
dd.add(s[i])
for i in range(l, n):
dd2.add(s[i])
tmp = max(tmp, len(dd&dd2))
l+=1
print(tmp)
|
p03011 | s161207183 | Wrong Answer | P,Q,R=map(int,input().split())
print(min(P+Q,Q+P,R+P)) |
p03136 | s955608201 | Wrong Answer | n = int(input())
l = list(map(int, input().split()))
l.sort()
print('Yes' if l[-1] <= sum(l[:-1]) else 'No')
|
p03145 | s006035113 | Accepted | a, b, c = map(int, input().split())
print((a * b) // 2) |
p02946 | s845926196 | Wrong Answer | k,x = map(int,input().split())
ans = [i for i in range(k-abs(x)+1,k+abs(x))]
for i in ans:
if -1000000 <= i <= 1000000:
print(i,end='')
|
p03695 | s886266423 | Wrong Answer | n = int(input())
kinds = set()
rainbow = 0
for a in list(map(int, input().split())):
color = a // 400
if color < 8:
kinds.add(color)
else:
rainbow += 1
print(max(len(kinds), 1), min(8, len(kinds) + rainbow))
|
p03264 | s814457980 | Accepted |
n = int(input())
print(n // 2 * (n - n // 2)) |
p02697 | s285859878 | Accepted | n, m = map(int, input().split())
if n%2 == 1:
l = 1
r = n-1
for i in range(m):
print(l, r)
l += 1
r -= 1
else:
l = 1
r = n-1
flag = False
for i in range(m):
if (not flag) and r-l <= n//2:
r -= 1
flag = True
print(l, r)
l += 1
r -= 1
|
p03284 | s120155476 | Accepted | N,K = map(int, input().split())
print('0' if N % K == 0 else '1') |
p03495 | s693462853 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
p=list(set(a))
ans=0
d=[]
for i in range(len(p)):
d.append(a.count(p[i]))
if len(d)<=k:
print(0)
quit()
d.sort()
for i in range(k-1):
ans+=d[i]
print(ans) |
p03106 | s781091439 | Accepted | a,b,k=map(int,input().split())
if a>b:
a,b=b,a
s=0
for i in range(a+1,0,-1):
if a%i==0 and b%i==0:
s+=1
if s==k:
print(i)
exit()
|
p03672 | s273585661 | Wrong Answer | a=input()
l=len(a)
while l>0:
# print(l)
if l%2!=0:
l -= 1
a = a[:-1]
# print(a)
else:
t =int(l/2)
if a[0:t] == a[t:]:
print(l)
break
else:
l -= 1 |
p03557 | s953890438 | Accepted | import numpy as np
import sys
input = sys.stdin.readline
N = int(input())
A = np.array(input().split(), dtype=np.int64)
B = np.array(input().split(), dtype=np.int64)
C = np.array(input().split(), dtype=np.int64)
A.sort()
C.sort()
A_cnt = np.searchsorted(A, B, side='left')
C_cnt = np.searchsorted(C, B, side='right')
ans = (A_cnt * (N-C_cnt)).sum()
print(ans) |
p02933 | s628161598 | Wrong Answer | n = int(input())
s = input()
if n < 3200:
print(s)
else:
print("red") |
p03624 | s468246028 | Wrong Answer | S=str(input())
list_ = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(S)):
if len([1 for s in list_ if s==S[i]])>0:
n=list_.index(S[i])
list_ = list_[:n] + list_[n + 1:]
if len(list_)>1:
print(list_[0])
else:
print("None") |
p02946 | s894291395 | Accepted | k, x = map(int, input().split())
m = x-k+1
M = x+k-1
for i in range(m, M+1):
print(i , end=" ") |
p02784 | s883297579 | Accepted | H, N = map(int, input().split())
A = list(map(int, input().split()))
sum_A = sum(A)
if H - sum_A <= 0:
print('Yes')
else:
print('No') |
p02786 | s937002033 | Wrong Answer | import math
h=int(input())
k=math.ceil(math.log2(h))
print(2**k-1)
|
p02640 | s349860618 | Accepted | x,y =map(int,input().split())
p=0
for i in range(x+1):
t=i
k=x-t
tashi=2*t
kashi=4*k
if tashi+kashi==y:
p=1
print('Yes')
break
if p==0:
print('No')
|
p02947 | s671000097 | Accepted | d,a={},0
for i in range(int(input())):
k=''.join(sorted(input()))
d[k]=d.get(k,-1)+1
a+=d[k]
print(a) |
p03127 | s675180387 | Wrong Answer | # ABC118c
from functools import reduce
from fractions import gcd
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n = int(input())
a = list(map(int, input().split()))
def gcds(*numbers):
return reduce(gcd, numbers)
print(gcds(a))
exit(0)
def solve(l):
m = min(l)
nl = list()
for i in l:
if i % m != 0:
nl.append(i % m)
nl.append(m)
# print(nl)
if len(nl) == 1:
return m
return solve(nl)
print(solve(a))
|
p04045 | s041220489 | Wrong Answer | import sys,math,collections,itertools,bisect
input = sys.stdin.readline
N,K=list(map(int,input().split()))
D = list(map(int,input().split()))
Ds = set([0,1,2,3,4,5,6,7,8,9])-set(D)
can = list(itertools.product(Ds,repeat = 5))
candi = []
for c in can:
candi.append(10**4*c[0]+10**3*c[1]+10**2*c[2]+10**1*c[3]+c[4])
candi = sorted(candi)
print(candi[bisect.bisect_left(candi,N)])
|
p03077 | s931870663 | Accepted | import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(input())
def FI(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()
import numpy as np
def main():
n=II()
A=[II() for _ in range(5)]
print(5+(n-1)//min(A))
if __name__ == "__main__":
main()
|
p03719 | s178136229 | Accepted | a, b, c = map(int, input().split())
if a <= c and c <= b:
print('Yes')
else:
print('No') |
p02639 | s025451486 | Wrong Answer | xl = list(map(int,input().split()))
for i in range(1,5):
if xl[i] == 0:
print(i+1)
else :
i = i + 1
|
p03836 | s425291595 | Wrong Answer | def addRoute(i, c):
t = ''
for _ in range(i):
t += c
return t
pos=list(map(int, input().split()))
ud = pos[3] - pos[1]
rl = pos[2] - pos[0]
s = ''
s += addRoute(ud, 'U')
s += addRoute(rl, 'R')
s += addRoute(ud, 'D')
s += addRoute(rl, 'L')
s += 'L'
s += addRoute(ud+1, 'U')
s += addRoute(rl+1, 'R')
s += 'RR'
s += addRoute(ud+1, 'D')
s += addRoute(rl+1, 'L')
s += 'U'
print(s) |
p03252 | s786439260 | Accepted | s=input()
t=input()
st={}
ts={}
for x,y in zip(s,t):
if x not in st:
st[x]=y
else:
if st[x]!=y:
print("No")
exit()
if y not in ts:
ts[y]=x
else:
if ts[y]!=x:
print("No")
exit()
print("Yes") |
p02622 | s306701894 | Wrong Answer | # B Minor Change
S = list(input())
T = list(input())
l=len(S)
ct = 0
print(l)
for i in range(l):
if S[i] != T[i]:
ct += 1
print(ct)
|
p03474 | s983378949 | Accepted | import sys
a,b = map(int, input().split())
s = input()
count = 0
if(s[a]!="-"):
print("No")
sys.exit()
else:
for i in range (len(s)):
if(s[i]=="-"):
count += 1
if (count == 1):
print("Yes")
else:
print("No") |
p02911 | s122034207 | Wrong Answer | n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
res = ['No'] * n
for i in range(n):
if k - q + a.count(n+i) > 0:
res[i] = 'Yes'
print('\n'.join(map(str, res))) |
p03644 | s861263547 | Wrong Answer | N = int(input())
ans = 0
count_dic = {}
for i in range(N):
i_tmp = i
count = 0
while True:
if i == 0:
break
elif i_tmp % 2 == 0:
i_tmp = i_tmp / 2
count += 1
else:
break
count_dic[i] = count
print(max(count_dic, key=count_dic.get))
|
p03493 | s636026004 | Accepted | print(input().count("1")) |
p03261 | s111204448 | Accepted | N, *W = open(0).read().split()
is_ok = True
if len(W) != len(set(W)):
is_ok = False
else:
for i, w in enumerate(W):
if i > 0:
if before_w != w[0]:
is_ok = False
break
before_w = w[-1]
if is_ok:
print("Yes")
else:
print("No") |
p03838 | s668067047 | Wrong Answer | x,y=map(int,input().split())
#print(y-x,x-y+2,1+y+x)
l=[]
if y-x>=0:
l.append(y-x)
if x-y+2>=0:
l.append(x-y+2)
if 1+y+x>=0:
l.append(1+y+x)
print(min(l)) |
p03131 | s835091939 | Accepted | import sys
k,bisc_to_yen,yen_to_bisc = map(int,input().split())
if yen_to_bisc - bisc_to_yen <= 2 or k-1 < bisc_to_yen:# 後者は、「あと二回で終了」までに地道増やしが間に合わない場合
print(k+1)
sys.exit()
before_change = bisc_to_yen - 1
remain = k - before_change
num_change = remain//2
ans = num_change*(yen_to_bisc-bisc_to_yen)
if remain % 2 == 1:
ans += 1
print(ans+bisc_to_yen)
|
p03524 | s794506942 | Accepted | s = list(input())
a = b = c = 0
for i in s:
if i == "a":
a += 1
elif i == "b":
b += 1
else:
c += 1
if a*b*c == 0 and a+b+c > 2:
print("NO")
elif max(a,b,c)-min(a,b,c) >= 2:
print("NO")
else:
print("YES")
|
p02707 | s320250429 | Accepted | from collections import Counter
N = int(input())
A = Counter([int(x) for x in input().split()])
for i in range(1,N+1):
print(A.get(i) if A.get(i) is not None else 0) |
p03284 | s768188998 | Accepted | n,k= map(int, input().split())
if n%k == 0:
print(0)
else:
print(1)
|
p03680 | s371629445 | Wrong Answer | n = int(input())
button = []
for i in range(n):
button.append(int(input()))
times = 0
next_button = 1
while times < 5:
times += 1
next_button = button[next_button-1]
if next_button == 2:
print(times)
exit()
print(-1) |
p03331 | s418755225 | Wrong Answer | def main():
n = int(input())
a = n - 1
b = 1
menor = soma_digitos(a) + soma_digitos(b)
temp = 0
for i in range(n-1):
a -= 1
b += 1
temp = soma_digitos(a) + soma_digitos(b)
if menor > temp:
menor = temp
print(menor)
def soma_digitos(n):
soma = 0
while n >= 1:
soma += n%10
n = n//10
return soma
main() |
p02707 | s029905516 | Accepted | n = int(input())
a_list = list(map(int,input().split()))
p_list = [0 for i in range(n)]
for a in a_list:
p_list[a-1] += 1
for p in p_list:
print(p) |
p02909 | s637614758 | Wrong Answer | S = input()
if S == "Sunny":
print ('cloudy')
elif S == "Cloudy" :
print ('Rainy')
else :
print ('Sunny') |
p03274 | s759808392 | Wrong Answer | n,k=map(int,input().split())
x=list(map(int,input().split()))
ans=2*10**8
for i in range(n-k+1):
ans=min(ans,min(abs(x[i]),abs(x[k+i-1]))+x[k+i-1]-x[i])
print(ans)
|
p02900 | s477334414 | Wrong Answer | from fractions import gcd
a,b = [int(x) for x in input().split()]
def prime_factor(n):
x = int(n**0.5)
res = [1]
for i in range(2,x+1):
while n%i==0:
n //= i
res.append(i)
if n!=1:
res.append(n)
return res
z = gcd(a,b)
print(len(prime_factor(z))) |
p02933 | s933872480 | Accepted | a = int(input())
s = input()
print(s) if a >= 3200 else print('red') |
p04043 | s877103163 | Wrong Answer | a, b, c = map(int, input().split())
s = a + b + c
if s == 17:
print("Yes")
else:
print("No") |
p02983 | s757171370 | Accepted | l,r = map(int, input().split())
if (r-l >= 2018):
print(0)
exit()
a = []
for i in range(l,r+1):
a.append(i%2019)
a.sort()
if (a[0]==0):
print(0)
exit()
b = []
for i in range (0,len(a)-1):
for j in range (1,len(a)):
b.append((a[i]*a[j])%2019)
print(min(b))
|
p02910 | s493333873 | Accepted | s = input()
a = "Yes"
for i in range(len(s)):
if i % 2 == 0:
if s[i] == "L":
a = "No"
else:
if s[i] == "R":
a = "No"
print(a) |
p03261 | s309054179 | Wrong Answer | n = int(input())
S = [input() for _ in range(n)]
if len(S) != len(set(S)):
print("No")
exit()
ans = {}
for s in S:
if s[0] in ans:
ans[s[0]] += 1
else:
ans[s[0]] = 1
if s[-1] in ans:
ans[s[-1]] -= 1
else:
ans[s[-1]] = -1
if sum(ans.values()) == 0:
print("Yes")
else:
print("No") |
p03760 | s958997741 | Accepted | O=input()
E=input()
P = ""
for i in range(len(E)):
P += O[i]
P += E[i]
if len(O)-len(E)==1:
P += O[-1]
print(P) |
p02546 | s962221394 | Wrong Answer | s = input()
if s[:-1]=='s':
print(s+'es')
else:
print(s+'s') |
p03543 | s547940423 | Accepted | a=input()
if len(set(a[1:]))==1 or len(set(a[:3]))==1:
print("Yes")
else:
print("No") |
p02897 | s968057934 | Accepted | a = int(input())
print( ((a+1)//2) / a) |
p03408 | s561220015 | Accepted | N = int(input())
S = {}
for _ in range(N):
s = input()
if s in S:
S[s] += 1
else:
S[s] = 1
M = int(input())
T = {}
for _ in range(M):
t = input()
if t in T:
T[t] += 1
else:
T[t] = 1
res = 0
for s in S:
if s in T:
if S[s] - T[s] > 0:
res = max(res, S[s] - T[s])
else:
res = max(res, S[s])
print(res)
|
p03061 | s893553330 | Accepted | import fractions as f
n = int(input())
a = [int(_) for _ in input().split()]
left = [0] * (n+1)
left[0] = 0
for i in range(1, n+1):
left[i] = f.gcd(left[i-1], a[i-1])
right = [0] * (n+1)
right[n] = 0
for i in range(1, n+1):
right[n-i] = f.gcd(right[n-i+1], a[n-i])
ans = 0
for i in range(n):
ans = max(ans, f.gcd(left[i], right[i+1]))
print(ans) |
p03815 | s604898393 | Accepted | x = int(input())
a = x//(5+6)
if x-11*a==0:
print(2*a)
elif 1<=x-11*a<=6:
print(2*a+1)
else:
print(2*a+2)
|
p02606 | s560052136 | Accepted | l,r,d = list(map(int,input().split()))
print(r//d - (l-1)//d) |
p02713 | s319731888 | Accepted | import math
from functools import reduce
n = int(input())
ans = 0
def gcd(*numbers):
return reduce(math.gcd, numbers)
for a in range(1,n+1):
for b in range(1,n+1):
for c in range(1,n+1):
ans += gcd(a,b,c)
print(ans) |
p02817 | s882955703 | Accepted | S,T = map(str,input().split(" "))
print(T,end="")
print(S) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.