problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03221 | s804066950 | Accepted | import bisect
n,m = map(int,input().split())
x = [list() for i in range(n)]
p = []
y = []
for i in range(m):
s,t = map(int,input().split())
p.append(s)
y.append(t)
x[s-1].append(t)
for i in range(n):
x[i].sort()
for i in range(m):
index = bisect.bisect_left(x[p[i]-1],y[i])
print("{:06}{:06}".format(p[i... |
p02546 | s300175817 | Accepted | S = input()
if S[-1] == 's':
print(S+'es')
else:
print(S+'s') |
p03239 | s812291119 | Accepted | N, T = map(int, input().split())
cost = []
for _ in range(N):
c, t = map(int, input().split())
if t <= T:
cost.append(c)
print('TLE' if len(cost) == 0 else min(cost)) |
p02630 | s622259883 | Accepted | from collections import Counter
N=int(input())
A=list(map(int,input().split()))
cnt=[0]*(10**5+10)
for a in A:
cnt[a]+=1
s=sum(A)
Q=int(input())
for _ in [0]*Q:
b,c=map(int,input().split())
s+=cnt[b]*(c-b)
cnt[c]+=cnt[b]
cnt[b]=0
print(s) |
p02801 | s230572448 | Accepted | #!/usr/bin/env python3
import sys
import string
def solve(C: str):
print(chr(ord(C) + 1))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
... |
p03136 | s030588639 | Accepted | n = int(input())
l = list(map(int,input().split()))
sl = sum(l)
ans = 'Yes'
for i in l:
if sl - i*2 <= 0:
ans = 'No'
print(ans) |
p03331 | s295188217 | Accepted | N = int(input())
v = float("inf")
for a in range(1, N):
b = N - a
c = sum(map(int, str(a))) + sum(map(int, str(b)))
if c < v:
v = c
print(v) |
p02790 | s242071117 | Accepted | def main():
x, y = map(int, input().split(' '))
if y >= x:
print(str(x) * y)
else:
print(str(y) * x)
if __name__ == '__main__':
main()
|
p02795 | s446617343 | Accepted | # -*- coding: utf-8 -*-
H,W,N = [int(input()) for _ in range(3)]
ans = N/max(H,W) if N%max(H,W)==0 else N/max(H,W)+1
print(int(ans)) |
p03000 | s390185170 | Accepted | import bisect
N, X = map(int, input().split())
l = list(map(int, input().split()))
d = [-1]*(N+1) #0-index #バウンドする位置を格納するリスト
d[0] = 0 #バウンドする初期値は0
for i in range(1, N+1):
d[i] = d[i-1] + l[i-1]
#print(d)
#print('left:', bisect.bisect_left(d, X))
#print('right:', bisect.bisect_right(d, X))
print(bisect.bisect_rig... |
p03067 | s109403040 | Accepted | a, b, c = map(int, input().split())
print('Yes' if a > c > b or a < c < b else 'No') |
p02646 | s430224526 | Accepted | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
dist = abs(b - a)
mys = v - w
if mys * t >= dist:
print("YES")
else:
print("NO") |
p03109 | s249514358 | Accepted | S = input()
if S <= "2019/04/30":
print("Heisei")
else:
print("TBD")
|
p03086 | s862925839 | Accepted | ok='AGCT'
s=list(input())
cnt=0
ans=0
for si in s:
if si in ok:
cnt+=1
else:
ans = max(ans,cnt)
cnt=0
ans = max(ans,cnt)
print(ans) |
p03627 | s835624871 | Accepted | N = int(input())
A = sorted(list(map(int,input().split())),reverse = True)
edge = []
for i in range(1,N):
if A[i] == A[i - 1] and A[i] not in edge:
edge.append(A[i])
elif A[i] == A[i - 3]:
edge.append(A[i])
if len(edge) == 2:
break
if len(edge) <= 1:
print(0)
else:
print(edge[0] * edge[1... |
p03339 | s535961266 | Accepted | n = int(input())
s = list(input())
cum_s = []
wum = 0
eum = 0
for i in range(n):
if s[i] == "W":
wum += 1
else:
eum += 1
cum_s.append([wum,eum])
r = cum_s[-1]
ans = int(1e10)
for i in range(n):
tar = cum_s[i]
cnt = 0
if s[i] == "W":
cnt += tar[0]-1
cnt += r[1] - t... |
p03556 | s873082882 | Accepted | n = int(input())
for i in range(n, 0, -1):
if (i**0.5).is_integer():
print(i)
break |
p02712 | s144922904 | Accepted | N = int(input())
ans = 0
for i in range(1,N+1):
if (i%3 !=0) & (i%5!=0):
ans = ans +i
print(ans) |
p02957 | s242562401 | Wrong Answer | # -*- coding: utf-8 -*-
def main():
A, B = map(int, input().split())
if (A + B) % 2 == 0:
ans = (A + B) / 2
else:
ans = 'IMPOSSIBLE'
print(ans)
if __name__ == "__main__":
main() |
p02608 | s523462238 | Wrong Answer | from collections import Counter
def main():
n = int(input())
ans = []
for x in range(1, n):
for y in range(1, n):
for z in range(1, n):
ans.append(x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x)
counter = Counter(ans)
for i in range(1, n+1):
print(counte... |
p02797 | s927994342 | Accepted | n,k,s=map(int,input().split())
if s==10**9:
ans=[s]*k+[10**9-1]*(n-k)
else:
ans=[s]*k+[10**9]*(n-k)
print(*ans) |
p02608 | s029542843 | Accepted | # coding:utf-8
n = int(input())
ans = [0 for _ in range(10050)]
for i in range(1, 105):
for j in range(1, 105):
for k in range(1, 105):
v = i*i+j*j+k*k+i*j+j*k+k*i
if v < 10050: #vはnを表していて、vのところで与式を満たす
ans[v] += 1
for i in range(n):
print(ans[i+1]) |
p02952 | s443779684 | Accepted | n = int(input())
ans = 0
for i in range(1, n+1):
if len(str(i)) % 2 == 1:
# print(i)
ans += 1
print(ans)
|
p03665 | s711223449 | Wrong Answer | n,p=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n):
a[i]=a[i]%2
a.sort()
one=sum(a)
zero=n-one
if p==1 and one==0:
print(0)
exit()
print(2**(zero)*2**(one-1)) |
p02957 | s058463803 | Accepted | def main():
A, B = map(int, input().split())
if (A + B) % 2 == 0:
ans = (A + B) // 2
else:
ans = "IMPOSSIBLE"
print(ans)
if __name__ == "__main__":
main()
|
p03285 | s444531274 | Wrong Answer | import sys
def resolve():
N = int(input())
for i in range(4, 100, 4):
if N == i:
print("Yes")
return
for j in range(7, (100//7), 7):
if N == j:
print("Yes")
return
if N == i + j:
print("Yes")
... |
p03359 | s554887451 | Wrong Answer | a, b = map(int, input().split())
ans = 0
for i in range(1, a+1):
for j in range(1, b+1):
if i == j:
ans += 1
print(ans) |
p02706 | s233787613 | Wrong Answer | n,m = map(int,input().split())
a = list(map(int,input().split()))
print(a)
for i in range(m):
n=n-a[i]
if(i>=0):
print(n)
else:
print(-1) |
p03324 | s015381392 | Accepted | import math
def main():
d,n = list(map(int,input().split()))
if n==100:
n+=1
print(pow(100,d)*n)
main()
|
p03126 | s842347960 | Accepted | n,m=map(int, input().split())
table = [0]*m
c = 0
for i in range(n):
ans = list(map(int, input().split()))
for j in range(1,len(ans)):
table[ans[j]-1] += 1
for i in range(m):
if table[i] == n:
c += 1
print(c)
|
p02684 | s363889216 | Accepted | N, K = map(int, input().split())
A = list(map(lambda a: int(a) - 1, input().split()))
INF = 10**18
minDist = [INF] * N
minDist[0] = 0
now = 0
R = 0
while minDist[now] < INF:
to = A[now]
if minDist[to] < INF:
R = minDist[now] + 1 - minDist[to]
break
minDist[to] = minDist[now] + 1
now = ... |
p03796 | s173604104 | Accepted | n = int(input())
power = 1
for i in range(1,n+1):
power *= i
power = power % (10 ** 9 + 7)
print(power % (10 ** 9 + 7)) |
p03951 | s763286564 | Accepted | def main():
n = int(input())
s = input()
t = input()
for i in range(n):
if s[i:] == t[:n - i]:
print(n + i)
break
else:
print(2 * n)
if __name__ == "__main__":
main()
|
p03471 | s093035978 | Accepted | n,y = map(int, input().split())
a = -1
b = -1
c = -1
for i in range(n+1):
for j in range(n+1):
k = n-i-j
if k < 0:
pass
else:
yy = 10000*i + 5000*j + 1000*k
if yy == y:
a = i
b = j
c = k
brea... |
p03262 | s263380597 | Accepted | import fractions
n,x=map(int,input().split())
x2=list(map(int,input().split()))
li=[abs(x2[i]-x) for i in range(n)]
ans=li[0]
for i in range(n):
ans=fractions.gcd(ans,li[i])
print(ans) |
p02700 | s619104581 | Accepted | import math
a,b,c,d = map(int, input().strip().split())
if math.ceil(a/d) >= math.ceil(c/b):
print("Yes")
else:
print("No") |
p03360 | s310613077 | Wrong Answer | a, b, c = map(int, input().split())
k = int(input())
m = max(a, b, c)
print(sum([a, b, c])-m+(m*2)**k)
|
p02848 | s959550456 | Wrong Answer | n = int(input())
s = input()
so = ''
for i in range(len(s)):
ni = ord(s[i]) + n
if ni > 122:
ni -= 26
so += chr(ni)
print(so) |
p03309 | s127940956 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = [(a[i]-i-1) for i in range(n)]
b = sorted(b)
if n % 2 == 1:
res = b[(n-1)//2]
else:
res = (b[n//2-1] + b[n//2])//2
print(sum(map(abs, [b[i]-res for i in range(n)]))) |
p02663 | s861804657 | Accepted | h1, m1, h2, m2, k = map(int, input().split())
wake_time = h2*60 + m2 - (h1 *60 + m1);
if wake_time > k:
print(wake_time - k);
else:
print(0);
|
p03434 | s698961883 | Accepted | n = int(input())
data = input().split()
int_data = [int(int_data) for int_data in data]
int_data.sort(reverse=True)
Alice = 0
Bob = 0
for i in range(n):
if i % 2 == 0:
Alice += int_data[i]
else:
Bob += int_data[i]
print(Alice - Bob) |
p02951 | s181513848 | Accepted | #!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
a, b, c = map(int, input().strip().split())
print(max(c - (a - b), 0))
if __name__=='__main__':
main()
|
p02873 | s161644517 | Wrong Answer | s = str(input())
count = 0
for i in range(len(s)):
if(s[i] == ">"):
count += 1
ans = 0
for i in range(1,count+1):
ans += i
print(ans) |
p03761 | s994509902 | Wrong Answer | from collections import Counter
N=int(input())
d={chr(i):100 for i in range(ord("a"),ord("z")+1)}
for i in range(N):
A={chr(i):0 for i in range(ord("a"),ord("z")+1)}
A.update(Counter(list(input())))
for i in A:
if d[i]>A[i]:
d[i]=A[i]
for i in d:
if d[i]==100:
d[i]=0
ans=""
for i in d:
ans+=i*d[... |
p02831 | s465965749 | Accepted | import math
m,n = map(int,input().split())
print(m*n//(math.gcd(m, n)))
|
p03284 | s026047820 | Accepted | n, k = map(int, input().split())
if n % k == 0:
print(0)
else:
print(1) |
p03773 | s017864938 | Accepted | a,b=map(int,input().split());print((a+b)%24) |
p02989 | s197126620 | Accepted | m=int(input())//2
l=sorted(list(map(int,input().split())))
print(l[m]-l[m-1]) |
p04030 | s802139024 | Wrong Answer | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
S = input()
ans = [''] * len(S)
cur = 0
for s in S:
if s == 'B':
... |
p03773 | s463207619 | Accepted | # 入力
A, B = map(int,input().split())
# 処理
start = A + B
if start >= 24:
print(start - 24)
else:
print(start) |
p02725 | s984505346 | Accepted | k, n = map(int, input().split())
array = list(map(int,input().split()))
max_length = 0
sum_length = 0
for i in range(n - 1):
length = array[i + 1] - array[i]
sum_length += length
if length > max_length:
max_length = length
last_length = k - array[n - 1] + array[0]
sum_length += last_length
max_length = max(ma... |
p04033 | s755028422 | Accepted | import sys
a,b = list(map(int, input().split()))
if a<=0 and b>= 0:
print("Zero")
sys.exit()
elif a < 0 and b < 0:
if (-(a-b)+1)%2 == 0:
print("Positive")
sys.exit()
else:
print("Negative")
sys.exit()
elif a==0 or b==0:
print("Zero")
sys.exit()
elif a>0 and b>0:
print("Positive")
sys.ex... |
p03380 | s697709832 | Accepted | import sys
import bisect
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
A = sorted(list(map(int, input().split())))
if n == 2:
print(*A[::-1])
exit()
idx = bisect.bisect_left(A, A[-1] // 2)
if abs(A[-1] - A[idx] - A[-1] // 2)... |
p03379 | s211317703 | Wrong Answer | import numpy as np
n=int(input())
l=list(map(int,input().split()))
arr=np.sort(np.array(l))
med=np.median(arr)
med_max=int(np.median(np.delete(arr,0)))
med_min=int(np.median(np.delete(arr,n-1)))
if n%2==0:
p=(n+1)//2
for i in range(n):
if l[i]<arr[p-1]:
print(med_max)
else:
... |
p02629 | s783793341 | Accepted | # abc171_c.py
import math
N = int(input())
ans=[]
while N > 0:
ans.append(N%26)
N = math.floor((N-1)/26)
alphabet = 'abcdefghijklmnopqrstuvwxyz'
ans = reversed(ans)
for i in ans:
print(alphabet[i-1],end="")
|
p02584 | s142971169 | Accepted | import sys
X, K, D = [int(x) for x in input().strip().split(" ")]
X = abs(X)
k, x = divmod(X, D)
if K <= k:
print(X - D * K)
sys.exit(0)
X = x
K -= k
if K % 2 == 0:
print(abs(X))
sys.exit(0)
print(abs(X - D)) |
p03131 | s030486011 | Accepted | k,a,b = map(int, input().split())
print(k+1 if b-a <= 2 else a + ((k-a+1)//2*(b-a) + ((k-a+1)%2))) |
p03943 | s376458104 | Wrong Answer |
abc = list(input().split())
list = sorted(abc)
print("Yes" if int(list[0])+int(list[1])==int(list[2]) else "No")
|
p02711 | s004670875 | Accepted | N = list(input())
if '7' in N:
print("Yes")
else:
print("No") |
p03001 | s346007967 | Accepted | w, h ,x, y=map(int, input().split())
ans=w*h/2
if w==2*x and h==2*y:
p=1
else:
p=0
print(ans, p) |
p02684 | s558295631 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
flag = 0
position = [0]
while flag == 0:
temp = position[-1]
if A[temp] -1 in position:
flag = 1
position.append(A[temp]-1)
for i in range(len(position)):
if position[i] == position[-1]:
start = i
break
x = start + (K - start)%(len(p... |
p03544 | s055262115 | Accepted | n = int(input())
lst = [2]
if n==1:
print(1)
else:
lst.append(1)
for _ in range(n-2):
lst.append(lst[-1]+lst[-2])
print(lst[-1]+lst[-2]) |
p03385 | s029820619 | Wrong Answer |
S = str(input())
if S[0] != S[1] and S[1] != S[2] and S[2] != S[0]:
print('Yes')
else:
print('Bad')
|
p02706 | s904076288 | Accepted | N,M=map(int,input().split())
A=list(map(int,input().split()))
if N<sum(A):
print(-1)
exit()
print(N-sum(A))
|
p03059 | s341719399 | Accepted | #入力:N,M(int:整数)
def input2():
return map(int,input().split())
a,b,t=input2()
ans=0
for i in range(1,21):
if a*i>t:
break
ans+=b
print(ans) |
p02817 | s337527524 | Accepted | S,T = input().split()
print(T + S) |
p03250 | s567517254 | Accepted | a = list(map(int, input().split()))
a.sort(reverse=True)
print(sum(a) + a[0] * 9) |
p02663 | s393566355 | Wrong Answer | H1,M1,H2,M2,K=map(int,input().split())
t1=60*H1 + M1
t2=60*H2 + M2
ans=0
tmp=t1
while(1):
tmp+=K
if tmp>=t2:
break
ans+=K
print(ans) |
p02601 | s881340463 | Accepted | import sys
a, b, c=map(int, input().split())
k=int(input())
while(k>=1 and a>=b):
b=b*2
k=k-1
if a>=b:
print("No")
sys.exit()
while(k>=1 and b>=c):
c=c*2
k=k-1
if b>=c:
print("No")
else:
print("Yes")
|
p03679 | s050641982 | Accepted | x,a,b=map(int,input().split())
print('delicious'if b<=a else 'safe' if a<b and b-a<=x else 'dangerous') |
p04033 | s622699412 | Accepted | # B
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
a,b=nm()
if a<=0<=b:
print('Zero')
elif b<0:
if (b-a+1)%2==1:
print('Negative')
elif (b-a+1)%2==0:
print('Positive')
elif 0<a:
print('Positive')
|
p04020 | s153719767 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, *A = map(int, read().split())
A = [0] + A
answer = 0
for i in range(1, N + 1):
if A[i - 1] and A[i]:
answer += 1
A[i] -= 1
n, A[i] = divmod(A[i], 2)
answer += n
print(ans... |
p03612 | s147287929 | Accepted | n = int(raw_input())
count = 0
res = 0
ais = map(int , raw_input().split())
for i in range(n + 1):
if (ais[i] if i < n else -1) != i + 1:
#flush the count
res += (count + 1)/2# + 1
count = 0
else:
count +=1
print res |
p02676 | s926552548 | Wrong Answer | k = int(input())
s = input()
if len(s) >= k:
print(s[0:k] + "...")
elif len(s) < k :
print(s) |
p02765 | s120531845 | Accepted | n,r=map(int,input().split())
ra=r
if n<=10:
ra=ra+1000-100*n
print(ra) |
p02608 | s301312245 | Accepted | N=int(input())
ans=[0]*10001
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
tmp=x**2+y**2+z**2
tmp+=x*y+y*z+z*x
if tmp<=N:
ans[tmp]+=1
for i in range(1,N+1):
print(ans[i])
|
p02814 | s238222510 | Accepted | import math
from functools import reduce
n, m = input().split()
a = list(map(int, input().split()))
b =[0]*int(n)
for i in range(len(a)):
b[i] = a[i]//2
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
c = 0
x = lcm_list(b)
for i in range(int(n... |
p03210 | s297634794 | Wrong Answer | X = int(input())
if X == 7 or X == 5 or X == 3:
print("Yes")
else:
print("No") |
p03282 | s306265431 | Wrong Answer | s = input()
k = input()
for a in s:
if a != '1':
print(int(a))
exit()
print(1)
|
p02756 | s357789673 | Accepted | S = input()
Q = int(input())
left = ''
right = S
for q in range(Q):
Query = list(map(str, input().split()))
if Query[0] == '1':
#反転
tmp = left
left = right
right = tmp
else: #Query[0]==2
if Query[1] == '1':
#先頭追加
left += Query[2]
els... |
p03657 | s433482169 | Wrong Answer | a=list(map(int,input().split()))
b=sum(a)
if b%3==0:
print('Possible')
else:
print('Impossible') |
p02705 | s111551797 | Wrong Answer | r = int(input())
print(3.14159*r)
|
p02866 | s741700483 | Accepted | N = int(input())
D = list(map(int, input().split()))
mod = 998244353
ans = 1
A = [0]*(max(D)+1)
for i in range(N):
A[D[i]] += 1
if D[0] != 0 or not all(D[1:]) or not all(A):
print(0)
exit()
for i in range(1, max(D)+1):
ans = ans * pow(A[i-1], A[i], mod) % mod
print(ans % mod) |
p02831 | s888887962 | Accepted | from fractions import gcd
def func(A, B):
ans = (A * B) // gcd(A, B)
return ans
if __name__ == "__main__":
A, B = map(int, input().split())
print(func(A, B))
|
p03282 | s198233955 | Accepted | S=input()
K=int(input())
if len(S)==1:
print(S)
quit()
i=0
while i<len(S) and i<K:
if S[i]!="1":
print(S[i])
quit()
i+=1
print(1) |
p02627 | s999974884 | Accepted | import sys
def _s(): return sys.stdin.readline().strip()
def main():
c = _s()
return 'A' if 65 <= ord(c) <= 90 else 'a'
if __name__ == "__main__":
print(main())
|
p02658 | s713906456 | Accepted | n = int(input())
arr = list(map(int,input().split()))
if 0 in arr:
print(0)
else:
res = 1
flag = 0
for i in arr:
res = res*i
if res>10**18:
flag = 1
break
if flag==1:
print(-1)
else:
print(res)
|
p02631 | s946421102 | Wrong Answer | #!/usr/bin/env python3
import sys
import numpy as np
input = sys.stdin.readline
n=int(input())
A = list(map(int,input().split()))
B = []
ans = A[0]
for i in range(1,n):
ans = ans ^ A[i]
for i in range(n):
B.append(ans ^ A[i])
print(B)
|
p02658 | s694768317 | Accepted | n = int(input())
A = list(map(int,input().split()))
A.sort()
if A[0]==0:
print(0)
exit()
ans = 1
for i in A:
ans*=i
if ans>1e18:
print(-1)
exit()
print(ans)
|
p03319 | s587438037 | Accepted | a,b=map(int,input().split())
c=(a-1)//(b-1)
while (c+1)*(b-1)<=a-1:
c+=1
if (a-1)%(b-1)!=0:
c+=1
print(c) |
p03696 | s493630821 | Accepted | input()
t=s=input()
p,q=o="()"
while o in s:s=s.replace(o,"")
f=s.count
print(p*f(q)+t+q*f(p)) |
p03944 | s001370768 | Wrong Answer | def solve(w, h, n, XYA):
m = [0, w, 0, h]
for x, y, a in XYA:
m[a - 1] = x if a <= 2 else y
return max(0, (m[1] - m[0]) * (m[3] - m[2]))
_w, _h, _n = list(map(int, input().split()))
_XYA = [map(int, input().split()) for _ in range(_n)]
print(solve(_w, _h, _n, _XYA)) |
p03471 | s708603308 | Accepted | import sys
n,Y = map(int,input().split())
for x in range(n+1):
for y in range(n-x+1):
z = n-(x+y)
if z >= 0 and 10000*x+5000*y+1000*z == Y:
print(x,y,z)
sys.exit()
print(-1,-1,-1) |
p02787 | s283730468 | Accepted | H,N = map(int,input().split())
AB = [list(map(int,input().split())) for i in range(N)]
dp = [float('inf') for i in range(H+1)]
dp[0] = 0
for i in range(N):
a,b = AB[i]
for j in range(H+1):
if j+a > H:
dp[H] = min(dp[H],dp[j]+b)
else:
dp[j+a] = min(dp[j+a],dp[j]+b)
print(d... |
p02831 | s124374405 | Accepted | from math import gcd
def lcm(a, b):
return a * b // gcd(a, b)
A, B = map(int, input().split())
print(lcm(A, B)) |
p02775 | s319292717 | Wrong Answer | n = list(map(int, input()))
l = [0] * (len(n)+1)
carry = 0
for i, k in enumerate(n):
if k > 5 - carry:
l[i+1] = k - 10
l[i] += 1
carry = 1
while l[i] >= 6 - (1 if l[i-1] < 0 else 0):
l[i] -= 10
i -= 1
l[i] += 1
if i == 0:
break
else:
l[i+1] = k
carry = 0
prin... |
p02854 | s980748503 | Accepted | N = int(input())
A = list(map(int, input().split()))
length = sum(A)
center = length / 2
now = 0
for i in range(N):
now += A[i]
if now == center:
print(0)
break
if now > center:
print(int(min(now-center, center-now+A[i]) * 2))
break |
p02618 | s939036670 | Accepted |
dd = int(input())
c = list(list(map(int, input().split())))
s = [[0]*26]*dd
v = [[0]*26]*dd
vs = [[0]*26]*dd
ans = [0]*dd
for i in range(dd):
s[i] = list(list(map(int, input().split())))
for i in range(26):
for j in range(dd):
v[j][i]=s[j][i]+c[i]*(j+1)
for i in range(dd):
maxv = -100000
fo... |
p03162 | s392114236 | Accepted | N = int(input())
Q = [list(map(int, input().split())) for _ in range(N)]
dp = [[0]*3 for i in range(N)]
dp[0][0] = Q[0][0]
dp[0][1] = Q[0][1]
dp[0][2] = Q[0][2]
for i in range(1, N):
dp[i][0] = max(dp[i-1][1], dp[i-1][2]) + Q[i][0]
dp[i][1] = max(dp[i-1][0], dp[i-1][2]) + Q[i][1]
dp[i][2] = max(dp[i-1][0],... |
p02633 | s834712690 | Accepted | import math
x = int(input())
print(((x*360)//math.gcd(x,360))//x) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.