problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02602 | s815014574 | Wrong Answer | from numpy import prod
n, k = map(int, input().split())
a = list(map(int, input().split()))
first_term = prod(a[:k])
for i in range(n - k):
term = first_term / a[i]
term = term * a[k+i]
if int(term) > int(first_term):
print('Yes')
else:
print('No')
first_term = int(term)
|
p02713 | s834265104 | Accepted | import math
def main():
k = int(input())
GCD = [[0] * 201 for i in range(201)]
for ki1 in range(1, k + 1):
for ki2 in range(1, k + 1):
GCD[ki1][ki2] = math.gcd(ki1, ki2)
ans = 0
for ki1 in range(1, k + 1):
for ki2 in range(1, k + 1):
for ki3 in range(1, k + 1):
ans += GCD[GCD[ki1][ki2]][ki3]
print(ans)
if __name__ == '__main__':
main()
|
p02621 | s365625523 | Wrong Answer |
a = int(input("\n"))
if a >= 10:
print("Number too big")
elif a < 1:
print("Number too small")
else:
print(int(a + (a**2) + (a**3))) |
p02689 | s935010392 | Accepted | n,m = map(int,input().split())
A = [0] + list(map(int,input().split()))
B = [ [] for _ in range(n + 1) ]
for _ in range(m):
s,e = map(int,input().split())
B[s].append(A[e])
B[e].append(A[s])
ans = 0
for i in range(1,n+1):
if len(B[i]) == 0:
ans += 1
elif max(B[i]) < A[i]:
ans += 1
print(ans) |
p03067 | s615407814 | Accepted | # -*- coding: utf-8 -*-
A, B, C = map(int, input().split())
print('Yes' if A < C < B or B < C < A else 'No')
|
p03814 | s520555806 | Accepted | S = input()
st = 0
en = 0
for i in range(len(S)):
if S[i] == "A":
st = i
break
for i in range(len(S)):
if S[i] == "Z":
en = i
print(en - st + 1) |
p02646 | s446563315 | Wrong Answer | N,S = map(int,input().split())
n,s = map(int,input().split())
T = int(input())
dis = n - N
speed = S - s
if n < N:
print("NO")
elif dis <= speed*T:
print("YES")
else:
print("NO") |
p03705 | s547572097 | Accepted | N,A,B = map(int,input().split())
print(max(0,(N-1)*B+A-(N-1)*A-B+1)) |
p02957 | s671110277 | Accepted | a, b = map(int, input().split())
if (a + b) % 2 == 0:
print((a + b) // 2)
else:
print("IMPOSSIBLE")
|
p04030 | s116422573 | Accepted | from collections import deque
S = input()
L = len(S)
d = deque()
for i in range(L):
if S[i] == "0":
d.append("0")
elif S[i] == "1":
d.append("1")
else:
if len(d) != 0:
d.pop()
ans = ''.join(d)
print(ans)
|
p02578 | s524787941 | Accepted | N = int(input())
L = list(map(int, input().split()))
ans = 0
for i in range(len(L) - 1):
if L[i] - L[i + 1] >= 0:
ans = ans + L[i] - L[i + 1]
L[i + 1] = L[i]
print(ans) |
p02697 | s370582060 | Wrong Answer | N, M = map(int,input().split())
half = N//2
for i in range(M):
print(half-i,half+i+1)
|
p02881 | s787929248 | Accepted | import math
N = int(input())
print(min([a + N // a - 2 for a in range(math.floor(math.sqrt(N)) + 1, 0, -1) if N % a == 0]))
|
p02759 | s244128109 | Wrong Answer | N=int(input())
if N%2==0:
print(N/2)
else:
print((N-1)/2+1) |
p03673 | s552251984 | Wrong Answer | input();l=list(input().split());print(*l[-1::-2]+l[::2]) |
p03126 | s824784386 | Accepted | #coding:utf-8
#カツサンドくん
n, m = map(int, input().split())
#各食べ物ごとの解答集計用
count = [0] * m
for i in range(n):
enq = list(map(int, input().split()))
for j in range(1, len(enq)):
food = enq[j] - 1
count[food] += 1
ans = 0
for item in count:
if item == n:
ans += 1
print(ans)
|
p03438 | s012947477 | Wrong Answer | from math import gcd
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
cnt_a, cnt_b = 0, 0
for i in range(n):
if a[i] < b[i]:
cnt_b += b[i] - a[i]
elif a[i] > b[i]:
cnt_a += a[i] - b[i]
print("Yes" if cnt_b % 2 == 0 and cnt_a <= cnt_b else "No") |
p02748 | s047864785 | Wrong Answer | [A, B, M] = input().split()
A = int(A)
B = int(B)
M = int(M)
a = list(map(int, input().split()))
b = list(map(int, input().split()))
cut_map = [[0*i for i in range(B)] for j in range(A)]
for i in range(M):
[inx, iny, inc] = list(map(int, input().split()))
if cut_map[inx-1][iny-1] > -inc:
cut_map[inx-1][iny-1] = -inc
for i in range(A):
for j in range(B):
cut_map[i][j] = a[i] + b[j]
print(min(min(cut_map))) |
p02729 | s538963668 | Wrong Answer | N, M = map(int, input().split())
print( N * (N-1) / 2 + M * (M-1) / 2 ) |
p03455 | s432030885 | Wrong Answer | print(["EOvdedn"][eval(input().replace(" ","*"))%2::2]) |
p02742 | s990093333 | Wrong Answer | H, W = (int(x) for x in input().split())
if H * W == 1:
k = 1
elif H*W % 2 == 1:
if (H == 1 or W == 1) and H*W != 1:
a = list(filter(lambda x: x != 1, [H, W]))
k = int(a[0] / 2) + 1
else:
k = int(H / 2) + (int(W / 2)) * H + 1
elif H * W % 2 == 0:
k = int(H * W / 2)
print(k) |
p03475 | s439390051 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
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())
def dfs(eki,t):
if eki == n-1:
return t
cc = c[eki]
ss = s[eki]
ff = f[eki]
t = max(ss,t)
return dfs(eki+1, -(-t)//ff*ff+cc)
for i in range(n):
print(dfs(i,0))
|
p02633 | s780227719 | Accepted | X = int(input())
import math
ans = 360 // math.gcd(360, X)
print(ans) |
p02963 | s304122466 | Accepted | s = int(input())
y3 = (s+10**9-1)//10**9
x3 = 10**9*y3-s
print(0,0,10**9,1,x3,y3) |
p03607 | s168374997 | Wrong Answer | n = int(input())
a = [int(input()) for _ in range(n)]
d = {}
for i in a:
if i not in d:
d[i] =0
d[i] +=1
elif i in d:
d[i] -=1
l =[]
for i in d.keys():
if d[i] != 0:
l.append(d[i])
print(len(l))
|
p02742 | s730175081 | Accepted | import math
h, w = list(map(int, input().split()))
if h == 1 or w == 1:
print(1)
else:
print(math.ceil((h * w) / 2)) |
p03250 | s723252782 | Wrong Answer | A,B,C = map(int,input().split())
AB = A * 10 + B
BC = B * 10 + C
CA = C * 10 + A
if AB > (BC and CA):
print(AB + C)
elif BC > (AB and CA):
print(BC + A)
else:
print(CA + B)
|
p02777 | s043749936 | Accepted | S,T = map(str,input().split())
A,B = map(int,input().split())
U = str(input())
if S == U:
print(A-1,B)
else:
print(A,B-1)
|
p02702 | s362478141 | Accepted |
s = input()
n = len(s)
A = [1]
mod = 2019
for i in range(n-1):
A.append((A[-1]*10)%mod)
B = [int(s[-1])]
for i in range(1, n):
B.append((B[-1] + A[i] * int(s[n-i-1])) % mod)
# print(B)
ans = 0
C = [0] * 2019
C[0] += 1
for i in range(n):
C[B[i]] += 1
for i in range(len(C)):
ans += (C[i]-1)*C[i]//2
print(ans) |
p02723 | s841078960 | Accepted | S = input()
if S[2] == S[3] and S[4] == S[5]:
print('Yes')
else:
print('No') |
p02792 | s144085752 | Accepted | N = int(input())
t = [[0] * 10 for _ in range(10)]
for i in range(1, N+1):
x = i % 10
y = i
while y // 10:
y //= 10
if x == 0 or y == 0:
continue
t[x][y] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += t[i][j] * t[j][i]
print(ans) |
p03469 | s032830875 | Wrong Answer | s= input()
if s[4]=='2017':
print('2018'+s[4:])
else:
print(s) |
p02768 | s389347156 | Accepted | # 共通系になりそう
from math import factorial
import sys, math
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 1000000007
def combination(n, r):
r = min(r, n - r)
num = 1
den = 1
for i in range(1, r + 1):
num = (num * (n + 1 - i)) % MOD
den = (den * i) % MOD
return num * pow(den, MOD - 2, MOD) % MOD
N, A, B = map(int, input().split())
result_ = pow(2, N) - 1 - combination(N, A) - combination(N, B)
print(result_ % MOD)
# powはn剰の時早い |
p03087 | s158817392 | Wrong Answer | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N,Q = MI()
S = LS2()
A = [0]*N
for i in range(1,N):
if S[i-1] == 'A' and S[i] == 'C':
A[i] = 1
from itertools import accumulate
A = list(accumulate(A))
print(A)
for i in range(Q):
l,r = MI()
print(A[r-1]-A[l-1])
|
p02642 | s607783188 | Accepted | from collections import Counter
from operator import mul
from functools import reduce
n = int(input())
A = list(map(int, input().split()))
cnt_a = Counter(A)
memo = [1] * 1000001
for a in A:
memo[a] = 1
A.sort()
a_max = max(A)
for a in A:
if not memo[a]:
continue
for i in range(a * 2, a_max + 1, a):
memo[i] = -1
for l in cnt_a.keys():
if cnt_a[l] >= 2:
memo[l] = "daburi"
ans = 0
for a in A:
if memo[a] == 1:
ans += 1
print(ans)
|
p03059 | s985030482 | Wrong Answer | a,b,t = map(int,input().split())
T = t + 0.5
print(round(T/a)*b) |
p03416 | s412212014 | Wrong Answer | a,b = input().split()
count = 0
anum = int(a)
bnum = int(b)
# a = list(a)
# b = list(b)
for i in range(anum,bnum):
stra = str(i)
if stra[0:2] == stra[3:5]:
print(stra[0:2])
print(stra[3:])
count += 1
print(count)
|
p03471 | s686102294 | Accepted | n, y = map(int, input().split())
for i in range(n+1):
for j in range(n-i+1):
if 10000*i + 5000*j + 1000*(n-i-j) == y:
print(i, j, n-i-j)
exit()
print('-1 -1 -1')
|
p03323 | s228903485 | Wrong Answer | a,b=map(int,input().split())
if a>9 or b>9:
print("Yay!")
else:
print(":(") |
p03478 | s180423244 | Accepted | n,a,b = map(int,input().split())
ans = 0
for i in range(1, n+1):
num = str(i)
cnt = 0
for j in range(len(num)):
cnt += int(num[j])
if a <= cnt <= b:
ans += i
print(ans)
|
p03319 | s092379950 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N):
if A[i] == 1:
loc = i
break
#print(loc) #locは0index
left = loc
right = N-(loc+1)
ans = left//(K-1) + right//(K-1)
nokori = left%(K-1) + 1 + right%(K-1)
#print(ans,nokori)
if nokori == 1:
ans += 0
elif nokori <= K:
ans += 1
else:
ans += 2
print(ans)
|
p03457 | s189194454 | Accepted | n = int(input())
ti_1, xi_1, yi_1 = [0,0,0]
for i in range(n):
ti, xi, yi = map(int, input().split())
tlim = ti- ti_1
dist = abs(xi - xi_1) + abs(yi - yi_1)
if tlim < dist or (tlim-dist) % 2 == 1:
print('No')
exit()
else:
ti_1, xi_1, yi_1 = ti, xi, yi
continue
print('Yes') |
p04019 | s499620776 | Wrong Answer | import sys
input = sys.stdin.readline
S = list(input())[: -1]
if S.count("N") == S.count("S") and (S.count("E") == S.count("W")): print("Yes")
else: print("No") |
p03243 | s826815991 | Accepted | N = int(input())
l = [111,222,333,444,555,666,777,888,999]
if N <= 111:
print(111)
else:
for i in range(8):
if l[i] < N <= l[i+1]:
print(l[i+1])
exit() |
p02645 | s481378244 | Wrong Answer | s = input()
print(s[0:4]) |
p02933 | s535055930 | Accepted | a=int(input())
s=input()
if a>=3200:
print(s)
else:
print('red') |
p03493 | s790096427 | Accepted | print(input().count("1")) |
p03493 | s429459982 | Wrong Answer | s = input().split()
n = s.count("1")
print(n) |
p03659 | s483810744 | Wrong Answer | n = int(input())
a = [int(x) for x in input().split()]
suma = sum(a)
x = a[0]
ans = abs(suma - x * 2)
for i in range(1, n):
x += a[i]
ans = min(ans, abs(suma - x * 2))
else:
print(ans) |
p02787 | s142350825 | Accepted | H, N = map(int, input().split())
inf = 1 << 32
dp = [inf] * (H + 1)
dp[0] = 0
for i in range(N):
a,b = map(int, input().split())
for j in range(H+1):
dp[min(H,j + a)] = min(dp[min(H,j + a)], dp[j] + b)
print(dp[H]) |
p03038 | s483032929 | Wrong Answer | N,M=map(int,input().split())
A=list(map(int,input().split()))
B=[0]*M
C=[0]*M
for i in range(M):
B[i],C[i]=map(int,input().split())
for i in range(M):
A.sort()
for j in range(B[i]):
if A[j] < C[i]:
A[j]=C[i]
print(i,j)
else:
break
if j==N-1:
break
print(sum(A))
|
p03208 | s325232621 | Accepted | n, k = map(int, input().split())
hl = [int(input()) for _ in range(n)]
hl.sort()
h_min = min(hl[i+k-1] - hl[i] for i in range(n-k+1))
print(h_min) |
p03241 | s271581359 | Wrong Answer | N,M=map(int,input().split())
ans=1
for i in range(1,int(M**0.5)+1):
if M%i==0 and M//N>=i:
ans=max(ans,i)
print(ans)
|
p03803 | s420112237 | Wrong Answer | a, b = map(int, input().split())
judge = ""
if a == b:
judge = "Draw"
elif a == 1:
judge = "Alice"
elif b == 1:
judge = "Bob"
if a < b:
judge = "Bob"
elif a > b:
judge = "Alice"
else:
judge = "Draw"
print(judge) |
p02759 | s122071568 | Accepted | a = int(input())
b = int(a / 2)
c = int((a + 1) / 2)
if a % 2 == 0:
print(b)
else:
print(c)
|
p03380 | s565723788 | Accepted | import bisect
n = int(input())
a = sorted(list(map(int, input().split())))
x = a[-1]
N = a[-1]//2
a = a[:-1]
y = bisect.bisect_left(a,N)
if len(a) <= y: ans = a[y-1]
else:
ans = a[y]
if 0 < y and abs(N-ans) > abs(N-a[y-1]): ans = a[y-1]
if y < len(a)-1 and abs(N-ans) > abs(N-a[y+1]): ans = a[y+1]
print(x,ans) |
p03835 | s864029525 | Accepted | k,s=[int(i) for i in input().split()]
count=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-(x+y)<=k:
count+=1
print(count) |
p03543 | s965433504 | Accepted |
n=list(input())
if (n[0]==n[1]==n[2]) or (n[1]==n[2]==n[3]) or (n[0]==n[1]==n[2]==n[3]):print('Yes')
else:print('No') |
p02684 | s422239964 | Accepted | N, K = map(int, input().split())
A = [int(x) for x in input().split()]
when = [-1 for _ in range(N+1)]
new = 1
i = 0
while when[new] == -1:
when[new] = i
new = A[new - 1]
i += 1
line = when[new]
roop = i - when[new]
if K > line:
K = (K - line) % roop
for j in range(N+1):
when[j] -= line
for j in range(N+1):
if when[j] == K:
print(j)
break |
p02687 | s106858194 | Wrong Answer | s = input()
if s == "ABC":
print("ADC")
else:
print("ABC") |
p02854 | s086849246 | Accepted | import numpy
N = int(input())
A = list(map(int, input().split()))
res = numpy.cumsum(A)
if res[-1] % 2 == 0:
L = res[-1]//2
ans = [abs(r - L) for r in res]
print(2*min(ans))
else:
L1 = res[-1]//2
L2 = L1 + 1
ans = [min(abs(r - L1),abs(r-L2)) for r in res]
print(2*min(ans)+1) |
p03469 | s983848455 | Wrong Answer | S = list(map(str, input()))
S[3]='8'
print(S) |
p02983 | s674205665 | Wrong Answer | l, r = map(int, input().split())
l %= 2019
r %= 2019
if l >= r:
print(0)
exit()
ans = 2018
for i in range(l, r):
for j in range(i+1, r+1):
ans = min(ans, (i*j)%2019)
print(ans) |
p02793 | s876951575 | Accepted | from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
mod = 10**9 + 7
lcm = 1
for i in range(n):
lcm = lcm * a[i] // gcd(lcm, a[i])
lcm %= mod
sum_b = 0
for i in range(n):
sum_b = (sum_b + lcm * pow(a[i], mod - 2, mod)) % mod
print(sum_b) |
p03011 | s839176064 | Accepted | p, q, r = map(int, input().split())
print(min(p+q, q+r, p+r))
|
p03243 | s971203284 | Accepted | N=int(input())
for i in range(N,1000):
if i in [111,222,333,444,555,666,777,888,999]:
print(i)
break |
p02963 | s555671561 | Accepted | from math import sqrt, ceil
S = int(input())
"""
|x1y2 - x2y1| = S
"""
x1 = ceil(sqrt(S))
x2 = x1*x1 - S
print(0,0,x1,1,x2,x1) |
p02677 | s446635353 | Accepted | import math
A, B, H, M = map(int, input().split())
Hno = 30 * H + 0.5 * M
Mno = 6 * M
angle = Hno - Mno
if angle < 0:
angle *= -1
cos = math.cos(math.radians(angle))
x = A ** 2 + B ** 2 - (2 * A * B * cos)
print(math.sqrt(x)) |
p02711 | s404368390 | Accepted | a,b,c=input()
if a=='7' or b=='7' or c=='7':
print("Yes")
else:
print('No') |
p03605 | s110056070 | Wrong Answer | N=list(input())
print(N)
if N[0]=='9' or N[1]=='9':
print('Yes')
else:
print('No')
|
p03495 | s991987526 | Accepted | import collections
N, K = map(int, input().split())
cntA = sorted(collections.Counter(list(map(int, input().split()))).items(), key=lambda x: x[1])
ans = 0
for i in range(max(0, len(cntA) - K)):
ans += cntA[i][1]
print(ans)
|
p02819 | s383389818 | Accepted | def is_prime(a):
if a == 2:
return True
for i in range(2, int(a**0.5)+2):
if a%i == 0:
return False
return True
X = int(input())
for i in range(X, 100004):
if is_prime(i):
print(i)
break |
p03146 | s933446184 | Accepted | a = [int(input())]
flg = False
while flg == False:
now = a[-1]
if a[-1] % 2 == 0:
new = int(a[-1] / 2)
else:
new = int(a[-1] * 3 + 1)
if new in a:
flg = True
else:
a.append(new)
print(len(a)+1) |
p03043 | s756756559 | Wrong Answer | def get_c(p):
c = 1
while 1:
if pow(2, c) >= p:
return c
c += 1
# input
N, K = map(int, input().split())
# check
prob = [1 / N] * N
for p, n in zip(range(1, N + 1), prob):
c = get_c(K - p)
n *= 0.5 ** c
print(sum(prob)) |
p02583 | s855523010 | Accepted | import itertools
n = input()
l = list(map(int, input().split()))
ls = sorted(set(l))
ans = 0
for p in itertools.combinations(ls, 3):
if p[0] + p[1] > p[2]:
ans += l.count(p[0]) * l.count(p[1]) * l.count(p[2])
print(ans) |
p03150 | s069917371 | Accepted | s = input()
ks = "keyence"
if s.startswith(ks) or s.endswith(ks):
print("YES")
exit(0)
for i in range(1, len(ks)):
k1 = ks[:i]
k2 = ks[i:len(ks)]
if s.startswith(k1) and s.endswith(k2):
print("YES")
exit(0)
print("NO")
|
p03345 | s172672996 | Wrong Answer | a,b,c,k = map(int, input().split())
if a==b==c:
print(0)
exit()
itr = k//3
amari = k%3
if itr > 100:
print("Unfair")
exit()
a *= pow(2,itr)
b *= pow(2,itr)
c *= pow(2,itr)
for i in range(amari):
newa=b+c
newb=a+c
newc=b+c
a,b,c = newa,newb,newc
if abs(a-b) > 10**18:
print("Unfair")
else:
print(a-b) |
p03730 | s710677222 | Accepted | a,b,c=list(map(int,input().split()))
for n in range(101):
if (a*n) % b ==c:
print("YES")
exit()
print("NO")
|
p03327 | s633455568 | Wrong Answer | import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))
N = int(input())
if N>999:
print('ABC')
else:
print('ABD')
|
p02791 | s835944629 | Accepted | N = int(input())
A = list(map(int, input().split()))
s = 0
P = (A[0:N])
Q = A
for i in range(N-1):
if Q[i] < Q[i+1]:
Q[i+1] = Q[i]
for i in range(N):
if P[i] == Q[i]:
s += 1
print(s) |
p02665 | s672609092 | Accepted | n = int(input())
A = list(map(int, input().split()))
ans = 0
if n == 0 and A[0] == 1:
print(1)
exit()
if n == 0 and A[0] != 1:
print(-1)
exit()
if n != 0 and A[0] == 1:
print(-1)
exit()
start = 1
way = sum(A)
for i in range(1,n+1):
start *= 2
if start < A[i]:
print(-1)
exit()
if start > way:
start = way
ans += start
#print(start, start-A[i])
start -= A[i]
way -= A[i]
#print()
print(ans+1)
|
p02820 | s900587222 | Accepted | n,k = map(int,input().split())
R,S,P = map(int,input().split())
points = {'r':P,'s':R,'p':S}
l = list(input())
com = ['']*n
ans = 0
for i,j in enumerate(l):
p = points[j]
com[i] = j
if (i-k>=0) and com[i] == com[i-k]:
com[i] = ''
p = 0
ans += p
print(ans)
|
p03146 | s206048499 | Accepted | a = int(input())
als = [0]*(10**6+2)
for i in range(0,10**6+2):
als[a] = 1
if a%2 == 0:
a = a//2
else:
a = 3*a+1
if als[a] == 1:
print(i+2)
exit()
|
p03327 | s775494678 | Accepted | N = int(input())
if 1 <= N <= 999:
print("ABC")
elif 1000 <= N <= 1998:
print("ABD") |
p02603 | s263596908 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
M = 1000
stock = 0
for i in range(1, N):
# print(M)
if A[i-1] < A[i]:
stock = M // A[i-1]
M -= stock * A[i-1]
elif A[i-1] > A[i]:
M += stock * A[i-1]
stock = 0
M += stock * A[-1]
print(M) |
p03220 | s732291287 | Wrong Answer | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
import decimal
def main():
numbers=[]
n = int(input())
t,a = map(int,input().split())
numbers=list(map(int,input().split()))
dp=[]
hensu=decimal.Decimal('0.006')
for number in numbers:
tmp=t-number*hensu
dp.append(a-tmp)
print(dp)
print(dp.index(min(dp))+1)
if __name__=="__main__":
main() |
p02713 | s192941830 | Accepted | import math
from functools import reduce
K=int(input())
a=0
def gcd(*numbers):
return reduce(math.gcd,numbers)
#def gcd_list(numbers):
# return reduce(math.gcd,numbers)
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
a+=gcd(i,j,k)
print(a) |
p03309 | s481906636 | Wrong Answer | N = int(input())
A = [int(a)-i-1 for i,a in enumerate(input().split(),1)]
A.sort()
b = int(sum(A)/len(A))
c = 10**9
for j in range(b-10, b+11):
k = sum(map(lambda x:abs(x-j), A))
c = min(c,k)
print(c) |
p03042 | s421774401 | Accepted | S=input()
a=int(S[:2])
b=int(S[2:])
if(1<=a<=12 and 1<=b<=12):
print("AMBIGUOUS")
elif(1<=a<=12):
print("MMYY")
elif(1<=b<=12):
print("YYMM")
else:
print("NA")
|
p03011 | s467544645 | Accepted | #129_A
a=sorted(list(map(int,input().split())))
print(sum(a)-max(a)) |
p03657 | s580786807 | Accepted | x,y=list(map(int, input().split()))
if x%3==0 or y%3==0 or (x+y)%3==0:
print('Possible')
else:
print('Impossible') |
p03043 | s289429105 | Wrong Answer | n, k = map(int, input().split())
n_sum = 0
def min_cnt(n, k):
res = 2
cnt = 1
while k > res:
cnt += 1
res *= 2*n
return cnt
if n < k:
for i in range(n):
num = k/2 - (i + 1)
n_sum += (1/n) * ((1/2) ** num)
else:
for i in range(k - 1):
num = k//2 + 1 - (i + 1)
n_sum += (1/n) * ((1/2) ** num)
n_sum += (n - k + 1) / n
print(n_sum)
print(5//2) |
p03448 | s606758421 | Accepted | X = [int(input()) for _ in range(4)]
ans = 0
for i in range(X[0] + 1):
for j in range(X[1] + 1):
for k in range(X[2] + 1):
if 500 * i + 100 * j + 50 * k == X[3]:
ans += 1
print(ans) |
p03745 | s927593971 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
ans = 1
mm = 0
i = 0
while(i<N-2):
if (A[i]-A[i+1])*(A[i+1]-A[i+2])<0:
ans += 1
i+=1
i+=1
print(ans) |
p03011 | s648681918 | Accepted | d = list(map(int, input().split()))
d.sort()
print(d[0] + d[1]) |
p03309 | s927054295 | Accepted | n = int(input())
a = list(map(int, input().split()))
a = [a[i] - (i + 1) for i in range(len(a))]
a.sort()
median = a[len(a) // 2]
cnt = 0
for i in range(len(a)):
cnt += abs(a[i] - median)
print(cnt)
|
p03673 | s795513532 | Accepted | n = int(input())
A = list(map(int,input().split()))
b = ""
inv = 1
import collections
b = collections.deque()
for i in range(n):
a = A[i]
if inv ==1:
b.append(a)
else:
b.appendleft(a)
inv *=-1
if inv ==1:
print(*b)
else:
print(*reversed(b))
|
p03069 | s553360615 | Accepted | from collections import Counter
INF = 114514191981036436433-4
n = int(input())
s = input()
b = Counter(s)
ans = b["."]
cur = b["."]
for i in range(n):
if s[i] == "#":
cur += 1
else:
cur -= 1
ans = min(ans,cur)
print(ans) |
p02553 | s021885228 | Wrong Answer | a,b,c,d=map(int,input().split())
print(max(a*c,b*d,a*d,b*d)) |
p02555 | s330182013 | Accepted | n = int(input())
m = 10**9 + 7
L = [-1 for _ in range(n+10)]
L[0] = 0
L[1] = 0
L[2] = 1
L[3] = 1
L[4] = 1
def f(m):
if m <= 5:
return L[m-1]
a = 1
for i in range(3, m-2):
if L[i-1] == -1:
L[i-1] = f(i)
a += L[i-1]
return a
print(f(n) % m) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.