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 |
|---|---|---|---|---|---|---|---|
p02765 | #!python3.4
# -*- coding: utf-8 -*-
# abc156/abc156_a
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n... | #!python3.4
# -*- coding: utf-8 -*-
# abc156/abc156_a
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 558,200 | 558,201 | u106311097 | python |
p02765 | i = input().split()
n = int(i[0])
r = int(i[1])
if n >= 10:
print(n)
else:
print(r + 100*(10-n)) | i = input().split()
n = int(i[0])
r = int(i[1])
if n >= 10:
print(r)
else:
print(r + 100*(10-n)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 558,204 | 558,205 | u485286322 | python |
p02765 | N,R=input().split()
N=int(N)
R=int(R)
if N>=10:
print(R)
else :
prinAt((100*(10-N))+R) | N,R=input().split()
N=int(N)
R=int(R)
if N>=10:
print(R)
else :
print((100*(10-N))+R) | [
"identifier.change",
"call.function.change"
] | 558,230 | 558,231 | u029935728 | python |
p02765 | N,R=input().split()
N=int(N)
R=int(R)
if N>=10:
print(R)
else :
print(100*(10-N)) | N,R=input().split()
N=int(N)
R=int(R)
if N>=10:
print(R)
else :
print((100*(10-N))+R) | [
"call.arguments.change",
"call.arguments.add"
] | 558,232 | 558,231 | u029935728 | python |
p02765 | n, display_rating = list(map(int, input().split(" ")))
if n < 10:
a = 100 * (10 - 2)
else:
a = 0
print(display_rating + a)
| n, display_rating = list(map(int, input().split(" ")))
if n < 10:
a = 100 * (10 - n)
else:
a = 0
print(display_rating + a)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 558,237 | 558,238 | u038523043 | python |
p02765 | a, b = input().split()
if int(a) < 9:
ans = int(b) + 100 * (10 - int(a))
print(ans)
else:
print(b)
| a, b = input().split()
if int(a) <= 9:
ans = int(b) + 100 * (10 - int(a))
print(ans)
else:
print(b)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,249 | 558,248 | u902361509 | python |
p02765 | a, b = input().split()
if int(a) < 9:
ans = int(b) - 100 * (10 - int(a))
print(ans)
else:
print(b)
| a, b = input().split()
if int(a) <= 9:
ans = int(b) + 100 * (10 - int(a))
print(ans)
else:
print(b)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 558,250 | 558,248 | u902361509 | python |
p02765 | N, R = input().split()
N = int(N)
R = int(R)
if N >= 10:
print(K)
else:
print(R + 100*(10-N)) | N, R = input().split()
N = int(N)
R = int(R)
if N >= 10:
print(R)
else:
print(R + 100*(10-N)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 558,251 | 558,252 | u559200744 | python |
p02765 | N, R = map(int, input().split())
print(R if N >= 10 else R-100*(10-N)) | N, R = map(int, input().split())
print(R if N >= 10 else (R + 100*(10-N))) | [
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 558,259 | 558,260 | u760391419 | python |
p02765 | n,r=map(int,input().split())
if n>10:
print(r)
else:
print(r-1000+100*n)
| n,r=map(int,input().split())
if n>10:
print(r)
else:
print(r+1000-100*n) | [
"expression.operation.binary.remove"
] | 558,263 | 558,264 | u835924161 | python |
p02765 | n,r=map(int,input().split())
if n>10:
print(r)
else:
print(r-1000+100*k) | n,r=map(int,input().split())
if n>10:
print(r)
else:
print(r+1000-100*n) | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 558,265 | 558,264 | u835924161 | python |
p02765 | N, R = map(int, input().split())
if (N >= 10):
ans = R
else:
ans = R + 1000 - 100 * N | N, R = map(int, input().split())
if (N >= 10):
ans = R
else:
ans = R + 1000 - 100 * N
print(ans) | [
"call.add"
] | 558,274 | 558,275 | u015593272 | python |
p02765 | def resolve():
n, r = map(int, input().split())
if n < 10:
print(100*(10-n)+r)
else:
print(r) | n, r = map(int, input().split())
if n < 10:
print(100*(10-n)+r)
else:
print(r) | [] | 558,294 | 558,295 | u202727309 | python |
p02765 | n,k=map(int,input().split())
print(k+100*(10-k) if n<10 else k) | n,k=map(int,input().split())
print(k+100*(10-n) if n<10 else k)
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 558,312 | 558,313 | u248670337 | python |
p02765 | n,r=map(int,input().split())
if n>=10:
naibu=r
else:
naibu=r-100*(10-n)
print(naibu) | n,r=map(int,input().split())
if n>=10:
naibu=r
else:
naibu=r+100*(10-n)
print(naibu) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 558,321 | 558,322 | u723792785 | python |
p02765 | n, r= map(int, input().split())
ans = 0
if n < 10: ans = 100 * (10 - n)
else: ans = r
print(ans) | n, r= map(int, input().split())
ans = 0
if n < 10: ans = 100 * (10 - n) + r
else: ans = r
print(ans) | [
"assignment.change"
] | 558,352 | 558,353 | u556610039 | python |
p02765 | n, k = map(int, input().split())
ans = 0
if n < 10:
ans = 100*(10-n)+k
else:
ans = k
print(k) | n, k = map(int, input().split())
ans = 0
if n < 10:
ans = 100*(10-n)+k
else:
ans = k
print(ans)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 558,354 | 558,355 | u468206018 | python |
p02762 | class UnionFind():
def __init__(self,n):
self.n = n
# parents が負の時は要素数
# parents が正の時は親の番号
self.parents = [-1] * n
# xの根を求める
def find(self,x):
if self.parents[x] < 0:
return x
else:
# 根を再帰的に求める
self.parents[x] = s... | class UnionFind():
def __init__(self,n):
self.n = n
# parents が負の時は要素数
# parents が正の時は親の番号
self.parents = [-1] * n
# xの根を求める
def find(self,x):
if self.parents[x] < 0:
return x
else:
# 根を再帰的に求める
self.parents[x] = s... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 558,374 | 558,375 | u861141787 | python |
p02762 | class UnionFind():
def __init__(self,size):
self.table = [-1 for _ in range(size)]
self.cou = [1 for _ in range(size)]
def find(self,x):
if self.table[x] < 0:
return x
else:
self.table[x] = self.find(self.table[x])
return self.table[x]
de... | class UnionFind():
def __init__(self,size):
self.table = [-1 for _ in range(size)]
self.cou = [1 for _ in range(size)]
def find(self,x):
if self.table[x] < 0:
return x
else:
self.table[x] = self.find(self.table[x])
return self.t... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,385 | 558,386 | u149752754 | python |
p02762 |
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1] * (n + 1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0] * (n + 1)
# ノードxのrootノードを見つける
def Fi... | class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1] * (n + 1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0] * (n + 1)
# ノードxのrootノードを見つける
def Fi... | [
"call.remove"
] | 558,399 | 558,400 | u073549161 | python |
p02762 |
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1] * (n + 1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0] * (n + 1)
# ノードxのrootノードを見つける
def Fi... |
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1] * (n + 1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0] * (n + 1)
# ノードxのrootノードを見つける
def Fi... | [
"call.remove"
] | 558,399 | 558,401 | u073549161 | python |
p02762 | def main():
n,m,k = map(int,input().split())
friend = []
block = []
# Union-Find作る
uf = UnionFind(n)
# iとすでに友達 iとブロックの数は最後に除外する
exclude_i = [0] * n
for _ in range(m):
a,bb = map(int,input().split())
# aとbを同じグループにする
uf.union(a-1,bb-1)
friend.append([a-1,bb... | def main():
n,m,k = map(int,input().split())
friend = []
block = []
# Union-Find作る
uf = UnionFind(n)
# iとすでに友達 iとブロックの数は最後に除外する
exclude_i = [0] * n
for _ in range(m):
a,bb = map(int,input().split())
# aとbを同じグループにする
uf.union(a-1,bb-1)
friend.append([a-1,bb... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 558,404 | 558,405 | u321035578 | python |
p02766 | N,K = map(int,input().split())
i = 0
anslist = []
while True:
i+=1
anslist.append(N%K)
N = N//K
#print (N)
if N<K:
anslist.append(N)
i+=1
break
anslist.reverse()
#print (anslist)
#print (''.join(map(str, anslist)))
print (i) | N,K = map(int,input().split())
i = 0
anslist = []
while True:
if N>=K:
i+=1
anslist.append(N%K)
N = N//K
#print (N)
if N<K:
anslist.append(N)
i+=1
break
anslist.reverse()
#print (anslist)
#print (''.join(map(str, anslist)))
print (i) | [
"control_flow.branch.if.add"
] | 558,447 | 558,448 | u302697704 | python |
p02766 | n,k = map(int,input().split())
keta = 1
while k ** keta < n:
keta += 1
print(keta) | n,k = map(int,input().split())
keta = 1
while k ** keta <= n:
keta += 1
print(keta) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,451 | 558,452 | u475189661 | python |
p02766 | n, k = map(int, input().split())
a = 1
while n > k ** a:
a += 1
print(a)
| n, k = map(int, input().split())
a = 1
while n >= k ** a:
a += 1
print(a)
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,453 | 558,454 | u003505857 | python |
p02766 | N,K=map(int,input().split())
count = 1
kai = K
while N > K:
K = K*kai
count += 1
print(count) | N,K=map(int,input().split())
count = 1
kai = K
while N >= K:
K = K*kai
count += 1
print(count) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,457 | 558,458 | u208133431 | python |
p02766 | N, K = map(int, input().split())
bit = 0
while(N > K**bit):
bit += 1
print(bit) | N, K = map(int, input().split())
bit = 0
while(N >= K**bit):
bit += 1
print(bit) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,463 | 558,464 | u574779290 | python |
p02765 | from sys import stdin
N,R = [int(x) for x in stdin.readline().rstrip().split()]
if N >= 10:
print(R)
else:
print(R - (100*(10-N))) | from sys import stdin
N,R = [int(x) for x in stdin.readline().rstrip().split()]
if N >= 10:
print(R)
else:
print(R + (100*(10-N))) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 558,496 | 558,497 | u405256066 | python |
p02765 | N, R = map(int, input().split())
if N < 10:
a = 100 * (10^N)
else:
a = 0
print(a + R) | N, R = map(int, input().split())
if N < 10:
a = 100 * (10-N)
else:
a = 0
print(a + R) | [
"assignment.value.change",
"expression.operation.binary.change"
] | 558,514 | 558,515 | u054473438 | python |
p02766 | n,k = map(int,input().split())
n2 = k
count = 0
while n2 <= n:
n2*=k
count+=1
print(n2)
print(count+1) | n,k = map(int,input().split())
n2 = k
count = 0
while n2 <= n:
n2*=k
count+=1
print(count+1) | [
"call.remove"
] | 558,520 | 558,521 | u018258333 | python |
p02766 | N, K = map(int, input())
ans = 1
while 1:
if N >= K ** ans:
ans += 1
continue
else:
print(ans) | N, K = map(int, input().split())
ans = 1
while 1:
if N >= K ** ans:
ans += 1
continue
else:
print(ans)
break | [
"control_flow.break.add"
] | 558,524 | 558,523 | u377834804 | python |
p02766 | import math
n, k = map(int, input().split())
print(math.ceil(math.log(n, k)))
| import math
n, k = map(int, input().split())
print(math.floor(math.log(n, k)) + 1)
| [
"misc.opposites",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 558,525 | 558,526 | u091307273 | python |
p02766 | n, k = map(int, input().split())
i = 1
while k ** i < n:
i += 1
print(i) | n, k = map(int, input().split())
i = 1
while k ** i <= n:
i += 1
print(i) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,536 | 558,537 | u125269142 | python |
p02766 | N,K = map(int, input().split())
Sum = 1
while True:
Sum += 1
if K ** Sum > N:
break
print(Sum) | N,K = map(int, input().split())
Sum = 0
while True:
Sum += 1
if K ** Sum > N:
break
print(Sum) | [
"literal.number.integer.change",
"assignment.value.change"
] | 558,538 | 558,539 | u698902360 | python |
p02766 | N,K = map(int, input().split())
Sum = 1
while True:
Sum += 1
if K ** Sum > N:
break
print(Sum-1) | N,K = map(int, input().split())
Sum = 0
while True:
Sum += 1
if K ** Sum > N:
break
print(Sum) | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 558,540 | 558,539 | u698902360 | python |
p02766 | import math
N, K = map(int, input().split())
print(math.ceil(math.log(N) / math.log(K))) | import math
N, K = map(int, input().split())
print(int(math.log(N) / math.log(K)) + 1) | [
"call.arguments.change",
"io.output.change"
] | 558,541 | 558,542 | u573900545 | python |
p02766 | N, K = map(int, input().split())
ans = 0
while K**ans < N:
ans += 1
print(ans) | N, K = map(int, input().split())
ans = 0
while K**ans <=N:
ans += 1
print(ans) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,543 | 558,544 | u000623733 | python |
p02766 | n,k=map(int,input().split())
ans=0
for i in range(n):
if n>=1:
n=n/k
ans+=1
else:
print(ans)
break | n,k=map(int,input().split())
ans=0
for i in range(100000000):
if n>=1:
n=n/k
ans+=1
else:
print(ans)
break | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 558,545 | 558,546 | u674959030 | python |
p02766 | n,k = map(int,input().split())
i = 0
while n>k**i:
i+= 1
print(i) | n,k = map(int,input().split())
i = 0
while n>= k**i:
i+= 1
print(i) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,547 | 558,548 | u273242084 | python |
p02766 | N, K = map(int, input().split())
for n in range(10**10):
if N <= K**n:
print(n)
exit() | N, K = map(int, input().split())
for n in range(10**10):
if N < K**n:
print(n)
exit() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,551 | 558,552 | u439063038 | python |
p02766 | N, K = map(int,input().split())
cnt = 0
while K ** cnt < N:
cnt += 1
print(cnt) | N, K = map(int,input().split())
cnt = 0
while K ** cnt <= N:
cnt += 1
print(cnt) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,561 | 558,562 | u473291366 | python |
p02766 | import math
def main():
N, K = map(int, input().split())
i = 1
tmp = 1
while i > -1:
if N > K ** i:
tmp += 1
else:
print(tmp)
return
i += 1
main() | import math
def main():
N, K = map(int, input().split())
i = 1
tmp = 1
while i > -1:
if N >= K ** i:
tmp += 1
else:
print(tmp)
return
i += 1
main() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,565 | 558,566 | u690833702 | python |
p02766 | N,K = map(int,input().split())
tmp = 1
for i in range(1,30):
if N > K**i:
tmp = i+1
else:
print(tmp)
break | N,K = map(int,input().split())
tmp = 1
for i in range(1,40):
if N >= K**i:
tmp = i+1
else:
print(tmp)
break
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,569 | 558,568 | u145915236 | python |
p02766 | n, k = map(int, input().split())
s = ""
while(True):
if n < k :
s += str(n)
break
else :
s += str(n%k)
n = n//k
print(s)
print(len(s)) | n, k = map(int, input().split())
s = ""
while(True):
if n < k :
s += str(n)
break
else :
s += str(n%k)
n = n//k
print(len(s)) | [
"call.remove"
] | 558,570 | 558,571 | u765590009 | python |
p02766 | n,k = map(int, input().split())
res = 0
m = n-1
a = 1
while True:
if n <= k**a:
ans = a
break
a += 1
print(ans) | n,k = map(int, input().split())
res = 0
m = n-1
a = 1
while True:
if n <= k**a - 1:
break
a += 1
print(a) | [
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 558,574 | 558,575 | u809819902 | python |
p02766 | n,k = map(int,input().split())
for i in range(100000):
if k**(i-1) < n <= k**i:
print(i)
break | n,k = map(int,input().split())
for i in range(100000):
if k**(i-1) <= n < k**i:
print(i)
break | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 558,578 | 558,579 | u131464432 | python |
p02766 | n,k = map(int, input().split())
ans = 0
while n > 0:
n /= k
ans += 1
print(ans)
| n,k = map(int, input().split())
ans = 0
while n > 0:
n /= k
n = int(n)
ans += 1
print(ans)
| [
"assignment.add"
] | 558,582 | 558,583 | u276686572 | python |
p02766 | # coding: utf-8
# Your code here!
n,k = map(int, input().split())
cnt = 1
a = k
while k < n:
k = k*a
cnt += 1
print(cnt) | # coding: utf-8
# Your code here!
n,k = map(int, input().split())
cnt = 1
a = k
while k <= n:
k = k*a
cnt += 1
print(cnt) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,584 | 558,585 | u889390649 | python |
p02766 | N, K = map(int, input().split())
M = 0
i = 0
while M < N:
M += K**i
i += 1
print(i) | N, K = map(int, input().split())
M = 0
i = 0
while M < N:
M += (K-1)*K**i
i += 1
print(i) | [
"expression.operation.binary.add"
] | 558,586 | 558,587 | u397020326 | python |
p02766 | n,k= map(int,input().split())
temp = 1
cnt = 0
while n > temp:
temp *= k
cnt += 1
print(max(1,cnt)) | n,k= map(int,input().split())
temp = 1
cnt = 0
while n >= temp:
temp *= k
cnt += 1
print(max(1,cnt)) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,588 | 558,589 | u564770050 | python |
p02766 | n,k= map(int,input().split())
temp = 1
cnt = 0
while n > temp:
temp *= k
cnt += 1
print(cnt) | n,k= map(int,input().split())
temp = 1
cnt = 0
while n >= temp:
temp *= k
cnt += 1
print(max(1,cnt)) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"call.add",
"call.arguments.change"
] | 558,590 | 558,589 | u564770050 | python |
p02766 | n,k=map(int,input().split())
i=1
while True:
if n>k**i:
i+=1
else:
break
print(i) | n,k=map(int,input().split())
i=1
while True:
if n>=k**i:
i+=1
else:
break
print(i) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,591 | 558,592 | u957957759 | python |
p02766 | n,k = map(int,input().split())
ans = 0
m = 1
while m < n:
m *= k
ans += 1
print(ans) | n,k = map(int,input().split())
ans = 0
m = 1
while m <= n:
m *= k
ans += 1
print(ans)
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,599 | 558,600 | u531599639 | python |
p02766 | n,k = map(int,input().split())
ans = 0
m = 1
while m > n:
m*k
ans += 1
print(ans) | n,k = map(int,input().split())
ans = 0
m = 1
while m <= n:
m *= k
ans += 1
print(ans)
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 558,601 | 558,600 | u531599639 | python |
p02766 | N, K = list(map(int, input().split()))
num = K
count = 1
while num < N:
num *= K
count += 1
print(count) | N, K = list(map(int, input().split()))
num = K
count = 1
while num <= N:
num *= K
count += 1
print(count) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,602 | 558,603 | u572122511 | python |
p02766 | n, k = map(int, input().split())
count == 0
while n >= k:
n = n // k
count += 1
print(count) | n, k = map(int, input().split())
count = 0
while n >= k:
n = n // k
count += 1
print(count+1)
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 558,611 | 558,612 | u392361133 | python |
p02766 | N,K=map(int, input().split())
if K == 10:
print(len(str(N)))
exit()
cnt = 1
while True:
if N / (K ** cnt) <= 1:
print(cnt)
exit()
cnt += 1
| N,K=map(int, input().split())
if K == 10:
print(len(str(N)))
exit()
cnt = 1
while True:
if N / (K ** cnt) < 1:
print(cnt)
exit()
cnt += 1
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,613 | 558,614 | u695261159 | python |
p02766 | n,k=list(map(int,input().split()))
import sys
ans=1
import copy
num=copy.deepcopy(k)
while(1):
if num>=n:
print(ans)
sys.exit()
num=num*k
ans=ans+1
| n,k=list(map(int,input().split()))
import sys
ans=1
import copy
num=copy.deepcopy(k)
while(1):
if num>n:
print(ans)
sys.exit()
num=num*k
ans=ans+1
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,617 | 558,618 | u437351386 | python |
p02766 | n, k = map(int, input().split())
count = 0
while(True):
if n > k ** count:
count += 1
else:
break
print(count)
| n, k = map(int, input().split())
count = 0
while(True):
if n >= k ** count:
count += 1
else:
break
print(count)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,619 | 558,620 | u871867619 | python |
p02766 | def B():
n,r = list(map(int, input().split()))
i = 1
while True:
if n < k**i:
print(i)
return
i += 1
B() | def B():
n,k = list(map(int, input().split()))
i = 1
while True:
if n < k**i:
print(i)
return
i += 1
B() | [
"assignment.variable.change",
"identifier.change"
] | 558,629 | 558,630 | u985041094 | python |
p02766 | import math
n, k = map( int, input().split() )
print( math.ceil( math.log( n, k ))) | import math
n, k = map( int, input().split())
print( math.floor( math.log( n, k ) ) + 1 )
| [
"misc.opposites",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 558,641 | 558,642 | u699008198 | python |
p02766 | line = input().split(" ")
n = int(line[0])
k = int(line[1])
exp = 1
while pow(k, exp) < n:
exp += 1
print(exp)
| line = input().split(" ")
n = int(line[0])
k = int(line[1])
exp = 1
while pow(k, exp) <= n:
exp += 1
print(exp)
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,649 | 558,650 | u504069186 | python |
p02766 | line = input().split(" ")
n = int(line[0])
k = int(line[1])
exp = 0
while pow(k, exp) < n:
exp += 1
print(exp)
| line = input().split(" ")
n = int(line[0])
k = int(line[1])
exp = 1
while pow(k, exp) <= n:
exp += 1
print(exp)
| [
"literal.number.integer.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,651 | 558,650 | u504069186 | python |
p02766 | N,K=int(input().split())
ans = 0
while (N > 0):
N //= K
ans += 1
print(ans) | N,K=map(int, input().split())
ans = 0
while (N > 0):
N //= K
ans += 1
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 558,652 | 558,653 | u742529680 | python |
p02766 | a,b = map(int,input().split())
count,rank = 1,b
while a > rank:
count += 1
rank *= b
print(count) | a,b = map(int,input().split())
count,rank = 1,b
while a >= rank:
count += 1
rank *= b
print(count) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,664 | 558,665 | u842028864 | python |
p02766 | # coding: utf-8
import math
n, k = map(int, input().split())
print(math.ceil(math.log(n, k)))
| # coding: utf-8
import math
n, k = map(int, input().split())
print(int(math.log(n, k)) + 1)
| [
"call.arguments.change",
"io.output.change"
] | 558,672 | 558,671 | u502247093 | python |
p02766 | N,K = map(int,input().split())
ans = 0
n = N
while n:
ans += 1
n //= 2
print(ans)
| N,K = map(int,input().split())
ans = 0
n = N
while n:
ans += 1
n //= K
print(ans)
| [
"identifier.replace.add",
"literal.replace.remove"
] | 558,674 | 558,675 | u446774692 | python |
p02766 | N, K = map(int,input().split())
counter = 0
while N >= K:
N = N/K
counter = counter + 1
print(counter) | N, K = map(int,input().split())
counter = 1
while N >= K:
N = N/K
counter = counter + 1
print(counter) | [
"literal.number.integer.change",
"assignment.value.change"
] | 558,678 | 558,679 | u465652095 | python |
p02766 | n,k=map(int,input().split())
sum=0
while n>1:
n=n/k
sum+=1
print (sum)
| n,k=map(int,input().split())
count=1
while n>=k:
n=n/k
count+=1
print(count)
| [
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"io.output.change"
] | 558,690 | 558,691 | u350093546 | python |
p02766 | counter = 0
n, k = map(int, input().split())
for i in range(100):
if k ** i >= n:
counter = i + 1
print(counter) | counter = 0
n, k = map(int, input().split())
for i in range(100):
if k ** i <= n:
counter = i + 1
else:
break
print(counter)
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.add"
] | 558,692 | 558,693 | u243572357 | python |
p02766 | n,k = map(int,input().split())
count = 1
a = k
while n > a:
count += 1
a = a * k
print(count) | n,k = map(int,input().split())
count = 1
a = k
while n >= a:
count += 1
a = a * k
print(count) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,699 | 558,700 | u931394483 | python |
p02766 | n,k = map(int,input().split())
count = 0
a = 1
while n > a:
count += 1
a = a * k
print(count) | n,k = map(int,input().split())
count = 1
a = k
while n >= a:
count += 1
a = a * k
print(count) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,701 | 558,700 | u931394483 | python |
p02766 | import sys
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
n, k = ISI()
i = 0
val=1
while(val<n):
val*=k
i+=1
print(i) | import sys
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
n, k = ISI()
i = 0
val=1
while(val<=n):
val*=k
i+=1
print(i) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,757 | 558,758 | u640603056 | python |
p02766 | N, K = map(int, input().split())
digit = 0
while True:
if N <= K ** digit:
break
digit += 1
print(digit) | N, K = map(int, input().split())
digit = 0
while True:
if N < K ** digit:
break
digit += 1
print(digit) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,768 | 558,769 | u948050032 | python |
p02766 | N, K = map(int, input().split())
count = 0
while N > 1:
N /= K
count += 1
print(count) | N, K = map(int, input().split())
count = 0
while N >= 1:
N /= K
count += 1
print(count) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,776 | 558,777 | u031157253 | python |
p02766 | n, k = map(int, input().split())
num = 1
index = 0
while num < n:
index += 1
num *= k
print(index) | n, k = map(int, input().split())
num = 1
index = 0
while num <= n:
index += 1
num *= k
print(index) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,786 | 558,787 | u297667660 | python |
p02766 | n,k=map(int,input().split())
i=0
while True:
if n>k**i:
i=i+1
else:
print(i)
break | n,k=map(int,input().split())
i=0
while True:
if n>=k**i:
i=i+1
else:
print(i)
break | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,788 | 558,789 | u629350026 | python |
p02766 | n, k = map(int, input().split())
ans = 1
while k < n:
n /= k
ans += 1
print(ans) | n, k = map(int, input().split())
ans = 1
while k <= n:
n /= k
ans += 1
print(ans) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,790 | 558,791 | u167647458 | python |
p02766 | #B
import math
n, k = map(int, input().split())
i=0
while True:
tmp=k**i
if tmp >= n:
break
i += 1
print(i) | #B
import math
n, k = map(int, input().split())
i=0
while True:
tmp=k**i
if tmp > n:
break
i += 1
print(i) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,796 | 558,797 | u490489966 | python |
p02766 | import math
n, k = map(int, input().split())
num = n
count = 1
while num >= k:
num = num // k
print(count) | import math
n, k = map(int, input().split())
num = n
count = 1
while num >= k:
num = num // k
count+= 1
print(count) | [] | 558,800 | 558,801 | u671060652 | python |
p02766 | import math
N, K = map(int, input().split(' '))
print(math.ceil(math.log(N, K)))
| import math
N, K = map(int, input().split(' '))
print(int(math.log(N, K)) + 1)
| [
"call.arguments.change",
"io.output.change"
] | 558,808 | 558,809 | u606878291 | python |
p02766 | def main():
n, k = map(int, input().split())
cnt = 0
i = 1
# nが大きい
while n >= i:
print(i)
i *= k
cnt += 1
print(cnt)
if __name__ == '__main__':
main() | def main():
n, k = map(int, input().split())
cnt = 0
i = 1
# nが大きい
while n >= i:
i *= k
cnt += 1
print(cnt)
if __name__ == '__main__':
main() | [
"call.remove"
] | 558,812 | 558,813 | u243312682 | python |
p02766 | def main():
n, k = map(int, input().split())
cnt = 0
i = 1
# nが大きい
while n > i:
i *= k
cnt += 1
print(cnt)
if __name__ == '__main__':
main() | def main():
n, k = map(int, input().split())
cnt = 0
i = 1
# nが大きい
while n >= i:
i *= k
cnt += 1
print(cnt)
if __name__ == '__main__':
main() | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,814 | 558,813 | u243312682 | python |
p02766 | n,k = [int(x) for x in input().split()]
res = 0
while n > 0:
n // k
c += 1
print(res) | n,k = [int(x) for x in input().split()]
res = 0
while n > 0:
n //= k
res += 1
print(res) | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"identifier.change"
] | 558,818 | 558,819 | u924828749 | python |
p02766 | n, k = map(int,input().split())
if n == 1:
print(1)
else:
a=1
ans = 0
while a<n:
a *=k
ans += 1
print(ans)
| n, k = map(int,input().split())
if n == 1:
print(1)
else:
a=1
ans = 0
while a<=n:
a *=k
ans += 1
print(ans)
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,820 | 558,821 | u881675205 | python |
p02766 | import sys
import math
n,k=map(int,input().split())
p=int(math.log2(n))
for i in range(p):
if n//(k**i)<1:
print(i)
sys.exit() | import sys
import math
n,k=map(int,input().split())
p=int(math.log2(n))
for i in range(p+2):
if n//(k**i)<1:
print(i)
sys.exit() | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 558,826 | 558,827 | u800058906 | python |
p02766 | n,k = map(int, input().split())
for i in range(1000000):
if k**i >= n:
print(i)
break | n,k = map(int, input().split())
for i in range(1000000):
if k**i > n:
print(i)
break | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,832 | 558,833 | u891687930 | python |
p02766 | # -*- coding: utf-8 -*-
N, K = map(int, input().split())
cnt = 1
val = N
while val > K:
val = val / K
cnt += 1
print(cnt) | # -*- coding: utf-8 -*-
N, K = map(int, input().split())
cnt = 1
val = N
while val >= K:
val = val / K
cnt += 1
print(cnt) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,838 | 558,839 | u540762794 | python |
p02766 | def from_10_to_n(x, n):
tmp = x
out = ''
while tmp > 0:
out = str(x % n) + out
tmp = tmp // n
return out
N, K = map(int, input().split())
N = from_10_to_n(x, n)
print(len(N)) | def from_10_to_n(x, n):
tmp = x
out = ''
while tmp > 0:
out = str(x % n) + out
tmp = tmp // n
return out
N, K = map(int, input().split())
N = from_10_to_n(N, K)
print(len(N)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 558,840 | 558,841 | u309120194 | python |
p02766 | n,k = map(int,input().split())
for i in range(10**9):
if n <= k**i:
print(i)
exit() | n,k = map(int,input().split())
for i in range(10**9):
if n < k**i:
print(i)
exit() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,842 | 558,843 | u427231601 | python |
p02766 | n,k= map(int,input().split())
count =1
while n > k:
n=n/k
count+=1
print(count) | n,k= map(int,input().split())
count =1
while n >= k:
n=n/k
count+=1
print(count) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,844 | 558,845 | u620846115 | python |
p02766 | n,k=map(int,input().split())
ans=0
while n>k:
n/=k
ans+=1
print(ans+1) | n,k=map(int,input().split())
ans=0
while n>0:
n//=k
ans+=1
print(ans) | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.condition.change",
"expression.operator.change",
"expression.operation.binary.remove"
] | 558,846 | 558,847 | u705418271 | python |
p02766 | n,k = map(int,input().split())
def base10to(n, k):
if(int(n/k)):
return base10to(int(n/k), k) + str(n%k)
return str(n%k)
print(base10to(n,k)) | n,k = map(int,input().split())
def base10to(n, k):
if(int(n/k)):
return base10to(int(n/k), k) + str(n%k)
return str(n%k)
print(len(base10to(n,k))) | [
"call.arguments.add",
"call.arguments.change"
] | 558,848 | 558,849 | u785728112 | python |
p02766 | N,K = map(int, input().split())
z = 1
cnt = 0
while z < N:
z *= K
cnt += 1
print(cnt) | N,K = map(int, input().split())
z = 1
cnt = 0
while z <= N:
z *= K
cnt += 1
print(cnt) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 558,850 | 558,851 | u618251217 | python |
p02766 | N,K=map(int,input().split())
i=0
while True:
if N<=K**i:
print(i)
break
i+=1 | N,K=map(int,input().split())
i=0
while True:
if N<K**i:
print(i)
break
i+=1 | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,852 | 558,853 | u827261928 | python |
p02766 | #!/usr/bin/env python3
def main():
N, K = map(int, input().split())
for i in range(10 ** 9):
if N <= K ** i:
print(i)
break
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
def main():
N, K = map(int, input().split())
for i in range(10 ** 9):
if N <= K ** i - 1:
print(i)
break
if __name__ == '__main__':
main()
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 558,854 | 558,855 | u216015528 | python |
p02766 | n, k = map(int,input().split())
i = 1
x = k
while True:
if (x >= n):
print(i)
break
else:
i = i + 1
x = x*k | n, k = map(int,input().split())
i = 1
x = k
while True:
if (x > n):
print(i)
break
else:
i = i + 1
x = x*k
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 558,864 | 558,865 | u625864724 | python |
p02766 | a = list(map(int, input().split()))
b = a[0]
c = 0
while b > 0:
b = b / a[1]
c += 1
print(c)
| a = list(map(int, input().split()))
b = a[0]
c = 0
while b > 0:
b = b // a[1]
c += 1
print(c)
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 558,872 | 558,873 | u094102716 | python |
p02766 | a = list(map(int, input().split()))
b = a[0]
c = 0
while b > 1:
b = b // a[1]
c += 1
print(c)
| a = list(map(int, input().split()))
b = a[0]
c = 0
while b > 0:
b = b // a[1]
c += 1
print(c)
| [
"literal.number.integer.change",
"control_flow.loop.condition.change"
] | 558,874 | 558,873 | u094102716 | python |
p02766 | a = list(map(int, input().split()))
b = a[0]
c = 0
while b > 1:
b = b / a[1]
c += 1
print(c) | a = list(map(int, input().split()))
b = a[0]
c = 0
while b > 0:
b = b // a[1]
c += 1
print(c)
| [
"literal.number.integer.change",
"control_flow.loop.condition.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 558,875 | 558,873 | u094102716 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.