Datasets:
peterverebics
/
CodeNet_Python_428

Dataset card Data Studio Files
xet
Community
1
problem_id
stringclasses
428 values
submission_id
stringlengths
10
10
status
stringclasses
2 values
code
stringlengths
5
816
p02600
s077877436
Accepted
X = int(input()) print((21-(X//100))//2)
p03327
s461606298
Wrong Answer
N = int(input()) if N <1000: print("ABC"+str(N).zfill(3)) else: print("ABD"+str(N-999).zfill(3))
p03274
s113192108
Wrong Answer
n, k = map(int, input().split()) x = list(map(int, input().split())) ans = 10 ** 9 if k == 1: for i in range(n): ans = min(ans, abs(x[i])) elif n == k: ans = min(abs(x[0]-x[n-1]) + abs(x[n-1]), abs(x[0]) + abs(x[0] - x[n-1])) else: for i in range(n-k): ans = min(ans, abs(x[i]-x[i+k-1]) + abs(x[i+k-1]), abs(x[i]) + abs(x[i] - x[i+k-1])) print(ans)
p03243
s484552205
Wrong Answer
N = input() if int(N[0]) > int(N[1]) or (int(N[0]) == int(N[1]) >= int(N[2])): print(N[0]+N[1]+N[2]) else: print(str(int(N[0])+1)+str(int(N[0])+1)+str(int(N[0])+1))
p03150
s689598529
Accepted
s = input() l = len(s) for i in range(l): for j in range(i, l): if s[:i] + s[j:] == "keyence": print("YES") exit() else: print("NO")
p02552
s128145281
Wrong Answer
x = int(input()) if x: print(1) else: print(0)
p03274
s560116842
Accepted
n,k=map(int,input().split()) x=list(map(int,input().split())) mi=10**10 for i in range(n-k+1): mi=min(mi,x[k-1+i]-x[i]+min(abs(x[i]),abs(x[k-1+i]))) print(mi)
p03319
s968848019
Accepted
from collections import Counter,defaultdict,deque from heapq import heappop,heappush from bisect import bisect_left,bisect_right import sys,math,itertools,fractions,pprint sys.setrecursionlimit(10**8) mod = 10**9+7 INF = float('inf') def inp(): return int(sys.stdin.readline()) def inpl(): return list(map(int, sys.stdin.readline().split())) n,k = inpl() a = inpl() now = 0 res = 0 for x in a: if x != 1: now += 1 if now == k-1: res += 1 now = 0 if now: res += 1 print(res)
p02897
s428118025
Accepted
N = int(input()) if N%2 == 0: print(1/2) else: print(-(-N//2)/N)
p02687
s263957145
Wrong Answer
s=input() if s == 'ARC': print('ABC') else: print('ABC')
p03162
s302856603
Wrong Answer
# C Vacation N = int(input()) A = [list(map(int, input().split())) for i in range(N)] #print(N,A) dp = [[0] * 3 for _ in range(N)] dp[0][0] = A[0][0] dp[0][1] = A[0][1] dp[0][2] = A[0][2] #print(dp) for i in range(N): for j in range(3): for k in range(3): if j != k: dp[i][j] = max(dp[i][j],dp[i-1][k]+A[i][j]) print(max(dp[N-1]))
p02924
s998435284
Wrong Answer
n = int(input()) print((n-1)//2 * (1 + (n-1)))
p03693
s042310403
Accepted
r,g,b=map(int,input().split()) print("YES"if (100*r+10*g+b)%4==0 else "NO")
p02838
s126767311
Accepted
import sys import numpy as np mod=10**9+7 n=int(sys.stdin.buffer.readline()) a=np.fromstring(sys.stdin.buffer.readline(),dtype=np.int64,sep=' ') ans=0 b=1 for i in range(60): s=int((a&1).sum()) ans=(ans+s*(n-s)*b)%mod a>>=1 b=b*2%mod print(ans)
p03611
s505994665
Accepted
n = int(input()) l = list(map(int,input().split())) l.sort() import bisect ans = 0 for i in l: a = bisect.bisect_right(l,i+1)-bisect.bisect_left(l,i-1) ans = max(ans,a) print(ans)
p02606
s577259712
Accepted
l,r,d = map(int,input().split()) c = 0 for i in range(l , r+1): if i % d == 0: c = c+1 print(c)
p03071
s990970920
Wrong Answer
a,b=map(int,input().split()) if a==b: print(a+b) elif a<b: print(b*2) else: print(a*2)
p03474
s258261468
Accepted
a, b = map(int, input().split()) s = input() if s[a] == '-' and s.count('-') == 1: print("Yes") else: print("No")
p02552
s389806475
Accepted
print(int(input()) ^ 1)
p02684
s537465266
Accepted
N,K = map(int,input().split()) A = list(map(int,input().split())) M = 0 temp = K while temp>0: M += 1 temp>>=1 nexts = [[-1]*N for _ in range(M)] for i in range(N): nexts[0][i] = A[i]-1 for t in range(1,M): for i in range(N): nexts[t][i] = nexts[t-1][nexts[t-1][i]] Kb = [0]*M temp = K for i in range(M): Kb[i] = temp&1 temp >>= 1 ans = 0 for i in reversed(range(M)): if Kb[i]: ans = nexts[i][ans] print(ans+1)