problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03331 | s922434207 | Accepted | def get_digit_sum(n):
result = 0
while n > 0:
result += n % 10
n //= 10
return result
def main():
ab_sum = int(input())
answer = float("inf")
for i in range(1, ab_sum // 2):
answer = min(answer, get_digit_sum(i) + get_digit_sum(ab_sum - i))
print(answer if ab_sum > 3 else 2)
if __name__ == '__main__':
main()
|
p02989 | s397860371 | Accepted | N = int(input())
l = list(map(int, input().split()))
l.sort()
mid_id = int((N / 2) - 1)
ans = l[mid_id+1] - l[mid_id]
print(ans)
|
p02988 | s674216343 | Wrong Answer | n = int(input())
p = input().split()
cnt = 0
for i in range(0, n-2):
if (p[i] < p[i+1] < p[i+2]) or (p[i] > p[i+1] > p[i+2]):
cnt += 1
print(cnt) |
p02659 | s149398302 | Wrong Answer | a, b = map(float, input().split())
ans = int(a * (b * 100 + 0.5) / 100)
print(ans)
|
p02607 | s416763991 | Accepted | n = int(input())
count = 0
for idx, a_i in enumerate(list(map(int, input().split()))):
if (idx + 1) % 2 != 0 and a_i % 2 != 0:
count += 1
print(count) |
p03457 | s304690456 | Wrong Answer | # -*- coding:utf-8 -*-
n = int(input())
t, x, y = [0], [0], [0]
for i in range(n):
t_i, x_i, y_i = map(int, input().strip().split())
t.append(t_i)
x.append(x_i)
y.append(y_i)
can = "YES"
for i in range(n):
dt = t[i+1] - t[i]
dist = abs(x[i+1] - x[i]) + abs(y[i+1] - y[i])
if (dt < dist) | (dist % 2 != dt % 2):
can = "NO"
print(can) |
p02854 | s411325078 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans = float('inf')
sum_A = sum(A)
CumSum = 0
for i in range(N-1):
CumSum = CumSum + A[i]
ans = min(ans,(abs((sum_A - CumSum)-(CumSum))))
print(ans)
|
p02717 | s765961908 | Accepted | x, y, z = map(int, input().split())
print(z, x, y) |
p02705 | s992302868 | Wrong Answer | import math
R = int(input())
ans = R ** 2 * math.pi
print(ans) |
p02665 | s854669501 | Accepted | N = int(input())
A = [int(i) for i in input().split()]
total = []
num = 0
for i in reversed(range(N+1)):
num += A[i]
total.append(num)
total.reverse()
if A[0] == 1 and N == 0:
print(1)
exit()
if A[0] != 0:
print(-1)
exit()
ans = 1
num = 1
for i in range(1,N+1):
num = min(2*num, total[i])
ans += num
num -= A[i]
if num < 0:
print(-1)
exit()
print(ans)
|
p03951 | s232471040 | Accepted | N = int(input())
s = input()
t = input()
ans = len(s) + len(t)
for i in range(N) :
if s[N - 1 - i :] == t[:i + 1] :
ans = len(s) + len(t) - (i + 1)
print(ans)
|
p03854 | s578138194 | Accepted | s = input()
flag = True
while s != "":
if s[-5:] == "dream":
s = s[:-5]
elif s[-7:] == "dreamer":
s = s[:-7]
elif s[-5:] == "erase":
s = s[:-5]
elif s[-6:] == "eraser":
s = s[:-6]
else:
flag = False
break
if flag:
print("YES")
else:
print("NO") |
p03479 | s077470794 | Wrong Answer | x,y=map(int,input().split())
lst=[]
lst.append(x)
for i in range(2,y):
z=0
z=lst[-1]*2
if z>y:
print(len(lst))
break
else:
lst.append(z)
# print() |
p03487 | s272481701 | Accepted | n = int(input())
a = map(int, input().split())
num_count = {}
for num in a:
if num in num_count:
num_count[num] += 1
else:
num_count[num] = 1
ans = 0
for key in num_count:
if key < num_count[key]:
ans += num_count[key] - key
elif key > num_count[key]:
ans += num_count[key]
print(ans)
|
p03037 | s075793484 | Accepted | n, m = map(int, input().split())
x = 1
y = n
for i in range(m):
l, r = map(int, input().split())
x = max(l, x)
y = min(r, y)
print(max(0, y-x+1)) |
p02595 | s845979290 | Accepted | n, d = map(int, input().split())
ans = 0
for _ in range(n):
x, y = map(int, input().split())
if (x**2+y**2)**(1/2) <= d:
ans += 1
print(ans) |
p03493 | s911443916 | Wrong Answer | s=list(map(int,input().split()))
print(s.count(1)) |
p03208 | s533880676 | Wrong Answer | n, k = map(int,input().split(" "))
trees = []
for i in range(n):
trees.append(int(input()))
trees.sort()
min_val = trees[k-1] - trees[0]
for i in range(1, n - k + 1):
min_val = min(abs(trees[n - k + 1] - trees[i]), min_val)
print(min_val) |
p03962 | s188899297 | Accepted | s=list(map(int,input().split()))
a=s[0]
b=s[1]
if s.count(a)==3:
print(1)
elif s.count(a)==2:
print(2)
elif s.count(b)==2:
print(2)
else:
print(3)
|
p02641 | s284388943 | Accepted | x, n = map(int, input().split())
if n != 0:
ps = list(map(int, input().split()))
ans = 0
sa = x
for i in range(0, 102):
if i not in ps and abs(x-i) < sa:
ans = i
sa = x-i
print(ans)
else:
print(x) |
p02595 | s384254753 | Accepted | import math
n,d = map(int,input().split())
cnt = 0
for i in range(n):
x,y = map(int,input().split())
if math.sqrt(x**2 + y**2) <= d:
cnt += 1
print(cnt) |
p03329 | s092167359 | Wrong Answer | N = int(input())
tannis = [1]
i = 1
while 6**i < N:
tannis.append(6**i)
i += 1
i = 1
while 9**i < N:
tannis.append(9**i)
i += 1
tannis.sort(reverse=True)
# print(tannis)
count = 0
i = 0
while N > 0:
if N >= tannis[i]:
count += N // tannis[i]
N = N % tannis[i]
else:
i += 1
print(count)
|
p03773 | s269939984 | Accepted | a,b=map(int,input().split())
print((a+b)%24) |
p03998 | s681151449 | Wrong Answer | line = input()
line2 = input()
line3 = input()
if line3[-1]=="a":
print("A")
elif line3[-1]=="b":
print("B")
elif line3[-1]=="c":
print("C") |
p03544 | s137329581 | Wrong Answer | n = int(input())
l0 = 2
l1 = 1
L = 0
if n == 1:
print(l0)
exit()
elif n == 2:
print(l1)
exit()
else:
for i in range(2, n+1):
L = l0 + l1
l0 = l1
l1 = L
print(L) |
p02555 | s202032781 | Accepted | def resolve():
S = int(input())
DP = [0]*(S+1)
DP[0] = 1
for i in range(3, S+1):
DP[i] = (DP[i-3] + DP[i-1]) % (10**9 + 7)
print(DP[-1])
resolve() |
p02787 | s836019964 | Accepted | import numpy as np
H,N=map(int,list(input().split(" ")))
a=np.empty(N,dtype=int)
b=np.empty(N,dtype=int)
for i in range(N):
a[i],b[i]=map(int,list(input().split(" ")))
dp=np.empty(H+1,dtype=int)
dp[0]=0
for h in range(1,H+1):
t=h-a
t[t<0]=0
dp[h]=np.min(dp[t]+b)
print(dp[H]) |
p02556 | s839641442 | Accepted | n = int(input())
zmax = -10**10
zmin = 10**10
wmax = -10**10
wmin = 10**10
for i in range(n):
x, y = map(int, input().split())
zref = x + y
wref = x - y
zmax = max(zmax, zref)
zmin = min(zmin, zref)
wmax = max(wmax, wref)
wmin = min(wmin, wref)
ans = max(zmax - zmin, wmax - wmin)
print(ans) |
p03281 | s590970186 | Accepted | n = int(input())
if n < 105:
print(0)
else:
output = 0
for i in range(105,n+1):
if i % 2 == 0:
continue
yaku = 0
for j in range(1,i+1):
if i % j == 0:
yaku += 1
if yaku > 8:
continue
if yaku == 8:
output += 1
print(output) |
p02646 | s362756281 | Accepted | import numpy as np
def main(A, B, V, W, T):
if abs(B-A) <= T*(V-W):
return "YES"
return "NO"
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
print(main(A, B, V, W, T))
|
p02796 | s121611215 | Accepted | n = int(input())
x=[0]*n
l=[0]*n
t=[0]*n
for i in range(n):
x[i],l[i]=map(int,input().split())
t[i]=[x[i],l[i]]
t=sorted(t,key=lambda x:x[0]+x[1])
right=t[0][0]+t[0][1]
count=1
for i in range(1,n):
if t[i][0]-t[i][1]>=right:
count+=1
right=t[i][0]+t[i][1]
print(count) |
p02748 | s195561265 | Wrong Answer | a,b,m = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
xyc = [list(map(int,input().split())) for _ in range(m)]
price = 10**6
for x,y,c in xyc:
k = A[x-1] + B[y-1] - c
if k < price:
price = k
print(k) |
p02618 | s406493941 | Accepted | D=int(input())#365
c=list(map(int,input().split()))
s=[]
for i in range(D):
s.append(list(map(int,input().split())))
print((i+10)%26+1) |
p03862 | s461203092 | Wrong Answer | N, x = map(int,input().split())
a = list(map(int, input().split()))
b = a[::-1]
ans1 = 0
ans2 = 0
for i in range(N-1):
if a[i] + a[i+1] > x:
ans1 += a[i] + a[i+1] - x
a[i+1] -= a[i] + a[i+1] - x
for i in range(N-1):
if b[i] + b[i+1] > x:
ans2 += b[i] + b[i+1] - x
b[i+1] -= b[i] + b[i+1] - x
print(min(ans1,ans2)) |
p03286 | s966909616 | Wrong Answer | n = int(input())
i = 0
ans = []
while n:
i += 1
if n%(2**i):
n -= (-2)**(i-1)
ans.append("1")
else:
ans.append("0")
print("".join(ans[::-1])) |
p03705 | s645757374 | Wrong Answer | n, a, b = map(int, input().split())
if a > b:
print(0)
else:
print((n - 2) * (b - a) + 1) |
p02663 | s857208604 | Accepted | h1,m1,h2,m2,k=map(int,input().split())
ans=(h2-h1)*60+(m2-m1)
ans-=k
print(ans) |
p03067 | s886028337 | Accepted | a,b,c=map(int,input().split())
a,b=min(a,b),max(a,b)
if a<=c<=b:
print("Yes")
else:
print("No") |
p02860 | s551626140 | Wrong Answer | n=int(input())
s=input()
if n%2==0:
if s[0:n//2]==s[n//2:-1]:
print("Yes")
else:
print("No")
else:
print("No") |
p02684 | s678737404 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
tt = [0] * n
tt[0] = 1
ans_l = [1]
i = 1
for j in range(k):
i = a[i-1]
if tt[i-1] == False:
tt[i-1] = 1
ans_l.append(i)
else:
break
d = ans_l.index(i)
k -= d
ans = k % (len(ans_l)-d)
print(ans_l[ans+d])
|
p03951 | s248873942 | Accepted | N = int(input())
s = input()
t = input()
ti = 1
ma = 0
for i in range(N - 1, -1, -1):
if s[i:] == t[:ti]:
ma = ti
ti += 1
print(2 * N - ma) |
p02700 | s822309543 | Accepted | a, b, c, d = list(map(int, input().split()))
while(True):
c -= b
if c <= 0:
print('Yes')
exit()
a -= d
if a <= 0:
print('No')
exit()
|
p02953 | s485367267 | Accepted | n=int(input())
arr=list(map(int,input().split()))
for i in range(n-2,-1,-1):
if arr[i]>arr[i+1]:
arr[i]-=1
if arr[i]>arr[i+1]:
print('No')
break
else:
print('Yes')
|
p02748 | s956311878 | Accepted | A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = min(a)+min(b)
for i in range(M):
x,y,c = map(int,input().split())
ans = min(ans,a[x-1]+b[y-1]-c)
print(ans) |
p02899 | s600250395 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans = [0]*N
for i, a in enumerate(A):
ans[a-1] = i+1
print(*ans) |
p02880 | s816557893 | Accepted | n=int(input())
for i in range(1,10):
syou=n/i
if syou.is_integer():
if 1<=syou and syou<=9:
print("Yes")
exit()
print("No") |
p02623 | s977388778 | Accepted | n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
ans = 0
j = m
for i in range(n + 1):
if a[i] > k:
break
while b[j] > k - a[i]:
j -= 1
ans = max(ans, i + j)
print(ans)
|
p04019 | s637144967 | Accepted | s= list(input())
s=set(s)
if len(s)%2==1:
print('No')
else:
if len(s) == 2:
if "W" in s and "E" in s or "S" in s and "N" in s:
print("Yes")
else:
print('No')
else:
print('Yes')
|
p02996 | s415510226 | Accepted | def main():
N = int(input())
AB = [tuple(map(int, input().split())) for _ in range(N)]
AB.sort(key=lambda x:x[1])
t = 0
for a, b in AB:
t += a
if t > b:
return False
return True
print('Yes' if main() else 'No')
|
p03416 | s742451484 | Wrong Answer | from sys import stdin
a, b = [int(x) for x in stdin.readline().rstrip().split()]
count=0
for i in range(a, b+1):
if str(i)[:2] == str(i)[3:]:
count+=1
print(count) |
p03284 | s575556096 | Accepted | a,b=list(map(int,input().split()))
if a%b==0:
print(0)
else:
print(1)
|
p02695 | s782343785 | Accepted | from itertools import combinations_with_replacement
N, M, Q = map(int,input().split())
ls = []
for _ in range(Q):
a,b,c,d = map(int,input().split())
ls.append((a-1,b-1,c,d))
ans = -1
for A in combinations_with_replacement(range(1,M+1),r=N):
sm = 0
for a,b,c,d in ls:
if A[b]-A[a] == c:
sm += d
ans = max(ans, sm)
print(ans) |
p02687 | s976229389 | Accepted | import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
S = read().decode().rstrip()
print("ABC") if S == 'ARC' else print("ARC")
|
p03163 | s694525130 | Accepted | N, WM = map(int, input().split())
W = []
V = []
dp = [[0] * (WM + 1) for _ in range(N + 1)]
for _ in range(N):
w, v = map(int, input().split())
W.append(w)
V.append(v)
for i in range(N):
for w in range(WM + 1):
if w - W[i] >= 0:
dp[i + 1][w] = max(dp[i + 1][w], dp[i][w - W[i]] + V[i])
dp[i + 1][w] = max(dp[i + 1][w], dp[i][w])
print(dp[N][WM])
|
p02786 | s238700096 | Accepted | n=int(input())
ans=0
m=1
while n>1:
n=n//2
ans+=m
m*=2
print(ans+m)
|
p02755 | s600058633 | Wrong Answer | # coding: utf-8
import math
def main():
a, b = map(int, input().split())
tmp_a_min = math.floor(a / 0.08)
tmp_a_max = math.floor((a+1) / 0.08)
# print(tmp_a_min, tmp_a_max)
for i in range(tmp_a_min, tmp_a_max):
if math.floor(i * 0.1) == b:
print(i)
break
else:
print(-1)
main() |
p02923 | s337805503 | 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()
H = iil()
cnt = 0
ans = 0
for i in range(1,len(H)):
# print(i)
if H[i-1] >= H[i]:
# print('hoge')
cnt += 1
else:
ans = max(cnt,ans)
cnt = 0
print(max(cnt,ans)) |
p02879 | s603667356 | Accepted | A,B=map(int,input().split())
if A<10 and B<10:
print(A*B)
else:
print(-1)
|
p03262 | s342291004 | Wrong Answer | from fractions import gcd
n,X=map(int,input().split())
x=list(map(int,input().split()))
x.append(X)
x.sort()
ans=x[1]-x[0]
if n>1:
for i in range(2,n):
ans=gcd(ans,x[i]-x[i-1])
print(ans) |
p02802 | s583852519 | Accepted | N, M = map(int, input().split())
isAC = [False] * (N+1)
penalties = [0] * (N+1)
ac, penalty = (0, 0)
for _ in range(M):
p, s = input().split()
p = int(p)
if s == "AC":
if not isAC[p]:
isAC[p] = True
ac += 1
penalty += penalties[p]
else:
penalties[p] += 1
print(ac, penalty) |
p03162 | s651710974 | Accepted | n=int(input())
dp=[[0 for _ in range(3)] for _ in range(n+1)]
for i in range(3):
dp[0][i]=0
a=[]
for _ in range(n):
d=list(map(int,input().split()))
a.append(d)
for x in range(n):
for y in range(3):
for z in range(3):
if y!=z:
dp[x+1][z]=max(dp[x+1][z],dp[x][y]+a[x][z])
print(max(dp[n][0],dp[n][1],dp[n][2])) |
p02576 | s398194567 | Accepted | n,x,t = map(int, input().split())
if n % x ==0:
print((n // x) * t)
else:
print((n // x + 1) * t)
|
p02553 | s046781371 | Accepted | a,b,c,d=map(int,input().split())
print(max(a*c,a*d,b*c,b*d)) |
p02843 | s386888544 | Accepted | X = int(input())
a = [100, 101, 102, 103, 104, 105]
dp = [[False]*100010 for _ in range(10)]
dp[0][0] = True
for i in range(6):
for j in range(X+1):
dp[i+1][j] |= dp[i][j]
if j >= a[i]:
dp[i+1][j] |= dp[i][j-a[i]]
dp[i+1][j] |= dp[i+1][j-a[i]]
if dp[6][X]:
print(1)
else:
print(0) |
p03035 | s622128053 | Wrong Answer | A,B=map(int,input().split())
if A>=13:
fare=B
elif A>=6 and A<=12:
fare=B/2
else:
fare=0
print(fare)
|
p02777 | s371087124 | Accepted | inputf = input
a,b = inputf().split(' ')
a_, b_ = inputf().split(' ')
a_ = int(a_)
b_ = int(b_)
c = inputf()
if c==a:
a_ -= 1
else:
b_ -= 1
print(a_, b_) |
p02608 | s407221566 | Accepted | n = int(input())
dp = [0 for i in range(n+1)]
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
res = x**2+y**2+z**2+x*y+y*z+z*x
if res<=n:
dp[res]+=1
for i in range(1,n+1):
print(dp[i])
|
p03069 | s826893200 | Wrong Answer | n=int(input())
s=input()
w_cnt=s.count(".")
ans=[]
b=0
w=w_cnt
for i in range(n):
if s[i]=="#":
b+=1
else:
w-=1
ans.append(b+w)
print(min(ans)) |
p02795 | s372047780 | Accepted | from math import ceil
H = int(input())
W = int(input())
N = int(input())
print(ceil(N/max(H,W))) |
p02554 | s002390742 | Accepted | n=int(input())
mod=10**9+7
ans=10**n
ans-=2*(9**n)
ans+=8**n
ans%=mod
print(ans)
|
p03803 | s710170261 | Accepted | import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
if __name__ == '__main__':
a = [int(i) for i in input().split()]
if a[0] == 1:
a[0]+=13
if a[1] == 1:
a[1]+=13
if a[0] > a[1] :
print("Alice")
elif a[0] == a[1]:
print("Draw")
else:
print("Bob") |
p04011 | s951523752 | Wrong Answer | N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if N > K:
print(X*N + Y*(N-K))
else:
print(X*N) |
p02972 | s152207962 | Accepted | n = int(input())
A = [None] + [int(i) for i in input().split()] # 1-based index
ans = []
choose = [0] * (n + 1)
for i in range(n, 0, -1): # 大きい数から評価する
x = sum(choose[2 * i::i]) # その箱の倍数に入っている玉の和を求める
if x % 2 == A[i]: # 偶奇の一致を確認
continue
choose[i] += 1
ans.append(str(i))
print(len(ans))
print(" ".join(ans))
|
p02622 | s125090828 | Accepted | def resolve():
S = list(input())
T = list(input())
cnt = 0
for i in range(len(S)):
if S[i] != T[i]:
cnt += 1
print(cnt)
if '__main__' == __name__:
resolve() |
p03371 | s577585933 | Accepted | #!/usr/bin/python3
#coding: utf-8
A, B, C, X, Y = (int(x) for x in input().split())
ret = 0
if A + B > C * 2:
m = min(X, Y)
X -= m
Y -= m
ret += m * C * 2
if X > 0:
if A > C * 2:
ret += X * C * 2
else:
ret += X * A
if Y > 0:
if B > C * 2:
ret += Y * C * 2
else:
ret += Y * B
print(ret)
|
p02663 | s170153667 | Accepted | h1, m1, h2, m2, k = map(int, input().split())
x = (h2*60 + m2) - (h1*60 + m1)
print(x-k) |
p03944 | s334032275 | Wrong Answer | W, H, N = map(int, input().split())
sx, sy, ex, ey = 0, 0, W, H
for i in range(N):
x, y, a = map(int, input().split())
if a == 1:
sx = max([x, sx])
elif a == 2:
ex = min([x, ex])
elif a == 3:
sy = max([y, sy])
else:
ey = min([y, ey])
print((ex-sx)*(ey-sy))
|
p02912 | s631496902 | Wrong Answer | import numpy as np
import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
p = [0] * n
arr = np.array(a)
for i in range(m):
index = np.argmax(arr)
tar = arr[index]
p[index] += 1
arr[index] = math.floor(tar / 2.0)
ans = 0
for i in range(n):
ans += a[i] / (2 ** p[i])
#ans = math.floor(np.sum(arr))
print(int(ans))
|
p03487 | s512158423 | Accepted | from collections import Counter
def solve():
N = int(input())
A = list(map(int, input().split()))
c = Counter(A)
ans = 0
for k,v in c.items():
if v<k:
ans += v
else:
ans += v-k
return ans
print(solve()) |
p02675 | s625902324 | Accepted | N = str(input())
num = N[-1]
num = int(num)
if num == 3:
print('bon')
elif num == 0 or num==1 or num==6 or num==8:
print('pon')
elif num ==2:
print('hon')
elif num == 4:
print('hon')
elif num==5:
print('hon')
elif num==7:
print('hon')
elif num==9:
print('hon') |
p02972 | s004918139 | Wrong Answer | n = int(input())
ns = list(map(int, input().split()))
rslt = [0] * n
r = n - 1
while r >= 0:
if sum(rslt[r:n:r+1]) % 2 == ns[r]:
rslt[r] += 1
r -= 1
print(sum(ns))
if sum(ns):
print(*[i+1 for i, num in enumerate(ns) if num == 1])
|
p02705 | s408425636 | Accepted | from math import pi
print(2 * pi * int(input())) |
p03163 | s885385748 | Wrong Answer | n,w=map(int,raw_input().split())
a=[map(int,raw_input().split()) for _ in xrange(n)]
z=[[0]*(w+1)]
for i in xrange(n):
z.append(z[-1][:])
for j in xrange(min(w,a[i][0])+1):
z[i+1][j]=max(z[i+1][j],z[i][j-a[i][0]]+a[i][1])
print max(z[-1]) |
p03699 | s583025093 | Accepted | a=int(input())
b=[0]*a
import sys
for i in range(a):
b[i]=int(input())
b.sort()
c=sum(b)
if c%10==0:
for i in range(a):
if b[i]%10!=0:
c=c-b[i]
print(c)
sys.exit()
print(0)
else:
print(c)
|
p03030 | s088210095 | Wrong Answer | N = int(input())
d = {}
S = set()
for i in range(N):
s,p = input().split()
p = int(p)
S.add(s)
if s in d:
d[s].append([p, i+1])
continue
d[s] = []
d[s].append([p, i+1])
print(d)
S = list(S)
S.sort()
for key in S:
L = d[key]
L = sorted(L, reverse=True)
for l in L:
print(l[1]) |
p03681 | s050922744 | Accepted | import math
n,m = map(int,input().split())
if 2 <= abs(n-m):
print (0)
elif 1 == abs(n-m):
print ((math.factorial(n)*math.factorial(m))%((10**9)+7))
elif n == m:
print ((2*(math.factorial(n)*math.factorial(m)))%((10**9)+7))
|
p02882 | s768751766 | Accepted | import math
a, b, x = map(int, input().split())
if x / (a * b) * 2 <= a:
c = x / (a * b) * 2
print(math.degrees(math.acos(c / math.sqrt(c * c + b * b))))
else:
c = 2 * x / (a * a) - b
print(math.degrees(math.acos(a / math.sqrt(a * a + (b -c) * (b - c)))))
|
p03705 | s794278696 | Wrong Answer | N, A, B = map(int, input().split())
if A>B or N==0:
print(0)
exit()
if A==B:
print(1)
exit()
if N==1:
print(0)
exit()
print((B-A+1)*2-1)
|
p03544 | s417139170 | Wrong Answer | N = int(input())
l = [2, 1]
i = 2
ans =0
while i < N +1:
l.append(str(int(l[i-1]) + int(l[i-2])))
ans = l[i]
i = i+1
print(ans) |
p03386 | s289270943 | Accepted | import sys
from collections import Counter
readline = sys.stdin.buffer.readline
MOD = 10**9+7
def main():
A, B, K = map(int, readline().split())
left = set(list(range(A, min(A+K, B+1))))
right = set(list(range(B, max(B-K, A-1), -1)))
ans = list(left | right)
ans.sort()
for i in ans:
print(i)
if __name__ == '__main__':
main() |
p03785 | s762693957 | Accepted | import collections
n, c, k = map(int, input().split())
t = [int(input()) for i in range(n)]
t.sort()
passenger = 0
departure_limit = t[0] + k
bus_cnt = 0
for T in t:
if passenger+1 > c or T > departure_limit:
departure_limit = T+k
passenger = 1
bus_cnt += 1
else:
passenger+=1
print(bus_cnt+1) |
p02641 | s426623923 | Accepted | x,n = map(int, input().split())
p = list(map(int, input().split()))
ab = min(abs(101 - x),abs(x))
if abs(101 - x) >= abs(x):
answer = 0
else:
answer = 101
for i in range(1,101):
if i in p:
continue
else:
if ab > abs(x - i):
ab = abs(x - i)
answer = i
elif ab == abs(x-i) and answer > i:
answer = i
print(answer) |
p03077 | s448657566 | Accepted | def main():
from builtins import int, map, list, print, min
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
input_list = (lambda: input().rstrip().split())
input_number = (lambda: int(input()))
input_number_list = (lambda: list(map(int, input_list())))
N = input_number()
ls = []
for i in range(5):
ls.append(input_number())
mini = min(ls)
cnt = -(-N//mini)+4
print(cnt)
if __name__ == '__main__':
main()
|
p03861 | s237606907 | Accepted | def solve():
a, b, x = map(int,input().split())
print(b // x + 1 - ((a-1) // x + 1))
if __name__ == '__main__':
solve() |
p02832 | s135110897 | Accepted | data=int(input())
array=list(map(int,input().split()))
counter=0
qwe=1
for i in range(data):
if array[i]==qwe:
counter+=1
qwe+=1
if counter==0:
print(-1)
else:
print(data-counter) |
p03994 | s608615779 | Accepted | N = 26
ord_a = ord('a')
S = [ord(s) - ord_a for s in input()]
K = int(input())
for i in range(len(S)):
r = (N - S[i]) % N
if K >= r:
K -= r
S[i] = 0
S[-1] += K % N
S[-1] %= N
answer = ''.join(chr(s + ord_a) for s in S)
print(answer)
|
p03644 | s155896001 | Accepted | n = int(input())
a = 1
while True:
a *= 2
if n < a:
print(int(a / 2))
break |
p03623 | s798943336 | Wrong Answer | x,a,b=map(int,input().split())
ad=abs(x-a)
bd=abs(x-b)
if ad > bd:
print("A")
elif ad < bd:
print("B") |
p03286 | s175735733 | Accepted |
def f(n):
if n == 0:
return '0'
r = []
while(n):
if n % 2:
r.append(1)
else:
r.append(0)
n = (n-r[-1])/-2
return ''.join(map(str,r[::-1]))
print f(int(raw_input())) |
p03555 | s322428112 | Wrong Answer | def rotation(c , c2):
return "Yes" if c == c2[-1] + c2[1] + c2[0] else "No"
def main():
c = str(input())
c2 = str(input())
print(rotation(c , c2))
if __name__ == '__main__':
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.