Datasets:
TnT
/
Multi_CodeNet4Repair

Dataset card Data Studio Files
xet
Community
problem_id
stringlengths
6
6
user_id
stringlengths
10
10
time_limit
float64
1k
8k
memory_limit
float64
262k
1.05M
problem_description
stringlengths
48
1.55k
codes
stringlengths
35
98.9k
status
stringlengths
28
1.7k
submission_ids
stringlengths
28
1.41k
memories
stringlengths
13
808
cpu_times
stringlengths
11
610
code_sizes
stringlengths
7
505
p02766
u441599836
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int, input().split())\nans = 0\n\nfor i in range(n):\n t = k ** i\n if n > t:\n ans += 1\n if n % t == 0:\n ans += 1\n else:\n break\nprint(ans + 0)\n', 'import math\nn, k = map(int, input().split())\n\nans = int(math.log(n, k))\n\nprint(ans+1)\n']
['Wrong Answer', 'Accepted']
['s822858948', 's090071958']
[2940.0, 2940.0]
[17.0, 17.0]
[190, 86]
p02766
u443577878
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K=map(int,input().split())\ncnt=0\nwhile N//K>=1:\n cnt += 1\nprint(cnt+1)', 'N,K=map(int,input().split())\ncnt=0\nwhile N//K>=1:\n cnt += 1\nprint(cnt)', 'N,K=map(int,input().split())\ncnt=0\nfor i in range(1,100):\n if N/(K**i)>=1:\n cnt += 1\nprint(cnt+1)']
['Time Limit Exceeded', 'Wrong Answer', 'Accepted']
['s396084908', 's929065948', 's273557210']
[2940.0, 2940.0, 2940.0]
[2104.0, 2104.0, 17.0]
[79, 77, 119]
p02766
u444722572
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int,input().split())\n \nans = 1\n \n while N >= K:\n N = N // K\n ans += 1\n \nprint(ans)', 'n,k=map(int,input().split())\ni=0\nwhile (n>1):\n n/=k\n i+=1\n print(n)\nprint(i)', 'n,k=map(int,input().split())\ni=0\nwhile (n>0):\n n/=k\n i+=1\nprint(i)', 'N, K = map(int,input().split())\n \nans = 1\n\nwhile N >= K:\n N = N // K\n ans += 1\n \nprint(ans)']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s657941105', 's774556945', 's968470897', 's532926757']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[102, 85, 72, 100]
p02766
u446371873
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = map(int,input().split())\nans = 0\nwhile int(n / k) != 0:\n ans += 1\n n = int(n / k)\nprint(ans)', 'n,k = map(int,input().split())\nans = 1\nwhile n != 0:\n n = int(n / k)\n ans += 1\nprint(ans)', 'n,k = map(int,input().split())\nans = 0\nwhile n != 0:\n n = int(n / k)\n ans += 1\nprint(ans)\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s319034778', 's759300611', 's152992423']
[3064.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[100, 91, 92]
p02766
u459315695
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K = map(int,input().split())\nCount=0\nwhile N > 0:\n N = int(N/K)\n print(N)\n Count=Count+1\nprint(Count)', 'N,K = map(int,input().split())\nCount=0\nwhile N > 0:\n N = int(N/K)\n Count=Count+1\nprint(Count)']
['Wrong Answer', 'Accepted']
['s865641883', 's121592681']
[2940.0, 2940.0]
[17.0, 17.0]
[106, 95]
p02766
u460748766
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\n\ndef finddigit(n, b):\n dig = (math.floor(math.log(n)/math.log(b))+1)\n print(dig)\n\nfinddigit(n,b)\n', 'import math\n\ndef finddigit(n, b):\n dig = (math.floor(math.log(n)/math.log(b))+1)\n print(dig)\n\nn,b = map(int,input().split())\nfinddigit(n,b)\n']
['Runtime Error', 'Accepted']
['s233432373', 's449382023']
[2940.0, 2940.0]
[18.0, 17.0]
[115, 146]
p02766
u465652095
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int,input().split())\n\ncounter = 0\nwhile N >= K:\n N = N/K\n counter = counter + 1\n\nprint(counter)', 'N, K = map(int,input().split())\n\ncounter = 1\nwhile N >= K:\n N = N/K\n counter = counter + 1\n\nprint(counter)']
['Wrong Answer', 'Accepted']
['s882424969', 's412887973']
[2940.0, 2940.0]
[17.0, 17.0]
[112, 112]
p02766
u468972478
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int, input().split())\nprint(n // k + 1)', 'n, k = map(int, input().split())\ni = 0\nwhile n:\n n //= k\n i += 1\nprint(i)']
['Wrong Answer', 'Accepted']
['s260530572', 's715170021']
[9036.0, 9160.0]
[26.0, 27.0]
[50, 75]
p02766
u469936642
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int, input().split())\nres = 0\nwhile n > k:\n res += 1\n n //= k\nprint(res+1)', 'n, k = map(int, input().split())\nres = 0\nwhile n >= k:\n res += 1\n n //= k\nprint(res+1)\n']
['Wrong Answer', 'Accepted']
['s542959775', 's436520703']
[2940.0, 2940.0]
[17.0, 17.0]
[87, 89]
p02766
u482743994
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k=map(int,input())\nans=0\nwhile n>0:\n ans+=1\n n=n//k\nprint(ans)', 'n,k=map(int,input().split())\nans=0\nwhile n>0:\n ans+=1\n n=n//k\nprint(ans)\n']
['Runtime Error', 'Accepted']
['s152602271', 's592058616']
[2940.0, 2940.0]
[17.0, 17.0]
[66, 75]
p02766
u483896240
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['# -*- coding: utf-8 -*-\n\nn, k = map(int, input().split())\n\nres = 0\nwhile n > 0:\n res += 1\n n //= k\n print(res, n, k)\nprint(res)', '# -*- coding: utf-8 -*-\n\nn, k = map(int, input().split())\n\nres = 0\nwhile n > 0:\n res += 1\n n //= k\nprint(res)']
['Wrong Answer', 'Accepted']
['s436132063', 's724950276']
[3064.0, 2940.0]
[18.0, 18.0]
[136, 115]
p02766
u486209657
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K=map(int,input().split())\nX=0\ncnt=0\ni=0\n\nwhile X<N:\n X=X+K**i\n print(X)\n i=i+1\n cnt=cnt+1\n\nprint(i)', 'N,K=map(int,input().split())\nX=0\ni=0\nwhile X<N:\n X=X+(K-1)*K**i\n i=i+1\nprint(i)']
['Wrong Answer', 'Accepted']
['s521001549', 's552510658']
[9040.0, 9152.0]
[28.0, 27.0]
[114, 85]
p02766
u486286539
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int, input().split())\n\ncount = 1\nwhile True:\n if n / k >= 1:\n n = int(n / k)\n print(n)\n count += 1\n else:\n break\n\nprint(count)', 'n, k = map(int, input().split())\n\ncount = 1\nwhile True:\n if n / k >= 1:\n n = int(n / k)\n count += 1\n else:\n break\n\nprint(count)']
['Wrong Answer', 'Accepted']
['s676504468', 's846852685']
[2940.0, 2940.0]
[17.0, 17.0]
[172, 155]
p02766
u486463852
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = [int(i) for i in input().split()]\nprint(int(math.floor(math.log(float(N)/math.pow(K,2), K))) + 1 + 2)', 'import math\n\nN, K = [int(i) for i in input().split()]\nprint(int(math.floor(math.log(float(N)/math.pow(K,2), K))) + 1 + 2)']
['Runtime Error', 'Accepted']
['s032867518', 's789350397']
[2940.0, 2940.0]
[17.0, 17.0]
[108, 121]
p02766
u497326082
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k=map(int,input().split())\nprint(n,k)\nans=1\nf=0\nwhile ans < n:\n ans*=k\n f+=1\nprint(f)', 'n,k=map(int,input().split())\nans=1\nf=0\nwhile ans < n+1:\n ans*=k\n f+=1\nprint(f)']
['Wrong Answer', 'Accepted']
['s100976997', 's899751652']
[2940.0, 2940.0]
[17.0, 17.0]
[93, 84]
p02766
u502247093
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['# coding: utf-8\nn, k = map(int, input().split())\nans = 1\nwhile n > k:\n n = n // k\n ans = ans + 1\nprint(ans)\n', '# coding: utf-8\nimport math\nn, k = map(int, input().split())\nif n % k\nprint(int(math.log(n, k)) + 1)\n', '# coding: utf-8\nimport math\nn, k = map(int, input().split())\nprint(int(math.log(n, k)) + 1)\n']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s034389700', 's672907711', 's461487477']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 17.0]
[114, 101, 92]
p02766
u504194367
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['i = input().split()\nN = int(i[0])\nK = int(i[1])\nlog = 0\n\nlog = math.log(N,K)\nif int(log) != log:\n log += 1\n\nprint(log)', 'import math\n \ni = input().split()\nN = int(i[0])\nK = int(i[1])\nresult = 0\n \nresult = math.log(N, K)\nresult = 1 + int(result)\n\n \nprint(result)']
['Runtime Error', 'Accepted']
['s326900911', 's659632434']
[3060.0, 3060.0]
[18.0, 17.0]
[119, 140]
p02766
u508934152
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int, input().split())\nT = 0\n\nwhile T != 0:\n N = N // K\n T += 1\n \nprint(T)', 'N, K = map(int, input().split())\nT = 0\n \nwhile N > 0:\n N = N // K\n T += 1\n \nprint(T)']
['Wrong Answer', 'Accepted']
['s844462153', 's153949607']
[2940.0, 2940.0]
[17.0, 18.0]
[87, 87]
p02766
u509516894
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['def Base_10_to_n(X, n):\n if (int(X/n)):\n return Base_10_to_n(int(X/n), n)+str(X%n)\n return str(X%n)\nx2 = 0\nx10, n = input().split()\nprint(int(x10), int(n))\nx10 = int(x10)\nn = int(n)\nx2 = Base_10_to_n(x10, n)\nprint( len(x2) )', 'def Base_n_to_10(X,n):\n out = 0\n for i in range(1,len(str(X))+1):\n out += int(X[-i])*(n**(i-1))\n return out#int out\n\nN, K = input().split()\nN = int(N)\nK = int(K)\nx = str(len(Base_n_to_10(N,K)))\nprint(x)', 'def Base_10_to_n(X, n):\n if (int(X/n)):\n return Base_10_to_n(int(X/n), n)+str(X%n)\n return str(X%n)\nx2 = 0\nx10, n = input().split()\nx10 = int(x10)\nn = int(n)\nx2 = Base_10_to_n(x10, n)\nprint(len(x2))']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s016127983', 's252482400', 's618323573']
[3064.0, 3056.0, 3060.0]
[17.0, 17.0, 17.0]
[237, 218, 211]
p02766
u511870776
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = input().split()\nprint(len(str(int(n, int(k)))))', 'import numpy as np\nn, r = map(int, input().split())\nprint(len(str(np.base_repr(n,r))))']
['Runtime Error', 'Accepted']
['s515432956', 's594561266']
[2940.0, 12392.0]
[17.0, 152.0]
[54, 86]
p02766
u514118270
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['a,b = list(map(int,input().split()))\nfor i in range(10)\n if b**i <= a < b**(i+1):\n ans = i\n break\n else:\n ans = no\nprint(ans)\n ', 'n,k = list(map(int,input().split()))\nfor i in range(100):\n if k**1 <= n < k**(i+1):\n print(i+1)', 'N,K = list(map(int,input(),split()))\nfor i in range(100):\n if K**i <= N < K**(i+1):\n print(i+1）', 'n,k = list(map(int,input().split()))\nfor i in range(100):\n if k**i <= n < k**(i+1):\n print(i+1)']
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s277925053', 's361869050', 's868266375', 's874334710']
[2940.0, 3060.0, 3192.0, 2940.0]
[17.0, 18.0, 20.0, 17.0]
[152, 99, 101, 99]
p02766
u516678561
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
[", m = list(map(int, input().split(' ')))\n\n\n\ndef conversion(_n, _m):\n if int(_n / _m):\n return conversion(int(_n / _m), _m) + str(_n % _m)\n return str(_n % _m)\n\n\nprint(conversion(n, m))\n", "n, m = list(map(int, input().split(' ')))\n\n\n\ndef conversion(_n, _m):\n if int(_n / _m):\n return conversion(int(_n / _m), _m) + str(_n % _m)\n return str(_n % _m)\n\n\ndigit = (conversion(n, m))\nprint(len(digit))\n"]
['Runtime Error', 'Accepted']
['s631681286', 's227724598']
[2940.0, 2940.0]
[23.0, 18.0]
[318, 340]
p02766
u521271655
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K = map(int,input().split())\nfor i in range(1,10**9):\n if K**i <= N < K**(i+1):\n print(i+1)\n ', 'N,K = map(int,input().split())\nif N == 0 or N == 1:\n print(1)\nfor i in range(1,100):\n if K**i <= N < K**(i+1):\n print(i+1)\n break']
['Time Limit Exceeded', 'Accepted']
['s739130735', 's174307446']
[2940.0, 2940.0]
[2104.0, 17.0]
[108, 149]
p02766
u521602455
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\nN,K=map(int,input().split())\nif math.log(N,K).is_integer:\n print(int(math.log(N,K)))\nelse:\n print(int(math.log(N,K))+1)', 'import math\nN,K=map(int,input().split())\nx=math.log(N,K)\nif x.is_integer():\n print(int(x)+1)\nelse:\n print(int(x)+1)']
['Wrong Answer', 'Accepted']
['s123209763', 's406265457']
[2940.0, 2940.0]
[18.0, 18.0]
[137, 121]
p02766
u524489226
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int, input().split())\n \ntmp = 1\nfor i in range(100):\n tmp = k * tmp\n\n if n < tmp:\n print(i)\n exit()', 'n, k = map(int, input().split())\n \ntmp = 1\nfor i in range(100):\n tmp = k * tmp\n\n if n < tmp:\n print(i+1)\n exit()']
['Wrong Answer', 'Accepted']
['s394045427', 's480256264']
[2940.0, 2940.0]
[17.0, 17.0]
[130, 132]
p02766
u524534026
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["n,k = map(int,input().split())\nans = []\nwhile n > 0:\n ans.append(int(n%k)) \n n //= k\n\nans.reverse()\n\n[print(i,end='') for i in ans]", 'n,k = map(int,input().split())\nans = 0\nwhile n > 0:\n n //= k\n ans +=1\n\nprint(ans)']
['Wrong Answer', 'Accepted']
['s464024659', 's893337114']
[2940.0, 2940.0]
[19.0, 18.0]
[137, 87]
p02766
u529106146
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K= map(int, input().split())\nA = 0\ncnt = -1\nif N == 0:\n print(1)\nelse:\n while N >= A:\n cnt += 1\n A = K**(cnt+1)-1\n print(A)\n print(cnt+1)', 'N,K= map(int, input().split())\nA = 0\ncnt = -1\nif N <= K-1:\n print(1)\nelse:\n while N > A:\n cnt += 1\n A = K**(cnt+1)-1\n print(cnt+1)']
['Wrong Answer', 'Accepted']
['s287072160', 's738918123']
[2940.0, 3060.0]
[18.0, 17.0]
[169, 153]
p02766
u529188211
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = input().split()\nprint(int(n, int(k)))', 'n, k = input().split()\nimport math\ndef findNumberOfDigits(n, base):\n dig = (math.floor(math.log(n) /\n math.log(base)) + 1)\n print(dig)\n\nfindNumberOfDigits(int(n), int(k))']
['Runtime Error', 'Accepted']
['s725143445', 's644941074']
[3064.0, 2940.0]
[17.0, 17.0]
[44, 197]
p02766
u529393736
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["from sys import stdin\n\ndef rec(n, k, r):\n if n < k:\n return r\n else:\n q, mod = divmod(n, k)\n r += str(mod)\n n = q\n return rec(n, k, r)\n\ndef main():\n N, K = [int(x) for x in stdin.read().rstrip().split()]\n print(rec(N, K, ''))", 'from sys import stdin\n\n\ndef rec(n, k, cnt):\n if n < k:\n return cnt + 1\n else:\n q, mod = divmod(n, k)\n cnt += 1\n n = q\n return rec(n, k, cnt)\n\n\ndef main():\n N, K = [int(x) for x in stdin.read().rstrip().split()]\n print(rec(N, K, 0))\n\n\nif __name__ == "__main__":\n main()\n']
['Wrong Answer', 'Accepted']
['s652728184', 's505200936']
[3060.0, 2940.0]
[17.0, 17.0]
[244, 319]
p02766
u531599639
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = map(int,input().split())\nans = 0\nm = 1\nwhile m > n:\n m*k\n ans += 1\nprint(ans)', 'n,k = map(int,input().split())\nans = 0\nm = 1\nwhile m <= n:\n m *= k\n ans += 1\nprint(ans)\n']
['Wrong Answer', 'Accepted']
['s524356259', 's669788081']
[2940.0, 2940.0]
[18.0, 17.0]
[85, 90]
p02766
u539517139
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n=int(input())\nk=int(input())\nc=0\nwhile n:\n c+=1\n n=n//k\nprint(c)', 'n,k=map(int,input().split())\nc=0\nwhile n:\n c+=1\n n=n//k\nprint(c)']
['Runtime Error', 'Accepted']
['s499754675', 's984332900']
[2940.0, 2940.0]
[17.0, 17.0]
[67, 66]
p02766
u546440137
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k=int(input())\n\ncount=0\n\nwhile n//k>0:\n n//k\n count+=1\n \n ', 'n,k=map(int,input().split())\n \ncount=1\n \nwhile n//k>0:\n n=n//k\n count+=1\n \nprint(count)']
['Runtime Error', 'Accepted']
['s307833640', 's336148950']
[9032.0, 9128.0]
[24.0, 25.0]
[64, 97]
p02766
u546853743
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k=map(int,input().split())\ncount=0\nwhile m!=0:\n int(m) = n/k\n n=m\n count += 1\nprint(count)', 'n,k=map(int,input().split())\ncount=0\nwhile int(m)!=0:\n int(m)= n/k\n n=int(m)\n count += 1\nprint(count)', 'n,r = map(int,input().split())\ni = 0\nwhile n > 0:\n n / r\n i += 1\nprint(i)', 'n,k=map(int,input().split())\ncount=0\nwhile n !=0:\n n //= k\n count += 1\nprint(count)']
['Runtime Error', 'Runtime Error', 'Time Limit Exceeded', 'Accepted']
['s245552020', 's344623369', 's970055097', 's724019482']
[9104.0, 9076.0, 2940.0, 9104.0]
[25.0, 21.0, 2104.0, 28.0]
[101, 110, 79, 89]
p02766
u547608423
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K=map(int,input().split())\n\ni=0\na=[]\nif K==10:\n print(len(str(N)))\nelse:\n while N>=K**i:\n i+=1\n i-=1\n for j in range(i+1):\n a.append(N//(K**(i-j)))\n N%=(K**(i-j))\n \n print(a) ', 'N,K=map(int,input().split())\n\ni=0\na=[]\nif K==10:\n print(len(str(N)))\nelse:\n while N>=K**i:\n i+=1\n i-=1\n for j in range(i+1):\n a.append(N//(K**(i-j)))\n N%=(K**(i-j))\n \n print(len(a)) ']
['Wrong Answer', 'Accepted']
['s841671543', 's049099147']
[3060.0, 3060.0]
[17.0, 17.0]
[227, 232]
p02766
u552176911
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\nn, k = list(map(int, input().split(" ")))\n\na = n\nc = 0\nwhile True:\n a = math.floor(a / k)\n c += 1\n print(a)\n if a <= k - 1:\n print(c + 1)\n exit()', 'n, k = list(map(int, input().split(" ")))\n\na = n\nc = 0\nwhile True:\n a = a // k\n c += 1\n if a == 0:\n print(c)\n exit()']
['Wrong Answer', 'Accepted']
['s938964395', 's291144421']
[3060.0, 2940.0]
[17.0, 17.0]
[183, 139]
p02766
u552201227
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K = map(int,input().split())\ncount = 0\nwhile N>0:\n N=N//K\n count +=1\n print(count)', 'N,K = map(int,input().split())\ncount = 0\nwhile N>0:\n N=N//K\n count = count +1\n print(count)\n', 'N,K = map(int,input().split())\ncount = 0\nwhile N>0:\n N=N//K\n count = count +1\nprint(count)\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s042024575', 's583648758', 's413513351']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[87, 95, 93]
p02766
u554781254
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['from collections import deque\n\nn, r = map(int, input().split())\nd = deque()\n\nwhile n > 0:\n d.append(n % k)\n n = n // k\n \nprint(len(d))', 'n, r = map(int, input().split())\nd = []\n\nwhile n > 0:\n d.append(n % k)\n n = n // k\n \nprint(len(d))', 'n, k = map(int, input().split())\nans = 0\nwhile n > 0:\n n = n // k\n ans += 1\nprint(ans)']
['Runtime Error', 'Runtime Error', 'Accepted']
['s565958300', 's661112545', 's202796642']
[3316.0, 2940.0, 2940.0]
[21.0, 17.0, 17.0]
[143, 107, 92]
p02766
u555291433
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["#!/usr/bin/env python\n\ni = 1\nnums = input()\nnums = nums.split(' ')\nprint(nums)\nx, y = (int(val) for val in nums)\n\nwhile x > y:\n x = x / y\n i += 1\n\nprint(i)\n", "#!/usr/bin/env python\n\ni = 1\nnums = input()\nnums = nums.split(' ')\nx, y = (int(val) for val in nums)\n\nwhile x >= y:\n x = x / y\n i += 1\n\nprint(i)\n"]
['Wrong Answer', 'Accepted']
['s091787642', 's684896628']
[2940.0, 2940.0]
[17.0, 18.0]
[162, 151]
p02766
u563676207
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['# input\nN, K = map(int, input().split())\n\n# process\nans = 0\nnum = N\nwhile num > 0:\n num //= K\n print(num)\n ans += 1\n\n# output\nprint(ans)\n', '# input\nN, K = map(int, input().split())\n\n# process\nans = 0\nnum = N\nwhile num > 0:\n num //= K\n ans += 1\n\n# output\nprint(ans)\n']
['Wrong Answer', 'Accepted']
['s044318194', 's942774735']
[2940.0, 2940.0]
[18.0, 17.0]
[146, 131]
p02766
u571395477
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["def main():\n N, K = [int(_) for _ in input().split()]\n\n s = ''\n while True:\n N_quotient = int(N / K)\n N_reminder = N % K\n N = N_quotient\n s = str(N_reminder) + s\n if N_quotient < K:\n s = str(N_quotient) + s\n break\n print(s)\n print(len(s))\nmain()", 'def main():\n N, K = [int(_) for _ in input().split()]\n i = 0\n while True:\n N_quotient = N // K\n if N_quotient != 0:\n i += 1\n else:\n break\n print(i)\nmain()', "def main():\n N, K = [int(_) for _ in input().split()]\n\n s = ''\n while True:\n N_quotient = N / K\n N_reminder = N % K\n s = str(N_reminder) + s\n if N_quotient < K:\n s = str(N_quotient) + s\n break\n print(len(s))\nmain()", 'def main():\n N, K = [int(_) for _ in input().split()]\n i = 0\n while True:\n N_quotient = N // K\n N = N_quotient\n if N_quotient != 0:\n i += 1\n else:\n break\n print(i)\nmain()', 'def main():\n N, K = [int(_) for _ in input().split()]\n i = 1\n while True:\n N_quotient = N // K\n N = N_quotient\n if N != 0:\n i += 1\n else:\n break\n print(i)\nmain()']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s098379453', 's231519504', 's254062063', 's588842776', 's926532409']
[3060.0, 2940.0, 3684.0, 2940.0, 2940.0]
[17.0, 2104.0, 2104.0, 18.0, 17.0]
[321, 209, 276, 232, 223]
p02766
u580372796
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int, input().split())\ncnt = 1\nwhile True:\n if n <= k**cnt + 1:\n cnt++\nprint(cnt)', 'n, k = map(int, input().split())\ncnt = 1\nwhile True:\n if n <= k**cnt + 1:\n cnt += 1\nprint(cnt)', 'n, k = map(int, input().split())\ncnt = 1\nwhile True:\n if n <= k**cnt + 1:\n cnt += 1\n else:\n break\nprint(cnt)', 'n, k = map(int, input().split())\ncnt = 1\nwhile True:\n if n <= k**cnt - 1:\n break\n cnt += 1\nprint(cnt)']
['Runtime Error', 'Time Limit Exceeded', 'Wrong Answer', 'Accepted']
['s136001664', 's863360415', 's910797011', 's414832670']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 2107.0, 2103.0, 17.0]
[95, 98, 116, 106]
p02766
u585819925
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = map(int, input().split())\nans = 1\nwhile(n / k != 0):\n n //= k\n ans += 1\nprint(ans)', 'n,k = map(int, input().split())\nans = 0\nwhile(n / k != 0):\n n //= k\n ans += 1\nprint(ans)\n']
['Wrong Answer', 'Accepted']
['s486235309', 's220498942']
[2940.0, 2940.0]
[17.0, 17.0]
[90, 91]
p02766
u594862874
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\nN, K = input().split()\nprint(math.floor(math.log(N) / math.log(K)) + 1)', 'import math\nN, K = input().split()\nprint(math.floor(math.log(K) / math.log(N)) + 1)', 'N, K = input().split()\n\nprint((math.floor(math.log(N) / math.log(K)) + 1))', "def base_changer(number,base):\n buff=97+abs(base-10)\n dic={};buff2='';buff3=10\n for i in range(97,buff+1):\n dic[buff3]=chr(i)\n buff3+=1 \n while(number>=base):\n mod=int(number%base)\n number=int(number//base)\n if (mod) in dic.keys():\n buff2+=dic[mod]\n continue\n buff2+=str(mod)\n if (number) in dic.keys():\n buff2+=dic[number]\n else:\n buff2+=str(number)\n\n return buff2[::-1] \nN,K = map(int, input().split())\nprint(len(base_changer(N,K)))"]
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s345730581', 's470508373', 's537811770', 's389770622']
[2940.0, 2940.0, 2940.0, 3064.0]
[17.0, 18.0, 17.0, 17.0]
[83, 83, 74, 536]
p02766
u595289165
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int, input().split())\n\n\ndef log(r, d):\n return np.log(d)/np.log(r)\n\n\ndef ceil(x):\n if x.is_integer():\n return int(x)\n return int(np.ceil(x))\n\n\nprint(ceil(log(k, n)))', 'import numpy as np\nn, k = map(int, input().split())\n\n\ndef log(r, d):\n return np.log(d)/np.log(r)\n\n\ndef ceil(x):\n if x.is_integer():\n return int(x) + 1\n return int(np.ceil(x))\n\n\nprint(ceil(log(k, n)))']
['Runtime Error', 'Accepted']
['s333255367', 's447003365']
[3056.0, 12388.0]
[17.0, 161.0]
[192, 215]
p02766
u607729897
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import itertools\nN,K = map(int,input().split())\nfor i in itertools.count(1):\n if N//(K**i)>=K:\n continue\nelse print(i)\n', 'import itertools\nN,K = map(int,input().split())\nfor i in itertools.count(1):\n if N//(K**i)<K:\n print(i)\n break\n', 'import itertools\nN,K = map(int,input().split())\n\nfor i in itertools.count(0):\n if N//(K**i)<K:\n print(i+1)\n break\n']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s295268770', 's653079863', 's320705054']
[2940.0, 3060.0, 3060.0]
[17.0, 18.0, 17.0]
[123, 118, 121]
p02766
u612635771
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int, input().split())\nwhile N>K:\n a=N/K\n b+=1\nprint(b) ', 'N, K = map(int, input().split())\nwhile N<K:\n a=N/K\n b+=1\nprint(b) ', 'N, K = map(int, input().split())\nb=0\nwhile N>K:\n a=N/K\n b+=1\nprint(b) ', 'N, K = map(int, input().split())\nb=0\nwhile N>0:\n N=N/K\n b+=1\nprint(b) ', 'N, K = map(int, input().split())\nb=0\nwhile N>0:\n N=N//K\n b+=1\nprint(b) ']
['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s412376001', 's627710252', 's709882038', 's851620584', 's331480807']
[9020.0, 9104.0, 8828.0, 9128.0, 9016.0]
[23.0, 26.0, 2206.0, 28.0, 27.0]
[69, 69, 73, 73, 74]
p02766
u624075921
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,m = map(int,input().split())\nct = 0\n\nwhile n > 0:\n ct+=1\n n//=k\n \nprint(ct)', 'n,k = map(int,input().split())\nprint(k * len(str(n))', 'n,m = map(int,input().split())\nct = 0\n\nwhile n > 0:\n ct+=1\n n//=m\n \nprint(ct)\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s454497834', 's694250457', 's809512012']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[80, 52, 81]
p02766
u625864724
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int,input().split())\ni = 1\nwhile True:\n x = k\n if (x >= n):\n print(i)\n break\n else:\n i = i + 1', 'n, k = map(int,input().split())\ni = 1\nx = k\nwhile True:\n if (x >= n):\n print(i)\n break\n else:\n i = i + 1\n', 'n, k = map(int,input().split())\nwhile True:\n i = 1\n x = k\n if (x >= n):\n print(i)\n break\n else:\n i = i + 1\n x = x*k\n ', 'n, k = map(int,input().split())\ni = 1\nx = k\nwhile True:\n if (x > n):\n print(i)\n break\n else:\n i = i + 1\n x = x*k\n']
['Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted']
['s008558087', 's075989858', 's745740259', 's941899379']
[9000.0, 8996.0, 9072.0, 9060.0]
[2205.0, 2205.0, 2205.0, 28.0]
[117, 116, 136, 127]
p02766
u626881915
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\ndef I():\n return input()\ndef II():\n return int(input())\ndef MII():\n return map(int, input().split())\ndef LMII():\n return list(map(int, input().split()))\n\nn, r = MII()\ni = 1\nwhile True:\n if n < r:\n break\n else:\n r *= r\n i += 1\nprint(i)', 'import math\ndef I():\n return input()\ndef II():\n return int(input())\ndef MII():\n return map(int, input().split())\ndef LMII():\n return list(map(int, input().split()))\n\nn, r = MII()\ni = 1\na = r\nwhile True:\n if n < a:\n break\n else:\n a *= r\n i += 1\nprint(i)\n']
['Wrong Answer', 'Accepted']
['s693707186', 's448762618']
[3060.0, 3060.0]
[17.0, 19.0]
[261, 268]
p02766
u628583308
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["#!/usr/bin/env python3\nimport sys\n\n\ndef solve(N: int, K: int):\n count = 0\n while True:\n N = N // K\n if N >= 1:\n count += 1\n else:\n break\n print (cont)\n return\n\n\n# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) # type: int\n K = int(next(tokens)) # type: int\n solve(N, K)\n\nif __name__ == '__main__':\n main()\n", '#!/usr/bin/env python3\nimport sys\nimport numpy as np\nimport math\n\ndef solve(N: int, X: "List[int]"):\n place = np.mean(X)\n place = round(place)\n result = 0\n for i in range(N):\n result += (X[i]-place) ** 2\n print(int(result))\n return\n\n\n# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) # type: int\n X = [int(next(tokens)) for _ in range(N)] # type: "List[int]"\n solve(N, X)\n\nif __name__ == \'__main__\':\n main()\n', "#!/usr/bin/env python3\nimport sys\n\n\ndef solve(N: int, K: int):\n count = 0\n while True:\n N = N // K\n if N >= 1:\n count += 1\n else:\n break\n print (count+1)\n return\n\n\n# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) # type: int\n K = int(next(tokens)) # type: int\n solve(N, K)\n\nif __name__ == '__main__':\n main()\n"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s603916218', 's651681390', 's015545714']
[3060.0, 12396.0, 3060.0]
[18.0, 152.0, 18.0]
[679, 750, 682]
p02766
u629560745
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int, input().split())\ncount = 1\nwhile True:\n N = N // K\n count += 1\n if N - K <= 0:\n break\nprint(count)', 'N, K = map(int, input().split())\ncount = 1\nwhile True:\n N = N // K\n count += 1\n if N <= K:\n break\nprint(count)', "N, K = map(int, input().split())\nq = ''\nwhile True:\n q += str(N % K)\n N = N // K\n if N == 0:\n break\nprint(len(q))"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s504776451', 's896818864', 's936829166']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 18.0]
[130, 126, 129]
p02766
u629607744
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k=map(int,input().split())\nl=[]\nif k<=9 :\n while True:\n a=n%k\n n//=k\n if n>=k:\n l.append(a)\n if n<k :\n l.append(n)\n break\n print(len(l))\nelse:\n print(len(str(n)))', 'n,k=map(int,input().split())\nl=[]\nif k<=9 :\n while True:\n a=n%k\n n//=k\n if n>=k:\n l.append(a)\n elif n<k :\n l.append(n)\n break\n print(len(l))\nelse:\n print(len(str(n)))', 'n,k=map(int,input().split())\nl=[]\nif k<=9 :\n while True:\n a=n%k\n if n>=k:\n l.append(a)\n n//=k\n if n<k :\n l.append(n)\n break\n print(len(l))\nelse:\n print(len(str(n)))']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s427935572', 's644273775', 's629398109']
[3060.0, 3060.0, 3060.0]
[17.0, 17.0, 17.0]
[194, 196, 194]
p02766
u631525844
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = input().split()\nprint(int(n, int(k)))', 'n, k = input().split()\nimport math\ndef findNumberOfDigits(n, base):\n dig = (math.floor(math.log(n) /\n math.log(base)) + 1)\n print(dig)\n\nfindNumberOfDigits(int(n), int(k))']
['Runtime Error', 'Accepted']
['s936036505', 's148836174']
[2940.0, 2940.0]
[17.0, 17.0]
[44, 197]
p02766
u632997108
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['X,n = map(int,input().split(" "))\ndef Base_10_to_n(X, n):\n if (int(X/n)):\n return Base_10_to_n(int(X/n), n)+str(X%n)\n return str(X%n)\na=Base_10_to_n(X, n)\nprint(a)', 'X,n = map(int,input().split(" "))\ndef Base_10_to_n(X, n):\n if (int(X/n)):\n return Base_10_to_n(int(X/n), n)+str(X%n)\n return str(X%n)\n print(Base_10_to_n(X, n))', 'X,n = map(int,input().split(" "))\ndef Base_10_to_n(X, n):\n if (int(X/n)):\n return Base_10_to_n(int(X/n), n)+str(X%n)\n return str(X%n)\na=Base_10_to_n(X, n)\nprint(len(str(a)))']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s325228182', 's382643841', 's241686191']
[9020.0, 8728.0, 9016.0]
[25.0, 27.0, 25.0]
[176, 173, 186]
p02766
u633574000
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["def Base_10_to_n(X, n):\n X_dumy = X\n out = ''\n while X_dumy>0:\n out = str(X_dumy%n)+out\n X_dumy = int(X_dumy/n)\n return out\n\ni = list(map(int, input().split()))\nout = Base_10_to_n(i[0], i[1])\npritnt(out)", "def Base_10_to_n(X, n):\n X_dumy = X\n out = ''\n while X_dumy>0:\n out = str(X_dumy%n)+out\n X_dumy = int(X_dumy/n)\n return out\n \ni = list(map(int, input().split()))\nout = Base_10_to_n(i[0], i[1])\nprint(len(str(out)))"]
['Runtime Error', 'Accepted']
['s401181324', 's132634665']
[3060.0, 3060.0]
[17.0, 17.0]
[229, 240]
p02766
u634046173
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = map(int, input().split())\n\nfor i in range(1,10):\n if n <= k ** i:\n print(i +1)\n sys.exit()', 'n,k = map(int, input().split())\n\nfor i in range(1,10):\n if n <= k ** i:\n print(i +1)\n break', 'n,k = map(int, input().split())\n\nfor i in range(1,50):\n if n < k ** i:\n print(i)\n break']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s439082384', 's572890850', 's583277314']
[2940.0, 2940.0, 2940.0]
[17.0, 18.0, 17.0]
[103, 98, 94]
p02766
u642012866
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int, input().split())\nif K == 10:\n print(len(str(N)))\nelse:\n res = 1\n while K < N:\n res += 1\n K **= 2\n print(res)', 'N, K = map(int, input().split())\nif K == 10:\n print(len(str(N)))\nelse:\n res = 1\n KK = K\n while KK <= N:\n res += 1\n KK *= K\n print(res)\n']
['Wrong Answer', 'Accepted']
['s193653242', 's248056879']
[2940.0, 2940.0]
[17.0, 17.0]
[134, 146]
p02766
u646818123
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['str = input()\na, b = str.split()\na, b = int(a), int(b)\n\nprint(len(str(int(a, b))))\n', 'a, b = input().split()\na, b = int(a), int(b)\n \ndigit = 0\nfor i in range(100):\n if a <= b ** i - 1:\n digit = i\n break\n \nprint(digit)']
['Runtime Error', 'Accepted']
['s700990219', 's188217393']
[2940.0, 2940.0]
[18.0, 17.0]
[83, 141]
p02766
u650417650
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['\ns = input().split()\nn = int(s[0])\nk = int(s[1])\n\nc =0\nwhile n>(k-1):\n a = n%k\n n = (n-a)/k\n print(n)\n c += 1\nprint(c+1)', '\ns = input().split()\nn = int(s[0])\nk = int(s[1])\n\nc =0\nwhile n>(k-1):\n a = n%k\n n = (n-a)/k\n c += 1\nprint(c+1)']
['Wrong Answer', 'Accepted']
['s238413790', 's520505476']
[3060.0, 2940.0]
[17.0, 17.0]
[132, 119]
p02766
u659302753
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["from sys import stdin\n\n\ndef Base_10_to_n(X, n):\n X_dumy = X\n out = ''\n while X_dumy>0:\n out = str(X_dumy%n)+out\n X_dumy = int(X_dumy/n)\n return out\n\n\ndef get_result(data):\n print(data)\n N, K = data[0]\n return len(Base_10_to_n(N, K))\n\nif __name__ == '__main__':\n raw_data = [val.rstrip('\\n') for val in stdin.readlines()]\n data = [list(map(int, val.split(' '))) for val in raw_data]\n result = get_result(data)\n print(result)\n", "from sys import stdin\n\n\ndef Base_10_to_n(X, n):\n X_dumy = X\n out = ''\n while X_dumy>0:\n out = str(X_dumy%n)+out\n X_dumy = int(X_dumy/n)\n return out\n\n\ndef get_result(data):\n print(data)\n N, K = data[0]\n return len(Base_10_to_n(N, K))\n\nif __name__ == '__main__':\n raw_data = [val.rstrip('\\n') for val in stdin.readlines()]\n data = [list(map(int, val.split(' '))) for val in raw_data]\n result = get_result(data)\n print(result)\n", "from sys import stdin\n\n\ndef Base_10_to_n(X, n):\n X_dumy = X\n out = ''\n while X_dumy>0:\n out = str(X_dumy%n)+out\n X_dumy = int(X_dumy/n)\n return out\n\n\ndef get_result(data):\n N, K = data[0]\n return len(Base_10_to_n(N, K))\n\nif __name__ == '__main__':\n raw_data = [val.rstrip('\\n') for val in stdin.readlines()]\n data = [list(map(int, val.split(' '))) for val in raw_data]\n result = get_result(data)\n print(result)\n"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s579928279', 's974690859', 's848399762']
[3060.0, 3060.0, 3060.0]
[17.0, 17.0, 17.0]
[471, 471, 455]
p02766
u660245210
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(input().spilt())\ny = 1\nwhile n > 1:\n y += 1\n n = n // k\nprint(y)', 'n, k = map(int, input().spilt())\ny = 1\nwhile n > 1:\n y += 1\n n = n // k\nprint(y)\n', 'n, k = map(int, input().split())\ni = k\ny = 1\nwhile n >= i:\n y += 1\n i *= k\nprint(y)\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s070692764', 's426288966', 's127477658']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 19.0]
[81, 87, 90]
p02766
u664373116
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\n#n,r=list(map(int,input().split()))\nn=10**9\nr=2\nfor i in range(40,-1,-1):\n if r**i<=n:\n ans=i+1\n break\nprint(ans)', 'import math\nn,r=list(map(int,input().split()))\n#n=10**9\n#r=2\nfor i in range(40,-1,-1):\n if r**i<=n:\n ans=i+1\n break\nprint(ans)']
['Wrong Answer', 'Accepted']
['s625430398', 's154019969']
[2940.0, 2940.0]
[17.0, 17.0]
[142, 143]
p02766
u670606123
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["N, K = map(int, input().split(' '))\n\nl = []\nwhile N >= K:\n a = N % K\n b = N // K\n N = b\n l.append(a)\n print('{}, {}'.format(a, b))\n\nprint(len(l) + 1)", "N, K = map(int, input().split(' '))\n\nl = []\nwhile N >= K:\n a = N % K\n N = N // K\n\n l.append(a)\n\n\nprint(len(l) + 1)\n"]
['Wrong Answer', 'Accepted']
['s897172061', 's374657401']
[3064.0, 2940.0]
[17.0, 17.0]
[164, 124]
p02766
u673338219
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = map(int,input().split())\nc = 0\nwhile n > 0:\n n = n//7\n c += 1\nprint(c)\n ', 'n,k = map(int,input().split())\nc = 0\nwhile n > 0:\n n = n//k\n c += 1\nprint(c)']
['Wrong Answer', 'Accepted']
['s856149917', 's138760516']
[2940.0, 2940.0]
[17.0, 18.0]
[81, 78]
p02766
u674347990
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['num, base = input()\nprint(int(log(int(num), int(base)) + 1)', "import math\n\nnum, base = input().split(' ')\nprint(int(math.log(int(num), int(base)) + 1))\n"]
['Runtime Error', 'Accepted']
['s962348442', 's119373802']
[2940.0, 2940.0]
[17.0, 17.0]
[59, 90]
p02766
u675155417
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\nx,y = map(int,input().split())\nprint(math.ceil(x/y))', 'x,y = map(int,input().split())\nz = 1\na = 0\nwhile x >= z:\n z = z * y\n a = a + 1\n if x < z:\n \tprint(a)\n \tbreak']
['Wrong Answer', 'Accepted']
['s871907791', 's298434079']
[2940.0, 2940.0]
[17.0, 17.0]
[64, 113]
p02766
u682563287
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['def main():\n N,K=map(int,open(0).read().split())\n keta=1\n while flag==0:\n if K**keta<=N and K**(keta+1)>N:\n print(keta+1)\n return\n keta= keta+1\n\nmain()', "def Base_10_to_n(X, n):\n X_dumy = X\n out = ''\n while X_dumy>0:\n out = str(X_dumy%n)+out\n X_dumy = int(X_dumy/n)\n return out\n \ndef main():\n N,K=map(int,input().split())\n print(len(Base_10_to_n(N,K)))\nmain()"]
['Runtime Error', 'Accepted']
['s717723967', 's569983673']
[2940.0, 2940.0]
[17.0, 17.0]
[196, 240]
p02766
u685684561
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K=map(int,input().split())\n\nt=0\nwhile K!=0:\n K=K//N\n t=t+1\nprint (t)', 'K,N=map(int,input().split())\n\nt=0\nwhile K!=0:\n K=K//N\n t=t+1\nprint (t)']
['Wrong Answer', 'Accepted']
['s466322808', 's146279359']
[2940.0, 2940.0]
[2104.0, 18.0]
[72, 72]
p02766
u686713618
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['def base10to(n, b):\n if (int(n/b)):\n return base10to(int(n/b), b) + str(n%b)\n return str(n%b)\nN, K = map(int, input().split())\nprint(base10to(N, K))', 'def base10to(n, b):\n if (int(n/b)):\n return base10to(int(n/b), b) + str(n%b)\n return str(n%b)\nN, K = map(int, input().split())\nprint(len(base10to(N, K)))']
['Wrong Answer', 'Accepted']
['s885822222', 's382401725']
[2940.0, 2940.0]
[17.0, 17.0]
[153, 158]
p02766
u698756732
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k=map(int,input().split())\n\nwhile n >= k:\n a += 1\n n = n // k\n\nprint(a + 1)', 'n,k=map(int,input().split())\na = 0\nwhile n >= k:\n a += 1\n n = n // k\n\nprint(a + 1)']
['Runtime Error', 'Accepted']
['s961648034', 's778268329']
[9076.0, 9044.0]
[27.0, 29.0]
[84, 89]
p02766
u699330893
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = map(int,input().split())\ncount = 0\nwhile(n > k):\n n = n // k\n count = count + 1\nprint(count + 1)', 'n,k = map(int,input().split())\ncount = 0\nwhile(n >= k):\n n = n // k\n count = count + 1\nprint(count + 1)']
['Wrong Answer', 'Accepted']
['s575427109', 's345478246']
[2940.0, 2940.0]
[17.0, 17.0]
[108, 109]
p02766
u702515431
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['a = input().split()\nfor i in range(len(a)):\n a[i] = int(a[i])\n\nind = 0\nwhile a[0] > 0:\n a[0] = a[0] // a[i]\n ind +=1\n\nprint(ind - 1)', 'a = input().split()\nfor i in range(len(a)):\n a[i] = int(a[i])\n\nind = 0\nwhile a[0] > 0:\n a[0] = a[0] // a[i]\n ind +=1\n\nprint(ind)']
['Wrong Answer', 'Accepted']
['s234060701', 's176315624']
[2940.0, 3060.0]
[17.0, 17.0]
[141, 137]
p02766
u705418271
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k=map(int,input().split())\nans=0\nwhile n>k:\n n/=k\n n=int(n)\n ans+=1\n\nprint(ans+1)', 'n,k=map(int,input().split())\nans=0\nwhile n>0:\n n//=k\n ans+=1\n\nprint(ans)']
['Wrong Answer', 'Accepted']
['s344758237', 's662101546']
[9144.0, 8984.0]
[29.0, 25.0]
[86, 74]
p02766
u707659359
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["N, K = [int(x) for x in input().split(' ')]\n\nx = 0\n\nwhile True:\n if N < (K ** x):\n print(x)\n x+=1", "N, K = [int(x) for x in input().split(' ')]\n \nx = 0\n \nwhile True:\n if N < (K ** x):\n print(x)\n break\n x+=1\n\n"]
['Time Limit Exceeded', 'Accepted']
['s088350278', 's127648908']
[3536.0, 2940.0]
[2104.0, 18.0]
[102, 116]
p02766
u707808519
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int, input().split())\nans = 0\nwhile N > K-1:\n ans += 1\n N //= K\n print(N)\nprint(ans+1)', 'N, K = map(int, input().split())\nans = 0\nwhile N > 0:\n ans += 1\n N //= K\nprint(ans)']
['Wrong Answer', 'Accepted']
['s488601727', 's777003927']
[2940.0, 2940.0]
[18.0, 17.0]
[106, 89]
p02766
u712877927
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['def Base_10_to_n(N, K):\n if (int(N/K)):\n return Base_10_to_n(int(N/K), K)+str(N%K)\n return str(N%K)\n\nx10 = 35\nx2 = Base_10_to_n(N, K)\nx2 = str(x2)\nprint(len(x2))', 'N, K = map(int, input().split())\ndef Base_10_to_n(N, K):\n if (int(N/K)):\n return Base_10_to_n(int(N/K), K)+str(N%K)\n return str(N%K)\n\nx10 = 35\nx2 = Base_10_to_n(N, K)\nx2 = str(x2)\nprint(len(x2))']
['Runtime Error', 'Accepted']
['s549061045', 's397898161']
[2940.0, 3060.0]
[17.0, 17.0]
[174, 207]
p02766
u729133443
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k=input().split();print(len(str(int(n,int(k)))))', 'n,k=map(int,input().split())\nc=0\nwhile n:n//=k;c+=1\nprint(c)']
['Runtime Error', 'Accepted']
['s542623316', 's380954279']
[2940.0, 2940.0]
[17.0, 20.0]
[50, 60]
p02766
u729535891
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int, input().split())\ncnt = 0\nwhile n // k > 0:\n cnt += 1\n n = n // k\n\nprint(cnt)', 'n, k = map(int, input().split())\ncnt = 0\nwhile n > 0:\n cnt += 1\n n = n // k\n\nprint(cnt)']
['Wrong Answer', 'Accepted']
['s776033280', 's440622289']
[2940.0, 2940.0]
[17.0, 18.0]
[98, 93]
p02766
u732870425
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int, input())\n\nans = 0\nwhile True:\n N = N // K\n ans += 1\n if N == 0:\n break\n\nprint(ans)', 'N, K = map(int, input())\n\nans = 0\nwhile True:\n N //= K\n ans += 1\n if N == 0:\n break\n\nprint(ans)', 'N, K = map(int, input().split())\n\nans = 0\nwhile True:\n N //= K\n ans += 1\n if N == 0:\n break\n\nprint(ans)']
['Runtime Error', 'Runtime Error', 'Accepted']
['s701390911', 's983725467', 's575654508']
[3188.0, 3188.0, 2940.0]
[20.0, 18.0, 17.0]
[114, 111, 119]
p02766
u742529680
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K=int(input().split())\nans = 0\nwhile (N > 0):\n N //= K\n ans += 1\nprint(ans)', 'N,K=map(int, input().split())\nans = 0\nwhile (N > 0):\n N //= K\n ans += 1\nprint(ans)']
['Runtime Error', 'Accepted']
['s878311621', 's819504152']
[2940.0, 2940.0]
[18.0, 17.0]
[79, 84]
p02766
u744034042
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,r = map(int,input().split())\ncnt = 0\nwhile n >= 1:\n n /= k\n cnt += 1\nprint(cnt)', 'n,k = map(int,input().split())\ncnt = 0\nwhile n >= 1:\n n /= k\n cnt += 1\nprint(cnt)']
['Runtime Error', 'Accepted']
['s424186319', 's747212532']
[2940.0, 2940.0]
[17.0, 18.0]
[87, 87]
p02766
u748311048
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["N,K=map(int, input().split())\ni=0\nwhile(K**i<N):\n i+=1\n\ncount=''\nfor j in range(i):\n M=N//(K**(i-j))\n count=str(M)+count\n N-=K**(i-j)*M\n \nprint(str(count))\n", "N,K=map(int, input().split())\ni=0\nwhile(K**i<N):\n i+=1\n\ncount=''\nfor j in range(i):\n M=N//(K**(i-j))\n count=str(M)+count\n N-=K**(i-j)*M\n \nprint(int(count))", 'N,K=map(int, input().split())\nn=0\nwhile K**(n+1)<=N:\n n+=1\n \nprint(n+1)']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s204098287', 's815225570', 's859924712']
[3316.0, 3316.0, 2940.0]
[20.0, 20.0, 17.0]
[161, 160, 73]
p02766
u752522099
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['ount = 0 \nn,k = map(int,input().split()) \n\nwhile True: \n count = count +1\n n = n // k\n if n == 0:\n break\n\nprint(count)\n', 'n,k = map(int,input())\nlis = []\n\nwhile n / k == 0:\n if n >k：\n lis.append(int(n % k))\n ing_total += 1\n else:\n if n >= 10:\n ing_total = 2\n else:\n ing_total = 1\n\nprint(ing_total)\n', 'count = 0 \nn,k = map(int,input().split()) \n\nwhile n > 0: \n count += 1\n n //= k\n\nprint(count)']
['Runtime Error', 'Runtime Error', 'Accepted']
['s711698437', 's847783992', 's156810149']
[2940.0, 3064.0, 2940.0]
[17.0, 18.0, 17.0]
[303, 234, 266]
p02766
u755944418
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = map(int, input().split())\n\ncnt = 1\nwhile True:\n if n <= k:\n break\n n = n // k\n cnt += 1\n\n\nprint(cnt)', 'n,k = map(int, input().split())\n\ncnt = 1\nwhile n < k:\n n = n // k\n cnt += 1\n\n\nprint(cnt)', 'n,k = map(int, input().split())\n \ncnt = 1\nwhile True:\n if n < k:\n break\n n = n // k\n cnt += 1\n\nprint(cnt)']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s168307654', 's786598559', 's013231719']
[2940.0, 2940.0, 2940.0]
[17.0, 2103.0, 17.0]
[122, 94, 121]
p02766
u757030836
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n = int(input())\nx = [int(i) for i in input().split()]\nx.sort()\n\nans = 10000\nfor p in range(1,x[-1]+1):\n sum =0\n for i in range(n):\n sum += (x[i]-p)**2\n \n ans = min(ans,sum)\n \nprint(ans) ', 'n,k = map(int,input().split())\ni = 0\n\nwhile k**i <= n:\n i +=1\n \nprint(i)']
['Runtime Error', 'Accepted']
['s063502026', 's179029207']
[3060.0, 2940.0]
[17.0, 18.0]
[197, 74]
p02766
u757274384
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\nn,k = map(int, input().split())\n\nN = int(math.floor(math.log(n)/math.log(k)))+1\nm = n\nL = []\nfor i in range(N+1):\n L.append(m//(k**(N-i)))\n m = m%(k**(N-i))\n \nif L[0] == 0:\n L.pop(0)\n\nANS = [str(L[i]) for i in range(len(L))]\nprint("".join(ANS))', 'import math\nn,k = map(int, input().split())\n\nN = int(math.floor(math.log(n)/math.log(k)))+1\nm = n\nL = []\nfor i in range(N+1):\n L.append(m//(2**(N-i)))\n m = m%(2**(N-i))\n \nif L[0] == 0:\n L.pop(0)\n\nANS = [str(L[i]) for i in range(len(L))]\nprint("".join(ANS))', 'import math\nn,k = map(int, input().split())\n\nL = []\nwhile True:\n N = int(math.floor(math.log(n)/math.log(k)))\n L.append(N)\n n = n - k**N\n if n <= k-1:\n print(len(L)+1)\n exit()\n', 'import math\nn,k = map(int, input().split())\n\nL = []\nwhile True:\n N = int(math.floor(math.log(n)/math.log(k)))\n L.append(N)\n n = n - k**N\n if n <= 2:\n print(len(L)+1)\n exit()\n', 'import math\nn,k = map(int, input().split())\n\nL = []\nwhile True:\n N = int(math.floor(math.log(n)/math.log(k)))\n L.append(N)\n n = n - 3**N\n if n <= 2:\n print(len(L)+1)\n exit()', 'import math\nn,k = map(int, input().split())\n\nN = int(math.floor(math.log(n)/math.log(k)))+1\nm = n\nL = []\nfor i in range(N+1):\n L.append(m//(k**(N-i)))\n m = m%(k**(N-i))\n \nif L[0] == 0:\n L.pop(0)\n\nprint(len(L))']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s117977831', 's118879115', 's133402652', 's921640504', 's991847986', 's546970343']
[3064.0, 3064.0, 2940.0, 2940.0, 5508.0, 3064.0]
[17.0, 18.0, 17.0, 17.0, 89.0, 17.0]
[260, 260, 186, 184, 183, 213]
p02766
u759938562
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int, input().split())\nans = 1\ntmp = 1\n\nwhile N >= tmp:\n tmp = tmp * K\n ans += 1\n\nprint(tmp)\nprint(ans-1)', 'N, K = map(int, input().split())\nans = 1\ntmp = 1\n\nwhile N >= tmp:\n tmp = tmp * K\n ans += 1\n\n# print(tmp)\nprint(ans-1)']
['Wrong Answer', 'Accepted']
['s417674439', 's093135801']
[2940.0, 2940.0]
[17.0, 20.0]
[121, 123]
p02766
u765590009
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = map(int, input().split())\n\ns = ""\nwhile(True):\n if n < k :\n s += str(n)\n break\n else :\n s += str(n%k)\n n = n//k\n\nprint(s)\nprint(len(s))', 'n, k = map(int, input().split())\n\ns = ""\nwhile(True):\n if n < k :\n s += str(n)\n break\n else :\n s += str(n%k)\n n = n//k\n\nprint(len(s))']
['Wrong Answer', 'Accepted']
['s360741876', 's226970365']
[9164.0, 9096.0]
[28.0, 27.0]
[156, 147]
p02766
u767664985
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = map(int, input().split())\nans = 0\nwhile N % K == 0:\n N = N // K\n ans += 1\nprint(ans)\n', 'N, K = map(int, input().split())\nans = 1\nwhile N % K == 0:\n N = N // K\n ans += 1\nprint(ans)\n', 'N, K = map(int, input().split())\nans = 1\nk = K\nwhile N >= k:\n k *= K\n ans += 1\nprint(ans)\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s482248746', 's745489839', 's895985268']
[2940.0, 2940.0, 2940.0]
[18.0, 18.0, 18.0]
[98, 98, 96]
p02766
u767871438
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = map(int,(input().split(" ")))\n\nimport math\na = (int(math.ceil(math.log(n)/math.log(k) )))\nif a==0:\n print(1)\nelse\n print(a)', 'n,k = int(input().split(" "))\nimport math\nprint(int(math.ceil(math.log(n)/math.log(k) )))', 'n,k = map(int,(input().split(" ")))\n\nimport math\na = (int(math.ceil(math.log(n)/math.log(k) )))\nif a==0:\n print(1)\nelse:\n print(a)\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s472742361', 's614816332', 's179563934']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 17.0]
[131, 89, 133]
p02766
u770661341
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K=map(int,input().split())\nquotient=N\ncnt=1\nwhile quotient>=K:\n remainder=quotient%K\n quotient=(quotient-remainder)/K\n print(int(remainder),int(quotient))\n cnt+=1\nprint(cnt)', 'N,K=map(int,input().split())\nquotient=N\ncnt=1\nwhile quotient>=K:\n remainder=quotient%K\n quotient=(quotient-remainder)/K\n cnt+=1\nprint(cnt)']
['Wrong Answer', 'Accepted']
['s987032410', 's281336550']
[3060.0, 2940.0]
[17.0, 17.0]
[187, 147]
p02766
u771538568
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['a,b=input().split()\na=int(a)\nb=int(b)\ni=0\nwhile a>b:\n i+=1\n b*=b\nprint(i)', 'a,b=input().split()\na=int(a)\nb=int(b)\nc=b\ni=1\nwhile a>=c:\n c=c*b\n i+=1\nprint(i)\n']
['Wrong Answer', 'Accepted']
['s927522729', 's319455286']
[2940.0, 2940.0]
[17.0, 17.0]
[79, 86]
p02766
u773686010
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import queue\nN,K = map(int,input().split())\nans = queue.Queue()\nwhile N >= K:\n N,amari = divmod(N,K)\n ans.put(amari)\nans.put(N)\nanswer = ""\nwhile not ans.empty():\n answer += str(ans.get())\nprint(answer)', 'import queue\nN,K = map(int,input().split())\nans = queue.Queue()\nwhile N >= K:\n N,amari = divmod(N,K)\n ans.put(amari)\nans.put(N)\nanswer = ""\nwhile not ans.empty():\n answer += str(ans.get())\nprint(len(answer))']
['Wrong Answer', 'Accepted']
['s328622009', 's770032305']
[9636.0, 9692.0]
[31.0, 29.0]
[211, 216]
p02766
u776557412
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['def Base_10_to_n(X, n):\n if (int(X/n)):\n return Base_10_to_n(int(X/n), n)+str(X%n)\n return str(X%n)\n\nN, K = map(int, input().split())\nif K!=10:\n N = Base_10_to_n(N, K)\nprint( N )', 'def Base_10_to_n(X, n):\n if (int(X/n)):\n return Base_10_to_n(int(X/n), n)+str(X%n)\n return str(X%n)\n \nN, K = map(int, input().split())\nif K!=10:\n N = Base_10_to_n(N, K)\nprint( len(str(N)) )']
['Wrong Answer', 'Accepted']
['s297483838', 's755947886']
[3060.0, 3060.0]
[17.0, 17.0]
[192, 203]
p02766
u779293207
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K=map(int,input().split())\nc=0\nwhile (N//K)>0:\n c = c + 1\n N = N//K\nprint(c)', 'N,K=map(int,input().split())\nc=1\nwhile (N//K)>0:\n c = c + 1\n N = N//K\nprint(c)\n\n\n']
['Wrong Answer', 'Accepted']
['s285461049', 's965319444']
[2940.0, 2940.0]
[18.0, 17.0]
[80, 83]
p02766
u785066634
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['a,b=map(int,input().split())\n\ncnt=1\n#if a%b==0:\n# cnt=0\nwhile a>=b:\n a=a//b\n cnt+=1\n \nprint(cnt+1) \n\n\n', "\nn,m=map(int,input().split())\ncnt=0\nwhile n>0:\n n//=m\n print('n',n,'m',m)\n cnt+=1\nprint(cnt)\n", '\nn,m=map(int,input().split())\ncnt=0\nwhile n>0:\n n//=m\n cnt+=1\nprint(cnt)\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s498221897', 's766750263', 's681976102']
[2940.0, 3060.0, 2940.0]
[17.0, 17.0, 17.0]
[151, 126, 95]
p02766
u785728112
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = map(int,input().split())\ndef base10to(n, k):\n if(int(n/k)):\n return base10to(int(n/k), k) + str(n%k)\n return str(n%k)\nprint(base10to(n,k))', 'n,k = map(int,input().split())\ndef base10to(n, k):\n if(int(n/k)):\n return base10to(int(n/k), k) + str(n%k)\n return str(n%k)\nprint(len(base10to(n,k)))']
['Wrong Answer', 'Accepted']
['s549078950', 's893974463']
[9004.0, 9092.0]
[27.0, 28.0]
[149, 154]
p02766
u788703383
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\nn,k = map(int,input().split())\nprint(int(math.log(k if n == 1 else n,k)))\n', 'n,k = map(int,input().split())\ncnt = 0\nwhile n:\n n = n//k\n cnt += 1\nprint(cnt)\n']
['Wrong Answer', 'Accepted']
['s620598264', 's039098169']
[2940.0, 2940.0]
[17.0, 17.0]
[86, 85]
p02766
u789565565
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K = input().split()\nN1 = int(N)\nK1 = int(K)\nfor i in range (1000000):\n if K1**(i-1) <= N1 and N1 < K1**i:\n print(i)', 'N,K = input().split()\nN1 = int(N)\nK1 = int(K)\nfor i in range (1000):\n if K1**(i-1) <= N1 and N1 < K1**i:\n print(i)\n break']
['Time Limit Exceeded', 'Accepted']
['s202577163', 's267761606']
[2940.0, 2940.0]
[2104.0, 17.0]
[127, 138]
p02766
u796708718
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = [int(x) for x in input().split(" ")]\n\ni=1\nx=K\n\nwhile x =< N:\n x *= K\n i += 1\n\nprint(i)', 'N, K = [int(x) for x in input().split(" ")]\n\ni=1\nx=K\n\nwhile x <= N:\n x *= K\n i += 1\n\nprint(i)']
['Runtime Error', 'Accepted']
['s197512690', 's062297343']
[2940.0, 2940.0]
[17.0, 17.0]
[95, 95]