problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02546 | s677574912 | Accepted | inps = input()
if inps[-1] == "s":
print(inps + "es")
else:
print(inps + "s") |
p02814 | s164820491 | Accepted | from math import gcd
n,m=map(int,input().split())
a=list(map(int,input().split()))
a=list(set(a))
a=list(map(lambda x: x//2, a))
def lcm(q):
x = q[0]
for i in range(1, len(q)):
x = (x * q[i]) // gcd(x, q[i])
return x
lcma=lcm(a)
for i in range(len(a)):
if (lcma//a[i])%2==0:
print(0)
exit()
temp=m//lcma
print(temp//2 if temp%2==0 else temp//2+1) |
p03087 | s534922913 | Wrong Answer | n,q=map(int,input().split())
s=input()
c=[0 for _ in range(n)]
p=''
for i in range(1,n):
x=s[i]
if p=='A' and x=='C':
c[i-1]=1
p=x
for i in range(q):
ans=0
l,r=map(int,input().split())
ans=sum(c[l-1:r-1])
# if s[]
print(ans)
|
p03328 | s631843377 | Wrong Answer | A,B=map(int,input().split())
H=[0]*1000
i=1
while i<=999:
H[i]=i+H[i-1]
i+=1
ans=0
while True:
if (A+ans in H)and(B+ans in H):
break
else:
ans+=1
print(ans) |
p02682 | s551963204 | Wrong Answer | A,B,C,K=list(map(int,input().split()))
if A+B>=K:
print(A)
exit()
print(A-(K-(A+B)))
|
p02879 | s993760322 | Wrong Answer | A,B=map(int,input().split())
for i in range(1,10):
for j in range(1,10):
if A*B==i*j:
print(A*B)
exit(0)
print("-1") |
p03860 | s546075882 | Wrong Answer | N = str(input())
print('A'+ N[0] + 'C')
|
p03328 | s862268481 | Accepted | a, b = map(int, input().split())
d = b-a
h2 = d*(d+1)/2
print(int(h2-b)) |
p03481 | s171968934 | Accepted | import math
x,y=map(int,input().split())
f=0
for i in range(100):
if x*2**i==y:
f=1
print(math.ceil(math.log2(y)-math.log2(x))+f) |
p03478 | s416207704 | Accepted | N, A, B = map(int, input().split())
ans = 0
for i in range(1, N + 1):
num = str(i)
total = 0
for n in num:
total += int(n)
if total >= A and total <= B:
ans += i
print(ans)
|
p03997 | s155211116 | Accepted | from sys import stdin
def main():
#入力
readline=stdin.readline
a=int(readline())
b=int(readline())
h=int(readline())
print((a+b)*h//2)
if __name__=="__main__":
main() |
p02795 | s651446171 | Accepted | H = int(input())
W = int(input())
N = int(input())
m = max(H,W)
if N%m == 0:
print(N//m)
else:
print(N//m + 1) |
p02996 | s157094392 | Wrong Answer | N=int(input())
AB=[list(map(int,input().split())) for _ in range(N)]
AB.sort(key=lambda x:x[1])
SUM_=0
for i in range(N):
SUM_+=AB[i][0]
if SUM_<=AB[-1][-1]:
print('Yes')
else:
print('No') |
p03221 | s711689432 | Wrong Answer | n,m=map(int,input().split())
py=[list(map(int,input().split())) for i in range(m)]
l=[[] for j in range(n)]
for p,y in py:
l[p-1].append(y)
for j in range(n):
l[j].sort()
for j in range(n):
for t in range(len(l[j])):
pre='0'*(6-len(str(j+1)))+str(j+1)
y='0'*(6-len(str(t+1)))+str(t+1)
print(pre+y) |
p04019 | s306284684 | Accepted | from collections import Counter
S = input()
if "N" in S and "S" not in S:
print("No")
elif "S" in S and "N" not in S:
print("No")
elif "E" in S and "W" not in S:
print("No")
elif "W" in S and "E" not in S:
print("No")
else:
print("Yes")
|
p03719 | s760833758 | Accepted | a, b, c = map(int, input().split())
print("Yes" if c >= a and c <= b else "No") |
p03317 | s281714387 | Accepted | n,k = map(int,input().split())
A = list(map(int,input().split()))
from math import ceil
def main():
print(ceil((n-1)/(k-1)))
if __name__ == "__main__":
main()
|
p02813 | s429832787 | Wrong Answer | import itertools
N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
# Nが10程度で小さい
# 階乗の全探索をしても間に合う
# Pythonならitertoolsが使える
# permutations（関数）にlistを渡すと、順列を生成！
l = [i for i in range(1, N+1)]
permutations_l = list(itertools.permutations(l))
a, b = 0, 0
for i, R in enumerate(permutations_l):
if R == P: a = i
elif R == Q: b = i
print(abs(a-b)) |
p03835 | s898177813 | Accepted | k, s = map(int, input().split())
counts = 0
for x in range(k+1):
if (s - x) > 2 * k:
continue
for y in range(min(k+1, s-x+1)):
if (s - x - y) <= k:
counts += 1
print(counts) |
p03126 | s104332656 | Accepted | n,m = map(int,input().split())
cnt = [0] * 100
for i in range(n):
a = list(map(int,input().split()))[1:]
for j in a:
cnt[j] += 1
print(sum(i == n for i in cnt))
|
p02677 | s721074822 | Wrong Answer | import math
a,b,h,m = map(int , input().split())
long_needle =(5 * m)/60 + h * 5
sort_needle = m
ans = math.sqrt(a**2 + b **2 - 2*a*b*abs(math.cos(abs(math.pi*(long_needle-sort_needle))/30)))
print(ans)
|
p03607 | s948427499 | Accepted | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n = ii()
s = set()
for i in range(n):
num = ii()
if num in s:
s.remove(num)
else:
s.add(num)
print(len(s)) |
p02766 | s639075209 | Accepted | n, k = map(int, input().split())
i = 0
while n >= k**i:
i+=1
print(i) |
p04020 | s907907044 | Accepted | n=int(input())
a=[int(input()) for i in range(n)]
ans=0
for i in range(n-1):
ans+=a[i]//2
if a[i+1]:
a[i+1]+=a[i]%2
ans+=a[-1]//2
print(ans) |
p03331 | s718143545 | Accepted | n = int(input())
ans = float("inf")
for i in range(1, n):
a = sum([int(i) for i in list(str(i))])
b = sum([int(i) for i in list(str(n-i))])
if ans > a+b:
ans = a + b
print(ans) |
p03951 | s173761949 | Accepted | n = int(input())
s = input()
t = input()
f = 0
m = 0
ind = 0
for i in range(1,n+1):
if(s[n-i:]==t[:i]):
f=1
if (len(t[:i])>m):
m = len(t[:i])
ind = i
print(2*n-ind) if f==1 else print(2*n)
|
p03075 | s868950239 | Wrong Answer | a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
l = max(b - a, c - b, d - c, e - d)
if l < k:
print("Yay!")
else:
print(":(") |
p02597 | s852100769 | Accepted | N = int(input())
c = input()
white = 0
white_ends = 0
for i in range(N):
if c[i] == "W":
white += 1
for i in range(N-white, N):
if c[i] == "W":
white_ends += 1
print(white-white_ends) |
p02860 | s388656766 | Accepted | input()
l = input()
print("NYoe s"[l[0:int(len(l)/2)] == l[int(len(l)/2):len(l)]::2]) |
p02732 | s381794123 | Accepted | n = int(input())
a = [int(_) for _ in input().split()]
num_cnt = [0] * 200001
for i in a:
num_cnt[i] += 1
pat_cnt = [0] * 200001
for i in range(200001):
b = num_cnt[i]
pat_cnt[i] = (b*(b-1))//2
ans = sum(pat_cnt)
for i in range(n):
#print(ans, pat_cnt[a[i]], num_cnt[a[i]])
print(ans - pat_cnt[a[i]] + ((num_cnt[a[i]]-1) * (num_cnt[a[i]]-2))//2)
|
p02714 | s141045476 | Accepted | n = int(input())
s = input()
c = s.count('R')*s.count('G')*s.count('B')
for i in range(n):
for j in range(i+1,n):
if j + j - i >= n:break
# print(j+j-i+1)
if s[i]!=s[j] and s[j]!=s[j+j-i] and s[i]!=s[j+j-i]:
c-=1
print(c) |
p02724 | s843230582 | Accepted | X = int(input())
quot1, rem = divmod(X,500)
quot2 = rem // 5
print(quot1*1000 + quot2*5) |
p02795 | s558753205 | Wrong Answer | a = int(input())
b = int(input())
n = int(input())
t = max(a, b)
print(n + t - 1 / t) |
p03360 | s166559464 | Wrong Answer | def main():
a = list(map(int, input().split()))
k = int(input())
a.sort()
print(a[0]+a[1]+a[2]*2*k)
if __name__ == "__main__":
main()
|
p02882 | s429443157 | Accepted | import math
a, b, x = map(int, input().split())
def calc(theta):
h = math.tan(theta) * a
if h <= b:
s = 1 / 2 * a * a * h
else:
c = h - b
s = 1 / 2 * a * a * h
s = s - s * ((c / h) ** 2)
return s
l, r = 0.0, math.pi / 2
while abs(r - l) > 1e-12:
m = (l + r) / 2
rem = a * a * b - calc(m)
if rem >= x:
l = m
else:
r = m
print(l * 180 / math.pi) |
p03345 | s926249814 | Wrong Answer | a, b, c, k = map(int, input().split())
flag = True
for i in range(10**18):
if k == 0:
break
if a == b and b == c:
break
A = a
B = b
C = c
a = B + C
b = A + C
c = A + B
if i == k - 1:
break
if a * 2 > 10**18 + c:
flag = False
break
if flag:
print(a - b)
else:
print('Unfair')
|
p02729 | s887624549 | Accepted | N, M = map(int, input().split())
print(N*(N-1)//2 + M*(M-1)//2) |
p03745 | s353776350 | Accepted | N= int(input())
now=0
ans=1
S=0
l=list(map(int,input().split()))
for i in range(1,N):
X=l[i]-l[i-1]
X=0 if X==0 else 1 if X>0 else -1
if X==0:
continue
elif S ==0:
S=X
elif S != X:
ans+=1
S=0
print(ans) |
p02732 | s070504496 | Accepted | from sys import stdin,setrecursionlimit
n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
lin = [0]*(n+1)
for i in li:
lin[i] += 1
liv = [0]*(n+1)
point = 0
for j,k in enumerate(lin):
point += k*(k-1)//2
liv[j] += k*(k-1)//2
for i in li:
print(point-liv[i]+(lin[i]-1)*(lin[i]-2)//2) |
p02570 | s472302346 | Accepted | D, T, S = map(int, input().split())
if S*T >= D:
print("Yes")
else:
print("No")
|
p02552 | s843943748 | Accepted | def main():
n = int(input())
if n == 1:
print(0)
else:
print(1)
if __name__ == "__main__":
main() |
p02947 | s696517262 | Accepted | # -*- coding: utf-8 -*-
N = int(input())
import collections
s_frq_dict = collections.defaultdict(int)
for _ in range(N):
s = [c for c in input()]
s.sort()
s_frq_dict[tuple(s)] += 1
ret = 0
for frq in s_frq_dict.values():
ret += int(frq * (frq-1) * 0.5)
print(ret) |
p03161 | s105578821 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
'''
------------------------
author : iiou16
------------------------
'''
import numpy as np
def main():
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H = np.array(H)
cost = np.array([100000] * N)
cost[0] = 0
for i in range(1, N):
cost[i] = min(
cost[max(i - K, 0)] + abs(H[i] - H[max(i - K, 0): i]))
# print(i, cost[i])
print(cost[N - 1])
if __name__ == '__main__':
main()
|
p02711 | s485118942 | Wrong Answer | s = 0
k = int(input())
def gcd(p,q):
if p%q == 0:
return q
return gcd(q, p%q)
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
s += gcd(gcd(a,b),c)
print(s) |
p03339 | s332638684 | Wrong Answer | import bisect
n = int(input())
s = input()
elist = []
wlist = []
for i in range(n):
if s[i] == "E":
elist.append(i)
elif s[i] == "W":
wlist.append(i)
ans = 10**18
lenelist = len(elist)
"""
西にいるWを数える
東にいるEを数える
"""
for i in range(n):
tmp = lenelist-bisect.bisect_left(elist, i)+bisect.bisect_left(wlist, i)
ans = min(tmp, ans)
print(ans) |
p03474 | s255443794 | Wrong Answer | a, b = map(int, input().split())
s = input()
flg = 0
for i in range(a +b):
try:
if (0 <= int(s[i]) <= 9):
if i == a:
flg = 0
except:
if i == a:
flg = 1
else:
flg = 0
print("Yes" if flg == 1 else "No") |
p02860 | s564758660 | Wrong Answer | S = input()
if len(S) % 2 != 0:
matched = False
else:
matched = True
index = len(S)//2
for i in range(index):
if S[i] != S[index+i]:
matched = False
break
if matched:
print('Yes')
else:
print('False') |
p02818 | s541152361 | Accepted | a, b, k = map(int, input().split())
if a >= k:
a -= k
print(a, b)
else:
k -= a
a = 0
if b >= k:
b -= k
print(a, b)
else:
b = 0
print(a, b) |
p02720 | s213691190 | Accepted | from collections import deque
n = int(input())
c = 0
q = deque()
for i in range(1, 10):
q.append(i)
k = 1
while c < n:
k = q.popleft()
# print(k)
if k%10:
q.append(10*k + k%10 - 1)
q.append(10 * k + k % 10)
if k%10 != 9:
q.append(10*k + (k%10) + 1)
c += 1
print(k) |
p03612 | s270910420 | Accepted | n=int(input())
p=list(map(int,input().split()))
ans=0
cnt=0
for i in range(n):
if p[i]==i+1:
cnt+=1
if cnt==2:
ans+=1
cnt=0
elif cnt==1:
ans+=1
cnt=0
if cnt==1:
ans+=1
print(ans) |
p03221 | s869817162 | Wrong Answer | N,M=map(int,input().split())
shi=[[] for i in range(N+1)]
py=[]
for i in range(M):
p,y=map(int,input().split())
shi[p].append(y)
py.append([p,y])
for i in range(N):
shi[i].sort()
shidic=[{} for i in range(N+1)]
for i in range(N+1):
for j in range(len(shi[i])):
shidic[i][shi[i][j]]=j+1
for P,Y in py:
print(str(P).zfill(6)+str(shidic[P][Y]).zfill(6)) |
p03481 | s448247899 | Accepted | x, y = map(int, input().split())
ans = 0
while x <= y:
x *= 2
ans += 1
print(ans) |
p02582 | s219388722 | Wrong Answer | s = input()
ans = 0
if 'RRR' in s:
ans == 3
elif 'RR' in s:
ans = 2
elif 'R' in s:
ans = 1
else:
ans = 0
print(str(ans)) |
p03416 | s745477583 | Wrong Answer | a, b = map(int, input().split())
ans = 0
for i in range(a, b+1):
s = str(i)
sl = len(s) // 2
if s[:sl] == s[sl+1:]: ans += 1
print(ans) |
p03565 | s330770317 | Accepted | S = input()[::-1]
T = input()[::-1]
flag = False
for i in range(len(S) - len(T) + 1):
matched = True
for j in range(len(T)):
if S[i + j] != "?" and S[i + j] != T[j]:
matched = False
break
if matched:
S = S[:i] + T + S[i + len(T):]
flag = True
break
if flag:
print(S.replace("?", "a")[::-1])
else:
print("UNRESTORABLE") |
p03795 | s278341438 | Wrong Answer | N = int(input('整数を入力してね>'))
X = int(800 * N)
Y = int(int(N/15)*200)
print(X - Y) |
p03126 | s677802273 | Accepted | N, M = map(int, input().split())
l = list()
for a in range(0, N):
L = list(map(int, input().split()))
L.pop(0)
l.append(L)
count = [0]*(M)
for a in l:
for b in a:
count[b-1] += 1
print(len(list(filter(lambda x: x == N, count))))
|
p03284 | s559183991 | Wrong Answer | N, K = map(int,input().split())
if N >= K :
print(N % K)
else :
print(1)
|
p03161 | s300635847 | Accepted | #!/usr/bin/env python3
def main():
N, K = map(int, input().split())
H = [int(x) for x in input().split()] + [0] * 200
INF = 10 ** 10
dp = [INF] * 10 ** 6
dp[0] = 0
for i in range(N):
for k in range(1, K + 1):
dp[i + k] = min(dp[i + k], dp[i] + abs(H[i] - H[i + k]))
print(dp[N - 1])
if __name__ == '__main__':
main()
|
p02761 | s568510655 | Wrong Answer | N, M = map(int, input().split(" "))
ans = [-1 for i in range(N)]
is_conflict = False
for i in range(M):
s, c = map(int, input().split(" "))
if ans[s - 1] == -1:
ans[s - 1] = c
else:
is_conflict |= (ans[s - 1] != c)
for i in range(N):
if i == 0 and ans[i] == -1:
ans[i] = 1
elif ans[i] == -1:
ans[i] = 0
if len(str(int(''.join([str(a) for a in ans])))) != N or is_conflict:
print(-1)
else:
print(''.join([str(a) for a in ans]))
|
p02957 | s858505524 | Accepted | n,m = (int(x) for x in input().split())
if n%2 != m%2:
print('IMPOSSIBLE')
else:
print(int((n+m)/2)) |
p03062 | s937003090 | Accepted | def main():
n = int(input())
a = [int(x) for x in input().split()]
count_negative = 0
for i in range(n):
if a[i] < 0:
count_negative += 1
a = [abs(x) for x in a]
answer = sum(a)
if count_negative % 2:
answer -= 2 * min(a)
print(answer)
if __name__ == '__main__':
main()
|
p02658 | s803098762 | Accepted | # -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline
n = input()
a = [int(i) for i in input().split()]
ans = 1
if 0 in a:
print("0")
sys.exit()
for aa in a:
ans = ans * aa
if ans > 10**18:
print("-1")
sys.exit()
print(ans) |
p02726 | s742853124 | Accepted | N, X, Y = map(int, input().split())
count = [0] * N
a = 0
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
a = min(j - i, abs(X - i) + abs(Y - j) + 1)
count[a] += 1
for i in range(1, N):
print(count[i]) |
p03592 | s869072672 | Wrong Answer | N, M, K = map(int, input().split())
black = 0
for n in range(N+1):
black += M*n
for m in range(M+1):
black -= n*m
black += (N-n)*m
if black==K:
print('Yes')
exit()
print('No') |
p02657 | s064012672 | Accepted | a, b = map(int, input().split())
print(a*b)
|
p02725 | s572855423 | Accepted | kn = input().split()
a = input().split()
al = [int(i) for i in a]
k = int(kn[0])
n = kn[1]
ml = k - abs(al[len(al)-1] - al[0])
for i in range(len(al)-1):
ml = max(ml,abs(al[i]-(al[i+1])))
print(k-ml)
|
p03262 | s788136412 | Accepted | from math import gcd
N,X=map(int,input().split())
x = list(map(int,input().split()))
if N == 1:
print(abs(X-x[0]))
exit()
diff = [abs(X-x[i]) for i in range(N)]
for i in range(1,N):
if i == 1:
total_gcd = gcd(diff[i],diff[i-1])
else:
total_gcd = gcd(diff[i],total_gcd)
print(total_gcd) |
p03037 | s135208192 | Wrong Answer | N,M=map(int,input().split())
s=[list(map(int,input().split())) for i in range(M)]
t=[i+1 for i in range(N)]
for j in range(M):
for k in range(len(t)):
if s[j][0]>t[k]:
t[k]=0
if s[j][1]<t[k]:
t[k]=0
t=set(t)
print(len(t)-1) |
p03037 | s909413910 | Accepted | n, m = map(int, input().split())
list_score = [ list(map(int,input().split(" "))) for i in range(m)]
left = 1
right = n
for i in range(m):
k = list_score[i]
if left < k[0]:
left = k[0]
if right > k[1]:
right = k[1]
if left > right:
print(0)
else:
print(right-left+1)
|
p03239 | s905447134 | Accepted | N,T=map(int,input().split())
l=[list(map(int,input().split())) for i in range(N)]
c=[i[0] for i in l if i[1]<=T]
print(min(c) if c else "TLE") |
p02848 | s320178097 | Accepted | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n = ii()
s = list(input())
ans = []
alpha = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
for i in s:
ans.append(alpha[(alpha.index(i)+n)%26])
print(''.join(ans)) |
p02719 | s910107525 | Accepted | n, k = (int(i) for i in input().split())
flag = True
n = n % k
ans = n
if(ans > abs(n-k)):
ans = abs(n-k)
print(ans)
|
p02971 | s855024909 | Accepted | import sys
input = sys.stdin.readline
N = int(input())
A = [int(input()) for _ in range(N)]
a1, a2 = sorted(A)[::-1][:2]
for a in A:
if a != a1:
print(a1)
else:
print(a2)
|
p02641 | s046855910 | Wrong Answer | x,n=map(int,input().split())
p=list(map(int,input().split()))
q=list(range(-1,101))
for i in range(n):
q.remove(p[i])
ans=0
for i in q:
if abs(x-i)==abs(x-ans):
ans=min(i,ans)
elif abs(x-i)<abs(x-ans):
ans=i
print(ans) |
p02664 | s167597360 | Accepted |
s=list(input())
for i in range(len(s)):
if s[i]=='?':
s[i]='D'
L=[str(a) for a in s]
L="".join(L)
print(L) |
p02820 | s998411009 | Wrong Answer | import math
N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
G = []
for i in range(K):
G.append([])
for i in range(len(T)):
G[i % K].append(T[i]) |
p03136 | s192410332 | Accepted | n=int(input())
l=list(map(int,input().split()))
sl=sorted(l)
if sl[-1]<sum(sl[:-1]):
print("Yes")
else:
print("No")
|
p02742 | s051033143 | Accepted | H, W = map(int, input().split())
if H > 1 and W > 1:
if H % 2 == 0:
result = W * (H // 2)
else:
if W % 2 == 0:
result = W * (H // 2) + (W // 2)
else:
result = W * (H // 2) + (W // 2) + 1
else:
result = 1
print(result) |
p02630 | s780798440 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
q=int(input())
dic={}
for i in range(len(a)):
dic.setdefault(a[i],1)
dic[a[i]]+=1
answer=sum(a)
for i in range(q):
b,c=map(int,input().split())
dic.setdefault(b,0)
dic.setdefault(c,0)
dic[c]+=dic[b]
answer=answer+dic[b]*c-dic[b]*b
dic[b] = 0
print(answer) |
p03759 | s079841638 | Accepted | a,b,c = map(int, input().split())
print('YES' if (a+c)/2 == b else 'NO') |
p02713 | s980346539 | Wrong Answer | import math
def gcd(A,B,C):
output = 1
maxi = max(A,B,C)
maximum = math.sqrt(maxi)
maxim = round(maximum)+1
for i in range(maxim,1,-1):
if ((A%i == 0) and (B%i == 0) and (C%i == 0)):
output = i
break
return output
K = int(input())
sum = 0
for A in range(1,K+1):
for B in range(1,K+1):
for C in range(1,K+1):
sum = sum + gcd(A,B,C)
print(sum)
|
p03086 | s825034857 | Accepted | import re
S = input()
ACGT = re.findall('[ACGT]+',S)
if len(ACGT) > 0:
print(max([len(s) for s in ACGT]))
else:
print(0) |
p03544 | s177068396 | Accepted | n=int(input())
luc=[0]*87
luc[0]=2
luc[1]=1
for i in range(2,87):
luc[i]=luc[i-1]+luc[i-2]
print(luc[n]) |
p03487 | s220136922 | Wrong Answer | from collections import Counter
n = int(input())
a = list(map(int,input().split()))
cnt = Counter(a)
ans = 0
for i in cnt.items():
dif = i[1] - i[0]
delete = i[1]
ans += min(dif ,delete)
print(ans) |
p03250 | s493434168 | Accepted | a,b,c=map(int,input().split())
m=min(a,b,c)
M=max(a,b,c)
n=a+b+c-m-M
print(M*10+n+m) |
p02848 | s822659088 | Accepted | n=int(input())
a=input()
L=[]
for i in range(26):
L.append(chr(65+i))
news=''
for i in range(len(a)):
news+=L[L.index(a[i])+n-26]
print(news)
|
p03206 | s144101310 | Accepted | print(['Christmas Eve Eve Eve','Christmas Eve Eve','Christmas Eve','Christmas'][int(input())-22]) |
p03645 | s002108084 | Accepted | N, M = map(int, input().split())
liners = {}
for i in range(M):
a, b = map(int, input().split())
liners.setdefault(a, [])
liners[a].append(b)
ans = "IMPOSSIBLE"
for i in liners[1]:
if i in liners and N in liners[i]:
ans = "POSSIBLE"
break
print(ans)
|
p03835 | s757978131 | Wrong Answer | K,N=map(int,input().split())
cnt=0
def souatari(K,N):
ans=0
if 2*K<N:
return 0
elif 2*K>=N and K<N:
return 2*K-N+1
elif K>=N:
return N+1
for i in range(K+1):
cnt+=souatari(K,N-i)
print(cnt)
1,9
2,8
3,7
4,6
5,5
2,9
3,8
4,7
5,6
0,10
1,9
2,8
3,7
4,6
5,5
|
p03962 | s594285290 | Wrong Answer | data = [int(i) for i in input().split()]
count = 0
for i in range(len(data)):
for j in range(i+1, len(data)):
if (data[i] == data[j]):
count += 1
else:
continue
print(count) |
p03012 | s786795325 | Accepted | import sys
stdin = sys.stdin
mod = 1000000007
inf = 1 << 60
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
n = ni()
w = na()
ans = inf
s = sum(w)
p = 0
for i in range(n):
p += w[i]
ans = min(ans, abs(s - p - p))
print(ans) |
p02699 | s508322029 | Accepted | # -*- coding: utf-8 -*-
s, w = map(int, input().split(' '))
if s > w:
print('safe')
else:
print('unsafe')
|
p02843 | s300794910 | Wrong Answer | X = int(input())
def hoge(X):
if ((X%100)%5) + 1 <= X//100:
return 1
else:
return 0
print(hoge(X))
|
p03796 | s595346164 | Accepted | import math
N = int(input())
print(math.factorial(N)%(10**9+7)) |
p03475 | s921414244 | Accepted | n=int(input())
csf=[list(map(int,input().split())) for _ in range(n-1)]
for i in range(n-1):
ans=0
for j in range(i,n-1):
c = csf[j][0]
s = csf[j][1]
f = csf[j][2]
if j==i:
ans+=s+c
else:
if ans<s:
ans=s+c
else:
ans+=(f-(ans-s)%f)%f+c
print(ans)
print(0) |
p03827 | s498294328 | Wrong Answer | n = int(input())
s = input()
ans = []
x = 0
for i in range(n):
if s[i] == "I":
x +=1
ans.append(x)
elif s[i] == "D":
x -=1
ans.append(x)
ans.sort(reverse=True)
print(ans[0]) |
p03611 | s869555015 | Accepted | from collections import Counter as CC
N = int(input())
a = list(map(int, input().split()))
b = CC(a)
X1, X2, X3 = 0, b[min(b)], b[min(b)+1]
count = X1 + X2 + X3
ans = count
for i in range(min(b) + 2, max(b) + 1):
count -= X1
X1, X2, X3 = X2, X3, b[i]
count += X3
ans = max(ans, count)
else:
print(ans) |
p03261 | s117799061 | Wrong Answer | def main():
n = int(input())
word_lst = [""] * n
previous_word = input()
ok = True
for i in range(1,n):
now_word = input()
if not (now_word[0] == previous_word[-1]):
ok = False
break
previous_word = now_word
print("Yes" if ok else "No")
if __name__ == '__main__':
main()
|
p03774 | s060489689 | Accepted | n, m = map(int,input().split())
students = [None]*n
points = [None]*m
for i in range(n):
students[i] = tuple(map(int,input().split()))
for i in range(m):
points[i] = tuple(map(int,input().split()))
ans = []
for s in students:
tmp = []
for p in points:
tmp.append(abs(s[0] - p[0]) + abs(s[1] - p[1]))
ans.append(tmp.index(min(tmp)) + 1)
for i in range(n):
print(ans[i]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.