problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02682 | s636397448 | Accepted | a, b, c ,k = map(int, input().split())
ak = min(a, k)
k -= ak
if k == 0:
ans = ak
print (ans)
else:
bk = min(b, k)
k -= bk
if k == 0:
ans = ak
print (ans)
else:
ck = k
ans = ak- ck
print (ans) |
p02595 | s418329076 | Wrong Answer | from math import sqrt
ans = 0
n,d = map(int,input().split())
for i in range(n):
x,y = map(int,input().split())
ans += 1 if sqrt((x**2)+(y**2)) >= d else 0
print(ans) |
p03030 | s294619348 | Accepted | n = int(input())
l = []
for i in range(1,n+1):
s,p = input().split()
l.append((s,100-int(p),i))
l.sort()
for item in l:
print(item[2])
|
p02818 | s274074315 | Wrong Answer | a,b,k=map(int, input().split())
print( max(0,a-k), min([0,b,a+b-k]) ) |
p03479 | s188122518 | Accepted | X, Y = map(int, input().split())
ans = 0
while X <= Y:
X *= 2
ans += 1
print(ans)
|
p04034 | s695214006 | Wrong Answer | import numpy as np
n,m = [int(i)for i in input().split()]
l = [[int(i)-1 for i in input().split()] for _ in range(m)]
line = np.array([1 for _ in range(n)])
is_red = np.zeros(n,dtype = np.int32)
is_red[0] = 1
for x,y in l:
line[x] -= 1 if line[x] > 0 else 0
line[y] += 1
is_red[y] = 1 if is_red[x] == 1... |
p02705 | s054323075 | Wrong Answer | n=int(input())
print((22/7)*n*n) |
p03087 | s500930633 | Accepted | n, m = map(int, input().split())
s = input()
d = [0] * n
cnt = 0
for i in range(n-1):
if s[i] == 'A' and s[i+1] == 'C':
cnt += 1
d[i+1] = cnt
for _ in range(m):
a, b = map(int, input().split())
print(d[b-1] - d[a-1])
|
p03705 | s896766319 | Accepted | N,A,B = map(int, input().split())
#print(N,A,B)
if A>B:
print(0)
elif (N==1 and A!=B):
print(0)
elif (N==1 and A==B):
print(1)
else:
print((B-A)*(N-2)+1)
|
p02578 | s359567841 | Accepted | n = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(n-1):
if A[i] >= A[i+1]:
ans += A[i]-A[i+1]
A[i+1] = A[i]
print(ans)
|
p02598 | s524938460 | Wrong Answer | def abc174_e():
n, k = map(int, input().split())
A = list(map(int, input().split()))
if k == 0: return max(A)
lower, upper = 0, 10**9
while upper - lower > 1:
x = (upper + lower) // 2
cnt = 0
for a in A:
cnt += a // x
if cnt > k: break
if cnt ... |
p03767 | s826467073 | Accepted | n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0
for i in range(1,n+1):
ans += a[-2*i]
print(ans) |
p02547 | s065239940 | Accepted | N = int(input())
D = [input().split() for l in range(N)]
zoro = []
for i in range(N):
if D[i][0] == D[i][1]:
zoro.append(1)
else:
zoro.append(0)
cnt = []
for i in range(N-2):
cnt.append(zoro[i]+zoro[i+1]+zoro[i+2])
zoro_cnt = 0
for i in range(N-2):
if cnt[i] == 3:
zoro_cnt += 1
if zoro_cnt >... |
p04012 | s030174054 | Accepted | import numpy as np
import sys
input = sys.stdin.readline
alp = "abcdefghijklmnopqrstuvwxyz"
alp = list(alp)
w = sorted(input())
w = w[1:]
#print(w)
cnt = 1
for i in range(1,len(w)):
# print( w[i],cnt)
if w[i] ==w[i-1] :
cnt +=1
else:
if cnt%2 == 1:
print("No")
exit... |
p02697 | s001071704 | Accepted | n, m = map(int, input().split())
if n % 2 == 1:
for i in range(m):
print(i + 1, n - i)
else:
for i in range(m):
if 2 * (i + 1) <= m + 1:
print(i + 1, n - i)
else:
print(i + 1, n - i - 1) |
p02600 | s258491937 | Accepted | X = int(input())
if X <= 599:
print(8)
elif X <= 799:
print(7)
elif X <= 999:
print(6)
elif X <= 1199:
print(5)
elif X <= 1399:
print(4)
elif X <= 1599:
print(3)
elif X <= 1799:
print(2)
elif X <= 1999:
print(1) |
p03041 | s405887286 | Wrong Answer | m,k=map(int,input().split())
if k>=2**m:
print(-1)
elif m==1:
if k==0: print(0,0,1,1)
else: print(-1)
else:
tmp=k
for i in range(1,2**m):
tmp^=i
ans=[i for i in range(2**m) if i!=k]+[k]+[i for i in range(2**m-1,-1,-1) if i!=k]+[k]
print(*ans)
|
p03471 | s866543950 | Wrong Answer | N,Y = map(int,input().split())
for x in range(N):
for y in range(N):
if Y == 10000*x+5000*y+1000*(N-x-y):
print(x,y,N-x-y)
exit()
print('-1','-1','-1')
|
p03997 | s613360675 | Accepted | a=int(input())
b=int(input())
h=int(input())
print((a+b)*h//2) |
p02570 | s398956693 | Wrong Answer | 5000
1
1
"No" |
p03042 | s104946967 | Accepted | n = int(input())
n1 = n//100
n2 = n%100
if 0<n1<13 and 0<n2<13: print("AMBIGUOUS")
elif 0<n1<13: print("MMYY")
elif 0<n2<13: print("YYMM")
else: print("NA") |
p03137 | s523766334 | Accepted | import sys
N,M = [int(x) for x in input().split()]
X = [int(x) for x in input().split()]
if N >= M:
print(0)
sys.exit()
X = sorted(X)
dis = [0 for x in range(M-1)]
for i in range(M-1):
dis[i] = X[i+1] - X[i]
dis.sort()
dis.reverse()
for i in range(N-1):
dis[i] = 0
print(sum(dis))
|
p02835 | s305712834 | Accepted | l = list(map(int, input().split()))
print('bust' if sum(l) >= 22 else 'win') |
p03779 | s633767476 | Accepted | x=int(input())
ans,i=0,0
while i < x:
i+=ans
ans+=1
print(ans-1)
|
p02677 | s810520590 | Wrong Answer | import math
s,l,h,m=map(int,input().split())
#JIKOKU
t=60*h+m
#TANSHIN KAKUDO
sd=(0.5*t)%360
ld=(6*t)%360
x=abs(sd-ld)
if x==180:
print(s+l)
exit()
elif x==0:
print(l-s)
elif x>180:
x=x-180
radx=math.radians(x)
cosx=math.cos(radx)
print((s**2+l**2-2*l*s*cosx)**0.5) |
p02982 | s162570276 | Wrong Answer | import math
import itertools
n, d = map(int, input().split())
xn = []
for i in range(n):
x = [int(num) for num in input().split()]
xn.append(x)
c_list = list(itertools.combinations([int(num) for num in range(n)], 2))
answers = []
for c in c_list:
sum = 0
for j in range(d):
sum += (xn[c[0]][j]-xn[c[1... |
p02959 | s781027749 | Wrong Answer | N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
pre=sum(A)
for i in range(N):
if B[i]<=A[i]:
A[i]-=B[i]
else:
A[i+1]=max(0, B[i]-A[i])
A[i]=0
print(sum(A)-pre) |
p03611 | s289028757 | Accepted | n = int(input())
a = list(map(int, input().split()))
count = [0]*10**5
for i in a:
count[i] += 1
ans = []
for i in range(len(count)-2):
ans.append(sum(count[i:i+3]))
print(max(ans)) |
p03665 | s485671413 | Accepted | n,p = map(int,input().split())
a = list(map(int,input().split()))
ans = o = e = 0
for i in a:
if i%2==0:e+=1
else:o+=1
from math import factorial
ec = 0
for i in range(e+1):
ec += factorial(e)//(factorial(e-i)*factorial(i))
oc = 0
if p==0:
for i in range(o+1):
if i%2==0:
oc += facto... |
p03239 | s900681246 | Accepted | n,t = map(int, input().split())
res = 10000
for i in range(n):
a,b = map(int, input().split())
if b <= t:
res = min(res,a)
if res ==10000:
print("TLE")
else:
print(res) |
p02995 | s926429660 | Wrong Answer | import fractions
a,b,c,d=map(int,input().split())
C=int(b//c)-int((a-1)//c)
D=int(b//d)-int((a-1)//d)
g=fractions.gcd(c,d)
l=(c*d)/g
E=int(b//l)-int((a-1)//l)
print(int(b)-int(a)+1-int(D)-int(C)+int(E))
|
p03723 | s135755843 | Accepted | A, B, C = map(int, input().split())
sum = 0
before = set()
while True:
if str(A)+' '+str(B)+' '+str(C) in before:
print(-1)
exit()
else:
before.add(str(A)+' '+str(B)+' '+str(C))
if A%2==1 or B%2==1 or C%2==1:
print(sum)
exit()
temp1 = int(B/2)+int(C/2)
temp2 =... |
p02768 | s029645937 | Accepted | mod=10**9+7
n,a,b=map(int,input().split())
ans=pow(2,n,mod)-1
x=1
p=1
for i in range(a):
p=p*(n-i)
p%=mod
x=x*(i+1)
x%=mod
tmp1=(p*pow(x,mod-2,mod))%mod
y=1
q=1
for j in range(b):
q=q*(n-j)
q%=mod
y=y*(j+1)
y%=mod
tmp2=(q*pow(y,mod-2,mod))%mod
print((ans-tmp1-tmp2)%mod) |
p03719 | s324625154 | Wrong Answer | a,b,c=[int(i) for i in input().split()]
if a>=b:
if a>=c and c>=b:
print('Yes')
else:
print('No')
else:
if b>=c and c>=a:
print('Yes')
else:
print('No') |
p02859 | s996643559 | Accepted | import sys
r = int(input())
S = r*r
print(S) |
p02724 | s715794592 | Accepted | S =int(input())
joy_500 = (S // 500) * 1000
joy_5 = ((S-(joy_500 // 2)) // 5) * 5
print(joy_500+joy_5) |
p03071 | s057602832 | Accepted | A,B=map(int,input().split())
C=max(A,B)
if C==A:
D=max(A-1,B)
else:
D=max(A,B-1)
print(C+D)
|
p02747 | s127390514 | Wrong Answer | hi = "hi"
S = input()
if hi in S:
print("Yes")
else:
print("No") |
p03013 | s002875094 | Wrong Answer | def main():
N, M= map(int, input().split())
a =[str(input()) for _ in range(M)]
DP = [0]*(N+1)
num = 1000000007
DP[0] = 1
for i in range(N):
if str(i) in a:
DP[i] = (DP[i-1] + DP[i-2]) % num
print(DP[-2]%num)
if __name__ == "__main__":
main() |
p04030 | s421457933 | Accepted | s = input()
L = ""
for i in s:
if i == "B":
if L:
L = L[:-1]
else:
L += i
print(L)
|
p02582 | s038257568 | Wrong Answer | S = input()[0:3]
res = 0
if S == 'RRS' or S == 'rrs':
res = 2
elif S=='RRR' or S == 'rrr':
res = 3
elif S=='RSR' or S == 'rsr':
res =1
elif S=='RSS' or S=='rss':
res = 1
else:
res = 0
print(res)
|
p02922 | s387709587 | Wrong Answer | # 標準出力を取得（strデータ）
A, B = input().split()
# A, B を integerに変換
A = int(A)
B = int(B)
# OAタップの数を表す変数の初期値を 1 とする
num = 1
if A == 1 & B == 1:
num = 0
else:
while (A - 1) * (num - 1) + A < B:
num = num + 1
# 結果を出力
print(num) |
p03457 | s357599639 | Accepted | N = int(input())
A = [[0,0,0]]
for i in range(N):
A.append(list(map(int, input().split())))
flag = True
for i in range(N):
if not flag:
break
time = int(A[i+1][0]) - int(A[i][0])
dist = abs(A[i+1][1] - A[i][1]) + abs(A[i+1][2] - A[i][2]) # x2-x1 + y2-y1
if time < dist:
flag = False
elif time % 2 !=... |
p03679 | s312646348 | Wrong Answer | x, a, b = map(int,input().split())
if 0 >= (b - a):
print("delicious")
elif x <= (b - a):
print("dangerous")
else:
print("safe")
|
p03796 | s321416668 | Accepted | n = int(input())
f = 1
m = 10**9+7
for i in range(1,n+1):
f = f%m * i
print(f%m) |
p02771 | s758591120 | Wrong Answer |
ABC = set(input())
print("Yes"if len(ABC)==2 else "No")
|
p03720 | s367080123 | Accepted | N, M = map(int, input().split())
road = [list(map(int, input().split())) for _ in range(M)]
city = [0]*N
for r in road:
city[r[0] - 1] += 1
city[r[1] - 1] += 1
print(*city,sep="\n") |
p02547 | s341335731 | Wrong Answer | N=int(input())
j=0
for i in range(N):
D1,D2=map(int,input().split())
if D1==D2:
j+=1
else:
j=0
if j>=3:
print('Yes')
else:
print('No') |
p03043 | s874605728 | Accepted | import math
N,K=map(int,input().split())
pro=0
if N==1 and K==1:
print(1)
elif N>=K:
pro+=(N-K+1)/N
for k in range(1, K):
r = math.ceil(math.log(K / k,2))
pro += 0.5**r / N
print(pro)
else:
for k in range(1, N+1):
r = math.ceil(math.log(K / k,2))
pro += 0.5**r / N
... |
p03475 | s513359564 | Accepted | N=int(input())
C=[0]*(N-1)
S=[0]*(N-1)
F=[0]*(N-1)
for i in range(N-1):
C[i],S[i],F[i]=map(int,input().split())
for i in range(N):
j=i
t=0
while j<N-1:
if t<=S[j]:
t=S[j]
else:
tmp= t-S[j]
s=tmp%F[j]
if s!=0:
t += F[j]-s
#print(i,j,t)
t += C[j]
j +=1
prin... |
p03797 | s609250027 | Wrong Answer | N,M=map(int,input().split())
if 2*N>=M:
print(N)
if 2*N<M:
L=M-2*N
print(N+L//4) |
p02802 | s363642566 | Wrong Answer | n,m = map(int,input().split())
pn = [0] * n
aw = [0] * n
for i in range(m):
p,s = input().split()
p = int(p) - 1
if s == "WA":
if aw[p] == 0:
pn[p] += 1
else:
aw[p] = 1
print ("%d %d" % (sum(aw),sum(pn))) |
p03274 | s177285053 | Accepted | n, k = map(int, input().split())
nums = [int(i) for i in input().split()]
# n, k = 5, 3
# nums = [-30, -10, 10, 20, 50]
m = 10 ** 10
# 左から
for i in range(n-k+1):
m = min(m, abs(nums[i]) + nums[i+k-1] - nums[i])
# 逆で考えるのindex的に大変なので-1をかけて反転する
nums = nums[::-1]
nums = [num * -1 for num in nums]
# 本当は関数化すべき
for i i... |
p02613 | s882495749 | Wrong Answer | N = int(input())
S=[]
for _ in range(N):
S.append(input())
C = [0,0,0,0]
judge = ['AC','WA','TLE','RE']
for i in range(N):
for j in range(4):
if judge[j]==S[i]:
C[j]=C[j]+1
for k in range(4):
print(f'{judge[k]} × {C[k]}')
|
p03076 | s010848499 | Wrong Answer | ae = [int(input()) for i in range(5)]
mm = ae[0]%10
for i in range(5):
mm = min(mm, ae[i]%10)
ae[i] = ((ae[i]//10)+1)*10
print(sum(ae)-(10-mm)) |
p02657 | s120941704 | Accepted | a,b = map(int,input(). split ())
print(a*b) |
p03241 | s102366047 | Accepted | def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
n,m=map(int, input().split(... |
p03487 | s502024010 | Accepted | N = input()
A = sorted([int(x) for x in input().split()])
import bisect as bs
ans = 0
f = lambda X, x: bs.bisect_right(X,x) - bs.bisect_left(X,x)
for a in set(A):
cnt = f(A,a)
if cnt < a:
ans += cnt
else:
ans += cnt-a
print(ans) |
p03243 | s522090101 | Accepted | n = int(input())
l = [111, 222, 333, 444, 555, 666, 777, 888, 999]
for i in l:
if i >= n:
print(i)
break |
p02755 | s681480970 | Accepted | import math
a, b = map(int, input().split())
def solve(x):
return math.floor(x * 0.08) == a and math.floor(x * 0.1) == b
for i in range(1, 10**5):
if solve(i):
print(i)
exit()
print(-1)
|
p03997 | s361725639 | Wrong Answer | import sys
def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def input():
return sys.stdin.readline().rstrip()
#############
# Main Code #
#############
a = getN()
b = getN()
h = getN()
print((a + b) / 2 * h)
|
p02958 | s441677693 | Wrong Answer | n = int(input())
p = list(map(int, input().split()))
dst = p[:]
asc = list(range(1, n+1))
can = (dst == asc)
for i in range(n-1):
if can:
break
for j in range(i+1, n):
dst[i], dst[j] = dst[j], dst[i]
can = (dst == asc)
dst = p[:]
print("YES" if can else "NO") |
p03817 | s363574983 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
x = int(input())
cnt = -(-x//11)
if cnt*11-x>=5:
print(cnt*2-1)
else:
print(cnt*2) |
p02695 | s943046421 | Wrong Answer | N, M, Q = map(int, input().split())
reqs = [list(map(int, input().split())) for _ in range(Q)]
As = []
def make(A):
global As, N, M
if len(A) == N+1:
As.append(A)
else:
for i in range(A[len(A)-1], M+1):
A.append(i)
make([1])
max = 0
for A in As:
score = 0
for req in reqs:
if A[req[1]... |
p02793 | s408723023 | Wrong Answer | import fractions
from functools import reduce
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
def main():
N = int(input())
AN = list(map(int, input().split()))
AN_... |
p02639 | s686237840 | Accepted | A, B, C ,D, E= map(int,input().split())
if A == 0:
print(1)
elif B == 0:
print(2)
elif C == 0:
print(3)
elif D == 0:
print(4)
else:
print(5) |
p03637 | s572950840 | Accepted | n=int(input())
a=list(map(int,input().split()))
num=[0,0,0]
for i in range(n):
if a[i]%4==0:
num[2]+=1
elif a[i]%2==0:
num[1]+=1
else:
num[0]+=1
if num[1]==0:
if num[0]>num[2]+1:
print("No")
else:
print("Yes")
elif num[0]>num[2]:
print("No")
else:
prin... |
p02688 | s920841083 | Wrong Answer | n,k = map(int,input().split())
set_i = set()
for i in range(0,k,2):
d = input()
s = map(int,input().split())
for s_ in s:
set_i.add(s_)
print(n-len(set_i))
|
p03069 | s522632208 | Accepted | n = int(input())
s = input()
cw = 0
cb = 0
di = []
a = -1
b = 0
mn = float("inf")
for i in range(n):
if s[i] == ".":
cw += 1
else:
di.append(i)
cb += 1
for k in range(len(di)):
if mn > cw - di[k] + 2*k:
mn = cw - di[k] + 2*k
print(min(min(cw,cb),mn)) |
p03407 | s523545551 | Accepted | a,b,c=map(int, input().split())
if a+b>=c:
print("Yes")
else:
print("No") |
p02572 | s088659079 | Wrong Answer | import numpy as np
n = int(input())
a = list(map(int,input().split()))
a_sum = sum(a)
aa = np.array(a)
aaa = np.cumsum(aa)
aaa = aaa
all_a = sum(a)
ans = 0
for i in range(n-1):
ans += (a[i]%(10**9+7) * (all_a - aaa[i]))
print(ans%(10**9+7)) |
p03854 | s700907519 | Accepted | S = input()
C = ['dream', 'dreamer', 'erase', 'eraser']
while S:
for c in C:
if S.endswith(c):
S = S[:-len(c)]
break
else:
print('NO')
break
else:
print('YES')
|
p02717 | s746264563 | Accepted | # coding: utf-8
X, Y, Z = map(int, input().strip().split())
A = Z
B = X
C = Y
print(A, B, C) |
p03329 | s694201703 | Accepted | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
n = ni()
dp = [99999999]*(n+1)
dp[0] = 0
for i in range(1, n+1):
dp[i] = dp[i-1] + 1
k = 6
while i-k >= 0:
dp[i] = min(dp[i], dp[i-k]+1)
k *= 6
k = ... |
p02882 | s516462248 | Accepted | import numpy as np
a,b,x=map(int,input().split())
hanbun=a*a*b/2
if x<hanbun:
teihen = x/(a*b/2)
katamuki = b/teihen
kakudo = np.rad2deg(np.arctan(katamuki))
else:
teihen = (a*a*b-x)/(a*a/2)
katamuki = teihen/a
kakudo = np.rad2deg(np.arctan(katamuki))
print(kakudo) |
p02802 | s401494738 | Wrong Answer | from collections import defaultdict
N,M = map(int,input().split())
AC_List = defaultdict(int)
WA_List = defaultdict(int)
for i in range(M):
Num,Sta = map(str,input().split())
if Num in AC_List:
continue
else:
if Sta == "WA":
WA_List[Num] += 1
else:
AC_List[Nu... |
p02951 | s335932018 | Accepted | def main():
a,b,c=map(int, input().split())
print(max(0, c-a+b))
if __name__ == "__main__":
main() |
p02711 | s952699993 | Accepted | import sys
N = input()
for ch in N:
if ch == '7':
print('Yes')
sys.exit()
print('No') |
p02777 | s848034114 | Accepted | # coding: utf-8
s,t = input().split()
a,b = map(int, input().split())
u = input()
if u == s:
print(a-1, b)
else:
print(a,b-1) |
p02983 | s388292982 | Accepted | def solve():
L, R = map(int, input().split())
ans = 10 ** 10
for i in range(L, min(L+2019, R)):
for j in range(L+1, min(L+2019, R) + 1):
ans = min(ans, i * j % 2019)
return ans
print(solve())
|
p03821 | s944759075 | Accepted | n = int(input())
ab = [[int(i) for i in input().split()] for _ in range(n)]
ans = 0
for i in range(n)[::-1]:
if (ab[i][0]+ans)%ab[i][1]==0:
y = 0
else:
y = ab[i][1] - ((ab[i][0]+ans)%ab[i][1])
ans += y
print(ans) |
p02701 | s881192395 | Accepted | N = int(input())
S = [0]*N
for i in range(N):
S[i] = input()
print(len(set(S))) |
p02988 | s140745797 | Accepted | n = int(input())
p = list(map(int, input().split()))
num = 0
for i in range(1, n-1):
if p[i-1] < p[i] < p[i+1] or p[i-1] > p[i] > p[i+1]:
num += 1
print(num) |
p02994 | s495738938 | Wrong Answer | n,l= map(int, input().split())
lt=[]
for i in range(n):
lt.append(abs(i+1+l-1))
lt.sort()
print(sum(lt[1:])) |
p03796 | s209179981 | Accepted | N = int(input())
MOD = 10**9+7
ans = 1
for i in range(N):
ans *= i+1
ans %= MOD
print(ans) |
p02718 | s086111554 | Wrong Answer | a,b=map(int,input().split())
c=list(map(int,input().split()))
c=[i for i in c if i>a/(4*b)]
if len(c)<b:
print("No")
else:
print("Yes") |
p03323 | s909651679 | Accepted | def main():
A, B = map(int, input().split())
if A > 8 or B > 8:
print(":(")
else:
print("Yay!")
if __name__ == "__main__":
main() |
p03127 | s698929736 | Accepted | import math
N = int(input())
A = list(map(int, input().split()))
ans = A[0]
for i in range(1, N):
ans = math.gcd(A[i], ans)
print(ans) |
p02596 | s425003178 | Wrong Answer | #abc174_c
k=int(input())
# kの倍数が登場 -> 77...777%k==0となる最小の77の長さは？
if k%2==0:
print(-1)
exit()
if k==7:
print(1)
exit()
rem=7%k
for i in range(2,k+1):
rem=(rem*10+7)%k
if rem==0:
print(i)
exit()
print(-1)
|
p03804 | s719175863 | Wrong Answer | n, m = map(int, input().split())
grida = []
gridb = []
for i in range(n):
grida.append(list(input()))
for i in range(m):
gridb.append(list(input()))
ans = False
for i in range(n-m):
for j in range(n-m):
bad = False
for k in range(m):
for l in range(m):
if grida[... |
p03419 | s988291986 | Accepted | import sys
import os
def file_input():
f = open('ARC091/input.txt', 'r')
sys.stdin = f
def main():
#file_input()
# int(input())
N,M=map(int, input().split())
if N==1 and M==1:
print(1)
elif N==1 or M==1:
print(N*M-2)
else:
print(N*M-4-(N+M-4)*2)
if __name__ ==... |
p02854 | s586684467 | Wrong Answer | N ,*A = map(int,open(0).read().split())
L = [0 for i in range(N+1)]
D = [0 for i in range(N)]
for i,a in enumerate(A,1):
L[i] = L[i-1] + a
for i in range(N):
D[i] = L[-1]-L[i]
#L.pop(0)
print(L)
print(D)
ans = 1e19
for i in range(N):
#print(L[i],D[i],L[i]-D[i])
ans = min(abs(L[i]-D[i]),ans)
print(ans) |
p03106 | s563635440 | Accepted | def main():
A, B, K = map(int, input().split())
count = 0
for i in range(100, 0, -1):
if (A % i == 0) and (B % i == 0):
count += 1
if count == K:
print(i)
break
main() |
p02622 | s460655606 | Accepted | S = input()
T = input()
count = 0
for i in range(len(S)):
if S[i] != T[i]:
count += 1
print(count) |
p02765 | s921107661 | Accepted | n, r =map(int,input().split())
if n >= 10:
print(r)
else:
print(r+1000-100*n) |
p03524 | s513735062 | Accepted | *x,=map(input().count,"abc");print("YNEOS"[max(x)>-~min(x)::2]) |
p02832 | s559173984 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = 1
ans = 0
if a.count(1) == 0:
print(-1)
exit()
for i in range(n):
if a[i] != cnt:
ans += 1
else:
cnt += 1
print(ans) |
p02747 | s153176092 | Accepted | S = input()
tmp = ""
for i in range(5):
tmp += "hi"
if tmp == S:
print("Yes")
exit()
print("No") |
p03061 | s518066783 | Accepted | from math import gcd
N = int(input())
A = list(map(int, input().split()))
if N == 2:
print(max(A))
else:
r = max(gcd(A[0], A[1]), gcd(A[1], A[2]), gcd(A[2], A[0]))
a = gcd(A[0], gcd(A[1], A[2]))
for i in range(3, N):
r = max(gcd(A[i], r), a)
a = gcd(A[i], a)
print(r) |
p03951 | s784273250 | Wrong Answer | # AtCoder Grand Contest 006
# A - Prefix and Suffix
N=int(input())
s=input()
t=input()
if s==t:
print(N)
exit()
else :
pass
l=0
for i in range (N):
if t[i]==s[-1*(i+1)]:
pass
else:
l=i
break
print(2*N-l) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.