problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03077
|
s329105302
|
Accepted
|
import sys
from math import ceil
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
sys.setrecursionlimit(10 ** 9)
def main():
N = INT()
P = [INT() for _ in range(5)]
print(ceil(N/min(P)) + 4)
if __name__ == '__main__':
main()
|
p03696
|
s271812252
|
Accepted
|
n = int(input())
s = input()
L = 0 # 左かっこの数
R = 0 # 右かっこの数
cnt = 0 # 左かっこ(の数に対応した、あるべき右かっこ)の数
for i in s:
if i == "(":
cnt += 1
else:
if cnt > 0:
cnt -= 1
else: # あるべき右かっこの数が０以下のとき、足りてないのは左かっこ
L += 1
R = cnt
print("("*L + s + ")"*R)
|
p03761
|
s660237105
|
Accepted
|
from collections import Counter
n=int(input())
s=Counter(input())
for i in range(n-1):
s&=Counter(input())
print("".join(sorted(s.elements())))
|
p03471
|
s406028850
|
Accepted
|
n,y = map(int,input().split())
f = False
for a in range(n+1):
for b in range(n+1):
c = n-(a+b)
if 10000*a+5000*b+1000*c == y and a+b+c == n and c>= 0:
f = True
print(a,b,c)
if f == True:
break
if f == False:
print('-1 -1 -1')
|
p03352
|
s847694521
|
Accepted
|
from bisect import bisect_left
import math
n = int(input())
lst = []
lst.append(1)
for i in range(2, int(math.sqrt(1000)) + 1):
for j in range(2, 10):
if i ** j <= 1000 and i ** j not in lst:
lst.append(i ** j)
lst.sort()
print(lst[bisect_left(lst, n) - 1] if n not in lst else lst[bisect_left(lst, n)])
|
p02607
|
s513851576
|
Wrong Answer
|
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(N):
if i%2==1 and A[i]%2==1:
ans +=1
print(ans)
|
p03479
|
s965051652
|
Wrong Answer
|
import sys
sys.setrecursionlimit(10000)
x,y = map(int,input().split())
if y == 1:
print(1)
exit()
asn = 0
def dfs(x,y,n):
n += 1
ans = x*2**n
if ans > y:
return n
else:
return dfs(x,y,n)
a = dfs(x,y,1)
print(a)
|
p02571
|
s020517809
|
Accepted
|
s = input().rstrip()
t = input().rstrip()
count = 0
min_count = 10000
for i in range(len(s) - len(t) + 1):
s_selected = s[i:i + len(t)]
#print(s_selected)
count = 0
for j in range(len(t)):
if t[j] != s_selected[j]:
count += 1
#print(count)
if count < min_count:
min_count = count
print(min_count)
|
p03359
|
s968689231
|
Accepted
|
#!/usr/bin/env python3
a, b = map(int, input().split())
if a <= b:
print(a)
else:
print(a-1)
|
p03723
|
s502434097
|
Wrong Answer
|
import sys
a, b, c = [int(w) for w in input().split()]
ans = 0
def is_fin(a, b, c):
global ans
if a == b == c:
ans = -1
return True
elif a % 2 or b % 2 or c % 2:
return True
else:
return False
while not is_fin(a, b, c):
ta = (b+c)/2
tb = (a+c)/2
tc = (a + b) / 2
a, b, c = ta, tb, tc
ans += 1
print(ans)
|
p03693
|
s442338592
|
Wrong Answer
|
r, g, b = map(int, input().split())
print('Yes' if (10 * g + b) % 4 == 0 else 'No')
|
p03711
|
s964887929
|
Accepted
|
x, y = map(int, input().split())
a = [1, 3, 5, 7, 8, 10, 12]
b = [4, 6, 9, 11]
if x in a and y in a:
print("Yes")
elif x in b and y in b:
print("Yes")
else:
print("No")
|
p02624
|
s175145670
|
Accepted
|
n = int(input())
A = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
A[j] += 1
print(sum(i * A[i] for i in range(1, n + 1)))
|
p02640
|
s687688595
|
Accepted
|
def main():
x, y = map(int, input().split())
for i in range(x + 1):
total = i * 2 + (x - i) * 4
if total == y:
print("Yes")
exit()
else:
print("No")
if __name__ == "__main__":
main()
|
p02779
|
s397235161
|
Wrong Answer
|
n = int(input())
a = list(map(int,input().split()))
x = len(a)
y = len(set(a))
if x == y:
print('Yes')
else:
print('No')
|
p03011
|
s271403808
|
Wrong Answer
|
p, q, r = map(int, input().split())
x = p + q
y = q + r
z = r + p
if x>=y and x>=z:
print(x)
elif y>=x and y>=z:
print(y)
else:
print(z)
|
p02994
|
s079668061
|
Accepted
|
N,L = map(int,input().split())
Apple = []
compare = []
for i in range(N):
Apple.append(L + i)
tot = sum(Apple)
for i in range(N):
a = Apple[i]
Apple.remove(a)
compare.append(abs(tot - sum(Apple)))
Apple.insert(i,a)
Apple.remove(Apple[compare.index(min(compare))])
print(sum(Apple))
|
p02702
|
s354341892
|
Accepted
|
s = input()[::-1]
sum_of_digits = 0
cnts = [0] * 2019
cnts[0] = 1
d = 1
for c in s:
sum_of_digits += int(c) * d
sum_of_digits %= 2019
d *= 10
d %= 2019
cnts[sum_of_digits] += 1
ans = 0
for cnt in cnts:
ans += cnt * (cnt - 1) // 2
print(ans)
|
p02602
|
s079345484
|
Accepted
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n-k):
if a[i] >= a[i+k]:
print('No')
else:
print('Yes')
|
p03071
|
s947857375
|
Accepted
|
#!/usr/bin/env python3
# N = int(input())
# S = input()
A, B = map(int, input().split())
# A = list(map(int, input().split()))
print(max(A + B, 2 * A - 1, 2 * B -1))
|
p03485
|
s168455455
|
Accepted
|
import math
a,b=(map(int,input().split()))
ans=(a+b)/2
print(int(math.ceil(ans)))
|
p02767
|
s933435769
|
Accepted
|
n=int(input())
x=[int(i) for i in input().split()]
sum=0
for i in range(n):
sum=sum+x[i]
if (sum/n)%1<=0.5:
p=int((sum/n))
else:
p=int((sum/n))+1
answer=0
for i in range(n):
answer=answer+(x[i]-p)**2
print(answer)
|
p03289
|
s856089629
|
Accepted
|
import re
def solve():
S = input()
print('AC' if re.match(r'^A[a-z]+C[a-z]+$', S) else 'WA')
if __name__ == "__main__":
solve()
|
p02946
|
s830512957
|
Accepted
|
k,x=map(int,input().split())
a=[i for i in range(x-k+1,x+k)]
print(*a)
|
p04005
|
s962039015
|
Wrong Answer
|
# n, m, l = map(int, input().split())
# list_n = list(map(int, input().split()))
# n = input()
# list = [input() for i in range(N)
# list = [[i for i in range(N)] for _ in range(M)]
import sys
input = sys.stdin.readline
A, B, C = map(int, input().split())
ans = 0
if (A * B * C) % 2 != 0:
ans = A*B
print(ans)
|
p02640
|
s004669491
|
Accepted
|
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
x, y = map(int, input().split())
if 4*x-y>=0 and y>=2*x and (4*x-y)%2==0:
print("Yes")
else:
print("No")
|
p03605
|
s440896662
|
Accepted
|
n = input()
if "9" in n:
print("Yes")
else:
print("No")
|
p03105
|
s793343508
|
Accepted
|
a, b, c = map(int, input().split())
x = b / a
if (x >= c):
print(c)
else:
print(int(x))
|
p02831
|
s918520367
|
Wrong Answer
|
A, B = map(int, input().split())
a , b = 0, 0
ans = 0
n = 1
for i in range(1, 100000):
a = A * i
if ans != 0:
print(ans)
break
for j in range(n, 100000):
b = B * j
if a == b:
ans = a
elif b < a:
continue
else:
n = j
break
|
p02697
|
s161938504
|
Accepted
|
# E - Rotation Matching
n, m = map(int, input().split())
l, r = 1, n - (n % 2)
for i in range(m):
if n % 2 == 0 and i == (m + 1) // 2:
l += 1
print(l, r)
l, r = l + 1, r - 1
|
p02642
|
s377729935
|
Accepted
|
# D
N = int(input())
d = [0] * (10**6 + 1)
A = list(map(int, input().split()))
for a in A:
d[a] += 1
ans = 0
maxa = max(A) + 1
for i in range(1,maxa):
if d[i] == 1:
ans += 1
if d[i] > 0:
# d[i]の倍数は含めない
for j in range(i*2,maxa,i):
d[j] = 0
print(ans)
|
p02584
|
s218512713
|
Accepted
|
start, num_move, distance = map(int, input().split())
# move toward
desired_move = abs(start) // distance
another_move = num_move - desired_move
if another_move <= 0:
ans_abs = abs(start) - num_move * distance
print(ans_abs)
else:
if another_move % 2 == 0:
ans_abs = abs(start) - desired_move * distance
print(ans_abs)
else:
ans_abs = abs(abs(start) - (desired_move+1) * distance)
print(ans_abs)
|
p03417
|
s594171104
|
Accepted
|
N, M = map(int, input().split())
N, M = min(N, M), max(N, M)
if N != 1 and M != 1:
print((N-2)*(M-2))
elif N == 1 and M != 1:
print(M-2)
else:
print(1)
|
p02835
|
s392504608
|
Accepted
|
s = sum(int(x) for x in input().split())
print('bust' if s >= 22 else 'win')
|
p03030
|
s966070582
|
Accepted
|
n=int(input())
res = []
for i in range(n):
s,p=map(str, input().split())
res += [(s,int(p))]
res1=res
res = sorted(res, key=lambda x:(x[0],-x[1]))
for i in range(n):
print(res1.index(res[i])+1)
|
p04012
|
s853751075
|
Wrong Answer
|
import collections
c=collections.Counter(list(input()))
cv=list(c.values())
ans=0
for i in range(len(cv)):
if cv[i]%2==1:
ans+=1
print('YNeos'[ans%2==1::2])
|
p03286
|
s006597351
|
Wrong Answer
|
n = int(input())
ans = []
a = n
while a != 0:
b = a % (-2)
a //= (-2)
if b == -1:
a += 1
b = 1
ans.append(b)
ans.reverse()
print(*ans, sep='')
|
p02727
|
s279525340
|
Accepted
|
# coding: utf-8
X, Y, A, B, C = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=False)
ans = 0
L = P[:X] + Q[:Y] + R
L.sort(reverse=True)
print(sum(L[:X+Y]))
|
p02796
|
s077299645
|
Wrong Answer
|
n = int(input())
LR = [None] * n
for i in range(n):
x, l = map(int, input().split())
LR[i] = (x - l, x + l)
LR.sort(key=lambda lr: -lr[1])
count = 0
cur = LR[0][0]
for l, r in LR[1:]:
if cur < r:
count += 1
else:
cur = l
print(n - count)
|
p02818
|
s893700400
|
Accepted
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
def main():
A, B, K = map(int, readline().split())
if A>=K:
print(A-K, B)
else:
print(0, max(B-K+A,0))
if __name__ == '__main__':
main()
|
p02760
|
s558908204
|
Wrong Answer
|
A=[tuple(map(int, input().split())) for _ in range(3)]
N=int(input())
B=[int(input())for _ in range(N)]
C=[[False]*3 for _ in range(3)]
for b in B:
for i in range(3):
for j in range(3):
if A[i][j]==b:
C[i][j]=True
ans=False
for i in range(3):
ans|=all(C[i][j] for j in range(3))
ans|=all(C[j][i] for j in range(3))
ans|=all(C[j][j] for j in range(3))
print("YNeos"[not ans::2])
|
p03645
|
s354278434
|
Wrong Answer
|
n,m=map(int,input().split())
g=[[] for i in range(n)]
for _ in range(m):
u,v=map(int,input().split())
g[u-1].append(v-1)
g[v-1].append(u-1)
for x in g[0]:
for y in g[x]:
if y==n-1:
print('POSSIBLE')
else:
print('IMPOSSIBLE')
|
p02996
|
s905839902
|
Accepted
|
import numpy as np
n = int(input())
g = []
for _ in range(n):
a, b = map(int, input().split())
g.append([a,b])
g = np.array(g)
g = g[np.argsort(g[:, 1])]
a = 0
for i,j in g:
a+=i
if a>j:
print('No')
exit(0)
print('Yes')
|
p02603
|
s045994015
|
Accepted
|
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def maxProfit(prices) -> int:
if len(prices) < 2:
return 0
ans = 1000
for i in range(1,len(prices)):
if prices[i] > prices[i - 1]:
stock = ans // prices[i - 1]
ans += stock * (prices[i] - prices[i - 1])
return ans
def main():
n = int(input().strip())
A = [int(i) for i in input().strip().split()]
ans = maxProfit(A)
print(ans)
if __name__ == "__main__":
main()
|
p04030
|
s042018904
|
Wrong Answer
|
a=input()
b=''
for i in a:
if i=='0':
b+='0'
elif i=='1':
b+='0'
else:
b+=b[:-1]
print(b)
|
p02639
|
s456130000
|
Wrong Answer
|
x = list(map(int, input().split()))
for i in range(4):
if x[i] == 0:
print(i + 1)
|
p03284
|
s500085063
|
Wrong Answer
|
n,k=map(int,input().split())
if(n<k):
print(1)
else:
print(n%k)
|
p03067
|
s335327201
|
Wrong Answer
|
A, B, C = map(int, input().split())
print('Yes' if A <C<B else 'No')
|
p03286
|
s246815820
|
Accepted
|
N = int(input())
ans = []
if N == 0:
ans.append("0")
while N != 0:
ans.append(str(N % 2))
N = -(N // 2)
ans.reverse()
print("".join(ans))
|
p02947
|
s315106590
|
Accepted
|
n=int(input())
d=dict()
a=0
for _ in range(n):
s=''.join(sorted(input()))
if s in d:
a+=d[s]
d[s]+=1
else:
d[s]=1
print(a)
|
p02547
|
s827435553
|
Accepted
|
n=int(input())
arr=[]
for i in range(n):
arr.append(list(map(int,input().split())))
flag=0
for i in range(n-2):
if(arr[i][0]==arr[i][1] and arr[i+1][0]==arr[i+1][1] and arr[i+2][0]==arr[i+2][1]):
flag=1
print("Yes")
break
if(flag==0):
print("No")
|
p03861
|
s676748197
|
Accepted
|
a,b,x=map(int,input().split())
ax=(a-1)//x
bx=b//x
print(bx-ax)
|
p02582
|
s468657213
|
Wrong Answer
|
s=input()
cnt=0
if s=='RRR':
cnt = 3
elif s== 'RRS':
cnt = 2
elif s== 'SRR':
cnt = 2
elif s == 'RSS':
cnt= 1
elif s == 'RSR':
cnt=1
elif s=='SSR':
cnt=1
print(cnt)
|
p02700
|
s185041049
|
Wrong Answer
|
a, b, c, d = map(int, input().split())
print("Yes") if a+b>c+d else print("No")
|
p02811
|
s308382247
|
Wrong Answer
|
K, X = map(int,input().split())
K = K*500
if(K >= X):
print("yes")
else:
print("No")
|
p03250
|
s927345030
|
Accepted
|
a,b,c = map(int,input().split())
d = max(a,b,c)
e = min(a,b,c)
f = (a + b + c) - (d + e)
print(10 * d + e + f)
|
p02795
|
s396336779
|
Accepted
|
h = int(input())
w = int(input())
n = int(input())
MAX = max(h, w)
if n % MAX == 0:
print(n // MAX)
else:
print(n // MAX + 1)
|
p02963
|
s223565541
|
Accepted
|
n = int(input())
z = 1000000000
if n==z*z:
print(z, 0, 0, z, 0, 0)
elif n > z:
a = n//z
b = n%z
print(a+1, b, 0, z, 1, 0)
else:
print(n, 0, 1, 1, 0, 0)
|
p02922
|
s809146924
|
Accepted
|
a,b = map(int,input().split())
som = 1
cnt = 0
f = 0
while(som < b):
som = som+a-1
cnt = cnt+1
if som >= b:
f = 1
break
print(cnt)
|
p02832
|
s536643066
|
Accepted
|
N = int(input())
blocks = list(map(int, input().split()))
target = 1
for block in blocks:
if block == target:
target += 1
if target > 1:
print(N-target+1)
else:
print(-1)
|
p03617
|
s269897386
|
Accepted
|
Q, H, S,D = map(int,input().split())
N=int(input())
L=min(4*Q, 2*H,S)
if 2*L<=D:
ans=N*L
else:
m=N//2
ans=m*D+L*(N-2*m)
print(ans)
|
p02922
|
s082578555
|
Accepted
|
a, b = map(int, input().split())
ans = 0
outlets = 1
while outlets < b:
outlets -= 1
outlets += a
ans += 1
print(ans)
|
p02700
|
s431121101
|
Accepted
|
A,B,C,D = map(int,input().split())
if -(-C//B) > -(-A//D):
print("No")
else:
print("Yes")
|
p03095
|
s891868586
|
Accepted
|
import collections
count = collections.Counter
mod = 1000000007
def main():
N = int(input())
S = input()
valuelist = list(count(S).values())
ans = 1
for v in valuelist:
ans = (ans * (v + 1))%mod
ans -= 1
print(ans)
if __name__ == "__main__":
main()
|
p03433
|
s468014347
|
Accepted
|
N = int(input())
A = int(input())
if N%500 <= A:
print('Yes')
else:
print('No')
|
p03103
|
s618347627
|
Accepted
|
N, M = map(int, input().split())
arr = sorted([list(map(int, input().split())) for _ in range(N)])
count = 0
money = 0
for list in arr:
for i in range(list[1]):
money += list[0]
count += 1
if count == M:
print(money)
exit()
|
p02951
|
s076215461
|
Wrong Answer
|
A = list(map(int,input().split()))
print(A[2] - (A[0]-A[1]))
|
p03437
|
s188116147
|
Accepted
|
from fractions import gcd
X, Y = map(int, input().split())
if (gcd(X, Y) == Y):
print(-1)
else:
print(X)
|
p02882
|
s475330484
|
Accepted
|
from math import pi, atan
a, b, x = map(int, input().split())
if a**2 * b * 0.5 <= x:
theta = atan(2 * (a**2 * b - x) / a**3)
else:
theta = atan(a * b**2 * 0.5 / x)
print("{:.10f}".format(theta / pi * 180))
|
p03797
|
s373039193
|
Accepted
|
n,m = map(int,input().split())
ans = 0
if n <= m//2:
ans += n
m -= 2*n
ans += m//4
else:
ans = m//2
print(ans)
|
p03817
|
s405943693
|
Wrong Answer
|
x=int(input())
cnt=(x//11)*2
if x%11 >5:
cnt+=2
elif 0< x%11 <=5:
cnt+=1
print(cnt)
|
p02601
|
s205336289
|
Accepted
|
A,B,C=map(int,input().split())
K=int(input())
flag=True
for i in range(K):
if A>=B:
B*=2
continue
if B>=C:
C*=2
continue
if C>B and B>A:
flag=False
break
if C>B and B>A:
flag=False
print('Yes' if flag==False else "No")
|
p02873
|
s902331185
|
Accepted
|
S = input()
n = len(S)
a = [0]*(n+1)
for i in range(n):
if S[i] == '<':
a[i+1] = max(a[i+1], a[i] + 1)
for i in range(n)[::-1]:
if S[i] == '>':
a[i] = max(a[i], a[i+1] + 1)
# print(a)
print(sum(a))
|
p03944
|
s368040092
|
Accepted
|
w,h,n=map(int,input().split())
A=[0,w,0,h]
for i in range(n):
x,y,a=map(int,input().split())
if a==1:
A[0]=max(A[0],x)
elif a==2:
A[1]=min(A[1],x)
elif a==3:
A[2]=max(A[2],y)
else:
A[3]=min(A[3],y)
if (A[1]-A[0])<=0 or (A[3]-A[2])<=0:
print(0)
else:
print((A[1]-A[0])*(A[3]-A[2]))
|
p03062
|
s828922945
|
Accepted
|
def main():
N = int(input())
A = [int(a) for a in input().split(" ")]
if A.count(0) > 0:
print(sum([abs(a) for a in A]))
return 0
minus = 0
for i in range(len(A)):
if A[i] < 0:
minus += 1
if minus % 2 == 0:
print(sum([abs(a) for a in A]))
return 0
A.sort(key=lambda a: abs(a))
print(sum([abs(a) for a in A[1:]]) - abs(A[0]))
main()
|
p02982
|
s765628680
|
Accepted
|
import math
n,d = map(int,input().split())
x = [list(map(int, input().split())) for i in range(n)]
ans = 0
for i in range(n-1):
for j in range(i+1,n):
t = 0
for k in range(d):
t+=(x[i][k]-x[j][k])**2
if math.sqrt(t)==int(math.sqrt(t)):
ans += 1
print(ans)
|
p02989
|
s542607108
|
Accepted
|
import sys
import math
import bisect
def solve(A):
n = len(A)
A.sort()
l = (n - 1) // 2
r = l + 1
return A[r] - A[l]
def main():
n = int(input())
A = list(map(int, input().split()))
print(solve(A))
if __name__ == "__main__":
main()
|
p02786
|
s004544140
|
Wrong Answer
|
import math
H = int(input())
monster_num = 1
attack = 0
while H > 1:
attack = attack + monster_num * 1
H = math.ceil(H/2)
monster_num = monster_num * 2
print(monster_num + attack)
|
p02707
|
s675109261
|
Accepted
|
import collections
n=int(input())
l=list(map(int,input().split()))
c=collections.Counter(l)
for i in range(1,n+1):
print(c[i])
|
p02602
|
s660292421
|
Wrong Answer
|
n, k = map(int,input().split())
a = input().split()
ls = []
times = 1
for j in range(n-k):
for i in range(j,j+k):
times *= int(a[i])
ls.append(times)
times = 1
i += 1
for x in range(len(ls)-1):
if ls[x] < ls[x+1]:
print('Yes')
print('No')
|
p03469
|
s824722925
|
Accepted
|
# coding: utf-8
S = input()
print('2018' + S[4:])
|
p03435
|
s438873243
|
Accepted
|
mat=[]
for i in range(3):
array=list(map(int,input().split()))
mat.append(array)
#print(mat)
diff_tate=[]
for i in range(2):
diff_tate.append([mat[i][0]-mat[2][0],mat[i][1]-mat[2][1],mat[i][2]-mat[2][2]])
#print(diff_tate)
diff_yoko=[]
for i in range(2):
diff_yoko.append([mat[0][i]-mat[0][2],mat[1][i]-mat[1][2],mat[2][i]-mat[2][2]])
#print(diff_yoko)
for diff in diff_tate+diff_yoko:
dset=set(diff)
if len(dset)>1:
print("No")
break
else:
print("Yes")
|
p02582
|
s764131948
|
Accepted
|
S = input()
count = 0
if 'R' in S:
count = 1
if 'RR' in S:
count = 2
if 'RRR' in S:
count = 3
print(count)
|
p02970
|
s276211773
|
Accepted
|
import sys, heapq, bisect, math, fractions
from collections import deque
N, D = map(int, input().split())
i = 0
res = 0
while i < N:
res += 1
i += 2 * D + 1
print(res)
|
p03543
|
s872139239
|
Wrong Answer
|
a=sorted(input())
for i in range(4):
if a.count(a[0]) <= 3:
print('Yes')
exit()
print('No')
|
p02608
|
s182018503
|
Accepted
|
N = int(input())
ans = [0] * 10**4
for x in range(1, 110):
for y in range(1, 110):
for z in range(1, 110):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n <= 10**4:
ans[n-1] += 1
for i in range(N):
print(ans[i])
|
p02694
|
s626018522
|
Accepted
|
from math import floor
def main():
X=int(input())
tmp=100
for year in range(1,4000):
tmp *= 1.01
tmp = floor(tmp)
if tmp >= X:
print(year)
exit()
main()
|
p02707
|
s529391408
|
Wrong Answer
|
n=int(input())
li=[int(x) for x in input().split()]
d={}
for i in range(len(li)):
if li[i] in d:
d[li[i]]+=1
else:
d[li[i]]=1
c=0
for u,v in d.items():
print(v)
c+=1
while c<n:
print(0)
c+=1
|
p02948
|
s738369426
|
Accepted
|
from heapq import *
N,M=map(int,input().split())
P=0
X=[[] for i in range(10**5+1)]
A,B=0,0
for i in range(N):
A,B=map(int,input().split())
if A>M:
continue
X[M-A].append(B)
Q=[]
heapify(Q)
for i in range(M-1,-1,-1):
for j in range(len(X[i])):
heappush(Q,-X[i][j])
if len(Q):
P-=heappop(Q)
print(P)
|
p02888
|
s535049803
|
Accepted
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
ans = 0
from bisect import bisect_left
for i in range(n-2):
for j in range(i+1, n-1):
ab = l[i] + l[j]
idx = bisect_left(l, ab)
ans += max(idx-j-1, 0)
print(ans)
|
p03359
|
s284184308
|
Accepted
|
a, b = list(map(int, input().split()))
if b < a:
print(a-1)
else:
print(a)
|
p02924
|
s556598586
|
Wrong Answer
|
a=int(input())
print(int((a - 1) * a / 2))
|
p03359
|
s280116417
|
Accepted
|
a, b = map(int, input().split())
ans = 0
if a == b or a < b:
ans += 1
for i in range(1, a):
ans += 1
print(ans)
|
p03673
|
s957885536
|
Wrong Answer
|
from collections import deque
n = int(input())
a_L = list(map(int,input().split()))
ans = deque()
for i in range(0,n):
if i %2 != 0:
ans.appendleft(a_L[i])
else:
ans.append(a_L[i])
print(*ans)
|
p03998
|
s224482973
|
Accepted
|
import sys
sys.setrecursionlimit(500000)
MOD = 10**9+7
def input():
return sys.stdin.readline()[:-1]
def mi():
return map(int, input().split())
def ii():
return int(input())
def i2(n):
tmp = [list(mi()) for i in range(n)]
return [list(i) for i in zip(*tmp)]
def main():
S = {
'a': list(input()),
'b': list(input()),
'c': list(input())
}
turn = 'a'
while S[turn]:
turn = S[turn].pop(0)
print(turn.upper())
if __name__ == '__main__':
main()
|
p02953
|
s727028725
|
Wrong Answer
|
N=int(input())
H=list(map(int,input().split()))
base=0
for h in H:
if base>h:
print("No")
break
base=h-1
else:
print("Yes")
|
p02724
|
s633065184
|
Wrong Answer
|
data = int(input())
result = (data // 1000) * 2000
data %= 1000
result += (data // 5) * 5
print(result)
|
p03137
|
s012128499
|
Accepted
|
def main():
N, M = list(map(lambda a: int(a), input().split(" ")))
if N >= M:
print(0)
return 0
X = list(map(lambda x: int(x), input().split(" ")))
X.sort()
D = [X[i+1] - X[i] for i in range(len(X) - 1)]
D.sort()
print(sum(D[:M-N]))
main()
|
p02584
|
s620009812
|
Accepted
|
x,k,d=map(int,input().split())
x=abs(x-0)
if (x-(k*d))>0:
print((x-(k*d)))
else:
k1=0
k1=x//d
k-=k1
a=(x-(k1*d))
if k%2==0:
print(a)
else:
print(abs(a-d))
|
p03679
|
s672160007
|
Accepted
|
x,a,b=map(int,input().split())
if b-a<=0:
print('delicious')
elif b-a<=x:
print('safe')
else:
print('dangerous')
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.