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
u054825571
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())\nans=1\np=K\nwhile p <= N:\n p *= K\n ans+=1\nprint(ans)']
['Wrong Answer', 'Accepted']
['s963177032', 's084253548']
[9012.0, 9116.0]
[28.0, 26.0]
[42, 83]
p02766
u055687574
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\ndef f(n, k):\n if n//k:\n return f(n//k, k) + str(n%k)\n else:\n return str(n%k)\n\nprint(f(N, K))', 'N, K = map(int, input().split())\n\ndef f(n, k):\n if n//k:\n return f(n//k, k) + str(n%k)\n return str(n%k)\n\nprint(len(f(N, K)))']
['Wrong Answer', 'Accepted']
['s152183740', 's226731834']
[2940.0, 2940.0]
[17.0, 17.0]
[146, 137]
p02766
u065994196
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['inp=list(map(int,input().strip().split()))[:2]\nn,r=inp[0],inp[1]\ncount=0\nwhile(n > 0):\n n=n//r\n count+=1\nreturn count\n', 'inp=list(map(int,input().strip().split()))[:2]\nn,r=inp[0],inp[1]\ncount=0\nwhile(n > 0):\n n=n//k\n count+=1\nreturn count', 'inp=list(map(int,input().strip().split()))[:2]\nn,r=inp[0],inp[1]\ncount=0\nwhile(n > 0):\n n=n//r\n count+=1\nprint(count)']
['Runtime Error', 'Runtime Error', 'Accepted']
['s296191842', 's520231093', 's597398056']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[120, 119, 123]
p02766
u067899663
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k=[int(k) for k in input().strip().split(" ")]\n\nres=0\nwhile n:\n n/=k\n res+=1\n\nprint(res)', 'n,k=[int(k) for k in input().strip().split(" ")]\n\nres=0\nwhile n:\n n//=k\n res+=1\n\nprint(res)']
['Wrong Answer', 'Accepted']
['s279724822', 's972200511']
[2940.0, 2940.0]
[17.0, 17.0]
[96, 97]
p02766
u068666298
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\u3000range(10)\n\tif K**i<=N<=K**(i+1):\n \tprint(i+1)\n', 'N,K=map(int, input().split()) \nfor i in range(100000):\n if K**i<=N<=K**(i+1):\n print(i+1)', 'N,K=map(int, input().split()) \nfor i in range(8000):\n if K**i<=N<K**(i+1):\n print(i+1)']
['Runtime Error', 'Time Limit Exceeded', 'Accepted']
['s660451903', 's760413723', 's408264639']
[3064.0, 2940.0, 2940.0]
[18.0, 2104.0, 395.0]
[91, 99, 96]
p02766
u068750695
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())\ncnt=0\nwhile a>0:\n a//=b\n cnt+=1\n ', 'a,b=map(int,input().split())\ncnt=0\nwhile a>0:\n a//=b\n cnt+=1\nprint(x)', 'a,b=map(int,input().split())\ncnt=0\nwhile a>0:\n a//=b\n cnt+=1\nprint(cnt)']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s058498155', 's844637150', 's160844805']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 17.0]
[64, 71, 73]
p02766
u069273180
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\nn,k=map(int,input().split())\nnum = n\nsum_k = k\nfor sum_k <= n:\n sum_k= sum_k * k\nprint(len(sum_k))\n \n', 'from sys import stdin\n\nn,k=map(int,input().split())\nnum = k\nsum_k = n\nfor sum_k <= n:\n sum_k= sum_k*n\nprint(len(sumk))\n \n', 'from sys import stdin\nn,k=map(int,input().split())\nc=0\nwhile n > 0:\n c += 1\n n=n//k\nprint(c)\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s046582490', 's781674742', 's309573628']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[127, 124, 99]
p02766
u072606168
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(len(str(int(n,k))))', 'n,k = map(int, input().split())\ns = 1\nc = 0\nwhile n//s > 0:\n s *= k\n c += 1\nprint(c)']
['Runtime Error', 'Accepted']
['s572248608', 's945617564']
[2940.0, 3064.0]
[17.0, 17.0]
[57, 86]
p02766
u076363290
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['s, k = map(int,input().split())\nc = list()\nwhile s >= 0:\n a = s % k\n c.append(a)\n s = s // k\n\nprint(len(c))\n', 's, k = map(int,input().split())\nc = []\nwhile s > 0:\n a = s % k\n c.append(a)\n s //= k\n\nprint(len(c))\n']
['Time Limit Exceeded', 'Accepted']
['s931114233', 's521687093']
[117648.0, 9008.0]
[2208.0, 27.0]
[117, 109]
p02766
u094102716
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['a = list(map(int, input().split()))\nb = a[0]\nc = 0\nwhile b > 0:\n b = b / a[1]\n c += 1\nprint(c)\n', 'a = list(map(int, input().split()))\nb = a[0]\nc = 0\nwhile b > 1:\n b = b // a[1]\n c += 1\nprint(c)\n', 'a = list(map(int, input().split()))\nb = a[0]\nc = 0\nwhile b > 0:\n b = b // a[1]\n c += 1\nprint(c)\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s788947087', 's808533012', 's620603766']
[9128.0, 9160.0, 9116.0]
[26.0, 29.0, 24.0]
[97, 98, 98]
p02766
u094214579
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,imput().split())\nA = Base_10_to_n(N, K)\nprint(len(A))\n', 'import math\nN,K = map(int,imput().split())\n\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\nA = Base_10_to_n(N, K)\nprint(len(A))\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())\nA = Base_10_to_n(N, K)\nprint(len(A))\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s480164673', 's745179155', 's273804769']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[184, 195, 184]
p02766
u096294926
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N,K = list(map(int,input().split()))\nif N == 0:\n print(1)\ni =0\nwhile N > 0:\n N -=K\n i += 1\nprint(i)', 'import math\nN,K = list(map(int,input().split()))\n\nprint(math.ceil(math.log(N,K)+1))', 'import math\nN,K = list(map(int,input().split()))\n\nprint(int(math.log(N,K)+1))']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s296115511', 's767505788', 's749524959']
[2940.0, 3060.0, 2940.0]
[2104.0, 20.0, 18.0]
[108, 83, 77]
p02766
u098510720
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = (int(z) for z in input().split())\nans = 0\nwhile n:\n n /= k\n ans += 1\nprint(ans)', 'n, k = (int(z) for z in input().split())\nans = 0\nwhile n:\n\tn /= k\n ans += 1\nprint(ans)', 'n, k = (int(z) for z in input().split())\nans = 0\nwhile n:\n n //= k\n ans += 1\nprint(ans)\n']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s427275287', 's828044296', 's531624769']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 16.0]
[88, 89, 90]
p02766
u098982053
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 print(N)\n N = N//K\n count+=1\nprint(count)', 'N,K = map(int,input().split(" "))\ncount=0\nwhile(N>0):\n N = N//K\n count+=1\nprint(count)']
['Wrong Answer', 'Accepted']
['s109419927', 's790016607']
[2940.0, 2940.0]
[17.0, 17.0]
[105, 92]
p02766
u102242691
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['\nn,k = map(int,input().split())\n\n\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############################\n\nprint(Base_10_to_n(n, k))\n\n\n', '\nn,k = map(int,input().split())\n\n\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############################\n\na = Base_10_to_n(n, k)\n\nprint(len(a))\n\n\n']
['Wrong Answer', 'Accepted']
['s944025733', 's631510494']
[2940.0, 3060.0]
[18.0, 18.0]
[462, 474]
p02766
u103902792
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()\nk = int(k)\nans = len(int(n,k))\nprint(ans)', 'n,k = input().split()\nk = int(k)\nans = len(str(int(n,k)))\nprint(ans)\n\n', 'n,k = input().split()\nk = int(k)\n\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)\nans = len(str(Base_10_to_n(int(n),k)))\nprint(ans)\n\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s115403039', 's944571329', 's277915340']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0]
[63, 70, 199]
p02766
u103915901
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!=0:\n if n//k!=0:\n ans=ans+1\n elif n%k!=0:\n ans=ans+1\nprint(ans)\n', 'n,k=map(int,input().split())\nans=0\nwhile n!=0:\n if n//k!=0:\n ans=ans+1\n elif n%k!=0:\n ans=ans+1\n n=n//k\nprint(ans)']
['Time Limit Exceeded', 'Accepted']
['s852009339', 's206368458']
[3064.0, 2940.0]
[2104.0, 17.0]
[115, 123]
p02766
u104005543
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())\nresult = ''\nwhile n != 0:\n result = str(n % k) + result\n n = n // k\nresult = int(result)\ni = 0\nwhile result / 10 ** i >= 1:\n i += 1\nprint(i + 1)", "n, k = map(int, input().split())\nresult = ''\nwhile n != 0:\n result = str(n % k) + result\n n = n // k\nresult = int(result)\ni = 0\nwhile result / 10 ** i >= 1:\n i += 1\nprint(i)"]
['Wrong Answer', 'Accepted']
['s010100899', 's998603096']
[3060.0, 2940.0]
[17.0, 17.0]
[187, 183]
p02766
u111652094
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())\nJ=K\nans=0\n\nwhile N>J:\n J=J*K\n ans+=1\n\nprint(ans)', 'N,K=map(int,input().split())\nJ=K\nans=1\n\nwhile N>=J:\n J=J*K\n ans+=1\n\nprint(ans)']
['Wrong Answer', 'Accepted']
['s926481674', 's270292953']
[2940.0, 2940.0]
[17.0, 17.0]
[83, 84]
p02766
u112317104
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['def ten_to_n(X, n):\n i = int(X / n)\n s = str(X % n)\n if (i):\n return Base_10_to_n(i, n) + s\n return s\n\ndef solve():\n N, M = map(int, input().split())\n n = Base_10_to_n(N, M)\n return len(n)\n \nprint(solve())', 'def ten_to_n(X, n):\n i = X // n\n s = str(X % n)\n if (i):\n return ten_to_n(i, n) + s\n return s\n\ndef solve():\n N, M = map(int, input().split())\n return len(str(ten_to_n(N, M)))\n\nprint(solve())']
['Runtime Error', 'Accepted']
['s797153912', 's670846758']
[3060.0, 3060.0]
[17.0, 17.0]
[233, 215]
p02766
u123745130
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()) \nlst_b=[] \nlst_c=[] \nwhile(True): \n b=n//m \n c=n%m \n lst_b.append(b) \n lst_c.append(c) \n n=b \n \tif b==0: \n \t\tprint("".join(map(str,lst_c[::-1]))) \n \t\tbreak ', 'n,m=map(int,input().split()) \nlst_b=[] \nlst_c=[] \nwhile(True): \n b=n//m \n c=n%m \n lst_b.append(b) \n lst_c.append(c) \n n=b \n if b==0: \n \tprint("".join(map(str,lst_c[::-1]))) \n \tbreak ', 'n,m=map(int,input().split()) \nlst_b=[] \nlst_c=[] \nwhile(True): \n b=n//m \n c=n%m \n lst_b.append(b) \n lst_c.append(c) \n n=b \n if b==0: \n \tprint(len("".join(map(str,lst_c[::-1])))) \n \tbreak ']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s079921662', 's594104779', 's279106426']
[2940.0, 3064.0, 3064.0]
[18.0, 17.0, 17.0]
[231, 211, 216]
p02766
u129961029
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())\nif b==2:\n a=bin(a)\nelif b==8:\n a=oct(a)\nelif b==10:\n a=int(a)\nprint(len(a))', 'a,b=map(int,input().split())\ncount=1\nwhile a>=b:\n a=a/b\n count+=1\nprint(count)']
['Runtime Error', 'Accepted']
['s695417712', 's375911755']
[3060.0, 2940.0]
[17.0, 17.0]
[113, 84]
p02766
u131881594
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 if n<k**i:\n print(i)\n break', 'n,k=map(int,input().split())\ni=1\nwhile True:\n if n<k**i:\n print(i)\n break\n i+=1']
['Time Limit Exceeded', 'Accepted']
['s028117306', 's013814802']
[8932.0, 9156.0]
[2206.0, 30.0]
[90, 99]
p02766
u137293997
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 if N<K^i:\n print(i)\n break\n else:\n i = i + 1\n', 'import math\n\nN, K = map(int,input().split())\nif N==1:\n print(1)\nelse:\n print(math.ceil(math.log(N, K)))']
['Runtime Error', 'Accepted']
['s462360724', 's467861187']
[2940.0, 2940.0]
[17.0, 17.0]
[105, 105]
p02766
u164385976
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 True:\n if n // pow(k, i) == 0:\n print(pow(k, i))\n print(i)\n break\n else:\n i += 1', 'n, k = map(int, input().split())\ni = 0\nwhile True:\n if n // pow(k, i) == 0:\n print(i)\n break\n else:\n i += 1']
['Wrong Answer', 'Accepted']
['s306244193', 's768733453']
[9132.0, 9140.0]
[26.0, 29.0]
[139, 118]
p02766
u168416324
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math as mt\nn,k=map(int,input().split())\nprint(mt.ceil(mt.log(n,k))\n', 'x,k=map(int,input().split())\nans=0\nwhile k**ans<=x:\n ans+=1\n\nprint(ans)\n']
['Runtime Error', 'Accepted']
['s907542569', 's391155139']
[8920.0, 9060.0]
[22.0, 27.0]
[74, 73]
p02766
u175746978
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n, k = list(map(int, input().split()))\nans = 0\nwhile True:\n n = n // k\n ans += 1\n if == 0:\n break\nprint(ans)\n\n ', 'n, k = list(map(int, input().split()))\nans = 0\nwhile True:\n l.append(n % k)\n n = n // k\n if n // k == 0:\n l.append(n % k)\n break\nans = len(l)\nprint(ans)', 'n, k = list(map(int, input().split()))\nans = 0\n# while True:\n# n = n // k\n# ans += 1\n# if n == 0:\n# break\n# print(ans)\n\n\nif k == 10:\n ans = len(str(n))\nelse:\n l = []\n while True:\n n = n // k\n ans += 1\n if n == 0:\n break\nprint(ans)\n', 'n, k =list(map(int, input().split()))\nl = []\nwhile True:\n l.append(n % k)\n n = n // k\n if n == 0:\n l.append(n % k)\n break\nans = len(l)\nprint(ans)', 'n, k =list(map(int, input().split()))\nl = []\nwhile True:\n l.append(n % k)\n n = n // k\n if n // k == 0:\n #l.append(n % k)\n break\nans = len(l)\nprint(ans)\n', '\nn, k =list(map(int, input().split()))\nl = []\nwhile True:\n l.append(n % k)\n n = n // k\n if n == 0:\n l.append(n % k)\n break\nans = len(l)\nprint(ans)\n', 'n, k = list(map(int, input().split()))\nans = 0\nwhile True:\n l = []\n l.append(n % k)\n n = n // k\n if n // k == 0:\n l.append(n % k)\n break\nans = len(l)\nprint(ans)', 'n, k =list(map(int, input().split()))\nl = []\nwhile True:\n l.append(n % k)\n n = n // k\n if n == 0:\n break\nans = len(l)\nprint(ans)']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s037870634', 's147858318', 's613760942', 's643299379', 's701893139', 's824185663', 's832557571', 's819932246']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0, 17.0, 18.0, 17.0, 17.0, 17.0]
[143, 175, 276, 168, 175, 170, 186, 144]
p02766
u178079174
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['N, K = list(map(int,input().split()))\nans = 1\nwhile N > K:\n N //=K\n ans += 1\nprint(ans)', 'N, K = list(map(int,input().split()))\nans = 0\nwhile N > 0:\n N //=K\n ans += 1\nprint(ans)']
['Wrong Answer', 'Accepted']
['s587871755', 's397340667']
[3064.0, 2940.0]
[17.0, 18.0]
[93, 93]
p02766
u185405877
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['i = list(map(int, input().split()))\nj=1\nwhile i[0]<i[1]**j:\n j+=1\nprint(j)', 'i= list(map(int, input().split()))\nj=1\nwhile i[0]>=i[1]**j:\n j+=1\nprint(j)']
['Wrong Answer', 'Accepted']
['s258074650', 's616941427']
[2940.0, 2940.0]
[2103.0, 17.0]
[75, 75]
p02766
u185935459
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())\ncnt = 0\n\nwhile(n > 0):\n n /= k\n cnt += 1\n\nprint(cnt)', 'n,k=map(int,input().split())\n\ncnt = 0\n\nwhile(n > 0):\n n //= int(k)\n cnt += 1\n int(n)\n\nprint(cnt)']
['Runtime Error', 'Accepted']
['s039648137', 's919085940']
[2940.0, 2940.0]
[18.0, 17.0]
[84, 99]
p02766
u188272222
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 = []\nwhile n//k != 0:\n a.append(n%k)\n n = n//k\n \n if n//k ==0:\n a.append(n%k)\nlen(a)', 'n,k = map(int,input().split())\na = []\nwhile n//k != 0:\n a.append(n%k)\n n = n//k\n \n if n//k ==0:\n a.append(n%k)\nlen(a)', 'n,k = map(int,input().split())\na = []\nwhile n//k != 0:\n a.append(n%k)\n n = n//k\n \n if n//k ==0:\n a.append(n%k)\n a.reverse()\nlen(a)', 'n,k = map(int,input().split())\na = []\nif n//k == 0:\n print(1)\n\nelse:\n while n//k != 0:\n a.append(n%k)\n n = n//k\n \n if n//k ==0:\n a.append(n%k)\n a.reverse()\n \n print(len(a))']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s300349729', 's851362892', 's920480561', 's949324720']
[2940.0, 3316.0, 2940.0, 3060.0]
[18.0, 20.0, 17.0, 17.0]
[124, 124, 140, 192]
p02766
u189604332
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["def calculate_num(m, n):\n integer = m\n base = n\n result = ''\n while integer > 0:\n result += str(integer%base) + result\n integer = integer//base\n print(integer)\n return result\n\ndef main():\n num = input()\n num_list = num.split()\n number = int(num_list[0])\n base = int(num_list[1])\n result = calculate_num(number, base)\n print(int(result))\nmain()", "def calculate_num(m, n):\n integer = m\n base = n\n result = ''\n digit = 0\n while integer > 0:\n result += str(integer%base) + result\n integer = integer//base\n digit = len(result)\n return digit\n\ndef main():\n num = input()\n num_list = num.split()\n number = int(num_list[0])\n base = int(num_list[1])\n result = calculate_num(number, base)\n print(result)\nmain()", "def calculate_num(m, n):\n integer = m\n base = n\n result = ''\n digit = 0\n while integer > 0:\n result += str(integer%base)\n integer = integer//base\n digit = len(result)\n return digit\n\ndef main():\n num = input()\n num_list = num.split()\n number = int(num_list[0])\n base = int(num_list[1])\n result = calculate_num(number, base)\n print(result)\nmain()"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s804443774', 's860812559', 's961246089']
[1575972.0, 1576052.0, 3060.0]
[2155.0, 723.0, 18.0]
[363, 374, 365]
p02766
u190178779
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['\nimport sys\nimport math\nN,K = map(int,input().split())\n\nif not ( 1 <= N <= 10**9 and 2 <= K <= 10 ): sys.exit()\n\ncount = 0\na = N\nwhile a >= K:\n a = a // K\n print(a)\n count += 1\nprint(count+1)', '\nimport sys\nN,K = map(int,input().split())\n\nif not ( 1 <= N <= 10**9 and 2 <= K <= 10 ): sys.exit()\n\ncount = 0\na = N\nwhile a >= K:\n a = a // K\n count += 1\nprint(count+1)']
['Wrong Answer', 'Accepted']
['s411247879', 's803328762']
[9060.0, 9112.0]
[31.0, 32.0]
[214, 189]
p02766
u191635495
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["# Digits\nN, K = map(int, input().split())\ndiv = N // K\ndigits = []\nwhile div > K:\n div = N // K\n digits.append(str(N % K))\n N = div\ndigits.append(str(N % K))\nif N // K != 0:\n digits.append(str(N // K))\n\nans = ''.join(digits[::-1])\nprint(ans)", '# Digits\nN, K = map(int, input().split())\ndiv = N // K\ndigits = []\nwhile div > K:\n div = N // K\n digits.append(str(N % K))\n N = div\ndigits.append(str(N % K))\nif N // K != 0:\n digits.append(str(N // K))\nans = len(digits)\nprint(ans)']
['Wrong Answer', 'Accepted']
['s179037935', 's688520242']
[9044.0, 9140.0]
[26.0, 33.0]
[274, 244]
p02766
u193264896
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["import sys\nimport math\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nMOD = 10**9+7\n\n\ndef main():\n N, K = map(int, readline().split())\n ans = math.log(1,2)\n print(math.ceil(ans))\n \n \n \nif __name__ == '__main__':\n main()", "import sys\nimport math\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nMOD = 10**9+7\n\n\ndef main():\n N, K = map(int, readline().split())\n if N<K:\n ans = 1\n else:\n ans = math.ceil(math.log(N,K))\n print(ans)\n \n \n \nif __name__ == '__main__':\n main()"]
['Wrong Answer', 'Accepted']
['s934594086', 's462933624']
[3060.0, 3064.0]
[17.0, 18.0]
[332, 364]
p02766
u194297606
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())\nif N >= 10:\n ans = R\nelse:\n ans = R + 100 * (10 - N)\n \nprint(ans) ', 'N, K = map(int, input().split())\n\ni = 0\nwhile K ** i <= N:\n ans = i + 1\n i += 1\n \nprint(ans) ']
['Wrong Answer', 'Accepted']
['s803520471', 's604867539']
[2940.0, 2940.0]
[17.0, 17.0]
[110, 105]
p02766
u199845325
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["n,sin=map(int,input().split(' '))\nwhile n>=sin:\n ls.append(n%sin)\n n=n//sin\nls.append(n)\nprint(len(ls))", "n,sin=map(int,input().split(' '))\nls=[]\nwhile n>=sin:\n ls.append(n%sin)\n n=n//sin\nls.append(n)\n\nprint(len(ls))"]
['Runtime Error', 'Accepted']
['s498745160', 's570055412']
[2940.0, 2940.0]
[17.0, 17.0]
[109, 116]
p02766
u200527996
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 K**i =< N:\n i+=1\nelse:\n print(i)', 'N,K = map(int, input().split())\ni = 1\nwhile K**i <= N:\n i+=1\nelse:\n print(i)']
['Runtime Error', 'Accepted']
['s891424217', 's195333502']
[2940.0, 2940.0]
[17.0, 17.0]
[82, 82]
p02766
u201387466
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 = 1\ns = 1\nwhile(s<N):\n s *= K\n c += 1\nprint(c)', 'N,K = map(int,input().split())\nc = 0\ns = 1\nwhile(s<=N):\n s *= K\n c += 1\nprint(c)']
['Wrong Answer', 'Accepted']
['s709153702', 's564298089']
[2940.0, 2940.0]
[17.0, 17.0]
[85, 86]
p02766
u201928947
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 n > 0:\n n //= k \n count += 1\nprint(count)', 'n,k = map(int,input().split())\ncount = 0\nwhile n > 0:\n n //= k \n count += 1\nprint(count)']
['Wrong Answer', 'Accepted']
['s705151835', 's102575072']
[2940.0, 2940.0]
[17.0, 17.0]
[90, 90]
p02766
u209313313
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\u3000 if (int(n/b)):\n\u3000\u3000 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)))', 'def base10to(n, b):\n\u3000 if (int(n/b)):\n\u3000\u3000 return base10to(int(n/b), b) + str(n%b)\n else: \n return str(n%b)\nN, K=map(int, input().split())\nx = base10to(N,K)\nprint(len(x))', 'def base10to(n, b):\n\u3000 if (int(n/b)):\n\u3000\u3000 return base10to(int(n/b), b) + str(n%b)\n return str(n%b)\nN, K=map(int, input().split())\nx = base10to(N,K)\nprint(len(x))', '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)))']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s634703251', 's855649364', 's928713763', 's200689143']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 18.0, 17.0, 17.0]
[166, 187, 172, 163]
p02766
u215286521
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['from math import floor,ceil,sqrt,factorial,log\nfrom collections import Counter, deque\nfrom functools import reduce\nimport numpy as np\nimport itertools\ndef S(): return input()\ndef I(): return int(input())\ndef MS(): return map(str,input().split())\ndef MI(): return map(int,input().split())\ndef FLI(): return [int(i) for i in input().split()]\ndef LS(): return list(MS())\ndef LI(): return list(MI())\ndef LLS(): return [list(map(str, l.split() )) for l in input()]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef LLSN(n: int): return [LS() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\n\nN, K = MI()\n\ndef nsinsuu(n, k):\n if n == 1: return 1\n cnt = 0\n while n > k:\n cnt += 1\n n = n // k\n return cnt\n\nprint(nsinsuu(N,K)+1)', 'from math import floor,ceil,sqrt,factorial,log\nfrom collections import Counter, deque\nfrom functools import reduce\nimport numpy as np\nimport itertools\ndef S(): return input()\ndef I(): return int(input())\ndef MS(): return map(str,input().split())\ndef MI(): return map(int,input().split())\ndef FLI(): return [int(i) for i in input().split()]\ndef LS(): return list(MS())\ndef LI(): return list(MI())\ndef LLS(): return [list(map(str, l.split() )) for l in input()]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef LLSN(n: int): return [LS() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\n\nN, K = MI()\n\ndef nsinsuu(n, k):\n if n == 1: return 0\n cnt = 0\n while n > k:\n cnt += 1\n n = n // k\n return cnt\n\nprint(nsinsuu(N,K)+1)', 'from math import floor,ceil,sqrt,factorial,log\nfrom collections import Counter, deque\nfrom functools import reduce\nimport numpy as np\nimport itertools\ndef S(): return input()\ndef I(): return int(input())\ndef MS(): return map(str,input().split())\ndef MI(): return map(int,input().split())\ndef FLI(): return [int(i) for i in input().split()]\ndef LS(): return list(MS())\ndef LI(): return list(MI())\ndef LLS(): return [list(map(str, l.split() )) for l in input()]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef LLSN(n: int): return [LS() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\n\nN, K = MI()\n\ndef nsinsuu(n, k):\n cnt = 0\n while n > k:\n cnt += 1\n n = n // k\n return cnt\n\nprint(nsinsuu(N,K)+1)', 'from math import floor,ceil,sqrt,factorial,log\nfrom collections import Counter, deque\nfrom functools import reduce\nimport numpy as np\nimport itertools\ndef S(): return input()\ndef I(): return int(input())\ndef MS(): return map(str,input().split())\ndef MI(): return map(int,input().split())\ndef FLI(): return [int(i) for i in input().split()]\ndef LS(): return list(MS())\ndef LI(): return list(MI())\ndef LLS(): return [list(map(str, l.split() )) for l in input()]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef LLSN(n: int): return [LS() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\n\nN, K = MI()\n\ncnt = 0\nwhile N > 0:\n N = N // K\n cnt += 1\n\nprint(cnt)']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s092528063', 's519483990', 's664817335', 's262010397']
[27144.0, 27088.0, 26988.0, 26964.0]
[116.0, 118.0, 116.0, 113.0]
[783, 783, 759, 698]
p02766
u216752093
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())\nhey=N\nans=1\nwhile hey//K >= K:\n ans += 1\n hey = hey//K\nprint(ans)', 'N,K=map(int,input().split())\nhey=N\nans=1\nwhile hey >= K:\n ans += 1\n hey = hey//K\nprint(ans)']
['Wrong Answer', 'Accepted']
['s691182076', 's944989686']
[2940.0, 2940.0]
[17.0, 17.0]
[100, 97]
p02766
u218487926
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()]\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\nprint(Base_10_to_n(n, k))", 'n, k = [int(i) for i in 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)\nprint(Base_10_to_n(n, k))\n', 'n, k = [int(i) for i in input().split()]\ndef decNbin(t, n):\n a = []\n while t!= 0:\n a.append(t % n)\n t = t // n\n a.reverse()\n return a\n"".join(map(str, decNbin(n, k)))', 'n, k = [int(i) for i in input().split()]\ndef decNbin(t, n):\n a = []\n while t!= 0:\n a.append(t % n)\n t = t // n\n a.reverse()\n return a\nprint(len(str("".join(map(str, decNbin(n, k))))))\n']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s196499602', 's369480519', 's680113514', 's825142574']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[216, 180, 177, 195]
p02766
u225845681
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())\nAns = (math.log(K,N) +1)\nprint(Ans)', 'N,K = map(int,input().split())\nfor i in range(10**9):\n print(K**i)\n if K**i <= N < K**(i+1):\n print(i+1)\n break', 'import math\nN,K = map(int,input().split())\nAns = (int(math.log(N,K)) +1)\nprint(Ans)']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s461304869', 's506625356', 's858148982']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 17.0]
[78, 119, 83]
p02766
u227082700
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(10**10**10**10**10):\n if k**i>n:\n print(i)\n exit()', 'n,k=map(int,input().split())\nfor i in range(10**10):\n if k**i>n:\n print(i)\n exit()\n']
['Time Limit Exceeded', 'Accepted']
['s332687831', 's968363430']
[10344.0, 2940.0]
[2104.0, 17.0]
[101, 90]
p02766
u231038326
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k =list(map(int,input().split()))\nA=0\n\nwhile True:\n n =n//k\n A+=1\n if n//k==0:\n break\nprint(A)', 'n,k =list(map(int,input().split()))\nA=0\n\nwhile True:\n n =n//k\n A+=1\n if n==0:\n break\nprint(A)']
['Wrong Answer', 'Accepted']
['s467301517', 's777441448']
[2940.0, 2940.0]
[17.0, 17.0]
[112, 109]
p02766
u236536206
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 //= k\n print(n)\n c += 1\nprint(c)', 'n, k = map(int, input().split())\nc = 0\nwhile(n != 0):\n n //= k\n c += 1\nprint(c)']
['Wrong Answer', 'Accepted']
['s620694898', 's512593834']
[2940.0, 2940.0]
[17.0, 17.0]
[92, 81]
p02766
u239653493
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 if n<(k**(i-1)):\n print(i)\n break\n else:\n i=i+1', 'n,k=map(int,input().split())\ni=1\nwhile True:\n if n<(k**(i-1)):\n print(i-1)\n break\n else:\n i=i+1']
['Wrong Answer', 'Accepted']
['s938083880', 's659088734']
[2940.0, 2940.0]
[17.0, 19.0]
[120, 122]
p02766
u243061947
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['def Digits(N, K):\n if not N:\n return 1\n digits = 0\n while not N:\n N = N // K\n digits += 1\n return digits\n \nN, K = map(int, input().split())\nprint (Digits(N, K))', 'def Digits(N, K):\n if N:\n return 1\n digits = 0\n while N:\n N = N // K\n digits += 1\n return digits\n\nN, K = map(int, input().split())\nprint (Digits(N, K))', 'def Digits(N, K):\n if not N:\n return 1\n digits = 0\n while N:\n N = N // K\n digits += 1\n return digits\n \nN, K = map(int, input().split())\nprint (Digits(N, K))\n']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s590923280', 's982969038', 's794351662']
[3064.0, 2940.0, 2940.0]
[18.0, 17.0, 17.0]
[173, 164, 170]
p02766
u243312682
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, input().split())\n cnt = 0\n i = 1\n \n while n >= i:\n print(i)\n i *= k\n cnt += 1\n print(cnt)\n\nif __name__ == '__main__':\n main()", "def main():\n n, k = map(int, input().split())\n cnt = 0\n i = 1\n \n while n >= i:\n i *= k\n cnt += 1\n print(cnt)\n\nif __name__ == '__main__':\n main()"]
['Wrong Answer', 'Accepted']
['s434163623', 's385096907']
[9148.0, 9168.0]
[28.0, 29.0]
[211, 194]
p02766
u243572357
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['counter = 0\nn, k = map(int, input().split())\nfor i in range(100):\n if k ** i >= n:\n counter = i + 1\nprint(counter)', 'counter = 0\nn, k = map(int, input().split())\nfor i in range(100):\n if k ** i <= n:\n counter = i + 1\n else:\n break\nprint(counter)\n']
['Wrong Answer', 'Accepted']
['s730920728', 's037748619']
[2940.0, 2940.0]
[17.0, 17.0]
[118, 137]
p02766
u244656600
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['nt,kt = input().split()\nn = int(nt)\nk = int(kt)\ni = 1\nwhile n > (k ** i):\n i = i+1\n \nprint(i +1)\n', 'nt,kt = input().split()\nn = int(nt)\nk = int(kt)\ni = 1\nwhile n >= (k ** i):\n i = i+1\n \nprint(i)\n']
['Wrong Answer', 'Accepted']
['s010323097', 's794005568']
[2940.0, 2940.0]
[17.0, 17.0]
[101, 99]
p02766
u263438842
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\n print(res+1)', 'n, k = map(int, input().split())\nres = 0\nwhile n >= k:\n res += 1\n n //= k\nprint(res+1)']
['Wrong Answer', 'Accepted']
['s938276254', 's916412875']
[2940.0, 2940.0]
[17.0, 17.0]
[90, 88]
p02766
u272075541
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['i = 1\nwhile n >= k**i:\n i += 1\n\nprint(i)', 'n,k = map(int, input().split())\nx = 0\nwhile n:\n n //= k\n x += 1\nprint(x)']
['Runtime Error', 'Accepted']
['s890290979', 's939993912']
[2940.0, 2940.0]
[17.0, 17.0]
[43, 74]
p02766
u273345915
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['l=input().split()\nN=int(l[0])\nK=int(l[1])\ncnt=0\na=N\n\nwhile True:\n a=a/K\n cnt+=1\n if a==0:break\n\nprint(a)', 'import math\n\nl=input().split()\nN=int(l[0])\nK=int(l[1])\ncnt=0\na=N\n\nwhile True:\n a=math.floor(a/K)\n cnt+=1\n if a==0:break\n\nprint(cnt)']
['Wrong Answer', 'Accepted']
['s127540727', 's093801331']
[2940.0, 3060.0]
[17.0, 17.0]
[107, 140]
p02766
u276686572
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 = 0\n\nwhile n > 0:\n n /= k\n ans += 1\n \nprint(ans)\n', 'n,k = map(str, input().split())\nk = int(k)\nnum = 0\n\nfor i in range(0, len(n)):\n sum += int(n[i]) * k^(len(n)-i)\n \nprint(len(str(sum)))', 'n,k = map(str, input().split())\nk = int(k)\nnum = 0\n\nfor i in range(0, len(n)):\n num += int(n[i]) * (len(n)-i) * k^(len(n)-i)\n \nprint(len(str(num)))\n', 'n,k = map(int, input().split())\n\nans = 0\n\nwhile n > 0:\n n /= k\n n = int(n)\n ans += 1\n \nprint(ans)\n']
['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s215278236', 's290463232', 's445337438', 's113938441']
[9000.0, 9172.0, 9176.0, 8940.0]
[26.0, 21.0, 29.0, 28.0]
[89, 136, 150, 102]
p02766
u277104886
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 //= k\n count += 1\nprint(count)', 'n, k = map(int, input().split())\ncount = 0\nwhile n >0:\n n //= k\n count += 1\nprint(count)']
['Time Limit Exceeded', 'Accepted']
['s855431233', 's244104460']
[2940.0, 2940.0]
[2104.0, 17.0]
[95, 94]
p02766
u281796054
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=1\nwhile n > k:\n n//=k\n a+=1\nprint(a)', 'n,k=map(int,input().split())\ni = 1\nw = k\nwhile w < n:\n w *= k\n i += 1\nprint(i+1)', 'n, k = map(int, input().split())\nans=0\nwhile n > 0:\n n//=k\n ans+=1\n \nprint(ans)']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s428387223', 's811354912', 's804976225']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[69, 82, 82]
p02766
u283751459
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 True:\n n = n//k\n count += 1\n print(n)\n if n <1:\n print(n)\n break\n \n \nprint(count)', 'n, k = map(int,input().split())\ncount = 0\nwhile True:\n n = n//k\n count += 1\n if n <1:\n break\n \n \nprint(count)']
['Wrong Answer', 'Accepted']
['s804189848', 's360724277']
[8984.0, 9168.0]
[28.0, 27.0]
[145, 121]
p02766
u284363684
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\ni = 1\nwhile N <= K ** i:\n if N <= K ** i:\n i += 1\n\nprint(i)', '# input\nN, K = map(int, input().split())\n\ni = 2\nwhile N > K ** i:\n if N <= K ** i:\n i += 1\n\nprint(i)', '# input\nN, K = map(int, input().split())\n\ni = 1\nwhile N >= K ** i:\n if N >= K ** i:\n i += 1\n\nprint(i)']
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s709450616', 's790035218', 's760929589']
[2940.0, 2940.0, 2940.0]
[2103.0, 2104.0, 17.0]
[111, 111, 111]
p02766
u289288647
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 transform(X, n):\n print(int(X/n))\n if (int(X/n)):\n return transform(int(X/n), n)+str(X%n)\n return str(X%n)\n\nprint(len(transform(N, K)))\n', 'N, K = map(int, input().split())\ndef transform(X, n):\n if (int(X/n)):\n return transform(int(X/n), n)+str(X%n)\n return str(X%n)\n\nprint(len(transform(N, K)))\n']
['Wrong Answer', 'Accepted']
['s313105020', 's374356978']
[2940.0, 2940.0]
[17.0, 18.0]
[189, 169]
p02766
u309018392
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 n > 0:\n n = n%k\n i += 1\nprint(i)', 'n,k = map(int,input().split())\ni = 1\nwhile n//k > 0:\n n //= k\n i +=1\nprint(i)']
['Wrong Answer', 'Accepted']
['s893943379', 's391058411']
[2940.0, 2940.0]
[2103.0, 18.0]
[81, 83]
p02766
u309120194
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
["def from_10_to_n(x, n):\n tmp = x\n out = ''\n while tmp > 0:\n out = str(x % n) + out\n tmp = tmp // n\n return out\n\nN, K = map(int, input().split())\nN = from_10_to_n(x, n)\nprint(len(N))", 'N, K = map(int, input().split())\n\n\n\n\nans = 0\nwhile N > 0:\n N //= K\n ans += 1\n\nprint(ans)']
['Runtime Error', 'Accepted']
['s571881469', 's785840707']
[9176.0, 8848.0]
[29.0, 26.0]
[191, 214]
p02766
u312666261
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
[',k = map(int,input().split())\na = 1\nwhile k**a < n:\n a += 1\n\nprint(a)', 'n,k = map(int,input().split())\na = 1\nwhile k**a <= n:\n a += 1\n\nprint(a)']
['Runtime Error', 'Accepted']
['s502689129', 's312731220']
[2940.0, 2940.0]
[17.0, 17.0]
[72, 74]
p02766
u314837274
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 N>=k**i:\n i+=1\nprint(i)', 'N,K=map(int,input().split())\ni=0\nwhile N>K=**i:\n i+=1\nprint(i)', 'N,K=map(int,input().split())\ni=0\nwhile N>=K**i:\n i+=1\nprint(i)']
['Runtime Error', 'Runtime Error', 'Accepted']
['s567385947', 's575084324', 's826027506']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[65, 65, 65]
p02766
u320763652
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,k = map(int, "282475249 7".split())\n\nisFlg = False\ni=1\nwhile True:\n tmp = k **i\n\n if n <= tmp:\n isFlg = True\n\n i+=1\n\n if isFlg:\n break\n\nprint(i)\n\n\n', 'n,k = map(int, input().split())\n\nisFlg = False\ni=1\nwhile True:\n tmp = k **i\n\n if n < tmp:\n isFlg = True\n\n\n if isFlg:\n break\n\n i+=1\n\n\nprint(i)\n\n\n']
['Wrong Answer', 'Accepted']
['s291723610', 's088937924']
[2940.0, 2940.0]
[18.0, 17.0]
[209, 170]
p02766
u322187839
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int INT;\n\nINT pow(int n,int k)\n{\n INT a=1;\n for (int i=1;i<=k;i++){\n a*=n;\n }\n return a;\n}\n\nint main()\n{\n INT n;\n int k;\n cin>>n>>k;\n int i=0;\n while(1){\n if(n<pow(k,i)){\n cout<<i<<endl;\n break;\n }\n ++i;\n }\n}', 'n,k=map(int,input().split())\ncnt=0\ni=1\n \nwhile True:\n p=n//k**i\n if p==0:\n print(i)\n break\n else:\n i+=1']
['Runtime Error', 'Accepted']
['s316243329', 's322279530']
[8752.0, 2940.0]
[25.0, 17.0]
[351, 133]
p02766
u323045245
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 > k :\n n = n // k\n mod = n % k\n ans.append(str(ans))\nprint("".join(ans))\n', 'n, k = map(int, input().split())\nans = []\nwhile n >= k :\n n = n // k\n mod = n % k\n ans.append(mod)\nans.append(n) \nprint(len(ans))\n']
['Wrong Answer', 'Accepted']
['s822696435', 's434145900']
[717692.0, 2940.0]
[2118.0, 17.0]
[126, 134]
p02766
u325282913
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 >= K:\n ans = str(N % K) + ans\n N = N // K\n print(ans)\nans = str(N) + ans\nprint(len(ans))", "N, K = map(int, input().split())\nans = ''\nwhile N >= K:\n ans = str(N % K) + ans\n N = N // K\nans = str(N) + ans\nprint(len(ans))"]
['Wrong Answer', 'Accepted']
['s321318203', 's486559213']
[2940.0, 2940.0]
[17.0, 17.0]
[148, 133]
p02766
u331997680
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 True:\n cnt += 1\n N = N//K\n if N != 0:\nprint(cnt) ', 'N, K = map(int, input().split())\ncnt = 0\nwhile True:\n cnt += 1\n N = N//K\n if N == 0:\n break\nprint(cnt) ']
['Runtime Error', 'Accepted']
['s542020413', 's546553138']
[2940.0, 2940.0]
[17.0, 17.0]
[99, 109]
p02766
u342062419
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 \nprint(count+1)', 'n,k = map(int, input().split())\ncount = 0\nwhile n > 0:\n n //= k\n count += 1 \nprint(count)']
['Wrong Answer', 'Accepted']
['s539756108', 's286450413']
[9160.0, 9100.0]
[27.0, 27.0]
[99, 95]
p02766
u345132740
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()\nC=0\nwhile(int(N)>=int(K)):\n C=C+1\n N=int(N)-int(K)**C\nprint(C)', 'N,K=input().split()\nC=0\nwhile(int(N)>=int(K)):\n N=int(N)//int(K)\n C=C+1\nprint(C+1)']
['Wrong Answer', 'Accepted']
['s722822486', 's289721002']
[2940.0, 2940.0]
[17.0, 17.0]
[84, 84]
p02766
u345483150
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import sys\nn,k=map(int,input().split())\nfor i in range(length.n):\n if k**i<=n and n<k**(i+1):\n print(i+1)\n sys.exit()\n ', 'import sys\nn,k=map(int,input().split())\nfor i in range(n):\n if k**i<=n and n<k**(i+1):\n print(i+1)\n sys.exit()\n ']
['Runtime Error', 'Accepted']
['s753517970', 's643735005']
[3068.0, 2940.0]
[17.0, 17.0]
[127, 120]
p02766
u347628226
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())\ni = r\nc = 1\nwhile i <= n:\n\ti *= r\n c += 1\nprint(c)', 'n, r = map(int, input().split())\ni = r\nc = 1\nwhile i <= n:\n\ti *= r\n\tc += 1\nprint(c)']
['Runtime Error', 'Accepted']
['s379780298', 's205131199']
[2940.0, 2940.0]
[17.0, 17.0]
[86, 83]
p02766
u349091349
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(n,k)))', 'import math\nn,k=map(int,input().split())\nprint(int(math.log(n,k))+1)']
['Wrong Answer', 'Accepted']
['s505731873', 's341840906']
[2940.0, 3060.0]
[17.0, 18.0]
[66, 68]
p02766
u350093546
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())\nsum=0\nwhile n>=1:\n n=n/k\n sum+=1\n \nreturn sum\n', 'n,k=map(int,input().split())\nsum=0\nwhile n>1:\n n=n/k\n sum+=1\n \nreturn sum', 'n,k=map(int,input().split())\nsum=0\nwhile n>=1:\n n=n/k\n sum+=1\n \nprint sum\n', 'n,k=map(int,input().split())\ncount=1\nwhile n>=k:\n n=n/k\n count+=1\nprint(count)\n']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s433562447', 's597921203', 's703244982', 's520920678']
[3064.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[78, 76, 77, 81]
p02766
u364774090
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 = list(map(int, input().split()))\nans = 100 ** 100\n\nfor p in range(1, 101):\n\tnow = 0\n\tfor x in X:\n\t\tnow += (p - x) ** 2\n\tans = min(ans, now)\nprint(ans)\n', 'N, K = list(map(int, input().split()))\nans = 0\nwhile N > 0:\n N //= K\n ans += 1\nprint(ans)']
['Runtime Error', 'Accepted']
['s737406267', 's485028230']
[9168.0, 9028.0]
[24.0, 26.0]
[171, 95]
p02766
u366369712
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())\ni = 0\nwhile True:\n if n < k**(i+1):\n print(i + 1)\n break\n i += 1', 'n,k = map(int,input().split())\n\ni = 0\nwhile True:\n if n < k**(i+1):\n print(i + 1)\n break\n i += 1\n\n']
['Runtime Error', 'Accepted']
['s087003024', 's723043916']
[2940.0, 2940.0]
[17.0, 17.0]
[110, 110]
p02766
u369796672
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import math\n\nN, K = map(int, input().split())\nP = math.log(N, K)\nQ = math.floor(P)\n\nprint(Q)', 'import math\n \nN, K = map(int, input().split())\nP = math.log(N, K)\nQ = math.floor(P)\n \nprint(Q + 1)']
['Wrong Answer', 'Accepted']
['s264426050', 's661780485']
[2940.0, 3060.0]
[18.0, 17.0]
[92, 98]
p02766
u371385198
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import sys\ninput = sys.stdin.readline\n\nN, K = map(int, input().split())\n\nd = 1\nwhile N:\n N //= 2\n d += 1\n\nprint(d)\n', 'import sys\ninput = sys.stdin.readline\n\nN, K = map(int, input().split())\n\nd = 0\nwhile N:\n N //= K\n d += 1\n\nprint(d)\n']
['Wrong Answer', 'Accepted']
['s773865286', 's898377143']
[2940.0, 2940.0]
[19.0, 17.0]
[121, 121]
p02766
u371409687
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>0:\n n=n/k\n cnt+=1\nprint(cnt)', 'def convert(n, k):\n if (int(n/k)):\n return convert(int(n/k), k)+str(n%k)\n return str(n%k)\nn,k=map(int,input().split())\nprint(len(Base_10_to_n(n,k)))', 'n,k=map(int,input().split())\ncnt=0\nwhile n>0:\n n=n//k\n cnt+=1\nprint(cnt)']
['Wrong Answer', 'Runtime Error', 'Accepted']
['s666948946', 's816175982', 's155119388']
[2940.0, 3060.0, 2940.0]
[17.0, 17.0, 17.0]
[77, 161, 78]
p02766
u373047809
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 True:\n if n // (k ** ans) == 0:\n break\n a += 1\nprint(ans)', 'n, k = map(int, input().split())\nans = 0\nwhile True:\n if n // (k ** ans) == 0:\n break\n ans += 1\nprint(ans)']
['Runtime Error', 'Accepted']
['s927575223', 's611509789']
[2940.0, 2940.0]
[17.0, 17.0]
[117, 119]
p02766
u373958718
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>1):\n n//=k; ans+=1\nprint(ans)', 'n,k=map(int,input().split())\nans=0\nwhile(n):\n n//=k; ans+=1\nprint(ans)']
['Wrong Answer', 'Accepted']
['s802416165', 's371530941']
[2940.0, 2940.0]
[17.0, 17.0]
[73, 71]
p02766
u379562612
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['imports sys\nl = sys.stdin.readline()\nn, k = map(int, l.split())\nif n == 0:\n print(1)\n sys.exit(0)\ncount = 0\nwhile n > 0:\n \tn /= k\n count += 1\nprint(count)', 'import sys\nl = sys.stdin.readline()\nn, k = map(int, l.split())\nif n == 0:\n print(1)\n sys.exit(0)\ncount = 0\nwhile n > 0:\n n //= k\n count += 1\nprint(count)']
['Runtime Error', 'Accepted']
['s049271250', 's378282283']
[2940.0, 3188.0]
[17.0, 20.0]
[160, 161]
p02766
u382431597
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['n,k = list(map(int, input().split()))\nans = ""\n\nwhile n != 0:\n ans = str(n%k) + ans\n n //= k\n\nprint(ans)', 'n,k = list(map(int, input().split()))\nans = ""\n\nwhile n != 0:\n ans = str(n%k) + ans\n n //= k\n\nprint(len(ans))\n']
['Wrong Answer', 'Accepted']
['s503075654', 's992219139']
[2940.0, 2940.0]
[17.0, 17.0]
[110, 116]
p02766
u383018986
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['rc = list(map(int, input().split()))\n\ndigit = 1\nwhile src[1] ** digit - 1 < src[0]:\n digit += 1\n\nprint(digit)', 'src = list(map(int, input().split()))\n\ndigit = 1\nwhile src[1] ** digit - 1 < src[0]:\n digit += 1\n\nprint(digit)\n']
['Runtime Error', 'Accepted']
['s128147390', 's330976743']
[2940.0, 2940.0]
[17.0, 17.0]
[112, 114]
p02766
u388297793
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>0)\n 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)', 'n,k=map(int,input().split())\nans=0\nwhile(n>0):\n n=n//k\n ans+=1\nprint(ans)']
['Runtime Error', 'Time Limit Exceeded', 'Accepted']
['s744821779', 's747226890', 's980445217']
[8872.0, 8996.0, 9052.0]
[27.0, 2206.0, 29.0]
[78, 77, 79]
p02766
u390901183
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 > 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)\n']
['Wrong Answer', 'Accepted']
['s019512502', 's876302731']
[2940.0, 3064.0]
[18.0, 19.0]
[84, 86]
p02766
u392361133
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 += 1\nprint(count)', 'n, k = map(int, input().split())\ncount = 0\nwhile n >= k:\n n = n // k\n count += 1\nprint(count+1)\n']
['Runtime Error', 'Accepted']
['s332219290', 's868432934']
[2940.0, 2940.0]
[17.0, 17.0]
[96, 98]
p02766
u394352233
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())\nq = N/K\nnum = 0\nwhile q >0:\n q = q / K**num\n num = num + 1\nprint(num)', 'N, K = map(int, input().split())\nnum = 0\nwhile q > 0:\n num = num + 1\n q = N // (K**num)\nprint(num)', 'N, K = map(int, input().split())\nq = N/K\nnum = 0\nwhile q > 0:\n q = q // (K**num)\n num = num + 1\nprint(num)', 'N, K = map(int, input().split())\nq = N/K\nnum = 0\nwhile q >0:\n q = q / (K**num)\n num = num + 1\nprint(num)', 'N, K = map(int, input().split())\nnum = 0\nwhile q > 0:\n num = num + 1\n q = N // (K**num) \nprint(num+1)', 'N, R = map(int, input().split())\nq = N/K\nnum = 0\nwhile q >0:\n q = q / (K**num)\n num = num + 1\nprint(num)', 'N, K = map(int, input().split())\nnum = 0\nwhile q > 0:\n num = num + 1\n q = N // (K**num)\nA = num + 1\nprint(A)', 'N, K = map(int, input().split())\nnum = 0\nq = N\nwhile q > 0:\n\tnum = num + 1\n\tq = N // (K**num)\nprint(num)']
['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s016019933', 's073384619', 's201809883', 's234968955', 's640283698', 's788986045', 's868448774', 's302850494']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0]
[104, 100, 108, 106, 104, 106, 110, 104]
p02766
u405256066
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\nN,K = [int(x) for x in stdin.readline().rstrip().split()]\nans = 0\nfor k in range(1000000):\n N -= (K**k)\n if N < 0:\n break\n ans += 1\n \nprint(ans)', 'from sys import stdin\nN,K = [int(x) for x in stdin.readline().rstrip().split()]\nans = 0\nfor k in range(10000000):\n if N < K**k:\n break\n \nprint(k)']
['Wrong Answer', 'Accepted']
['s883320033', 's088309435']
[2940.0, 2940.0]
[18.0, 17.0]
[185, 158]
p02766
u411237324
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\n\n# print(i)\n# break\n\ntemp = 1\ncnt = 0\nwhile n > temp - 1:\n temp *= k\n print(temp)\n cnt += 1\nprint(cnt)\n', 'n, k = map(int, input().split())\n\n\n\n# print(i)\n# break\n\ntemp = 1\ncnt = 0\nwhile n > temp - 1:\n temp *= k\n # print(temp)\n cnt += 1\nprint(cnt)\n']
['Wrong Answer', 'Accepted']
['s559002468', 's100477195']
[2940.0, 2940.0]
[17.0, 17.0]
[211, 213]
p02766
u427344224
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing P = pair<ll, ll>;\nusing Graph = vector<vector<ll>>;\n#define rep(i, n) for(ll i=0;i<(ll)(n);i++)\n#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)\n#define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--)\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};\nconst int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};\nconst ll MOD = 1000000007;\nconst ll INF = 1000000000000000000L;\n#ifdef __DEBUG\n\n/**\n * For DEBUG\n * https://github.com/ta7uw/cpp-pyprint\n */\n#include "cpp-pyprint/pyprint.h"\n\n#endif\n\nvoid Main() {\n ll N, K;\n cin >> N >> K;\n ll ans = 0;\n ll tmp = 0;\n while (pow(K, tmp) <= N) {\n tmp++;\n }\n rep2(i, 1, tmp + 1) {\n if (pow(K, i - 1) <= N && N < pow(K, i)) {\n ans = max(ans, i);\n }\n }\n cout << ans << \'\\n\';\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n Main();\n return 0;\n}\n', 'N, K = map(int, input().split())\n\nans = -1\nfor i in range(1, 40):\n if K ** (i - 1) <= N < K ** i:\n ans = i\n\nprint(ans)\n']
['Runtime Error', 'Accepted']
['s936886061', 's000215060']
[2940.0, 2940.0]
[17.0, 17.0]
[1031, 129]
p02766
u427690532
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['\nN,K = map(int,input("入力：").split())\nq, mod = divmod(N,K)\nmod_list = [mod]\nwhile True:\n q , mod =divmod(q,K)\n mod_list.append(mod)\n if q <=0 :\n break\n\nn_ary = int("".join(map(str,mod_list[::-1])))\nprint(len(str(n_ary)))', '\nN,K = map(int,input().split())\nq, mod = divmod(N,K)\nmod_list = [mod]\nwhile True:\n q , mod =divmod(q,K)\n mod_list.append(mod)\n if q <=0 :\n break\n\nn_ary = int("".join(map(str,mod_list[::-1])))\nprint(len(str(n_ary)))']
['Wrong Answer', 'Accepted']
['s685330946', 's237011080']
[9192.0, 9120.0]
[26.0, 23.0]
[291, 280]
p02766
u428132025
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\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\nprint(len(str(base_10_to_n(n, k))))', 'n, k = map(int, input().split())\nans = 0\n\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\nprint(len(str(base_10_to_n(n, k))))']
['Runtime Error', 'Accepted']
['s446503941', 's332990547']
[3060.0, 2940.0]
[19.0, 17.0]
[199, 199]
p02766
u428199834
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 N>K**i:\n i=i+1\nelse:\n print(i+1)', 'N,K=map(int,input().split())\ni=0\nwhile N>=K**i:\n i=i+1\nelse:\n print(i)\n']
['Wrong Answer', 'Accepted']
['s761891327', 's852030512']
[2940.0, 2940.0]
[17.0, 18.0]
[73, 73]
p02766
u430336181
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())\nN_ = N\nnum = 1\nwhile N > K:\n N = N//K\n num +=1\n\nlist = []\nprint(num)\n\n\nfor i in range(num, -1, -1):\n n = str(N_//(K**i))\n N_ = N_ % (K**i)\n # print(N_, n)\n list.append(n)\n\nprint(len(list))\n\n', 'N, K = map(int, input().split())\nN_ = N\nnum = 1\nwhile N > K:\n N = N//K\n num +=1\n\nlist = []\n\nfor i in range(num, -1, -1):\n n = str(N_//(K**i))\n N_ = N_ % (K**i)\n # print(N_, n)\n list.append(n)\n\n\nwhile list[0] == "0":\n list.remove("0")\n\nprint(len(list))\n\n']
['Wrong Answer', 'Accepted']
['s820440591', 's307655879']
[3060.0, 3060.0]
[17.0, 17.0]
[241, 274]
p02766
u436725550
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())\ncout = 1\nfor i in ranga(N):\n N = N//K\n cout += 1\n if N<K:\n break\nprint(cout)', 'N, K = map(int, input().split())\ncout = 0\nfor i in range(N):\n N = N//K\n cout += 1\n if N<K:\n break\nprint(cout)', 'N, K = map(int, input().split())\ncout = 1\nfor i in range(N):\n if N<K:\n break\n N = N//K\n cout += 1\n\nprint(cout)']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s090075520', 's999073783', 's345252016']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[125, 125, 126]
p02766
u440884206
2,000
1,048,576
Given is an integer N. Find the number of digits that N has in base K.
['import string\nnumbers = "0123456789"\nalphabets = string.ascii_letters \ncharacters = numbers + alphabets\nNK=list(map(int,input().split()))\nn=NK[0]\nk=NK[1]\nresult = \'\'\nwhile n>=k:\n idx=n%k\n result=characters[idx]+result\n n=int(n/k)\n idx=n%k\n result=characters[idx]+result\n# return result\nprint(result)', "N,K=map(int,input().split())\ndef Base_10_to_n(N,K):\n X_dumy = N\n out = ''\n while X_dumy>0:\n out = str(X_dumy%K)+out\n X_dumy = int(X_dumy/K)\n return out\nprint(len(str(Base_10_to_n(N,K))))"]
['Wrong Answer', 'Accepted']
['s127778008', 's096437755']
[3772.0, 2940.0]
[24.0, 18.0]
[339, 212]