problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03644 | s883248408 | Accepted |
N = int(input())
i = 0
while 2**i < N:
i +=1
if 2**i ==N:
print(2**i)
else:
print(2**(i-1)) |
p03011 | s691477728 | Wrong Answer | P, Q, R = map(int,input().split())
print(min(P + Q, Q + R)) |
p03759 | s222290202 | Accepted | a,b,c=map(int, input().split())
print("YES" if b-a == c-b else "NO") |
p03241 | s784831797 | Accepted | from collections import defaultdict
n, m = map(int, input().split())
ans = 0
i = 1
while i * i <= m:
if m % i == 0:
a, b = i, m // i
if b >= n:
ans = max(ans, a)
if a >= n:
ans = max(ans, b)
i += 1
print(ans)
|
p02731 | s409642266 | Accepted | L = int(input())
a = L / 3.0
print(a ** 3) |
p03219 | s881086651 | Wrong Answer | X, Y = map(int, input().split())
print(X+Y/2) |
p02917 | s491668117 | Accepted | n=int(input())
b=list(map(int,input().split()))
a=[0]*n
a[0]=b[0]
a[n-1]=b[n-2]
for i in range(n-2):
a[i+1]=min(b[i],b[i+1])
print(sum(a))
|
p04005 | s559138021 | Wrong Answer | A, B, C = map(int, input().split())
div = C // 2
ans = 0
if A * B * C % 2 != 0:
ans = abs((A * B * div) - (A * B * (C - div)))
print(ans) |
p02754 | s586228989 | Accepted | from sys import stdin
if __name__ == "__main__":
_in = [_.rstrip() for _ in stdin.readlines()]
N, A, B = list(map(int,_in[0].split(' '))) # type:list(int)
# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
cnt = N//(A+B)*A + (A if N%(A+B)>A else N%(A+B))
# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
print(cnt)
|
p03163 | s393084512 | Accepted | def main():
import numpy as np
N, W = map(int, input().split())
ndp = np.zeros(W+1, dtype= np.int64)
for _ in range(N):
w, v = map(int,input().split())
np.maximum(ndp[:-w] + v, ndp[w:], out = ndp[w:])
else:print(ndp[-1])
if __name__=="__main__":
main() |
p03042 | s352056546 | Accepted | s=input()
f=int(s[:2])
b=int(s[2:])
if f>=1 and f<=12:
if b>=1 and b<=12:
print('AMBIGUOUS')
else:
print('MMYY')
else:
if b>=1 and b<=12:
print('YYMM')
else:
print('NA') |
p02663 | s797035427 | Accepted | import sys
input = sys.stdin.readline
h1,m1,h2,m2,k=map(int,input().split())
H=(h2-h1)*60
M=m2-m1
time=H+M
if time-k >=0:
print(time-k)
else:
print(0) |
p02701 | s255066345 | Accepted | MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
def main():
n = int(input())
S = {input() for _ in range(n)}
print(len(S))
if __name__ == '__main__':
main() |
p03565 | s505989267 | Wrong Answer | S = str(input())
T = str(input())
N = len(S)-len(T)+1
M = len(T)
ans = None
for i in range(N):
flag = 0
for j in range(M):
if S[i+j]==T[j] or S[i+j] == "?":
flag += 1
else:
break
if flag == M:
ans = S[:i]+T+S[i+M:]
ans = ans.replace('?','a')
print(ans)
if ans is None:
print("UNRESTORABLE") |
p03150 | s132849269 | Wrong Answer | S = input()
c = "keyence"
if S[-7:] == c or S[:7] == c:
print("YES")
else:
for i in range(1, 7):
c_, _c = c[:i], c[i:]
if S[:i] == c_ and S[-(i + 1):] == _c:
print("YES")
break
else:
print("NO") |
p02642 | s817801809 | Accepted | n = int(input())
a = list(map(int,input().split()))
a.sort()
li = [True] * (10**6 + 10)
ans = 0
for i in range(n):
if not li[a[i]]:
continue
li[a[i]] = False
tmp = a[i]
while tmp < len(li):
li[tmp] = False
tmp += a[i]
if i < n-1:
if a[i+1] == a[i]:
continue
ans += 1
print(ans)
|
p02818 | s939312631 | Accepted | A, B, K = map(int, input().split())
print(max(0, A-K), max(0, B-max(0, K-A))) |
p02899 | s361140689 | Accepted | N=int(input())
A=list(map(int,input().split()))
for i in range(N):
A[i]=[A[i],i]
A.sort()
for i in range(N):
print(A[i][1]+1,end=' ')
print()
|
p02705 | s609001239 | Accepted | import math
R = int(input())
print(2*math.pi*R)
|
p04031 | s110879155 | Accepted | N = int(input())
a = list(map(int, input().split()))
import math
#残差最小化の解
x = sum(a)/N
x_large = math.ceil(x)
x_small = math.floor(x)
#大きい残差と小さい残差を計算
sum_large = 0
sum_small = 0
for i in a:
sum_large += (x_large-i)**2
sum_small += (x_small-i)**2
#最小残差
print(min(sum_large,sum_small)) |
p03624 | s847550834 | Accepted | S1 = set(list('abcdefghijklmnopqrstuvwxyz'))
S2 = set(list(input()))
S3 = S1-S2
if len(S3) == 0:
print('None')
else:
print(sorted(list(S3))[0]) |
p04033 | s524491485 | Accepted | a, b = map(int, input().split())
if a <= 0 and 0 <= b:
print('Zero')
elif a > 0:
print('Positive')
else:
if abs(a-b) % 2 == 0:
print('Negative')
else:
print('Positive') |
p02947 | s488629416 | Wrong Answer | from itertools import combinations as c
n, *d = map(sorted, open(0).read().split())
print(sum(d[i[0]] == d[i[1]] for i in c(range(int("".join(n))), 2))) |
p02761 | s181931696 | Accepted | n,m=map(int,input().split())
sc=[list(map(int,input().split())) for _ in range(m)]
start=10**(n-1)
if n==1:
start=0
for i in range(start,1001):
i = str(i)
for s,c in sc:
if i[s-1] != str(c):
break
else:
print(i)
exit()
print(-1) |
p02552 | s599174575 | Accepted | print(1-int(input())) |
p02797 | s641950315 | Wrong Answer | n,k,s = map(int, input().split())
a = list()
check = True
x = s - 1
y = s + 1
fin = 0
for i in range(n):
if fin <= k:
if check == True:
check = False
a.append(x)
else:
check = True
a.append(1)
fin += 1
else:
a.append(s+1)
print(*a) |
p03815 | s923988120 | Accepted | x = int(input())
ans = 0
if x >= 11:
t = x//11
ans += t*2
x = x%11
if x > 6:
ans += 2
elif x <= 6 and x != 0:
ans += 1
print(ans) |
p03077 | s537752275 | Wrong Answer | N = int(input())
A = [int(input()) for _ in range(5)]
print(N//(min(A))+5) |
p03815 | s977268182 | Accepted | import math
n = int(input())
q = math.floor(n/11)
r = n % 11
if r == 0: print(2*q)
elif r <= 6: print(2*q+1)
else: print(2*q+2) |
p02700 | s687729070 | Wrong Answer | #coding UTf-8
a,b,c,d = map(int,input().split())
while True:
a=a-d;
if a<=0:
print("No")
break;
c=c-b;
if c<=0:
print("Yes")
break;
|
p02801 | s624663718 | Accepted | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
C = sr()
answer = chr(ord(C) + 1)
print(answer)
# 26 |
p02842 | s604121868 | Accepted | # coding: utf-8
def main():
N = int(input())
ans = ':('
for i in range(50001):
if int(i * 1.08) == N:
ans = i
break
print(ans)
if __name__ == "__main__":
main()
|
p02639 | s338802095 | Accepted | def main():
nums = map(int, input().split())
for i, num in enumerate(nums, 1):
if num == 0:
print(i)
break
if __name__ == '__main__':
main()
|
p02923 | s270389910 | Wrong Answer | n = int(input())
h = list(map(int,input().split()))
a = h[0]
m = 0
ans = 1
for i in range(1,n):
if a >= h[i]:
m += 1
else:
ans = max(ans,m)
m = 0
a = h[i]
print(max(ans,m)) |
p02606 | s425736828 | Accepted | L, R, D = map(int, input().split())
cnt = 0
for i in range(L, R+1):
if i % D == 0:
cnt += 1
print(cnt) |
p03680 | s086430887 | Accepted | import sys
sys.setrecursionlimit(200000)
n = int(input())
a = [int(input()) for i in range(n)]
switch = [False] * (n + 1)
def button(x,cnt):
if switch[x]:
print(-1)
return -1
if x == 2:
print(cnt)
return
switch[x] = True
button(a[x - 1], cnt + 1)
return cnt
ans = button(1, 0) |
p03000 | s428139327 | Accepted | n,x=map(int,input().split())
a=list(map(int,input().split()))
cnt=1
now=0
if sum(a)<=x:
print(n+1)
exit()
for i in a:
now+=i
if now>x:
print(cnt)
exit()
cnt+=1 |
p02724 | s671316236 | Wrong Answer | X = int(input())
#500
X_500 = X // 500 * 2
#5
X_5 = (X % 500) // 5 * 5
print(X_500 + X_5)
|
p03607 | s359892776 | Wrong Answer | import collections
N = int(input())
A = [int(input()) for i in range(N)]
count_dict = collections.Counter(A)
count = 0
for i in count_dict.values():
if i == 1:
count += 1
print(count)
|
p03835 | s781360022 | Wrong Answer |
import itertools
K,S = map(int, input().split())
X = list(range(K+1))
count=0
for x,y in list(itertools.product(X, X)):
if x+y >= S-K:
count+=1
print(count) |
p02993 | s610270641 | Accepted | s = input()
for i in range(3):
if s[i] == s[i+1]:
print("Bad")
exit()
print("Good") |
p02935 | s171938833 | Accepted | n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
res = v[0]
for i in range(1, n):
res = (res + v[i]) / 2
print(res) |
p03095 | s636681999 | Accepted | from collections import Counter
N = int(input())
S = input()
S_c = Counter(S)
ans = 1
mod = 10 ** 9 + 7
for val in S_c.values():
ans *= (val + 1)
ans %= mod
print(ans - 1) |
p04005 | s259566587 | Accepted | a = sorted(list(map(int, input().split())))
if a[0]%2 == 1 and a[1]%2 == 1 and a[2]%2 == 1:
print(a[0]*a[1])
else:
print(0)
|
p02772 | s516180548 | Accepted | def judgiment(number_num):
flag = True
for number in list(map(int, input().split())):
if number % 2 == 0:
if not (number % 3 == 0 or number % 5 == 0):
flag = False
return flag
break
else:
continue
return flag
if __name__ == "__main__":
number_num = int(input())
flag = judgiment(number_num)
if flag == True:
print("APPROVED")
else:
print("DENIED")
|
p02784 | s440628402 | Accepted | H, N = map(int, input().split())
A = list(map(int, input().split()))
if sum(A) >= H:
print('Yes')
else:
print('No') |
p02711 | s852837307 | Accepted | def main():
N = input()
if (N[0] == "7") or (N[1] == "7") or (N[2] == "7"):
print("Yes")
else:
print("No")
return 0
if __name__ == '__main__':
main() |
p03545 | s893911531 | Wrong Answer | List = [int(n) for n in input()]
ans = [List[0]] * 4
for i in range(8):
for j in range(3):
if i & (1<<j):
ans[j+1]= -List[j+1]
else:
ans[j+1] = List[j+1]
if sum(ans) == 7:
break
ans = [str(ans[0])] + ['+' + str(x) if x>0 else str(x) for x in ans[1:]]
print("".join(ans) + '=7')
|
p03221 | s906195650 | Wrong Answer | n,m=map(int,input().split())
py=[list(map(int,(str(_+1)+' '+input()).split())) for _ in range(m)]
py.sort(key=lambda x:str(x[1])+','+str(x[2]))
a=[]
pi=0
x=0
b='00000'
ans=[]
for pyi in py:
if pyi[1]!=pi:
x=1
pi=pyi[1]
else:
x+=1
ans.append([pyi[0],(b+str(pyi[1]))[-6:]+(b+str(x))[-6:]])
ans.sort(key=lambda x:x[0])
for ansi in ans:
print(ansi[1]) |
p02761 | s737749688 | Accepted | import sys
n,m = map(int,input().split())
s_c = [list(map(int,input().split())) for s in range(m)] #0 is s, 1 is c
l = 0
if n == 1:
n,l = 0,9
elif n == 2:
n,l =10,99
else:
n,l = 100,999
for i in range(n,l+1):
bol = True
tmp = list(str(i))
for j in range(m):
k = s_c[j][0]
if tmp[k-1] != str(s_c[j][1]):
bol = False
if bol:
print(i)
sys.exit()
print(-1) |
p03469 | s857786720 | Wrong Answer | s=input()
s="2018"+s[:4] |
p02813 | s842925463 | Accepted | import itertools
n=int(input())
p=tuple(map(int,input().split()))
q=tuple(map(int,input().split()))
num=[i for i in range(1,n+1)]
l=list(itertools.permutations(num, r=None))
a=l.index(p)
b=l.index(q)
print(abs(a-b))
|
p03759 | s826237806 | Wrong Answer | print("YES") |
p02777 | s770367524 | Accepted | s,t=input().split()
a,b=map(int, input().split())
u=input()
if u==s:
print(a-1,b)
else:
print(a,b-1) |
p02779 | s743883991 | Accepted | N = input()
A = input().rstrip().split()
As = len(set(A))
if len(A) == As:
print("YES")
else:
print("NO") |
p03645 | s208978127 | Accepted | N,M=map(int,input().split())
from1=set()
toN=set()
for i in range(M):
a,b=map(int,input().split())
if a==1:
from1.add(b)
elif b==N:
toN.add(a)
print(("","IM")[len(from1&toN)==0]+"POSSIBLE")
|
p02571 | s660282056 | Accepted | s = input()
t = input()
ls = len(s)
lt = len(t)
max = 0
for i in range(ls-lt+1):
k = 0
for j in range(i,i+lt):
if s[j] == t[j-i]:
k += 1
if max < k:
max = k
print(lt-max)
|
p02607 | s437818623 | Wrong Answer | N = int(input())
tmp = input().split(' ')
a = []
result = []
for i in range(N):
a.append(int(tmp[i]))
if (i % 2 == 1 and a[i] % 2 == 1):
result.append(a[i])
print(len(result))
|
p03767 | s950876200 | Accepted | n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0
for i in range(n):
ans += a[-2*(i+1)]
print(ans)
|
p03001 | s504255974 | Accepted | W, H, x, y = map(int, input().split())
print(W * H / 2, int((x == W / 2)&(y == H / 2))) |
p02711 | s016247647 | Accepted | N = list(input())
flag = False
for i in range(3):
if N[i] == '7':
flag = True
if flag:
print('Yes')
else:
print('No')
|
p02660 | s911771583 | Accepted | from math import sqrt
n = int(input())
cnt = 0
for i in range(2, int(sqrt(n))):
if n % i == 0:
div = i
while n % div == 0:
n /= div
div *= i
cnt += 1
while n % i == 0:
n /= i
if n > 1:
cnt += 1
print(cnt) |
p02820 | s853749497 | Wrong Answer | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T=input()
count=0
RSP={"r" : P, "s" : R, "p" : S}
for i in range(N):
if (i//K)%2==0<K:
count+=RSP[T[i]]
else:
if i+K<N:
if T[i]!=T[i-K] and T[i]!=T[i+K]:
count+=RSP[T[i]]
else:
if T[i]!=T[i-K]:
count+=RSP[T[i]]
print(count) |
p02768 | s824107084 | Accepted | n,a,b = map(int, input().split())
mod = 10**9+7
ans = pow(2,n,mod)-1
nca = 1
ncb = 1
for i in range(b):
ncb = ncb*(n-i)%mod
ncb *= pow(i+1,mod-2,mod)
if i+1==a:
nca = ncb
ans -= nca+ncb
print(ans%mod) |
p03437 | s452674602 | Wrong Answer | import sys
import math
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
X, Y = map(int, readline().split())
x = X
if Y%X==0:
print(-1)
else:
print(X)
if __name__ == '__main__':
main()
|
p03592 | s187588630 | Accepted | n,m,k=map(int,input().split())
for i in range(n+1):
for j in range(m+1):
s=m*i+n*j-2*i*j
if s==k:
print("Yes")
exit()
print("No") |
p02854 | s021945720 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n = int(input())
a = list( map(int, input().split()))
from itertools import accumulate
acc = [0] + a
acc = list(accumulate(acc))
suma = sum(a)
ans = float('inf')
for i in range(n):
ans = min(abs( 2*acc[i]-suma ),ans )
print(ans)
|
p02552 | s748510764 | Accepted | x = int(input())
print(1-x) |
p02897 | s550014958 | Accepted | n=int(input())
print(((n+1)//2)/n) |
p02660 | s024066636 | Accepted | import math
def factorization(N):
tmp=N
F=[]
for i in range(2,int(math.sqrt(N))+1):
if tmp%i==0:
F.append(i)
tmp//=i
while tmp%i==0:
tmp//=i
if i>tmp:
break
if tmp!=1:
F.append(tmp)
return F
N=int(input())
F=factorization(N)
ans=0
for f in F:
ff=f
while N%ff==0:
ans+=1
N//=ff
ff*=f
print(ans)
|
p02701 | s967157530 | Accepted | n=int(input())
s=set()
for i in range(n):s.add(input())
print(len(s)) |
p02756 | s617921801 | Accepted | s = list(input())
q = int(input())
front = []
end = []
flip = False
for i in range(q):
x = input()
if x == "1":
flip = flip ^ True
else:
z,f,c = x.split()
f = bool(int(f)-1)
if flip ^ f:
end.append(c)
else:
front.append(c)
if flip:
s = s[::-1]
ans = end[::-1] + s + front
else:
ans = front[::-1] + s + end
print("".join(ans)) |
p02747 | s988942959 | Wrong Answer | try:
s = input()
s = s.replace(' ', '')
s = s.replace('hii', 'xxx')
#print(s)
if "hi" in s:
print("Yes")
else: print("No")
except:
print("No")
|
p02765 | s849586034 | Accepted | N, R = map(int, input().split())
if N < 10:
print(R + 100 * (10 - N))
else:
print(R) |
p02843 | s935701040 | Accepted | x = int(input())
for c in range(x+1):
l = 100*c
r = 105*c
if l <= x <= r:
print(1)
exit()
else:
print(0) |
p02785 | s072752595 | Accepted | n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
k = min(k,len(h))
del h[:k]
print(sum(h)) |
p02766 | s732878513 | Accepted | N,K=map(int,input().split())
for i in range(10**18):
if K**i<=N<K**(i+1):
print(i+1)
break |
p03416 | s003959700 | Accepted | A, B = map(int,input().split())
ans = 0
for i in range(A, B+1):
num = str(i)
#print(i,num[0:2],num[::-1][0:2])
if num[0:2] == num[::-1][0:2]:
ans += 1
print(ans) |
p02880 | s849825700 | Accepted | def make_divisor(n):
divisors=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
divisors.append([n//i,i])
return divisors
n = int(input())
lis = make_divisor(n)
for j in lis:
if j[0]<10 and j[1]<10:
print('Yes')
exit(0)
print('No') |
p03161 | s938494533 | Accepted | n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
cnt=[]
for j in range(max(0,i-k),i):
cnt.append(dp[j]+abs(h[j]-h[i]))
dp[i]=min(cnt)
print(dp[-1])
|
p03323 | s900589152 | Wrong Answer | a, b = map(int, input().split())
print("Yay") if a+b % 16 > min(a,b) else print(":(") |
p02973 | s709238911 | Accepted | import bisect
def main():
N = int(input())
A = []
c = 1
l = []
for _ in range(N):
a = int(input())
A.append(a)
l.append(A[-1])
for j in reversed(A[:-1]):
i = bisect.bisect_right(l, j)
if i == len(l):
l.append(j)
else:
l[i] = j
print(len(l))
main()
|
p03282 | s350522105 | Accepted | s = list(str(input()))
s = list(map(int, s))
k = int(input())
flag = True
for i in range(min(len(s),k)):
if s[i] != 1:
flag = False
else:
pass
if flag:
print(1)
else:
for i in range(len(s)):
if s[i] != 1:
print(s[i])
break
|
p03479 | s014282353 | Accepted | import math
x,y=map(int,input().split())
def ans(x,x2,y):
if x>y:
return 0
else:
return ans(x2,x2*2,y)+1
print(ans(x,x*2,y)) |
p02802 | s410286829 | Accepted | N, M = map(int, input().split())
wa = [0]*N
ac = [0]*N
for i in range(M):
p, s = map(str, input().split())
p = int(p)
if (s=='WA') and (ac[p-1]==0):
wa[p-1] += 1
else:
ac[p-1] = 1
ans_ac = 0
ans_wa = 0
for i in range(N):
if ac[i] == 1:
ans_ac += 1
ans_wa += wa[i]
print(str(ans_ac), str(ans_wa)) |
p02957 | s505621522 | Wrong Answer | a,b = map(int,input().split())
if abs(a-b)%2==0:
print(abs(a-b)//2)
else:
print('IMPOSSIBLE') |
p02629 | s769442594 | Accepted | import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
n=ii()
s="abcdefghijklmnopqrstuvwxyz"
ans=""
while(n>0):
n-=1
ans+=s[n%26]
n//=26
print(ans[::-1]) |
p03286 | s956904348 | Wrong Answer | def main():
N = int(input())
ans = ''
base = 1
while N != 0:
if N % (base * -2) == 0:
ans += '0'
else:
ans += "1"
N -= base
base *= -2
ans = list(ans)
ans.reverse()
print(''.join(ans))
if __name__ == "__main__":
main() |
p02607 | s039027192 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in A[1::2]:
if i % 2 == 1:
ans += 1
print(ans) |
p02996 | s844188331 | Accepted | N=int(input())
l_2d = []
for i in range(N):
l_2d.append(list(map(int,input().split())))
l_2d.sort(key=lambda x: x[1], reverse=False)
A=0
ANS='Yes'
for l in l_2d:
A += l[0]
if l[1] < A:
ANS = 'No'
break
print(ANS) |
p02603 | s550539104 | Accepted | n = int(input())
a = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(n-1):
if a[i+1] > a[i]:
stock = money // a[i]
money = money - stock * a[i] + stock * a[i+1]
print(money) |
p02838 | s550900336 | Accepted | MOD = int(1e9 + 7)
n = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(62):
cnt = 0
for a in A:
if a & 1<<i:
cnt += 1
ans += (1<<i % MOD) * cnt % MOD * (n - cnt) % MOD
print(ans % MOD)
|
p02582 | s001629648 | Accepted | s=input()
if s == 'RRR':
print(3)
elif s == 'SRR' or s == 'RRS':
print(2)
elif s == 'SSS':
print(0)
else:
print(1) |
p02742 | s856349165 | Accepted | a, b = map(int, input().split())
c = a*b
if a == c:
print(1)
elif b == c:
print(1)
elif c % 2 == 0:
print(int(c/2))
else:
print(int(c/2)+1) |
p02819 | s421131282 | Accepted | x = int(input())
primes = [True]*(2*x)
for i in range(2, x):
if primes[i]:
for j in range(i, 2*x, i):
primes[j] = False
for i in range(x, 2*x):
if primes[i]:
print(i)
exit()
|
p03796 | s215523871 | Wrong Answer | import math
print(math.factorial(100000)%(10**9+7)) |
p03478 | s460842312 | Accepted | N,A,B = map(int,input().split())
ans = 0
for i in range(1,N + 1):
a = i
digit_sum = 0
while a > 0:
digit_sum += a%10
a //= 10
if A <= digit_sum <= B:
ans += i
print(ans) |
p02918 | s255368161 | Accepted | #python3
def main():
n, k = map(int, input().split())
s = input()
sc = 0
for i in range(n-1):
if s[i] == s[i+1]:
sc += 1
ans = min(sc+2*k, n-1)
print(ans)
main()
|
p03785 | s100394946 | Accepted | N,C,K=map(int,input().split())
from collections import deque
T=[int(input())for _ in range(N)]
T.sort()
T=deque(T)
ans=1
bus=T[0]+K
count=0
while T:
i=T.popleft()
if i>bus:
bus=i+K
ans+=1
count=1
elif count==C:
bus=i+K
ans+=1
count=1
else:
count+=1
print(ans) |
p03835 | s660151144 | Accepted | K, S = map(int, input().split())
sum_three = 0
for i in range(K+1):
for j in range(K+1):
if 0 <= S - (i + j) <= K:
sum_three += 1
print(sum_three) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.