problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02780 | n, k = map(int,input().split())
p = list(map(int, input().split()))
val = 0
for i in range(k):
val += p[i]
point = k-1
cnt = val
for i in range(k,n):
cnt += p[i] - p[i-k]
if cnt > val:
val = cnt
point = i-k+1
#print(point)
ans = 0
for i in range(k):
ans += (p[point] + 1) / 2
point... | n, k = map(int,input().split())
p = list(map(int, input().split()))
val = 0
for i in range(k):
val += p[i]
point = 0
cnt = val
for i in range(k,n):
cnt = cnt + p[i] - p[i-k]
if cnt > val:
val = cnt
point = i-k+1
#print(point)
ans = 0
for i in range(k):
ans += (p[point] + 1) / 2
p... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 581,088 | 581,089 | u361381049 | python |
p02780 | import numpy as np
n,k = map(int(input().split()))
p = np.array(list(map(int, input().split())))
m = (p+1)/2
s = sum(m[:k])
r = s
for i in range(n-k):
s -= m[i]
s += m[i+k]
r = max(r,s)
print(r) | import numpy as np
n,k = map(int, input().split())
p = np.array(list(map(int, input().split())))
m = (p+1)/2
s = sum(m[:k])
r = s
for i in range(n-k):
s -= m[i]
s += m[i+k]
r = max(r,s)
print(r) | [
"assignment.value.change",
"call.arguments.change"
] | 581,103 | 581,104 | u864989756 | python |
p02780 | n,k=map(int,input().split())
p=list(map(int,input().split()))
#q=[x-1 for x in p]
ans=0
s=sum(p[:k])
for i in range(n-k):
s=s+p[k+i]-p[i]
ans=max(ans,s)
print(ans/2+k/2)
| n,k=map(int,input().split())
p=list(map(int,input().split()))
s=sum(p[:k])
ans=s
for i in range(n-k):
s=s+p[k+i]-p[i]
ans=max(ans,s)
print(ans/2+k/2)
| [
"assignment.remove",
"assignment.add"
] | 581,127 | 581,128 | u762540523 | python |
p02780 | N, K = map(int, input().split())
p = list(map(int, input().split()))
S = [0]*(N+1)
for i in range(N):
S[i+1] = S[i] + (1+p[i])/2
print(S)
ans = 0
for i in range(N-K+1):
diff = S[i+K] - S[i]
ans = max(ans, diff)
print(ans) | N, K = map(int, input().split())
p = list(map(int, input().split()))
S = [0]*(N+1)
for i in range(N):
S[i+1] = S[i] + (1+p[i])/2
ans = 0
for i in range(N-K+1):
diff = S[i+K] - S[i]
ans = max(ans, diff)
print(ans) | [
"call.remove"
] | 581,136 | 581,137 | u273010357 | python |
p02780 | n,k,*p=map(int,open(0).read().split())
s=m=k
for i in range(k,n):s+=p[i]-p[i-k]*(i>=k);m=max(m,s)
print(m/2) | n,k,*p=map(int,open(0).read().split())
s=m=k
for i in range(n):s+=p[i]-p[i-k]*(i>=k);m=max(m,s)
print(m/2) | [
"call.arguments.change"
] | 581,154 | 581,155 | u729133443 | python |
p02780 | n,k,*p=map(int,open(0).read().split())
s=m=sum(p[:k])
for i in range(k,n):s+=p[i]-p[i-k];m=max(m,s)
print((s+k)/2) | n,k,*p=map(int,open(0).read().split())
s=m=sum(p[:k])
for i in range(k,n):s+=p[i]-p[i-k];m=max(m,s)
print((m+k)/2) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 581,157 | 581,158 | u729133443 | python |
p02780 | n,k,*p=map(int,open(0).read().split())
p+=0,
for i in range(n):p[i]-=~p[i-1]
print(max(p[i+k]-p[i-1]for i in range(n-k))/2) | n,k,*p=map(int,open(0).read().split())
p+=0,
for i in range(n):p[i]-=~p[i-1]
print(max(p[i+k]-p[i]for i in range(-1,n-k))/2) | [
"expression.operation.binary.remove",
"call.arguments.add"
] | 581,160 | 581,161 | u729133443 | python |
p02780 | N,K = map(int,input().split())
ps = list(map(int,input().split()))
dicesSum=[]
l1=ps[0:K]
dicesSum.append(sum(l1))
if K==N:
exp= (K+ dicesSum[0])/2
print(exp)
else:
for i in range(1,N-K+1):
dicesSum.append(dicesSum[i-1]-ps[i-1]+ps[i+K-1])
print(dicesSum)
max_value = max(dicesSum)
exp= ... | N,K = map(int,input().split())
ps = list(map(int,input().split()))
dicesSum=[]
l1=ps[0:K]
dicesSum.append(sum(l1))
if K==N:
exp= (K+ dicesSum[0])/2
print(exp)
else:
for i in range(1,N-K+1):
dicesSum.append(dicesSum[i-1]-ps[i-1]+ps[i+K-1])
max_value = max(dicesSum)
exp= (K+ max_value)/2
... | [
"call.remove"
] | 581,166 | 581,167 | u971719367 | python |
p02780 | N,K = map(int,input().split())
ps = list(map(int,input().split()))
dicesSum=[]
l1=ps[0:K]
dicesSum.append(sum(l1))
if K==1:
exp= (1+ dicesSum[0])/2
print(exp)
else:
for i in range(1,N-K):
dicesSum.append(dicesSum[i-1]-ps[i-1]+ps[i+K-1])
max_value = max(dicesSum)
exp= (K+ max_value)/2
p... | N,K = map(int,input().split())
ps = list(map(int,input().split()))
dicesSum=[]
l1=ps[0:K]
dicesSum.append(sum(l1))
if K==N:
exp= (K+ dicesSum[0])/2
print(exp)
else:
for i in range(1,N-K+1):
dicesSum.append(dicesSum[i-1]-ps[i-1]+ps[i+K-1])
max_value = max(dicesSum)
exp= (K+ max_value)/2
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 581,168 | 581,167 | u971719367 | python |
p02780 | import numpy as np
N, K = map(int, input().split())
x = np.array(list(map(float, input().split())))
for i in range(N):
x[i] = (1 + x[i]) / 2
ans = 0
data = np.sum(x[:K])
for i in range(N-K):
data = data + x[i+K] - x[i]
if data > ans:
ans = data
print(ans) | import numpy as np
N, K = map(int, input().split())
x = np.array(list(map(float, input().split())))
for i in range(N):
x[i] = (1 + x[i]) / 2
data = np.sum(x[:K])
ans = data
for i in range(N-K):
data = data + x[i+K] - x[i]
if data > ans:
ans = data
print(ans) | [
"assignment.remove",
"assignment.add"
] | 581,183 | 581,184 | u370217787 | python |
p02780 | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upper... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upper... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 581,193 | 581,194 | u083960235 | python |
p02780 | def main():
from itertools import accumulate
import sys
read = sys.stdin.buffer.read
N, K, *p = map(int, read().split())
p = [0] + list(accumulate(p))
print((max(y - x for x, y in zip(p, p[K:])) + K) / 2)
if __name__ == '__main__':
print(main())
| def main():
from itertools import accumulate
import sys
read = sys.stdin.buffer.read
N, K, *p = map(int, read().split())
p = [0] + list(accumulate(p))
print((max(y - x for x, y in zip(p, p[K:])) + K) / 2)
if __name__ == '__main__':
main()
| [
"call.remove",
"call.arguments.change"
] | 581,203 | 581,204 | u607729897 | python |
p02780 | from itertools import accumulate
n,k = map(int,input().split())
P = list(map(int,input().split()))
# 期待値の前計算
expP = [(P[i]+1)/2 for i in range(n)]
# 累積和の計算
acc = [0]+ list(+accumulate(expP)) # 0を忘れずに
print(acc)
# 隣接する K 項の和の計算
ans = 0
for i in range(n-k+1):
ans = max(ans,acc[i+k]-acc[i])
print(ans) | from itertools import accumulate
n,k = map(int,input().split())
P = list(map(int,input().split()))
# 期待値の前計算
expP = [(P[i]+1)/2 for i in range(n)]
# 累積和の計算
acc = [0]+ list(accumulate(expP)) # 0を忘れずに
# 隣接する K 項の和の計算
ans = 0
for i in range(n-k+1):
ans = max(ans,acc[i+k]-acc[i])
print(ans) | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change",
"call.remove"
] | 581,205 | 581,206 | u202727309 | python |
p02780 | nk = list(map(int,input().split()))
p = list(map(int,input().split()))
ans = [0] * (nk[0] + nk[1])
zeros = [0] * nk[1]
seq4search = zeros + p
for i in range(nk[1], nk[0] + nk[1]):
seq4search[i] = (seq4search[i] + 1) / 2
ans[i] = ans[i-1] + seq4search[i] - seq4search[i - k]
print(max(ans)) | nk = list(map(int,input().split()))
p = list(map(int,input().split()))
ans = [0] * (nk[0] + nk[1])
zeros = [0] * nk[1]
seq4search = zeros + p
for i in range(nk[1], nk[0] + nk[1]):
seq4search[i] = (seq4search[i] + 1) / 2
ans[i] = ans[i-1] + seq4search[i] - seq4search[i - nk[1]]
print(max(ans)) | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 581,207 | 581,208 | u882696550 | python |
p02780 | nk = list(map(int,input().split()))
p = list(map(int,input().split()))
ans = [0] * (nk[0] + nk[1])
zeros = [0] * nk[1]
seq4search = zeros + p
for i in range(nk[1] + 1, nk[0] + nk[1]):
seq4search[i] = (seq4search[i] + 1) / 2
ans[i] = ans[i-1] + seq4search[i] - seq4search[i - k]
print(max(ans)) | nk = list(map(int,input().split()))
p = list(map(int,input().split()))
ans = [0] * (nk[0] + nk[1])
zeros = [0] * nk[1]
seq4search = zeros + p
for i in range(nk[1], nk[0] + nk[1]):
seq4search[i] = (seq4search[i] + 1) / 2
ans[i] = ans[i-1] + seq4search[i] - seq4search[i - nk[1]]
print(max(ans)) | [
"expression.operation.binary.remove",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 581,209 | 581,208 | u882696550 | python |
p02780 | n, k = map(int, input().split())
l = list(map(int, input().split()))
tmp = l[:k]
now = tmp
for i in range(n-k):
tmp -= l[i]
tmp += l[i+k]
now = max(tmp, now)
print((now + k) / 2) | n, k = map(int, input().split())
l = list(map(int, input().split()))
tmp = sum(l[:k])
now = tmp
for i in range(n-k):
tmp -= l[i]
tmp += l[i+k]
now = max(tmp, now)
print((now + k) / 2) | [
"call.add",
"call.arguments.change"
] | 581,222 | 581,223 | u055875839 | python |
p02780 | n, k = map(int, input().split())
l = list(map(int, input().split()))
tmp = l[:k]
now = tmp
for i in range(n-k+1):
tmp -= l[i]
tmp += l[i+k]
now = max(tmp, now)
print((now + k) / 2) | n, k = map(int, input().split())
l = list(map(int, input().split()))
tmp = sum(l[:k])
now = tmp
for i in range(n-k):
tmp -= l[i]
tmp += l[i+k]
now = max(tmp, now)
print((now + k) / 2) | [
"call.add",
"call.arguments.change",
"expression.operation.binary.remove"
] | 581,224 | 581,223 | u055875839 | python |
p02780 | N, K = map(int, input().split())
p = list(map(int, input().split()))
now = sum(p[:K])
saidai = now
for i in range(K, N):
now -= p[i-K]
now += p[i+K]
if now > saidai:
saidai = now
print('{:.12f}'.format((saidai + K)/2)) | N, K = map(int, input().split())
p = list(map(int, input().split()))
now = sum(p[:K])
saidai = now
for i in range(K, N):
now -= p[i-K]
now += p[i]
if now > saidai:
saidai = now
print('{:.12f}'.format((saidai + K)/2)) | [
"expression.operation.binary.remove"
] | 581,225 | 581,226 | u096983897 | python |
p02780 | a, b = map(int, input().split())
num_list = list(map(int, input().split()))
k_sum = sum(num_list[0:b])
max_sum = k_sum
for i, j in zip(num_list[0:], num_list[k:]):
k_sum -= i
k_sum += j
max_sum = max(max_sum, k_sum)
out = (max_sum + b) / 2
print(out) | a, b = map(int, input().split())
num_list = list(map(int, input().split()))
k_sum = sum(num_list[0:b])
max_sum = k_sum
for i, j in zip(num_list[0:], num_list[b:]):
k_sum -= i
k_sum += j
max_sum = max(max_sum, k_sum)
out = (max_sum + b) / 2
print(out) | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 581,240 | 581,241 | u078982327 | python |
p02780 | from itertools import accumulate
N, K = map(int, input().split())
A = list(map(int, input().split()))
expected = [(a+1)/2 for a in A]
accum_expected = list(accumulate(expected))
accum_expected.insert(0, 0)
ans = 0
for i in range(K, N-K+1):
ans = max(ans, accum_expected[i]-accum_expected[i-K])
print(ans) | from itertools import accumulate
N, K = map(int, input().split())
A = list(map(int, input().split()))
expected = [(a+1)/2 for a in A]
accum_expected = list(accumulate(expected))
accum_expected.insert(0, 0)
ans = 0
for i in range(K, N+1):
ans = max(ans, accum_expected[i]-accum_expected[i-K])
print(ans) | [
"expression.operation.binary.remove"
] | 581,242 | 581,243 | u746849814 | python |
p02780 | def main():
def CalExVal(x):
return (1/2*(x+1))
N, K = map(int, input().split())
A = list(map(int, input().split()))
Ex = list((map(CalExVal, A)))
#temp = len(A)-K + 1
#adjlist = [0]*(temp)
#adjlist = [sum(list(map(CalExVal, A))[i:(K+i)]) for i in range(temp)]
tem = sum(Ex[:K])
res = tem
for i... | def main():
def CalExVal(x):
return (1/2*(x+1))
N, K = map(int, input().split())
A = list(map(int, input().split()))
Ex = list((map(CalExVal, A)))
#temp = len(A)-K + 1
#adjlist = [0]*(temp)
#adjlist = [sum(list(map(CalExVal, A))[i:(K+i)]) for i in range(temp)]
tem = sum(Ex[:K])
res = tem
for i... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 581,248 | 581,249 | u841924362 | python |
p02780 | raw = input()
N, K = raw.split(' ')
N = int(N)
K = int(K)
str_li = input().split(' ')
num_li = list(map(int, str_li))
sum_li = [0]
for i in num_li:
sum_li.append(sum_li[-1] + i + 1)
ans = 0
for index in range(K, N):
ans_tmp = sum_li[index] - sum_li[index - K]
if ans_tmp > ans:
ans = ans_tmp
print(a... | raw = input()
N, K = raw.split(' ')
N = int(N)
K = int(K)
str_li = input().split(' ')
num_li = list(map(int, str_li))
sum_li = [0]
for i in num_li:
sum_li.append(sum_li[-1] + i + 1)
ans = 0
for index in range(K, N+1):
ans_tmp = sum_li[index] - sum_li[index - K]
if ans_tmp > ans:
ans = ans_tmp
print(... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 581,252 | 581,253 | u064136529 | python |
p02780 | # sys.stdin.readline()
import sys
input = sys.stdin.readline
def main():
n,k = map(int,input().split())
l=list(map(int,input().split()))
l2 = [(1+i)/2 for i in l]
kitai=sum(l2[0:k])
tmp = kitai
for idx in range(n)[:n - k + 1]:
tmp -= l2[idx]
tmp += l2[idx+k]
if (kitai < t... | # sys.stdin.readline()
import sys
input = sys.stdin.readline
def main():
n,k = map(int,input().split())
l=list(map(int,input().split()))
l2 = [(1+i)/2 for i in l]
kitai=sum(l2[0:k])
tmp = kitai
for idx in range(n)[:n - k]:
tmp -= l2[idx]
tmp += l2[idx+k]
if (kitai < tmp):... | [
"expression.operation.binary.remove"
] | 581,267 | 581,268 | u820284192 | python |
p02781 | N = input()
K = int(input())
m = len(N)
dp = [[[0] * (K+1) for _ in range(2)] for _ in range(m+1)]
dp[0][0][0] = 1
for i in range(1,m+1):
l = int(N[i-1])
for k in range(K+1):
if k-1>0:
if l!=0:
dp[i][0][k]=dp[i-1][0][k-1]
dp[i][1][k] = dp[i-1][1][k] + 9 * dp... | N = input()
K = int(input())
m = len(N)
dp = [[[0] * (K+1) for _ in range(2)] for _ in range(m+1)]
dp[0][0][0] = 1
for i in range(1,m+1):
l = int(N[i-1])
for k in range(K+1):
if k-1>=0:
if l!=0:
dp[i][0][k]=dp[i-1][0][k-1]
dp[i][1][k] = dp[i-1][1][k] + 9 * d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 581,314 | 581,315 | u434872492 | python |
p02781 | import sys
sys.setrecursionlimit(100)
n = input()
k = int(input())
m = {}
def doit(n, k):
if len(n) == 0:
return k == 0
d = int(n[0])
if (n, k) not in m:
ret = 0
for i in range(d + 1):
if i == d:
ret += doit(n[1:], k - 1 if i > 0 else k)
els... | import sys
sys.setrecursionlimit(10000)
n = input()
k = int(input())
m = {}
def doit(n, k):
if len(n) == 0:
return k == 0
d = int(n[0])
if (n, k) not in m:
ret = 0
for i in range(d + 1):
if i == d:
ret += doit(n[1:], k - 1 if i > 0 else k)
e... | [
"literal.number.integer.change",
"call.arguments.change"
] | 581,321 | 581,322 | u971632623 | python |
p02781 | from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
... | from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
... | [
"control_flow.branch.if.condition.change"
] | 581,327 | 581,328 | u788260274 | python |
p02781 | def resolve():
N = list(input())
lenN = len(N)
K = int(input())
dp = [[[None, None] for _ in range(K+1)] for __ in range(lenN)]
def rec(i, k, smaller):
if k==0:
return 1
if i>=lenN:
return 0
if dp[i][k][int(smaller)] is not None:
... | def resolve():
N = list(input())
lenN = len(N)
K = int(input())
dp = [[[None, None] for _ in range(K+1)] for __ in range(lenN)]
def rec(i, k, smaller):
if k==0:
return 1
if i>=lenN:
return 0
if dp[i][k][int(smaller)] is not None:
... | [
"misc.opposites",
"call.arguments.change"
] | 581,347 | 581,348 | u106797249 | python |
p02781 | N = input()
K = int(input())
dp = [[[0] * (K + 1) for _ in range(2)] for _ in range(len(N) + 1)]
dp[0][0][0] = 1
for i in range(len(N)):
n = int(N[i])
for j in range(2):
for k in range(K + 1):
for d in range((9 if j == 1 else n) + 1):
if k + int(d != 0) <= K:
... | N = input()
K = int(input())
dp = [[[0] * (K + 1) for _ in range(2)] for _ in range(len(N) + 1)]
dp[0][0][0] = 1
for i in range(len(N)):
n = int(N[i])
for j in range(2):
for k in range(K + 1):
for d in range((9 if j == 1 else n) + 1):
if k + int(d != 0) <= K:
... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 581,353 | 581,354 | u057109575 | python |
p02781 | N = input()
K = int(input())
if len(N) < K:
print(0)
exit()
ans = [1, int(N[-1]), 0, 0];
nine = [1, 9, 81, 729]
def combination(N,K):
if N < K:
return 0
elif K == 0:
return 0
elif K == 1:
return N
elif K == 2:
return N*(N-1)//2
else:
return N*(N-1)*(N-2)//6
for k in range(1, len(N)... | N = input()
K = int(input())
if len(N) < K:
print(0)
exit()
ans = [1, int(N[-1]), 0, 0];
nine = [1, 9, 81, 729]
def combination(N,K):
if N < K:
return 0
elif K == 0:
return 1
elif K == 1:
return N
elif K == 2:
return N*(N-1)//2
else:
return N*(N-1)*(N-2)//6
for k in range(1, len(N)... | [
"literal.number.integer.change",
"function.return_value.change"
] | 581,365 | 581,366 | u627600101 | python |
p02781 | N = input()
K = int(input())
if len(N) < K:
print(0)
exit()
ans = [1, int(N[-1]), 0, 0];
nine = [1, 9, 81, 729]
def combination(N,K):
if N < K:
return 0
elif K == 0:
return 0
elif K == 1:
return N
elif K == 2:
return N*(N-1)//2
else:
return N*(N-1)*(N-3)//6
for k in range(1, len(N)... | N = input()
K = int(input())
if len(N) < K:
print(0)
exit()
ans = [1, int(N[-1]), 0, 0];
nine = [1, 9, 81, 729]
def combination(N,K):
if N < K:
return 0
elif K == 0:
return 1
elif K == 1:
return N
elif K == 2:
return N*(N-1)//2
else:
return N*(N-1)*(N-2)//6
for k in range(1, len(N)... | [
"literal.number.integer.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 581,367 | 581,366 | u627600101 | python |
p02781 | N = input()
K = int(input())
if int(N) < K:
print(0)
exit()
keta = []
for k in range(len(N)):
keta.append(int(N[-k-1]))
ans = [1, keta[0], 0, 0];
def combination(N,K):
if N < K:
return 0
else:
p = 1
for k in range(K):
p *= N
N -= 1
for k in range(1, K+1):
p //= k
retur... | N = input()
K = int(input())
if len(N) < K:
print(0)
exit()
keta = []
for k in range(len(N)):
keta.append(int(N[-k-1]))
ans = [1, keta[0], 0, 0];
def combination(N,K):
if N < K:
return 0
else:
p = 1
for k in range(K):
p *= N
N -= 1
for k in range(1, K+1):
p //= k
retur... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 581,368 | 581,369 | u627600101 | python |
p02781 | import sys
sys.setrecursionlimit(10**6)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9+7
N = int(readline())
K = int(readline())
@lru_cache(None)
def f(N,K):
if K == -1:
return 0
if N < 10:
if K == 0:
return 1
... | import sys
from functools import lru_cache
sys.setrecursionlimit(10**6)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9+7
N = int(readline())
K = int(readline())
@lru_cache(None)
def f(N,K):
if K == -1:
return 0
if N < 10:
if ... | [] | 581,385 | 581,386 | u515740713 | python |
p02781 | n = int(input())
k = int(input())
ans = 0
def k1(n):
str1_n = str(n)
keta1 = len(str1_n)
cnt = 9 * (keta1 - 1) + int(str1_n[0])
return cnt
def k2(n):
str2_n = str(n)
keta2 = len(str2_n)
cnt = 81 * (keta2 - 1) * (keta2 - 2) // 2
cnt += (int(str2_n[0]) - 1) * k1(10 ** (keta2 - 1) - 1)... | n = int(input())
k = int(input())
ans = 0
def k1(n):
str1_n = str(n)
keta1 = len(str1_n)
cnt = 9 * (keta1 - 1) + int(str1_n[0])
return cnt
def k2(n):
str2_n = str(n)
keta2 = len(str2_n)
cnt = 81 * (keta2 - 1) * (keta2 - 2) // 2
cnt += (int(str2_n[0]) - 1) * k1(10 ** (keta2 - 1) - 1)... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 581,394 | 581,395 | u222668979 | python |
p02781 | import functools
N = int(input())
K = int(input())
@functools.lru_cache(user_function)
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func... | import functools
N = int(input())
K = int(input())
@functools.lru_cache(None)
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func(quotient... | [
"call.arguments.change"
] | 581,421 | 581,422 | u772029934 | python |
p02781 | import functiontool
N = int(input())
K = int(input())
@functools.lru_cache(user_function)
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return f... | import functools
N = int(input())
K = int(input())
@functools.lru_cache(None)
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func(quotient... | [
"identifier.change",
"call.arguments.change"
] | 581,423 | 581,422 | u772029934 | python |
p02781 | import functools
N = int(input())
K = int(input())
@functools.lru_cache(user_function)
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func... | import functools
N = int(input())
K = int(input())
@functools.lru_cache()
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func(quotient,cou... | [
"call.arguments.change"
] | 581,421 | 581,425 | u772029934 | python |
p02781 | import functiontool
N = int(input())
K = int(input())
@functools.lru_cache(user_function)
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return f... | import functools
N = int(input())
K = int(input())
@functools.lru_cache()
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func(quotient,cou... | [
"identifier.change",
"call.arguments.change"
] | 581,423 | 581,425 | u772029934 | python |
p02781 |
N = int(input())
K = int(input())
@lru_cache
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func(quotient,counter-1)*remain + func(quotie... | import functools
N = int(input())
K = int(input())
@functools.lru_cache()
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func(quotient,cou... | [
"call.add"
] | 581,426 | 581,425 | u772029934 | python |
p02781 | N = int(input())
K = int(input())
def func(num,counter):
remain = num%10
quotient = num//10
print(num,counter)
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func(quotient,counter-1)*remain + func... | N = int(input())
K = int(input())
def func(num,counter):
remain = num%10
quotient = num//10
if counter == 0:
return 1
if num<10:
if counter ==1:
return num
else:
return 0
return func(quotient,counter-1)*remain + func(quotient-1,counte... | [
"call.remove"
] | 581,427 | 581,428 | u772029934 | python |
p02781 | def main():
import sys
input = sys.stdin.readline
N = list(map(int, list(input()[:-1])))
K = int(input())
L = len(N)
# dp[i][j][k]
# i 桁目まで決めて
# j 個の非0を使って
# k = 0 : そこまでの桁はNと一致
# k = 1 : そこまでの桁でN未満であることが確定
dp = [[[0] * 2 for _ in range(K + 2)] for _ in range(L + 1)]
dp... | def main():
import sys
input = sys.stdin.readline
N = list(map(int, list(input()[:-1])))
K = int(input())
L = len(N)
# dp[i][j][k]
# i 桁目まで決めて
# j 個の非0を使って
# k = 0 : そこまでの桁はNと一致
# k = 1 : そこまでの桁でN未満であることが確定
dp = [[[0] * 2 for _ in range(K + 2)] for _ in range(L + 1)]
dp... | [
"assignment.value.change"
] | 581,436 | 581,437 | u111473084 | python |
p02781 | def main():
import sys
input = sys.stdin.readline
N = list(map(int, list(input()[:-1])))
K = int(input())
L = len(N)
# dp[i][j][k]
# i 桁目まで決めて
# j 個の非0を使って
# k = 0 : そこまでの桁はNと一致
# k = 1 : そこまでの桁でN未満であることが確定
dp = [[[0] * 2 for _ in range(K + 2)] for _ in range(L + 1)]
dp... | def main():
import sys
input = sys.stdin.readline
N = list(map(int, list(input()[:-1])))
K = int(input())
L = len(N)
# dp[i][j][k]
# i 桁目まで決めて
# j 個の非0を使って
# k = 0 : そこまでの桁はNと一致
# k = 1 : そこまでの桁でN未満であることが確定
dp = [[[0] * 2 for _ in range(K + 2)] for _ in range(L + 1)]
dp... | [
"assignment.value.change"
] | 581,436 | 581,438 | u111473084 | python |
p02781 | def main():
NOT_DET = 0
SMALLER = 1
s = input()
n = len(s) # 桁数
k = int(input())
dp = [[[0] * 2 for _ in range(k + 1)] for _ in range(n + 1)]
# dp[上から何桁決めたか][0でない数字の個数][smaller=1]
dp[0][0][0] = 1
for i, ci in enumerate(s):
for j in range(k + 1):
dp[i + 1][j][... | def main():
NOT_DET = 0
SMALLER = 1
s = input()
n = len(s) # 桁数
k = int(input())
dp = [[[0] * 2 for _ in range(k + 1)] for _ in range(n + 1)]
# dp[上から何桁決めたか][0でない数字の個数][smaller=1]
dp[0][0][0] = 1
for i, ci in enumerate(s):
for j in range(k + 1):
dp[i + 1][j][... | [
"call.add",
"call.arguments.add"
] | 581,444 | 581,445 | u562935282 | python |
p02781 | n = str(input())
k = int(input())
dp = [[[0] * (k+1) for i in range(2)] for j in range(len(n)+1)]
dp[0][0][0] = 1
for i in range(len(n)):
for j in range(k+1):
if n[i] == "0":
dp[i+1][0][j] = dp[i][0][j]
dp[i+1][1][j] = dp[i][1][j]
if j > 0:
dp[i+1][1][j] +... | n = str(input())
k = int(input())
dp = [[[0] * (k+1) for i in range(2)] for j in range(len(n)+1)]
dp[0][0][0] = 1
for i in range(len(n)):
for j in range(k+1):
if n[i] == "0":
dp[i+1][0][j] = dp[i][0][j]
dp[i+1][1][j] = dp[i][1][j]
if j > 0:
dp[i+1][1][j] +... | [
"expression.operation.binary.change"
] | 581,446 | 581,447 | u667024514 | python |
p02781 | from functools import lru_cache
N = input()
K = int(input())
@lru_cache(maxsize=None)
def search(d, cnt, isEq):
if d == len(N):
return 1 if cnt == K else 0
n = int(N[d])
if isEq and n == '0':
return search(d + 1, cnt, isEq)
if isEq:
ret = 0
ret += search(d + 1, cnt, ... | from functools import lru_cache
N = input()
K = int(input())
@lru_cache(maxsize=None)
def search(d, cnt, isEq):
if d == len(N):
return 1 if cnt == K else 0
n = int(N[d])
if isEq and n == 0:
return search(d + 1, cnt, isEq)
if isEq:
ret = 0
ret += search(d + 1, cnt, Fa... | [
"control_flow.branch.if.condition.change"
] | 581,462 | 581,463 | u392319141 | python |
p02781 | import math
import numpy as np
import queue
from collections import deque
import heapq
def cmb(n,r):
c = 1
for i in range(r):
c *= (n-i)
for i in range(r):
c //= (i+1)
return c
n = input()
k = int(input())
ln = len(n)
ans = 1
nn0 = 0
for i in range(ln):
if int(n[i]) > 0:
a... | import math
import numpy as np
import queue
from collections import deque
import heapq
def cmb(n,r):
c = 1
for i in range(r):
c *= (n-i)
for i in range(r):
c //= (i+1)
return c
n = input()
k = int(input())
ln = len(n)
ans = 0
nn0 = 0
for i in range(ln):
if int(n[i]) > 0:
a... | [
"literal.number.integer.change",
"assignment.value.change"
] | 581,466 | 581,467 | u169350228 | python |
p02781 | n_str = input() # 3***
k = int(input())
dp1 = [[0] * (k + 2) for _ in range(len(n_str) + 1)]
dp2 = [[0] * (k + 2) for _ in range(len(n_str) + 1)]
# dp1[i][j] : 上から i 桁はnと一致していて、0でない数が j 個現れているような数
# dp2[i][j] : 上から i 桁が既にnより小さく、0でない数が j 個現れているような数
dp1[0][0] = 1
# dp2[0][1] = int(n_str[0]) - 1
# dp2[0][0] = 1
for i ... | n_str = input() # 3***
k = int(input())
dp1 = [[0] * (k + 2) for _ in range(len(n_str) + 1)]
dp2 = [[0] * (k + 2) for _ in range(len(n_str) + 1)]
# dp1[i][j] : 上から i 桁はnと一致していて、0でない数が j 個現れているような数
# dp2[i][j] : 上から i 桁が既にnより小さく、0でない数が j 個現れているような数
dp1[0][0] = 1
# dp2[0][1] = int(n_str[0]) - 1
# dp2[0][0] = 1
for i ... | [
"call.remove"
] | 581,492 | 581,493 | u533039576 | python |
p02781 | def solve(n,k) :
if n <= 9 and k == 1 :
return n
elif n <= 9 and k >= 2 :
return 0
elif k == 0:
return 0
else :
m = n //10
r = n % 10
return r * solve(m,k-1) + (9 - r) * solve(m-1,k-1) + solve(m,k)
n = int(input())
k = int(input())
print(solve(n,k)) | def solve(n,k) :
if n <= 9 and k == 1 :
return n
elif n <= 9 and k >= 2 :
return 0
elif k == 0:
return 1
else :
m = n //10
r = n % 10
return r * solve(m,k-1) + (9 - r) * solve(m-1,k-1) + solve(m,k)
n = int(input())
k = int(input())
print(solve(n,k)) | [
"literal.number.integer.change",
"function.return_value.change"
] | 581,496 | 581,497 | u645487439 | python |
p02781 | n = input()
k = input()
nl = len(n)
dp = [[[0]*(k+1) for _ in range(2)]for _ in range(nl+1)]
#dp[i][j][k] i:上からの桁数、j:smaller flag、k:0以外の数字の個数
dp[0][0][0] = 1
for i in range(nl):
for j in range(2):
for l in range(k+1):
c = int(n[i])
if j == 1:
dp[i+1][j][l] += dp[i][j][l]
if l < k:
... | n = input()
k = int(input())
nl = len(n)
dp = [[[0]*(k+1) for _ in range(2)]for _ in range(nl+1)]
#dp[i][j][k] i:上からの桁数、j:smaller flag、k:0以外の数字の個数
dp[0][0][0] = 1
for i in range(nl):
for j in range(2):
for l in range(k+1):
c = int(n[i])
if j == 1:
dp[i+1][j][l] += dp[i][j][l]
if l < ... | [
"call.add",
"call.arguments.change"
] | 581,531 | 581,532 | u977141657 | python |
p02781 | # coding: utf-8
import re
import math
import itertools
from copy import deepcopy
import fractions
import random
from functools import lru_cache
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mo... | # coding: utf-8
import re
import math
import itertools
from copy import deepcopy
import fractions
import random
from functools import lru_cache
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.integer.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 581,545 | 581,546 | u902151549 | python |
p02781 | N = [0] + list(map(int, input()))
K = int(input())
n = len(N)
DP = [
[[0] * (K+1) for _ in range(2)] for _ in range(n)
]
# 0桁目(0)で最大値を取っていてk=0の要素は1個。
DP[0][0][0] = 1
for i in range(1, n):
for k in range(K):
if N[i] != 0:
DP[i][0][k+1] += DP[i-1][0][k]
DP[i][1][k] += DP[i-1][0][k]
DP[i][... | N = [0] + list(map(int, input()))
K = int(input())
n = len(N)
DP = [
[[0] * (K+2) for _ in range(2)] for _ in range(n)
]
# 0桁目(0)で最大値を取っていてk=0の要素は1個。
DP[0][0][0] = 1
for i in range(1, n):
for k in range(K+1):
if N[i] != 0:
DP[i][0][k+1] += DP[i-1][0][k]
DP[i][1][k] += DP[i-1][0][k]
DP[i... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 581,563 | 581,564 | u875541136 | python |
p02781 | import sys
from math import factorial
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
K = ir()
length = 0
for i in range(1, 100):
if 10 ** i > N:
length = i
break
answer = 0
def F(length, K, N):
ret = 0
if length == 1:
... | import sys
from math import factorial
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
K = ir()
length = 0
for i in range(1, 102):
if 10 ** i > N:
length = i
break
answer = 0
def F(length, K, N):
ret = 0
if length == 1:
... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 581,576 | 581,577 | u600402037 | python |
p02781 | N = int(input())
K = int(input())
#桁DP
string = str(N)
digits = len(string)
#dp[i][j][k]=と同じ桁数の整数で上からi桁目までで0でない数字がj個あるものの個数
#k=0: i桁目まで見てN未満が確定, k=1: 未確定
dp = [[[0]*2 for _ in range(K+1)] for __ in range(digits+1)]
#初期状態
dp1[0][0][1] = 1
for i in range(digits):
d = int(string[i])
ni = i+1
for j in range(... | N=int(input())
K=int(input())
string = str(N)
digits = len(string)
#dp[i][j][k]=と同じ桁数の整数で上からi桁目までで0でない数字がj個あるものの個数
#k=0: i桁目まで見てN未満が確定, k=1: 未確定
dp = [[[0]*2 for _ in range(K+1)] for __ in range(digits+1)]
#初期状態
dp[0][0][1] = 1
for i in range(digits):
d = int(string[i])
ni = i+1
for j in range(K+1):
... | [
"assignment.variable.change",
"identifier.change"
] | 581,590 | 581,591 | u852690916 | python |
p02781 | N = int(input())
K = int(input())
#桁DP
string = str(N)
digits = len(string)
#dp[i][j][k]=と同じ桁数の整数で上からi桁目までで0でない数字がj個あるものの個数
#k=0: i桁目まで見てN未満が確定, k=1: 未確定
dp = [[[0]*2 for _ in range(K+1)] for __ in range(digits+1)]
#初期状態
dp1[0][0][1] = 1
for i in range(digits):
d = int(string[i])
ni = i+1
for j in range(... | N = int(input())
K = int(input())
#桁DP
string = str(N)
digits = len(string)
#dp[i][j][k]=と同じ桁数の整数で上からi桁目までで0でない数字がj個あるものの個数
#k=0: i桁目まで見てN未満が確定, k=1: 未確定
dp = [[[0]*2 for _ in range(K+1)] for __ in range(digits+1)]
#初期状態
dp[0][0][1] = 1
for i in range(digits):
d = int(string[i])
ni = i+1
for j in range(K... | [
"assignment.variable.change",
"identifier.change"
] | 581,590 | 581,592 | u852690916 | python |
p02781 | import sys
def solve():
input = sys.stdin.readline
N = int(input())
K = int(input())
if N <= 1000:
count = 0
for i in range(1, N + 1):
d = 0
ci = i
while ci > 0:
d += (1 if ci % 10 > 0 else 0)
ci //= 10
if d... | import sys
def solve():
input = sys.stdin.readline
N = int(input())
K = int(input())
if N <= 1000:
count = 0
for i in range(1, N + 1):
d = 0
ci = i
while ci > 0:
d += (1 if ci % 10 > 0 else 0)
ci //= 10
if d... | [
"call.add"
] | 581,595 | 581,596 | u608088992 | python |
p02781 | n = input()
k = int(input())
if len(n) <= k:
cnt = 0
for i in range(1,int(n)+1):
if len(str(i)) - str(i).count('0') == k:
cnt += 1
print(cnt)
exit()
cnt = 0
l = len(n)
def combi(n,k):
ans = 1
if k == 0:
return ans
for i in range(k):
ans = ans * (n-i) // ... | n = input()
k = int(input())
if len(n) <= k:
cnt = 0
for i in range(1,int(n)+1):
if len(str(i)) - str(i).count('0') == k:
cnt += 1
print(cnt)
exit()
cnt = 0
l = len(n)
def combi(n,k):
ans = 1
if k == 0:
return ans
for i in range(k):
ans = ans * (n-i) // ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 581,613 | 581,614 | u145600939 | python |
p02781 | def main():
s = [int(char) for char in input()]
l = len(s)
k = int(input())
tmp = 0
nonzero = []
for number in s:
if number > 0:
tmp += 1
nonzero.append(tmp)
nonzero.append(0) # let nonzero[-1] be 0
def binomial(n, k):
if n < k or n < 0 or k < 0:
... | def main():
s = [int(char) for char in input()]
l = len(s)
k = int(input())
tmp = 0
nonzero = []
for number in s:
if number > 0:
tmp += 1
nonzero.append(tmp)
nonzero.append(0) # let nonzero[-1] be 0
def binomial(n, k):
if n < k or n < 0 or k < 0:
... | [] | 581,635 | 581,636 | u595856802 | python |
p02781 | import math
def combi(n,r):
if r > n:return 0
return math.factorial(n) // (math.factorial(n - r)*(math.factorial(r)))
def solve(i,k,smaller):
#一番最後の桁まで調べたら終了
if i == N:
if k == 0:return 1
else: 0
#途中であっても0以外の数字を使い切ったら終了
if k == 0:return 1
#Nより小さいことが確定すれば残りの桁数（N-i）のうち
#... | import math
def combi(n,r):
if r > n:return 0
return math.factorial(n) // (math.factorial(n - r)*(math.factorial(r)))
def solve(i,k,smaller):
#一番最後の桁まで調べたら終了
if i == N:
if k == 0:return 1
else: return 0
#途中であっても0以外の数字を使い切ったら終了
if k == 0:return 1
#Nより小さいことが確定すれば残りの桁数（N-i）の... | [
"control_flow.return.add"
] | 581,691 | 581,692 | u215315599 | python |
p02781 |
ar = input()
k = int(input())
l = len(ar)
DP = [[[-1] * 2 for j in range(5)] for i in range(102)]
def dp(i, j, fl):
if i == l:
if j == k:
return 1
else:
return 0
if DP[i][j][fl] != -1:
return DP[i][j][fl]
res = 0
# print(i,j,fl)
if fl:
... |
ar = input()
k = int(input())
l = len(ar)
DP = [[[-1] * 2 for j in range(103)] for i in range(102)]
def dp(i, j, fl):
if i == l:
if j == k:
return 1
else:
return 0
if DP[i][j][fl] != -1:
return DP[i][j][fl]
res = 0
# print(i,j,fl)
if fl:
... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 581,717 | 581,718 | u449403739 | python |
p02781 | S = input()
N = len(S)
K = int(input())
MOD = 10 ** 9 + 7
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
# 必要なだけforを回す
for i in range(2, 6):
fact.append((fact[-1] * i) % MOD)
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
factinv.append((factinv[-1] * inv[-1]) % MOD)
# nCr n個から重複を許さずr個の組み合わせを選ぶ
def cmb(n, r... | S = input()
N = len(S)
K = int(input())
MOD = 10 ** 9 + 7
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
# 必要なだけforを回す
for i in range(2, 10 ** 6):
fact.append((fact[-1] * i) % MOD)
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
factinv.append((factinv[-1] * inv[-1]) % MOD)
# nCr n個から重複を許さずr個の組み合わせを選ぶ
def cm... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 581,727 | 581,728 | u112317104 | python |
p02781 | import sys
sys.setrecursionlimit(10 ** 6)
from math import factorial
def comb(n, r):
if r < 0 or r > n:
return 0
else:
return factorial(n) // (factorial(n - r) * factorial(r))
# 左から i 桁目以降について、0 以外の値を残り K 個使用可能
# smaller: i 桁目までが 一致している時=False, 小さい時=True
def solve(i, k, smaller):
if i == n:
if k =... | import sys
sys.setrecursionlimit(10 ** 6)
from math import factorial
def comb(n, r):
if r < 0 or r > n:
return 0
else:
return factorial(n) // (factorial(n - r) * factorial(r))
# 左から i 桁目以降について、0 以外の値を残り K 個使用可能
# smaller: i 桁目までが 一致している時=False, 小さい時=True
def solve(i, k, smaller):
if i == n:
if k =... | [
"call.arguments.change",
"function.return_value.change"
] | 581,739 | 581,740 | u802963389 | python |
p02781 | n = int(input())
k = int(input())
keta = len(str(n))
dp = [[[0 for j in range(keta+2)] for _ in range(2)] for i in range(keta)]
s = str(n)
#dp[何桁目か][未満フラグ 0 = 未満][ゼロ以外のの個数]
x = int(s[0])
if x == 1:
dp[0][1][0] = 1
else:
dp[0][1][0] += 1
dp[0][0][0] += x - 1
for index, c in enumerate(s[1:]):
i =... | n = int(input())
k = int(input())
keta = len(str(n))
dp = [[[0 for j in range(k+2)] for _ in range(2)] for i in range(keta)]
s = str(n)
#dp[何桁目か][未満フラグ 0 = 未満][ゼロ以外のの個数]
x = int(s[0])
if x == 1:
dp[0][1][0] = 1
else:
dp[0][1][0] += 1
dp[0][0][0] += x - 1
for index, c in enumerate(s[1:]):
i = in... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change",
"variable_access.subscript.index.change"
] | 581,745 | 581,746 | u301984327 | python |
p02781 | import sys
import math
input = sys.stdin.readline
n = int(input())
k = int(input())
t = n
m = 0
while t:
m += 1
t //= 10
def comb(n, r):
if r > n:
return 0
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
ans = 9 ** k * comb(m-1, k)
tk = k
def dfs(i, mt, kt):
a = i... | import sys
import math
input = sys.stdin.readline
n = int(input())
k = int(input())
t = n
m = 0
while t:
m += 1
t //= 10
def comb(n, r):
if r > n:
return 0
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
ans = 9 ** k * comb(m-1, k)
tk = k
def dfs(i, mt, kt):
a = i... | [
"control_flow.branch.if.condition.change"
] | 581,774 | 581,775 | u408620326 | python |
p02781 | N=input()
K=int(input())
dp_0 = [[0]*(len(N)) for i in range(K+1)]
dp_1 = [[0]*(len(N)) for i in range(K+1)]
dp_0[0][0]=1
dp_0[1][0]=int(N[0])-1
dp_1[1][0]=1
for i in range(len(N)-1):
for j in range(K+1):
if j==K:
dp_0[j][i+1] += dp_0[j][i]
elif j==0:
dp_0[j][i+1] =dp_0[j][i]... | N=input()
K=int(input())
dp_0 = [[0]*(len(N)) for i in range(K+1)]
dp_1 = [[0]*(len(N)) for i in range(K+1)]
dp_0[0][0]=1
dp_0[1][0]=int(N[0])-1
dp_1[1][0]=1
for i in range(len(N)-1):
for j in range(K+1):
if j==K:
dp_0[j][i+1] += dp_0[j][i]
elif j==0:
dp_0[j][i+1] =dp_0[j][i]... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 581,798 | 581,799 | u474423089 | python |
p02781 | N = input()
K = int(input())
DP = [[[0 for i in range(K+1)] for i in range(2)] for i in range(len(N))]
for d in range(int(N[0])+1):
DP[0][d<int(N[0])][d!=0] += 1
for i in range(len(N)-1):
for j in range(2):
for k in range(K+1):
for d in range(10 if j else int(N[i+1])+1):
i... | N = input()
K = int(input())
DP = [[[0 for i in range(K+1)] for i in range(2)] for i in range(len(N))]
for d in range(int(N[0])+1):
DP[0][d<int(N[0])][d!=0] += 1
for i in range(len(N)-1):
for j in range(2):
for k in range(K+1):
for d in range(10 if j else int(N[i+1])+1):
i... | [
"expression.operation.binary.add"
] | 581,805 | 581,806 | u441575327 | python |
p02781 | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース... | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース... | [] | 581,820 | 581,821 | u407160848 | python |
p02781 | n = input()
k = int(input())
n_list = []
for a in n:
n_list.append(int(a))
n_num = len(n_list)
if n_num < k:
print('0')
return
dp = [[[0] * (n_num + 1) for _ in range(2)]for _ in range(n_num + 1)]
dp[0][0][0] = 1
for i in range(n_num):
for smaller in range(2):
for j in range(n_num):
... | n = input()
k = int(input())
n_list = []
for a in n:
n_list.append(int(a))
n_num = len(n_list)
if n_num < k:
print('0')
else:
dp = [[[0] * (n_num + 1) for _ in range(2)]for _ in range(n_num + 1)]
dp[0][0][0] = 1
for i in range(n_num):
for smaller in range(2):
for j in range(n... | [
"function.return_value.change"
] | 581,827 | 581,828 | u255382385 | python |
p02781 | def count(keta,kazu):
if(keta<kazu):
return 0
result=1
wari=1
for i in range(kazu):
wari*=i+1
result*=keta-i
result//=wari
#print(result)
for i in range(kazu):
result*=9
return result
def Ans(moji,kazu):
#print(moji,kazu)
naga=len(moji)
if(na... | def count(keta,kazu):
if(keta<kazu):
return 0
result=1
wari=1
for i in range(kazu):
wari*=i+1
result*=keta-i
result//=wari
#print(result)
for i in range(kazu):
result*=9
return result
def Ans(moji,kazu):
#print(moji,kazu)
naga=len(moji)
if(na... | [
"control_flow.return.add"
] | 581,835 | 581,836 | u965840662 | python |
p02781 | N_str = str(input())
K = int(input())
digit_length = len(N_str)
topmost_digit = int(N_str[0])
C_table = [[0, 0, 0] for _ in range(digit_length)]
def C(all, pick):
if C_table[all][pick] == 0:
count_child = 1
count_parent = 1
for i in range(pick):
count_child *= all - i
... | N_str = str(input())
K = int(input())
digit_length = len(N_str)
topmost_digit = int(N_str[0])
C_table = [[0, 0, 0, 0] for _ in range(digit_length+10)]
def C(all, pick):
if C_table[all][pick] == 0:
count_child = 1
count_parent = 1
for i in range(pick):
count_child *= all - i
... | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 581,841 | 581,842 | u736524428 | python |
p02781 | def nCk(n, k):
return factorial(n)/factorial(n-k)/factorial(k)
from math import factorial
N = input()
K = int(input())
order = len(N)
diff = order - K
if order < K:
print(0)
s = int(N[0])
#lower = factorial(order-1)/factorial(diff-1)/ factorial(K) * (9**K)
if order - 1 >= K:
lower = nCk(order - 1, K) * (9**K)... | def nCk(n, k):
return factorial(n)/factorial(n-k)/factorial(k)
from math import factorial
N = input()
K = int(input())
order = len(N)
diff = order - K
if order < K:
print(0)
else:
s = int(N[0])
#lower = factorial(order-1)/factorial(diff-1)/ factorial(K) * (9**K)
if order - 1 >= K:
lower = nCk(order - 1... | [] | 581,843 | 581,844 | u770199020 | python |
p02781 | ''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''
#codeforces
gi = lambda : list(map(int,input().split()))
s = input()
n, = gi()
ans = 0
mag = len(s) - 1
#corner cases:
if len(s) <= 3:
s = int(s)
for k in range(s + 1):
if len(str(k)) - str(k).count("0") == n:
ans += 1
print(ans)
exit()
while mag - n >= 0:
a = 9
... | ''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''
#codeforces
gi = lambda : list(map(int,input().split()))
s = input()
n, = gi()
ans = 0
mag = len(s) - 1
#corner cases:
if len(s) <= 7:
s = int(s)
for k in range(s + 1):
if len(str(k)) - str(k).count("0") == n:
ans += 1
print(ans)
exit()
while mag - n >= 0:
a = 9
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 581,847 | 581,848 | u909815117 | python |
p02781 | # does not contain more than K non
# zero digits
# This function returns the count of
# required numbers from 0 to num
def countInRangeUtil(pos, cnt, tight, num):
# Last position
if pos == len(num):
# If count of non zero digits
# is less than or equal to K
if cnt <= K:... | # does not contain more than K non
# zero digits
# This function returns the count of
# required numbers from 0 to num
def countInRangeUtil(pos, cnt, tight, num):
# Last position
if pos == len(num):
# If count of non zero digits
# is less than or equal to K
if cnt <= K:... | [
"literal.number.integer.change",
"assignment.value.change"
] | 581,849 | 581,850 | u237380963 | python |
p02781 | def factorial(n):
a = 1
for i in range(1, n + 1):
a *= i
return a
def nCr(n,r):
if r > n:
return 0
return factorial(n) // factorial(r) // factorial(n - r)
def normal(d, k):
#print("normal d,k ", d, k)
return nCr(d, k) * (9**k)
def main():
tmp = input()
N = [int(c) ... | def factorial(n):
a = 1
for i in range(1, n + 1):
a *= i
return a
def nCr(n,r):
if r > n:
return 0
return factorial(n) // factorial(r) // factorial(n - r)
def normal(d, k):
#print("normal d,k ", d, k)
return nCr(d, k) * (9**k)
def main():
tmp = input()
N = [int(c) ... | [
"assignment.add"
] | 581,881 | 581,882 | u162773977 | python |
p02782 | from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
def modin... | from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
def modin... | [
"call.arguments.change",
"call.arguments.add"
] | 581,965 | 581,966 | u102445737 | python |
p02782 | r1,c1,r2,c2 = map(int,input().split())
# 二項係数 mod P
mod = 10**9+7
m = r2+c2 +10
fac = [1]*m
ninv = [1]*m
finv = [1]*m
for i in range(2,m):
fac[i] = fac[i-1]*i%mod
ninv[i] = (-(mod//i)*ninv[mod%i])%mod
finv[i] = finv[i-1]*ninv[i]%mod
def comb(n,k):
return (fac[n]*finv[k]%mod)*finv[n-k]%mod
def g(r... | r1,c1,r2,c2 = map(int,input().split())
# 二項係数 mod P
mod = 10**9+7
m = r2+c2 +10
fac = [1]*m
ninv = [1]*m
finv = [1]*m
for i in range(2,m):
fac[i] = fac[i-1]*i%mod
ninv[i] = (-(mod//i)*ninv[mod%i])%mod
finv[i] = finv[i-1]*ninv[i]%mod
def comb(n,k):
return (fac[n]*finv[k]%mod)*finv[n-k]%mod
def g(r... | [
"assignment.change"
] | 582,042 | 582,043 | u391731808 | python |
p02782 | bikkuri = [1]
mod = 10**9+7
for i in range(1,2*10**6+1000):
bikkuri.append((bikkuri[-1]*i)%mod)
r1,c1,r2,c2 = map(int,input().split())
def F(r,c):
tmp = (bikkuri[r+c+2]*pow(bikkuri[c+1],mod-2,mod)*pow(bikkuri[r+1],mod-2,mod) - 1)%mod
return tmp
ans = F(r2,c2)-F(r1-1,c2)-F(r2,c1-1)+F(r1-1,c1-1)
print(ans) | bikkuri = [1]
mod = 10**9+7
for i in range(1,2*10**6+1000):
bikkuri.append((bikkuri[-1]*i)%mod)
r1,c1,r2,c2 = map(int,input().split())
def F(r,c):
tmp = (bikkuri[r+c+2]*pow(bikkuri[c+1],mod-2,mod)*pow(bikkuri[r+1],mod-2,mod) - 1)%mod
return tmp
ans = (F(r2,c2)-F(r1-1,c2)-F(r2,c1-1)+F(r1-1,c1-1))%mod
prin... | [
"assignment.change"
] | 582,059 | 582,060 | u980322611 | python |
p02782 | MOD = 10 ** 9 + 7
FACT_MAX = 2 * 10 ** 6 + 3
fact = [1] * FACT_MAX
for i in range(1, FACT_MAX):
fact[i] = fact[i - 1] * i % MOD
def comb(n, r):
return fact[n] * pow(fact[n - r], MOD - 2, MOD) * pow(fact[r], MOD - 2, MOD)
def g(r, c):
return (comb(r + c + 2, c + 1) - 1) % MOD
r1, c1, r2, c2 = map(int, input(... | MOD = 10 ** 9 + 7
FACT_MAX = 2 * 10 ** 6 + 3
fact = [1] * FACT_MAX
for i in range(1, FACT_MAX):
fact[i] = fact[i - 1] * i % MOD
def comb(n, r):
return fact[n] * pow(fact[n - r], MOD - 2, MOD) * pow(fact[r], MOD - 2, MOD)
def g(r, c):
return (comb(r + c + 2, c + 1) - 1) % MOD
r1, c1, r2, c2 = map(int, input(... | [
"call.arguments.change",
"call.arguments.add"
] | 582,214 | 582,215 | u638282348 | python |
p02782 | import sys
input = sys.stdin.buffer.readline
def main():
a,b,c,d = map(int,input().split())
MOD = 10**9+7
N = c+d+5
fac = [0 for _ in range(N+1)]
fac[0],fac[1] = 1,1
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD
def comb(x,y):
return (fac[x+y]*pow(fac[x],MOD-2... | import sys
import math
input = sys.stdin.buffer.readline
def main():
a,b,c,d = map(int,input().split())
MOD = 10**9+7
N = c+d+5
fac = [0 for _ in range(N+1)]
fac[0],fac[1] = 1,1
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD
def comb(x,y):
return (fac[x+y]*pow(... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 582,247 | 582,248 | u816631826 | python |
p02782 | import sys
input = sys.stdin.buffer.readline
def main():
a,b,c,d = map(int,input().split())
MOD = 10**9+7
N = c+d+5
fac = [0 for _ in range(N+1)]
fac[0],fac[1] = 1,1
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD
def comb(x,y):
return (fac[x+y]*pow(fac[x],MOD-2,M... | import sys
input = sys.stdin.buffer.readline
def main():
a,b,c,d = map(int,input().split())
MOD = 10**9+7
N = c+d+5
fac = [0 for _ in range(N+1)]
fac[0],fac[1] = 1,1
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD
def comb(x,y):
return (fac[x+y]*pow(fac[x],MOD-2,M... | [
"call.arguments.change",
"call.arguments.add"
] | 582,276 | 582,277 | u648212584 | python |
p02782 | r1,c1,r2,c2=map(int,input().split())
r2+=1
c2+=1
N=2*(10**6)
mod=10**9+7
fac=[1]*(N+2)
inv=[1]*(N+2)
t=1
for i in range(1,N+2):
t*=i
t%=mod
fac[i]=t
t=pow(fac[N+1],mod-2,mod)
for i in range(N+1,0,-1):
inv[i]=t
t*=i
t%=mod
def comb(n,r):
return fac[n]*inv[n-r]*inv[r]%mod
print(comb(r2+c2,c2)-... | r1,c1,r2,c2=map(int,input().split())
r2+=1
c2+=1
N=2*(10**6)+2
mod=10**9+7
fac=[1]*(N+2)
inv=[1]*(N+2)
t=1
for i in range(1,N+2):
t*=i
t%=mod
fac[i]=t
t=pow(fac[N+1],mod-2,mod)
for i in range(N+1,0,-1):
inv[i]=t
t*=i
t%=mod
def comb(n,r):
return fac[n]*inv[n-r]*inv[r]%mod
print((comb(r2+c2,c... | [
"call.arguments.change",
"call.arguments.add"
] | 582,289 | 582,290 | u065446124 | python |
p02782 | import sys
readline = sys.stdin.buffer.readline
r1,c1,r2,c2 = map(int,readline().split())
mod = 10**9+7
def pow(n,p,mod=10**9+7): #繰り返し二乗法(nのp乗)
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2 % mod
p //= 2
else:
res = res * n % mod
p -= 1
retur... | import sys
readline = sys.stdin.buffer.readline
r1,c1,r2,c2 = map(int,readline().split())
mod = 10**9+7
def pow(n,p,mod=10**9+7): #繰り返し二乗法(nのp乗)
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2 % mod
p //= 2
else:
res = res * n % mod
p -= 1
retur... | [
"literal.number.integer.change",
"expression.operation.binary.change"
] | 582,346 | 582,345 | u372144784 | python |
p02782 | r1,c1,r2,c2=map(int,input().split())
MOD=10**9+7
idx=r2+c2+2
perm=[1]*(idx+1)
perm_inv=[1]*(idx+1)
for i in range(1,idx+1):
perm[i]=perm[i-1]*i
perm[i]%=MOD
def inv_mod(a):
return pow(a,MOD-2,MOD)
perm_inv[-1]=inv_mod(perm[-1])
for i in range(idx-1,-1,-1):
perm_inv[i]=perm_inv[i+1]*(i+1)
perm_inv[i]%=... | r1,c1,r2,c2=map(int,input().split())
MOD=10**9+7
idx=r2+c2+2
perm=[1]*(idx+1)
perm_inv=[1]*(idx+1)
for i in range(1,idx+1):
perm[i]=perm[i-1]*i
perm[i]%=MOD
def inv_mod(a):
return pow(a,MOD-2,MOD)
perm_inv[-1]=inv_mod(perm[-1])
for i in range(idx-1,-1,-1):
perm_inv[i]=perm_inv[i+1]*(i+1)
perm_inv[i]%=... | [
"expression.operation.binary.add"
] | 582,462 | 582,463 | u492026192 | python |
p02782 | r1,c1,r2,c2=map(int,input().split())
MOD=10**9+7
idx=r2+c2+3
perm=[1]*(idx+1)
for i in range(1,idx+1):
perm[i]=perm[i-1]*i
perm[i]%=MOD
def inv_mod(a):
return pow(a,MOD-2,MOD)
def comb(n,m,p=10**9+7):
if n < m : return 0
if n < 0 or m < 0:return 0
m = min(m, n-m)
top = bot = 1
for i in ra... | r1,c1,r2,c2=map(int,input().split())
MOD=10**9+7
idx=r2+c2+3
perm=[1]*(idx+1)
for i in range(1,idx+1):
perm[i]=perm[i-1]*i
perm[i]%=MOD
def inv_mod(a):
return pow(a,MOD-2,MOD)
def comb(n,m,p=10**9+7):
if n < m : return 0
if n < 0 or m < 0:return 0
m = min(m, n-m)
top = bot = 1
for i in ra... | [] | 582,464 | 582,465 | u492026192 | python |
p02782 | m = 1000000007
r1, c1, r2, c2 = map(int, input().split())
nf = 10 ** 6 * 2 + 100
fact = [0] * (nf + 1)
fact[0] = 1
for i in range(nf):
fact[i + 1] = fact[i] * (i + 1) % m
def F(r, c):
path = (fact[r + c + 2] % m) * pow(fact[r + 1] * fact[c + 1], m - 2, m) % m
return path - 1
r1 -= 1
c1 -= 1
ans = F(... | m = 1000000007
r1, c1, r2, c2 = map(int, input().split())
nf = 10 ** 6 * 2 + 100
fact = [0] * (nf + 1)
fact[0] = 1
for i in range(nf):
fact[i + 1] = fact[i] * (i + 1) % m
def F(r, c):
path = (fact[r + c + 2] % m) * pow(fact[r + 1] * fact[c + 1], m - 2, m) % m
return path - 1
r1 -= 1
c1 -= 1
ans = F(... | [
"assignment.add"
] | 582,466 | 582,467 | u325956328 | python |
p02782 | #input
r_1, c_1, r_2, c_2 = map(int, input().split())
#output
mod = 10**9 + 7
n_ = 10**7 + 3
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n: ... | #input
r_1, c_1, r_2, c_2 = map(int, input().split())
#output
mod = 10**9 + 7
n_ = 2*10**6 + 1
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 582,512 | 582,513 | u461454424 | python |
p02782 | #input
r_1, c_1, r_2, c_2 = map(int, input().split())
#output
mod = 10**9 + 7
n_ = 10**10 + 3
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n:... | #input
r_1, c_1, r_2, c_2 = map(int, input().split())
#output
mod = 10**9 + 7
n_ = 2*10**6 + 1
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
rev[i] = rev[i+1]*(i+1)%mod
def cmb(n,r):
if n <= 0 or r < 0 or r > n... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 582,514 | 582,513 | u461454424 | python |
p02782 | import sys
import numpy as np
sys.setrecursionlimit(10 ** 7)
r1, c1, r2, c2 = map(int, input().split())
# 階乗、Combinationコンビネーション(numpyを使う)
def cumprod(arr, MOD):
L = len(arr)
Lsq = int(L**.5+1)
arr = np.resize(arr, Lsq**2).reshape(Lsq, Lsq)
for n in range(1, Lsq):
arr[:, n] *= arr[:, n-1]
... | import sys
import numpy as np
sys.setrecursionlimit(10 ** 7)
r1, c1, r2, c2 = map(int, input().split())
# 階乗、Combinationコンビネーション(numpyを使う)
def cumprod(arr, MOD):
L = len(arr)
Lsq = int(L**.5+1)
arr = np.resize(arr, Lsq**2).reshape(Lsq, Lsq)
for n in range(1, Lsq):
arr[:, n] *= arr[:, n-1]
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 582,523 | 582,522 | u593567568 | python |
p02783 | h,a=map(int,input.split())
cnt=0
while True:
h-=a
cnt+=1
if h<=0:
break
print(cnt) | h,a=map(int,input().split())
cnt=0
while True:
h-=a
cnt+=1
if h<=0:
break
print(cnt) | [
"call.add"
] | 582,566 | 582,567 | u243159381 | python |
p02783 | H,A = map(int(),input().split)
print(H//A if H%A == 0 else H//A+1)
| H,A = map(int,input().split())
print(H//A if H%A == 0 else H//A+1) | [
"call.arguments.change",
"call.add"
] | 582,572 | 582,573 | u288980918 | python |
p02783 | a,b=list(map(int,input().split()))
count=0
while (a<0):
count+=1
a-=b
print(count)
| a,b=list(map(int,input().split()))
count=0
while (a>0):
count+=1
a-=b
print(count)
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 582,584 | 582,585 | u754511616 | python |
p02783 | a,b=list(map(int,input()))
count=0
while (a<0):
count+=1
a-=b
print(count)
| a,b=list(map(int,input().split()))
count=0
while (a>0):
count+=1
a-=b
print(count)
| [
"call.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 582,586 | 582,585 | u754511616 | python |
p02783 | tmp = input().split(" ")
HP = int(tmp[0])
attack = int(tmp[1])
print(math.ceil(HP/attack)) | import math
tmp = input().split(" ")
HP = int(tmp[0])
attack = int(tmp[1])
print(math.ceil(HP/attack)) | [] | 582,587 | 582,588 | u739843002 | python |
p02783 | H,A = map(int,input().split())
answer = H // A
if answer == 0:
answer += 1
print(answer) | H,A = map(int,input().split())
answer = H // A + 1
if H % A == 0:
answer -= 1
print(answer) | [
"control_flow.branch.if.condition.change",
"expression.operator.change"
] | 582,595 | 582,596 | u732061897 | python |
p02783 | import math
#h = int(input())
#a = int(input())
h,a = map(int,input().split())
print(math.ceil((h+a)/a))
| import math
#h = int(input())
#a = int(input())
h,a = map(int,input().split())
print(math.ceil((h)/a))
| [
"expression.operation.binary.remove"
] | 582,597 | 582,598 | u704411633 | python |
p02783 | INPUT = list(input().split())
H = INT(INPUT[0])
A = INT(INPUT[1])
if H%A == 0:
print(H//A)
else:
print(H//A + 1) | INPUT = list(input().split())
H = int(INPUT[0])
A = int(INPUT[1])
if H%A == 0:
print(H//A)
else:
print(H//A + 1) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 582,599 | 582,600 | u893418950 | python |
p02783 | H,A=map(int, input().split())
print(math.ceil(H/A)) | import math
H,A=map(int, input().split())
print(math.ceil(H/A)) | [] | 582,603 | 582,604 | u799428010 | python |
p02783 | H, A =map(int,input().split())
T = 0
while H <= 0:
H -= A
T += 1
print(T) | H, A =map(int,input().split())
T = 0
while H > 0:
H -= A
T += 1
print(T)
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 582,607 | 582,608 | u272457181 | python |
p02783 | h,a = map(int,input().split())
counter = 0
while h >= 0:
h -= a
counter +=1
print(counter) | h,a = map(int,input().split())
counter = 0
while h > 0:
h -= a
counter += 1
print(counter) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 582,609 | 582,610 | u598684283 | python |
p02783 | H, A = map(int, input().split())
i = 0
while H>=0:
H = H-A
i += 1
print(i) | H, A = map(int, input().split())
i = 0
while H >= 1:
H = H-A
i += 1
print(i) | [
"literal.number.integer.change",
"control_flow.loop.condition.change"
] | 582,617 | 582,618 | u710398282 | python |
p02783 | h, a = map(int, input().split())
count = 0
while h >= 0:
h -= a
count += 1
print(count) | h, a = map(int, input().split())
count = 0
while h > 0:
h -= a
count += 1
print(count) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 582,625 | 582,626 | u125269142 | python |
p02783 | h,a=map(int,input().split())
ans=0
while h>=0:
h-=a
ans+=1
print(ans) | h,a=map(int,input().split())
ans=0
while h>0:
h-=a
ans+=1
print(ans) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 582,631 | 582,632 | u486773779 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.