problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02970 | s037497773 | Accepted | n, d = map(int, input().split())
d *= 2
print((d + n) // (d + 1)) |
p03617 | s192644324 | Accepted | T = list(map(int,input().split()))
n = int(input())*4
q_s = 1
h_s = 2
s_s = 4
d_s = 8
L = []
temp = 1
for i in range(4):
s = temp
v = T[i] / s
L.append([T[i],s,v])
temp *= 2
L.sort(key=lambda x: x[2])
ans = 0
for l in L:
ans += (n // l[1])*l[0]
n = n % l[1]
print(ans) |
p03472 | s947408131 | Accepted | import bisect
N,H = map(int,input().split())
a = []; b = []
for i in range(N):
ai,bi = map(int,input().split())
a.append(ai)
b.append(bi)
a = sorted(a)
b = sorted(b)
strn_a = a[N-1]
damage = [strn_a]
for i in range(bisect.bisect_left(b,strn_a),N):
damage.append(b[i])
ans = 0
for i in damage[::-1]:
H -= i
ans += 1
if H <= 0:
break
if H > 0:
if H % damage[0] == 0:
ans += H // damage[0]
else:
ans += H // damage[0] + 1
print(ans) |
p03261 | s153272134 | Wrong Answer | import sys
N = int(input())
W = list(input() for _ in range(N))
if len(set(W)) == N:
for i in range(N-1):
if W[i][0] != W[i+1][-1]:
print('No')
sys.exit()
else:
print('Yes')
else:
print('No') |
p03761 | s966330033 | Wrong Answer | def resolve():
n = int(input())
S0 = sorted(list(input()))
dic = dict(zip(set(S0), [0]*len(S0)))
for s0 in S0:
dic[s0] += 1
for i in range(n-1):
S = list(input())
for k, v in dic.items():
cnt = S.count(k)
dic[k] = min(v, cnt)
ans = ''
for k, v in dic.items():
ans += k * v
print(ans)
if __name__ == '__main__':
resolve() |
p03623 | s756996539 | Wrong Answer | def main():
x, a, b = map(int, input().split())
distance_a = a - x
distance_b = b - x
if distance_a < 0:
distance_a = distance_a * -1
elif distance_b < 0:
distance_b = distance_b * -1
if distance_a > distance_b:
print('B')
else:
print('A')
main() |
p02779 | s224660035 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
if len(a) == len(set(a)):
print('Yes')
else:
print('No') |
p04045 | s881437230 | Accepted | def main():
N, K = (int(i) for i in input().split())
D = {i for i in input().split()}
ans = N
while any(a in D for a in str(ans)):
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
p03698 | s873108037 | Accepted | S = input()
a=0
for i in range(len(S)):
if a==1:
break
if i==len(S)-1:
print("yes")
break
for j in range(i+1,len(S)):
if S[i]==S[j]:
print("no")
a=1
break |
p02843 | s067215448 | Wrong Answer | x = int(input())
if (x >= 2000):
ans = 1
elif (x < 100):
ans = 0
else:
hundred = x // 100
deci = x % 100
five = deci // 5
if (hundred >= five):
ans = 1
else:
ans = 0
print(ans)
|
p03637 | s670185224 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
c2=0
c4=0
for aa in a:
if aa%2 == 0:
if aa%4 == 0:
c4+=1
else:
c2+=1
c0=n-(c2+c4)
cc=2*c4-c0
if c2>=1:
cc-=1
print("Yes" if cc >= 0 else "No")
|
p02712 | s788728340 | Accepted | n = int(input())
ans = 0
for i in range(1,n+1):
if i%15 ==0:
pass
elif i%3 == 0:
pass
elif i%5 == 0:
pass
else:
ans += i
print(ans) |
p03607 | s927406875 | Accepted | import sys
import collections
readline = sys.stdin.readline
def main():
N = int(readline())
A = []
for _ in range(N):
A.append(int(readline()))
Aitems = list(zip(*collections.Counter(A).items()))
Acount = list(Aitems[1])
tmp = [x%2 for x in Acount]
ans = sum(tmp)
print(ans)
if __name__ == "__main__":
main()
|
p02612 | s146230021 | Wrong Answer | print(int(input()) % 1000) |
p02582 | s541200794 | Accepted | str = input()
cnt = 0
for i in range(3):
if str == 'RRR':
cnt = 3
elif str == 'RRS':
cnt = 2
elif str == 'SRR':
cnt = 2
elif str == 'SSS':
cnt = 0
else:
cnt = 1
print(cnt) |
p02600 | s055184885 | Accepted | x = int(input())
if x <= 599:
print("8")
elif x <= 799:
print("7")
elif x <= 999:
print("6")
elif x <= 1199:
print("5")
elif x <= 1399:
print("4")
elif x <= 1599:
print("3")
elif x <= 1799:
print("2")
else:
print("1") |
p02917 | s607680498 | Wrong Answer | N = int(input())
B = [int(s) for s in input().split(' ')]
def doit(bb):
bb = list(bb)
A = []
for b in bb:
if len(A) == 0:
A.append(b)
continue
A.append(min(A[-1], b))
A.append(min(bb[-1], A[-1]))
return sum(A)
print(max(doit(B), doit(reversed(B))))
|
p02713 | s684066600 | Wrong Answer | from math import gcd
k = 200
total = 0
for a in range(1, k+1):
for b in range(1, k+1):
for c in range(1, k+1):
# print(a, b, c, gcd(a, gcd(b, c)))
total += gcd(a, gcd(b, c))
print(total)
|
p02582 | s453972258 | Wrong Answer | X=str(input())
if X=='RRR':
print(3)
elif X=='RRS' or X=='SRR':
print(2)
elif X=='SSS':
print(0) |
p03379 | s154361695 | Accepted | def main():
n = int(input())
x = list(map(int,input().split()))
s = sorted(x)
m1 = s[n//2-1]
m2 = s[n//2]
for i in x:
if i <= m1:
print(m2)
else:
print(m1)
if __name__ == '__main__':
main()
|
p02946 | s034899530 | Accepted | k,x=map(int,input().split())
print(*[i for i in range(x-k+1,x+k)]) |
p02862 | s237474393 | Accepted | def com(n,r,mod):
k=min(r,n-r)
C=1
for i in range(1,k+1):
C=(C*(n+1-i)*pow(i,mod-2,mod))%mod
return C
x, y = map(int,input().split())
mod = 10 ** 9 + 7
m = 2 * x - y
n = 2 * y - x
if m >= 0 and n >= 0 and m % 3 == 0 and n % 3 == 0:
print(com((n + m) // 3, n // 3, mod))
else:print(0) |
p02923 | s616445568 | Accepted | n = int(input())
h = list(map(int, input().split()))
#h, w = list(map(int, input().split()))
count = 0
ans = 0
for i in range(n-1):
if h[i] >= h[i+1]:
count += 1
else:
if count > ans:
ans = count
count = 0
#print(count)
if count > ans:
ans = count
print(ans)
|
p03251 | s978722686 | Wrong Answer |
if __name__ == '__main__':
n,m,x,y = map(int,input().split())
X = list(map(int,input().split()))
Y = list(map(int,input().split()))
x_max = max(X)
y_min = min(Y)
for Z in range(x,y):
if x_max < Z <= y_min:
print("No war")
break
else:
print("War")
|
p02970 | s616500097 | Accepted | import math
N,D = map(int, input().split())
print(math.ceil(N/(D*2+1))) |
p02947 | s390603205 | Accepted | def count_anagram_strings():
n = int(input())
count = 0
d = dict()
for i in range(n):
key = "".join(sorted(list(input())))
if key not in d:
d[key] = 1
else:
d[key] += 1
# N numbers have N * (N - 1) / 2 pairs
for v in d.values():
count += v * (v - 1) / 2
print(int(count))
if __name__ == '__main__':
# n = int(input())
count_anagram_strings() |
p02829 | s562126664 | Accepted | ans = 6
for _ in range(2):
ans -= int(input())
print(ans) |
p03705 | s753851512 | Accepted | n,a,b=map(int,input().split())
print(max(0,(n-2)*(b-a)+1)) |
p03838 | s708036394 | Accepted | x, y = map(int, input().split())
ans = 2* (10 **9)
if y - (-x) >= 0:
ans = y + x + 1
if -y -x >= 0:
ans = min(ans, -y -x + 1)
if -y - (-x) >= 0:
ans = min(ans, -y +x +2)
if y - x >= 0:
ans = min(ans, y-x)
print(ans) |
p03862 | s373048808 | Wrong Answer | def resolve():
n, x = map(int, input().split())
a = list(map(int, input().split()))
c = 0
for i in range(n-1):
if a[i] + a[i+1] > x:
st = (a[i] + a[i + 1]) - x
a[i+1] = 0
c += st
print(c)
resolve() |
p03161 | s591490167 | Accepted | n,k = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')]*n
dp[0] = 0
for i in range(1,n):
dp[i] = min([dp[j]+abs(h[i]-h[j]) for j in range(max(0,i-k),i)])
print(dp[-1]) |
p02924 | s883344140 | Accepted | N = int(input())
print((N-1)*N//2) |
p03555 | s420703415 | Accepted | s=input()
t=input()
flag=0
if (s[0]==t[2])and(s[1]==t[1])and(s[2]==t[0]):
flag=1
if flag==0:
print("NO")
else:
print("YES") |
p02797 | s673447273 | Accepted | n, k , s = map(int, input().split())
ans = []
for i in range(n):
if k != 0:
ans.append(s)
k -= 1
else:
ans.append(s+1 if s != 10**9 else s-1)
print(" ".join([str(x) for x in ans]))
|
p02987 | s285889941 | Wrong Answer | S = input()
if S[0] == S[1] and S[1] != S[2] and S[2] == S[3]:
print("Yes")
elif S[0] == S[3] and S[1] == S[2] and S[0] != S[1]:
print("Yes")
else:
print("No")
|
p03219 | s673852736 | Accepted | x, y = [int(_) for _ in input().split()]
print(x + y//2) |
p03261 | s007546350 | Accepted | n=int(input())
ans='Yes'
ab=input()
l=[ab]
for i in range(n-1):
a=input()
l.append(a)
if l[i][-1]!=a[0]:
ans='No'
break
if len(set(l))!=len(l):
ans='No'
break
print(ans) |
p03645 | s937060964 | Wrong Answer | N,M=map(int,input().split())
A=[[] for _ in range(N+1)]
for _ in range(M):
a,b=map(int,input().split())
A[a].append(b)
ans=False
for i in A[1]:
if i==M:
ans=True
break
for j in A[i]:
if j==M:
ans=True
break
print("POSSIBLE" if ans else "IMPOSSIBLE" ) |
p02664 | s393593568 | Wrong Answer | t = input('')
a = ''
n = ''
for i in range(len(t)):
if t[i] == 'P':
n = 'D'
a += t[i]
if t[i] == 'D':
n = 'D'
a += t[i]
if t[i] == '?':
a+=n
print(a)
# DDDDDD -> 6
# PDPDPD -> 6
# PDPDPDP -> 3 + 3
# PDDDDDP -> 1 + 5
|
p03001 | s923452511 | Wrong Answer | import sys
input=sys.stdin.readline
w,h,x,y=map(int,input().split())
if w*y!=h*x:
print(min(w*y,h*x),0)
else:print(min(w*y,h*x),1) |
p04033 | s782179570 | Accepted | a, b = map(int, input().split())
if a<0 and b>0:
print('Zero')
elif b<0:
if (b-a+1)%2 == 0:
print('Positive')
else:
print('Negative')
else:
print('Positive') |
p03773 | s226563659 | Accepted | a,b=map(int,input().split())
ans=a+b
if ans>=24:
print(ans%24)
else:
print(ans) |
p03472 | s626961482 | Wrong Answer | import math
n,h = map(int,input().split())
a = []
b = []
for i in range(n):
x,y = map(int, input().split())
a += [x]
b += [y]
amax = max(a)
ans = 0
for x in b:
if x > amax:
ans += 1
h -= x
if h <= 0:
print(ans)
exit()
if h % amax == 0:
print(ans + h//amax)
else:
print(ans + h//amax + 1) |
p03637 | s569390741 | Accepted | n = int(input())
a = list(map(int, input().split()))
c2 = 0
c4 = 0
for i in a:
if i%2==0:
if i%4==0:
c4 += 1
else:
c2 += 1
if c2>0:
m = c4*2 + c2
else:
m = c4*2 + 1
if m>= n:
print('Yes')
else:
print('No') |
p02759 | s735532694 | Wrong Answer | N = int(input())
print(N//2)
|
p03524 | s004015077 | Accepted | from collections import Counter
S=input()+"abc"
C=Counter(S)
print("YES" if max(C.values())-min(C.values())<=1 else "NO") |
p03262 | s417287384 | Accepted | import math
from functools import reduce
import fractions
#import math
#import itertools
#import statistics
#import numpy as np
#import collections
#n = int(input())
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
x.append(k)
x.sort()
def gcd_list(numbers):
return reduce(fractions.gcd, numbers)
dif = []
for i in range(n):
dif.append(x[i+1]-x[i])
ans = gcd_list(dif)
print(ans) |
p02880 | s448543813 | Wrong Answer | n=int(input())
for i in range(1,10):
if(n%i==0 and n/i<=9):
print("Yes")
break
else:
print("No")
|
p02946 | s096082171 | Accepted | k, x= map(int, input().split())
pos = [i for i in range(x-k+1, x+k)]
print(*pos, sep=" ") |
p02683 | s723931760 | Accepted | import itertools
N, M, X = map(int, input().split())
a = [list(map(int, input().split())) for i in range(N)]
li = []
for i in range(N+1):
for j in itertools.combinations(range(N), i):
sm = [0] * (M+1)
for k in j:
for l in range(M+1):
sm[l] += a[k][l]
if all(y >= X for y in sm[1:M+1]):
li.append(sm[0])
if li == []:
print(-1)
else:
print(min(li)) |
p04005 | s210641723 | Accepted | a, b, c = map(int, input().split())
if a % 2 == 0 or b % 2 == 0 or c % 2 == 0:
print(0)
exit()
a, b, c = sorted([a, b, c])
print(a * b)
|
p03680 | s245147697 | Accepted | N = int(input())
a = []
for _ in range(N):
a.append(int(input()))
route = set()
route.add(0)
before = 0
ans = 0
for i in range(N):
now = a[before] - 1
ans += 1
if now == 1:
break
elif now not in route:
route.add(now)
before = now
else:
ans = -1
break
print(ans)
|
p04011 | s567936983 | Accepted | n, k, x, y = [int(input()) for _ in range(4)]
if n <= k:
print(x * n)
else:
print(x * k + y * (n - k)) |
p03433 | s922448356 | Wrong Answer | n = int(input())//500
a = int(input())
if n >= a:
print("Yes")
else:
print("No") |
p03043 | s945846249 | Accepted | data=input().split()
N=int(data[0])
K=int(data[1])
ans=0
for i in range(1,N+1):
dice=i
n=0
while 1<=dice<=K-1:
dice*=2
n+=1
ans+=((1/2)**n)/N
print(ans) |
p03693 | s755229976 | Accepted | r, g, b = map(int, input().split())
if (g*10 + b) % 4 == 0:
print("YES")
else:
print("NO")
|
p02681 | s029102416 | Wrong Answer | A = list(input())
B = list(input())
c = len(B)
del B[c-1]
if A == B:
print("Yes")
else:
print("NO") |
p03251 | s612825923 | Wrong Answer | N,M,X,Y = map(int,input().split())
x_lis = list(map(int,input().split()))
y_lis = list(map(int,input().split()))
x_max = max(x_lis)
y_min = min(y_lis)
ans = "War"
for Z in range(X,Y+1):
if x_max < Z <= y_min:
ans = "No War"
print(ans) |
p02801 | s592352451 | Wrong Answer | print(chr(ord(input()))) |
p03251 | s943100074 | Accepted | n, m, x, y = map(int, input().split())
xn = [int(i) for i in input().split()]
ym = [int(i) for i in input().split()]
if max(xn) >= y:
print("War")
elif min(ym) <= x:
print("War")
elif max(xn) >= min(ym):
print("War")
else:
print("No War") |
p03495 | s723726669 | Wrong Answer | from collections import Counter
n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=len(a)
a=dict(Counter(a))
count=0
a = sorted(a.items(), key=lambda x:x[1], reverse=True)
print(a)
for i,j in a:
count+=1
ans-=j
if count==k:
break
print(ans) |
p03136 | s964313519 | Accepted | N = int(input())
L = list(map(int, input().split()))
L.sort()
if L[len(L)-1] < sum(L[:len(L)-1]):
print("Yes")
else:
print("No") |
p03524 | s616627070 | Accepted | s=input()
ct={"a":0,"b":0,"c":0}
for i in range(len(s)):
ct[s[i]]+=1
print("YES" if max(ct.values())-min(ct.values())<2 else "NO") |
p02951 | s260858314 | Accepted | a,b,c = map(int, input().split())
print(b+c-a)if a<=b+c else print(0) |
p03433 | s220464612 | Wrong Answer | N,A = map(int,open(0))
print("YES" if A>=(N%500) else "NO") |
p02933 | s742498086 | Wrong Answer | a = int( input() )
# aが3200以上ならsと出力し、3200未満ならredと出力
if a >= 3200:
print('s')
else:
print('red') |
p03835 | s983349230 | Accepted | k,s = map(int, input().split())
cnt = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s-(x+y) <= k:
cnt += 1
print(cnt) |
p02697 | s778541157 | Wrong Answer | n,m=map(int,input().split())
a=[[] for i in range(m)]
for i in range(m):
a[i].append(i+1)
for i in range(m):
a[-1-i].append(i+1+m)
a[-1][1]=n
for x in a:
print(x[0],x[1])
|
p03319 | s919279984 | Accepted | from math import ceil
N,K=map(int,input().split())
A=list(map(int,input().split()))
X=A.index(1)
M=float("inf")
for i in range(N):
if i<=X<=i+K-1:
P=ceil(i/(K-1))
Q=ceil((N-i-1)/(K-1))
M=min(M,P+Q)
print(M)
|
p02796 | s400425802 | Accepted | N=int(input())
rllist=[]
for _ in range(N):
X,L=map(int,input().split())
rllist.append((X+L,X-L))
rllist.sort()
#print(rllist)
answer=0
max_r=-float("inf")
for r,l in rllist:
#print(max_r,l)
if max_r<=l:
answer+=1
max_r=r
print(answer) |
p02933 | s308234502 | Wrong Answer | a = int(input())
s = input()
print(s if a < 3200 else "red") |
p02719 | s395613239 | Accepted | N, K = [int(a) for a in input().split()]
num_count = (N-N%K)//K
ans = min(abs(N - num_count*K), abs(N - (num_count+1)*K))
if num_count > 0:
ans = min(abs(N - (num_count-1)*K), ans)
print(ans) |
p03252 | s869946996 | Accepted | s = input()
t = input()
replace_s = {chr(i): '' for i in range(ord('a'), ord('z')+1)}
replace_t = {chr(i): '' for i in range(ord('a'), ord('z')+1)}
ans = 'Yes'
for i, j in zip(s, t):
if replace_s[i] and replace_s[i] != j or replace_t[j] and replace_t[j] != i:
ans = 'No'
break
if not replace_s[i]:
replace_s[i] = j
if not replace_t[i]:
replace_t[j] = i
print(ans)
|
p02755 | s054868883 | Accepted | from math import floor
import sys
from copy import copy
input = sys.stdin.readline
'''
n, m = map(int, input().split())
n = int(input())
A = list(map(int, input().split()))
S = input().strip()
for test in range(int(input())):
'''
inf = 100000000000000000 # 1e17
mod = 998244353
aa, bb = map(int, input().split())
for i in range(1, 10000):
if int(floor(i * 0.08)) == aa and int(floor(i * 0.1)) == bb:
print(i)
sys.exit()
print("-1")
|
p03338 | s188882117 | Wrong Answer | n=int(input())
s=input()
ans=0
for i in range(1,n):
cnt=0
x=list(set(s[:i]))
y=list(set(s[i:]))
for j in x:
if x in y:
cnt+=1
if ans<cnt:
ans=cnt
print(ans) |
p03380 | s868956099 | Accepted | import bisect
n=int(input())
a=list(map(int,input().split()))
a.sort()
idx=bisect.bisect_left(a,a[-1]//2)
if n==2:
print(a[1],a[0])
exit()
if idx==0:
print(a[-1],a[idx])
else:
if a[idx]-a[-1]//2<=a[-1]//2-a[idx-1]:
print(a[-1],a[idx])
else:
print(a[-1],a[idx-1]) |
p03241 | s932951828 | Accepted | n,m = map(int,input().split())
if m % n == 0:
print(m//n)
exit()
ans = 1
for i in range(2,int(m**(0.5))+1):
if m % i == 0:
if i <= m/n:
ans = max(ans,i)
if m//i <= m/n:
ans = max(ans,m//i)
print(ans) |
p03062 | s601811689 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(N-1):
if a[i]>0:
ans+=a[i]
else:
if a[i+1]<0:
ans+=(-a[i])
a[i+1]*=-1
else:
if -a[i]>=a[i+1]:
ans+=-a[i]
a[i+1]*=-1
else:
ans+=a[i]
print(ans+a[-1]) |
p02819 | s501029922 | Wrong Answer | x = int(input())
for val in range(x, x**10000) :
if x ==2 :
print(x)
break
elif ((2** val) % val) == 2 :
print (val)
break
else :
continue |
p02777 | s979935780 | Wrong Answer | S,T = input().split()
A,B = map(int,input().split())
U = input()
if(S==U):
print(B)
else:
print(A) |
p03163 | s813664219 | Wrong Answer | import sys
def input():
return sys.stdin.readline().strip()
def main():
# i have too make index as weight and value as value
import numpy as np
N, W = map(int, input().split())
dp = np.zeros(W + 1, int)
for i in range(N):
w, v = map(int, input().split())
np.maximum(dp[:-w] + v, dp[w:], out=dp[w:])
print(dp[:-w],dp[w:] )
print(dp)
if __name__ == "__main__":
main()
|
p02897 | s679035773 | Wrong Answer | n = int(input())
ans = n / 2 if n % 2 == 0 else (n + 1) / 2
print(ans) |
p02831 | s262698054 | Accepted | from fractions import gcd
a, b = map(int, input().split())
lcm = a * b // gcd(a, b)
print(lcm) |
p02779 | s645268081 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = [0 for _ in range (max(a)+1)]
for i in a:
b[i]+=1
if b[i]==2:
print("No")
exit()
print("Yes") |
p03639 | s782337579 | Wrong Answer | n = int(input())
al = list(map(int, input().split()))
four, two = 0, 0
for a in al:
if a%4 == 0:
four += 1
elif a == 2:
two += 1
if n%2 == 0:
if n-four <= four + two//2*2:
print('Yes')
else:
print('No')
else:
if n-four-1 <= four + two//2*2:
print('Yes')
else:
print('No')
|
p02684 | s393088141 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
done=[-1 for _ in range(N)]
done[0]=0
n=0
now=0
init=0
loop=N
log=[0]
while n<N:
log.append(A[log[-1]]-1)
n+=1
if done[log[-1]]>-1:
init=done[log[-1]]
loop=n-done[log[-1]]
break
done[log[-1]]=n
if K<init:
print(log[K]+1)
else:
num=init+(K-init)%loop
print(log[num]+1) |
p02663 | s107453347 | Accepted | h1,m1,h2,m2,k=map(int,input().split())
print((h2-h1-1)*60+60-m1+m2-k) |
p03127 | s501433834 | Wrong Answer | N = int(input())
A = list(map(int,(input().split())))
f = 0
while f == 0 or len(set(A)) >= 3:
nim = sorted(set(A))[0]
if nim == 0:
nim = sorted(set(A))[1]
for i in range(N):
if A[i] != nim:
A[i] %= nim
if len(set(A)) == 1:
print(nim)
break
f = 1
else:
print(nim) |
p03254 | s897894224 | Accepted | [N, x] = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
count = 0
i = 0
while x > 0 and i <= len(a):
x -= a[i]
if i == len(a)-1:
if x != 0:
break
if x >= 0:
count += 1
i += 1
print(count) |
p02697 | s078979343 | Accepted | n, m = map(int, input().split())
od = (m + 1) // 2
x = 2 * od + 1
for i in range(1, od + 1):
print(i, x - i)
ev = m - od
y = 2 * ev
for i in range(m - od):
print(x + i, x + y - i)
|
p02995 | s402971355 | Accepted | from fractions import gcd
A, B, C, D = map(int,input().split())
total = B - A + 1
divC = B//C - (A-1)//C
divD = B//D - (A-1)//D
lcm = int(C * D / gcd(C, D))
divCD = B//lcm - (A-1)//lcm
print(total - divC - divD + divCD)
|
p02576 | s666994054 | Wrong Answer | N,X,T=input().split()
n=int(N)
x=int(X)
t=int(T)
s=int(t*(((n-(n%x))/x)+1))
print(s) |
p02708 | s185139361 | Accepted | N,K = map(int,input().split())
lst = list(range(0,N+1))
m = 10**9 + 7
cnt = 0
start = sum(lst[:K])
end = sum(lst[-K:])
cnt += end - start + 1
for i in range(K+1,N+2):
start += lst[i-1]
end += lst[-i]
cnt += end - start + 1
print(cnt % m)
|
p03693 | s942866350 | Accepted | #Rgb Cards
lst = list(input().split())
a = "".join(lst)
print("YES" if int(a) % 4 == 0 else "NO")
|
p03795 | s561871787 | Accepted | N=int(input())
print(N*800-N//15*200) |
p03455 | s350748619 | Wrong Answer | a,b=map(int,input().split())
if a*b%2==0:
print("even")
else:
print("odd")
|
p03821 | s134778225 | Accepted | def main():
n = int(input())
A, B = [], []
for _ in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
ans = 0
for a, b in zip(A[::-1], B[::-1]):
aa = a + ans
r = aa % b
if r != 0:
ans += b - r
print(ans)
if __name__ == '__main__':
main()
|
p03137 | s996500100 | Wrong Answer | n,m = map(int,input().split())
L = list(map(int,input().split()))
L.sort()
diff = []
for i in range(m-1):
diff.append(L[i+1]-L[i])
diff.sort()
if n == m:
print(0)
exit()
print(sum(diff[:m-n])) |
p02792 | s603730029 | Accepted | N = int(input())
Cij = [[0 for _ in range(10)] for _ in range(10)]
for i in range(1,N+1):
a, b = int(str(i)[0]), int(str(i)[-1])
Cij[a][b] += 1
print(sum(Cij[i][j]*Cij[j][i] for i in range(10) for j in range(10))) |
p03438 | s109834340 | Accepted | n=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
if sum(A)>sum(B):
ans='No'
else:
c=0
d=0
for a,b in zip(A,B):
if a<b:
d+=(b-a)//2+(b-a)%2
c+=(b-a)%2
else:
c+=a-b
if d>=c:
ans='Yes'
else:
ans='No'
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.