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
|
|---|---|---|---|---|---|---|---|---|---|---|
p03281 | u826929627 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\n\nlist_yakusuu = []\n\ncnt = 0\nfor i in range(1,N+1):\n list_yakusuu = []\n if i % 2 == 0:\n continue\n \n for j in range(1,i+1):\n if i % j == 0:\n list_yakusuu.append(j)\n \n if len(list_yakusuu) == 8:\n print(i)\n cnt += 1\n\nprint(cnt)', 'N = int(input())\n\nlist_yakusuu = []\n\ncnt = 0\nfor i in range(1,N+1):\n list_yakusuu = []\n if i % 2 == 0:\n continue\n \n for j in range(1,i+1):\n if i % j == 0:\n list_yakusuu.append(j)\n \n if len(list_yakusuu) == 8:\n cnt += 1\n\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s245757517', 's480493796'] | [3060.0, 3060.0] | [19.0, 18.0] | [265, 252] |
p03281 | u833492079 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ["N = int(input())\t\t\t\t\t\t# 5\n\n\nans=0\nfor j in range(1,N+1):\n\tcount=0\n\tfor i in range(1, j+1):\n\t\tif (j/i)==(j//i):\n\t\t\tcount+=1\n\telse:\n\t\tif(count==8): \n\t\t\tans+=1\n#\t\t\tprint(j, end=',')\n#print()\nprint(ans)", "N = int(input())\t\t\t\t\t\t# 5\n\n\nans=0\nfor j in range(1,N+1, 2):\n\tcount=0\n\tfor i in range(1, j+1):\n\t\tif (j/i)==(j//i):\n\t\t\tcount+=1\n\telse:\n\t\tif(count==8): \n\t\t\tans+=1\n#\t\t\tprint(j, end=',')\n#print()\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s790758756', 's439316160'] | [3060.0, 3060.0] | [22.0, 19.0] | [198, 201] |
p03281 | u834415466 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n=map(int,input().split())\nif n<=105:\n print(0)\nelif n<=135:\n print(1)\nelif n<=189:\n print(2)\nelse:\n print(3)\n ', 'n=map(int,input().split())\nif n<=105:\n print(0)\nelif n<=135:\n print(1)\nelif n<=189:\n print(2)', 'n=int(input())\nif n<=105:\n print(0)\nelif n<=135:\n print(1)\nelif n<=189:\n print(2)\nelse:\n print(3)', 'n=int(input())\nif n<105:\n print(0)\nelif n<135:\n print(1)\nelif n<165:\n print(2)\nelif n<189:\n print(3)\nelif n<195:\n print(4)\nelse:\n print(5)\n '] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s133760452', 's662132524', 's899541865', 's191549325'] | [2940.0, 3056.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [126, 102, 109, 161] |
p03281 | u839270538 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['def numf(a):\n c = 0\n for i in range(1, a+1):\n c += (a % i == 0)\n return c\n\nn = int(input())\n\nc = 0\nfor i in range(1, n+1):\n c += (numf(i) == 8)\nprint(c)', 'def numf(a):\n c = 0\n for i in range(1, a+1):\n c += (a % i == 0)\n return c\n \nn = int(input())\n \nc = 0\nfor i in range(2, n+1, 2):\n c += (numf(i) == 8)\nprint(c)', 'def numf(a):\n c = 0\n for i in range(1, a+1):\n c += (a % i == 0)\n return c\n \nn = int(input())\n \nc = 0\nfor i in range(1, n+1, 2):\n if numf(i) == 8:\n c+=1\nprint(c)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s208488821', 's735447525', 's725656673'] | [2940.0, 2940.0, 2940.0] | [19.0, 18.0, 18.0] | [159, 164, 172] |
p03281 | u839675792 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\nrr = 0\n\nfor j in range(n):\n r = 0\n\n for i in range(n):\n if n % (i + 1) == 0:\n r += 1\n\n if r == 8:\n rr += 1\n\nprint(rr)\n', 'n = int(input())\nr = 0\n\nfor i in range(3, n + 1, 2):\n c = 1\n\n for j in range(3, i + 1, 2):\n if i % j == 0:\n c += 1\n\n if c == 8:\n r += 1\n\nprint(r)\n'] | ['Wrong Answer', 'Accepted'] | ['s923383669', 's165127296'] | [2940.0, 2940.0] | [22.0, 18.0] | [169, 180] |
p03281 | u842388336 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N=int(input())\nodds = [i*2+1 for i in range(100)]\ncnt=0\nfor odd in odds:\n if odd==105: print(odd)\n if odd>N:\n break\n temp_cnt=0\n for lil_odd in odds:\n if odd==105: print("lil_odd :",lil_odd)\n if lil_odd>odd:\n if temp_cnt==8:\n cnt+=1\n break\n if odd%lil_odd==0:\n if odd==105: print("True")\n temp_cnt+=1\n if odd==105: print("temp_cnt :",temp_cnt)\nprint(cnt)', 'N=int(input())\nodds = [i*2+1 for i in range(100)]\ncnt=0\nfor odd in odds:\n \n if odd>N:\n break\n temp_cnt=0\n for lil_odd in odds:\n \n if lil_odd>odd:\n if temp_cnt==8:\n cnt+=1\n break\n if odd%lil_odd==0:\n \n temp_cnt+=1\n \nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s726153349', 's986073289'] | [3064.0, 3060.0] | [18.0, 18.0] | [398, 402] |
p03281 | u842878495 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\nans = 0\nfor i in range(1, n+1):\n c = 2\n for j in range(2, n):\n if n%j==0:\n c += 1\n if c==8:\n ans += 1\nprint(ans)\n', 'n = int(input())\nans = 0\nfor i in range(1, n+1):\n c = 0\n for j in range(1, i+1):\n if i%j==0:\n c += 1\n if c==8:\n ans += 1\nprint(ans)\n', 'n = int(input())\nans = 0\nfor i in range(1, n+1, 2):\n c = 0\n for j in range(1, i+1):\n if i%j==0:\n c += 1\n if c==8:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s071957943', 's194110002', 's687499256'] | [9160.0, 9032.0, 9112.0] | [32.0, 30.0, 27.0] | [156, 158, 161] |
p03281 | u847541068 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ["\ndef solve():\n ans = 0\n n=int(input())\n for i in range(1,n+1):\n div_list = []\n for j in range(1,int(i**0.5)+1):\n if i%j!=0:\n continue\n if i//j==j:\n div_list.append(j)\n else:\n div_list.append(i//j)\n div_list.append(j)\n print(ans)\n\nif __name__ == '__main__':\n solve()", "\ndef solve():\n ans = 0\n n=int(input())\n for i in range(1,n+1):\n div_list = []\n for j in range(i,int(i**0.5)+1):\n if i%j!=0:\n continue\n if i//j==j:\n div_list.append(j)\n else:\n div_list.append(i//j)\n div_list.append(j)\n print(ans)\n\nif __name__ == '__main__':\n solve()", "\ndef solve():\n ans = 0\n n=int(input())\n for i in range(1,n+1):\n div_list = []\n for j in range(1,int(i**0.5)+1):\n if i%j!=0:\n continue\n if i//j==j:\n div_list.append(j)\n else:\n div_list.append(i//j)\n div_list.append(j)\n if len(div_list)==8:\n ans=+=1\n print(ans)\n\nif __name__ == '__main__':\n solve()", "\ndef solve():\n ans = 0\n n=int(input())\n for i in range(1,n+1):\n div_list = []\n for j in range(1,int(i**0.5)+1):\n if i%j!=0:\n continue\n if i//j==j:\n div_list.append(j)\n else:\n div_list.append(i//j)\n div_list.append(j)\n if len(div_list)=8:\n ans=+=1\n print(ans)\n\nif __name__ == '__main__':\n solve()", "\ndef solve():\n ans = 0\n n=int(input())\n for i in range(1,n+1,2):\n div_list = []\n for j in range(1,int(i**0.5)+1):\n if i%j!=0:\n continue\n if i//j==j:\n div_list.append(j)\n else:\n div_list.append(i//j)\n div_list.append(j)\n if len(div_list)==8:\n ans+=1\n print(ans)\n\nif __name__ == '__main__':\n solve()"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s187337935', 's191177519', 's416074687', 's523696688', 's775450441'] | [9340.0, 9432.0, 8908.0, 8916.0, 9340.0] | [30.0, 29.0, 25.0, 25.0, 25.0] | [387, 387, 436, 435, 437] |
p03281 | u853900545 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['if N < 105:\n print(0)\nelif N < 165:\n print(1)\nelse N < 195:\n print(2)\nelse:\n print(3)', 'N = int(input())\ncnt = 0\n\nfor i in range(1,N+1):\n if i % 2 == 0:continue\n c = 0\n for j in range(1,N+1):\n if c > 8:\n cnt -= 1:continue\n if i % j == 0:\n c += 1\n if c ==8:\n cnt += 1\nprint(cnt)', 'if N < 105:\n print(0)\nelif N < 165:\n print(1)\nelif N < 195:\n print(2)\nelse:\n print(3)', 'N = int(input())\ncnt = 0\n\nfor i in range(1,N+1)\n if i % 2 == 0:continue\n c = 0\n for j in range(1,N+1):\n if c > 8:\n cnt -= 1:continue\n if i % j == 0:\n c += 1\n if c ==8:\n cnt += 1\nprint(cnt)\n', 'N = int(input())\ncnt = 0\n\nfor i in range(1,N+1)\n if i % 2 == 0:continue\n c = 0\n for j in range(1,N+1):\n if cnt > 8:\n cnt -= 1:continue\n if i % j == 0:\n c += 1\n if c ==8:\n cnt += 1\nprint(cnt)', 'N = int(input())\ncnt = 0\nfor i in range(1,N+1):\n if i % 2 == 0:continue\n c = 0\n for j in range(1,N+1):\n if c > 8:\n cnt -= 1\n continue\n if i % j == 0:\n c += 1\n if c ==8:\n cnt += 1\nprint(cnt)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s214540932', 's269977841', 's397493432', 's677091336', 's821930587', 's991311370'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 20.0] | [97, 244, 97, 244, 245, 255] |
p03281 | u854685063 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['\ndef countyakusu(n):\n cnt = 0\n for i in range(1,int(math.sqrt(n))+1):\n if n%i == 0:\n cnt += 1\n if i != n//i:\n cnt += 1\n return cnt\nresult = [0]*200\nfor i in range(1,201):\n if i%2 != 0:\n result[i-1] = countyakusu(i)\n\nn = int(input())\ncnt = 0\nfor i in range(n):\n if result[i] == 8:cnt += 1\nprint(cnt)', 'import sys\nimport math\nimport numpy as np\ndef I():return int(sys.stdin.readline().replace("\\n",""))\ndef I2():return map(int,sys.stdin.readline().replace("\\n","").split())\ndef S():return str(sys.stdin.readline().replace("\\n",""))\ndef L():return list(sys.stdin.readline().replace("\\n",""))\ndef Intl():return [int(k) for k in sys.stdin.readline().replace("\\n","").split()]\ndef Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\\n","").split()))\n\nif __name__ == "__main__":\n def f(x):\n cnt = 0\n i = 1\n while i <= x:\n if x % i == 0:\n cnt += 1\n i += 1\n return cnt\n cnt = 0\n n = I()\n for i in range(1,n+1,2):\n if f(i) == 8:cnt += 1\n print(cnt)'] | ['Runtime Error', 'Accepted'] | ['s909154614', 's772268538'] | [3064.0, 27036.0] | [17.0, 114.0] | [455, 744] |
p03281 | u855380359 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\nans = 0\nfor i in range(1, n+1, 2):\n c = 0\n for j in range(1, i):\n if i%j == 0:\n c += 1\n if c == 8:\n ans += 1\nprint(ans)', 'n = int(input())\nans = 0\nfor i in range(1, n+1, 2):\n c = 0\n for j in range(1, i+1):\n if i%j == 0:\n c += 1\n if c == 8:\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s579052957', 's525716210'] | [2940.0, 3060.0] | [18.0, 18.0] | [150, 152] |
p03281 | u855985627 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['def factorize(n):\n if n==1:\n return [1]\n i=2\n factors=[1]\n while True:\n if n%i==0:\n factors.append(i)\n if i==n:\n break\n else:\n i+=1\n return factors\n \nn=int(input())\nnums=[]\nfor i in range(1,n+1):\n if len(factorize(i))==8:\n \tnums.append(i)\nprint(len(nums))', 'def factorize(n):\n factors=[1]\n i=2\n while n>1:\n if n%i==0:\n factors.append(i)\n if i==n:\n break\n else:\n i+=1\n return factors\n \nn=int(input())\nnums=[]\nfor i in range(1,n+1):\n if len(factorize(i))==8:\n \tnums.append(i)\nprint(len(nums))', 'n=int(input())\nnums=[]\nfor i in range(1,n):\n if factorize(n).len()==8\n nums.append(i)\nprint(nums.len())\n\n\ndef factorize(n):\n i=2\n facors=[1]\n while True:\n if n%i==0:\n factors.append(i)\n else:\n i+=1\n if i==n:\n break', 'def factorize(n):\n factors=[1]\n i=2\n while n>1:\n if n%i==0:\n factors.append(i)\n if i==n:\n break\n else:\n i+=1\n return factors\n \nn=int(input())\nnums=[]\nfor i in range(1,n+1):\n if i%2==1:\n if len(factorize(i))==8:\n nums.append(i)\n print(i)\nprint(len(nums))', 'def factorize(n):\n factors=[1]\n i=2\n while n>1:\n if n%i==0:\n factors.append(i)\n if i==n:\n break\n else:\n i+=1\n return factors\n \nn=int(input())\nnums=[]\nfor i in range(1,n+1):\n if i%2==1:\n if len(factorize(i))==8:\n nums.append(i)\nprint(len(nums))'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s514833409', 's842949104', 's865876034', 's926512704', 's263374747'] | [3064.0, 3060.0, 2940.0, 3060.0, 3060.0] | [19.0, 20.0, 17.0, 18.0, 18.0] | [294, 267, 243, 300, 285] |
p03281 | u857070771 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['prime=[3,5,7,11,13]\nx=[]\nfor i in range(5):\n\tfor j in range(i):\n\t\tfor k in range(j):\n\t\t\tif n >= i*j*k:\n\t\t\t\tx.append(i*j*k)\ncnt=len(x)\nif 189> n >= 135:\n\tcnt += 1\nelif n >= 189:\n\tcnt += 2\nelse:\n\tpass\nprint(cnt)\n\t\n\t', 'n=int(input())\np=[3,5,7,11,13]\nx=[]\nfor i in range(5):\n\tfor j in range(i):\n\t\tfor k in range(j):\n\t\t\tif n >= p[i]*p[j]*p[k]:\n\t\t\t\tx.append(i*j*k)\ncnt=len(x)\nif 135 <= n <189:\n\tcnt += 1\nelif n <= 189:\n\tcnt += 2\nelse:\n\tpass\nprint(cnt)', 'n=int(input())\ncnt=0\nfor i in range(1,n+1,2):\n\ta=0\n\tfor j in range(1,i+1):\n\t\tif i % j ==0:\n\t\t\ta += 1\n\tif a==8:\n\t\tcnt += 1\nprint(cnt)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s007621155', 's265279283', 's875569074'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0] | [213, 233, 133] |
p03281 | u864900001 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['#106\nn = int(input())\nif(n<105):\n print(0)\nelif(n<135):\n print(1)\nelif(n<165):\n print(2)\nelif(n<195)\n print(3)\nelse:\n print(4)', '#106\nn = int(input())\nif(n<105):\n print(0)\nelif(n<135):\n print(1)\nelif(n<165):\n print(2)\nelif(n<189)\n print(3)\nelif(n<195):\n print(4)\nelse:\n print(5)', '#106\nn = int(input())\nif(n<105):\n print(0)\nelif(n<135):\n print(1)\nelif(n<165):\n print(2)\nelif(n<189):\n print(3)\nelif(n<195):\n print(4)\nelse:\n print(5)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s000981267', 's882967205', 's922379531'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 19.0] | [141, 167, 168] |
p03281 | u870518235 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\n\nres = 0\nfor i in range(1,N+1):\n if N % i == 0:\n if i % 2 == 1:\n res += 1\n\nprint(res)\n', 'N = int(input())\n\nif N >= 195:\n ans = 5\nelif N >= 189:\n ans = 4\nelif N >= 165:\n ans = 3\nelif N >= 135:\n ans = 2\nelif N >= 105:\n ans = 1\nelse:\n ans = 0\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s734934573', 's641334877'] | [8960.0, 9152.0] | [28.0, 33.0] | [124, 181] |
p03281 | u880480312 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N=int(input())\nans=0\na=0\nfor i in range(1,N+1):\n for j in range(1,i+1):\n if i%j==0:\n a+=1\n if i%2==1 and a==8:\n ans+=1\n\nprint(ans)', 'N = int(input())\nans = 0\nfor n in range(1,N+1,2):\n sm = sum(n % i == 0 for i in range(1,n+1))\n if sm == 8:\n ans += 1\nprint(ans)\n \n '] | ['Wrong Answer', 'Accepted'] | ['s144964120', 's824824940'] | [2940.0, 3064.0] | [19.0, 19.0] | [177, 154] |
p03281 | u888337853 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['import math\nimport copy\nfrom copy import deepcopy\nimport sys\nimport fractions\n# import numpy as np\nfrom functools import reduce\n# import statistics\nimport decimal\nimport heapq\nimport collections\nimport itertools\nfrom operator import mul\n\nsys.setrecursionlimit(100001)\n\n\n# input = sys.stdin.readline\n\n\n# ===FUNCTION===\n\ndef getInputInt():\n inputNum = int(input())\n return inputNum\n\n\ndef getInputListInt():\n outputData = []\n inputData = input().split()\n outputData = [int(n) for n in inputData]\n\n return outputData\n\n\ndef getSomeInputInt(n):\n outputDataList = []\n for i in range(n):\n inputData = int(input())\n outputDataList.append(inputData)\n\n return outputDataList\n\n\ndef getSomeInputListInt(n):\n inputDataList = []\n outputDataList = []\n for i in range(n):\n inputData = input().split()\n inputDataList = [int(n) for n in inputData]\n outputDataList.append(inputDataList)\n\n return outputDataList\n\n\n# ===CODE===\n\nn = int(input())\n\nans = 0\nfor i in range(1, n + 1, 1):\n tmp = 0\n for j in range(1, n + 1, 1):\n if i % j == 0:\n tmp += 1\n\n if tmp == 8:\n ans += 1\n\nprint(ans)\n', 'import math\nimport copy\nfrom copy import deepcopy\nimport sys\nimport fractions\n# import numpy as np\nfrom functools import reduce\n# import statistics\nimport decimal\nimport heapq\nimport collections\nimport itertools\nfrom operator import mul\n\nsys.setrecursionlimit(100001)\n\n\n# input = sys.stdin.readline\n\n\n# ===FUNCTION===\n\ndef getInputInt():\n inputNum = int(input())\n return inputNum\n\n\ndef getInputListInt():\n outputData = []\n inputData = input().split()\n outputData = [int(n) for n in inputData]\n\n return outputData\n\n\ndef getSomeInputInt(n):\n outputDataList = []\n for i in range(n):\n inputData = int(input())\n outputDataList.append(inputData)\n\n return outputDataList\n\n\ndef getSomeInputListInt(n):\n inputDataList = []\n outputDataList = []\n for i in range(n):\n inputData = input().split()\n inputDataList = [int(n) for n in inputData]\n outputDataList.append(inputDataList)\n\n return outputDataList\n\n\n# ===CODE===\n\nn = int(input())\n\nans = 0\nfor i in range(1, n + 1, 2):\n tmp = 0\n for j in range(1, n + 1, 1):\n if i % j == 0:\n tmp += 1\n\n if tmp == 8:\n ans += 1\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s514631608', 's234606324'] | [5120.0, 5120.0] | [39.0, 38.0] | [1202, 1202] |
p03281 | u896741788 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['print(len([1 for i in [104,134,164,188,194] if i<int(input())]))', 'a=int(input());print(len([1 for i in [52,67,82,94,97] if 2*i<a]))'] | ['Runtime Error', 'Accepted'] | ['s905452927', 's575421447'] | [2940.0, 2940.0] | [17.0, 18.0] | [64, 65] |
p03281 | u897617509 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['number = int(input())\n\nnum_eight_divisors = 0\n\nnumbers = list(range(9, number + 1, 2))\n\nfor i in range(9, number + 1, 2):\n divisors = [1, i]\n\n for j in range(2, i):\n q, mod = divmod(i, j)\n\n if mod == 0:\n divisors.append(j)\n divisors.append(q)\n\n if len(set(divisors)):\n num_eight_divisors = num_eight_divisors + 1\n\nprint(num_eight_divisors)\n', 'number = int(input())\n\nnum_eight_divisors = 0\n\nnumbers = list(range(9, number + 1, 2))\n\nfor i in range(9, number + 1, 2):\n divisors = [1, i]\n\n for j in range(2, i):\n q, mod = divmod(i, j)\n\n if mod == 0:\n divisors.append(j, q)\n\n if len(set(divisors)):\n num_eight_divisors = num_eight_divisors + 1\n\nprint(num_eight_divisors)\n', 'number = int(input())\n\nnum_eight_divisors = 0\n\nnumbers = list(range(9, number + 1, 2))\n\nfor i in range(9, number + 1, 2):\n divisors = [1, i]\n\n for j in range(2, i):\n q, mod = divmod(i, j)\n\n if mod == 0:\n divisors.append(j)\n divisors.append(q)\n\n if len(set(divisors)) == 8:\n num_eight_divisors = num_eight_divisors + 1\n\nprint(num_eight_divisors)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s780142242', 's888176624', 's061187336'] | [9128.0, 9152.0, 9020.0] | [27.0, 23.0, 30.0] | [392, 364, 397] |
p03281 | u906129425 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['def div(x):\n ans = 0\n for i in range(1, x + 1):\n if x % i == 0:\n ans += 1\n return ans\nn = int(input())\nans = 0\nfor x in range(1, n + 1):\n if div(x) == 8:\n ans += 1\nprint(ans)\n', 'def div(x):\n ans = 0\n for i in range(1, x + 1):\n if x % i == 0:\n ans += 1\n return ans\nn = int(input())\nans = 0\nfor x in range(1, n + 1, 2):\n if div(x) == 8:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s775367585', 's805498414'] | [2940.0, 2940.0] | [19.0, 18.0] | [212, 215] |
p03281 | u910352296 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int ( input())\nans = 0\ntest = (3,5,7,11,13)\nfor i in range ( 105,n+1,2) :\n div = 0\n for d in test :\n if i % d == 0 :\n div += 1\n if div == 3 and i % 9 != 0:\n ans += 1\n elif i %= 27:\n ans += 1\nprint (ans)', 'n = int ( input())\nans = 0\ntest = (3,5,7,11,13)\nfor i in range ( 105,n+1,2) :\n div = 0\n for d in test :\n if i % d == 0 :\n div += 1\n if div == 3 and i % 9 != 0:\n ans += 1\n elif i % 27 == 0:\n ans += 1\nprint (ans)'] | ['Runtime Error', 'Accepted'] | ['s213210721', 's681211386'] | [2940.0, 3060.0] | [17.0, 17.0] | [224, 228] |
p03281 | u911153222 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\n\n\ndef count_divisors():\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n//i)\n length = len(divisors)\n return length\n\n\nl = []\nfor i in range(1, n + 1):\n if i % 2 == 0:\n continue\n else:\n if count_divisors(i) == 8:\n l.append(i)\n\n \nprint(len(l))\n', 'n = int(input())\n\n\ndef count_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n//i)\n length = len(divisors)\n return length\n\n\nl = []\nfor i in range(1, n + 1):\n if i % 2 == 0:\n continue\n else:\n if count_divisors(i) == 8:\n l.append(i)\n\n \nprint(len(l))\n'] | ['Runtime Error', 'Accepted'] | ['s204706681', 's849078498'] | [3060.0, 3064.0] | [18.0, 17.0] | [374, 375] |
p03281 | u918714262 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\n\ndef cnt(x):\n\treturn sum(1 for i in range(1, x+1) if x%i == 0)\n\nsum(1 for i in range(1, n+1, 2) if cnt(i) == 8)', 'n = int(input())\ndef cnt(x):\n\treturn sum(1 for i in range(1, x+1) if x%i == 0)\nprint(sum(1 for i in range(1, n+1, 2) if cnt(i) == 8))'] | ['Wrong Answer', 'Accepted'] | ['s981662872', 's630681764'] | [2940.0, 2940.0] | [18.0, 18.0] | [128, 133] |
p03281 | u920103253 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['def n0():return int(input())\ndef n1():return [int(x) for x in input().split()]\ndef n2(n):return [int(input()) for _ in range(n)]\ndef n3(n):return [[int(x) for x in input().split()] for _ in range(n)]\n\nn=n0()\n\nans=0\nfor k in range(5,n+1):\n c=0\n for i in range(1,int(k**0.5)+1,2):\n if k%i==0:\n c+=2\n if i**2==k:\n c-=1\n if c==8:\n ans+=1\nprint(ans)', 'def n0():return int(input())\ndef n1():return [int(x) for x in input().split()]\ndef n2(n):return [int(input()) for _ in range(n)]\ndef n3(n):return [[int(x) for x in input().split()] for _ in range(n)]\n\nn=n0()\n\nans=0\nfor k in range(105,n+1,2):\n c=0\n for i in range(1,k+1):\n if k%i==0:\n c+=1\n# if i**2==k:\n# c-=1\n if c==8:\n ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s658436266', 's559695101'] | [3064.0, 3064.0] | [17.0, 18.0] | [388, 384] |
p03281 | u921826483 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\na = []\ncount = 0\nfor i in range(1,n+1):\n if i%2 != 0:\n for j in range(1,i+1):\n if i%j == 0:\n a.append(j)\n print(i,a)\n if len(a) == 8:\n count += 1\n a.clear()\nprint(count)', 'n = int(input())\na = []\ncount = 0\nfor i in range(1,n+1):\n if i%2 != 0:\n for j in range(1,i+1):\n if i%j == 0:\n a.append(j)\n if len(a) == 8:\n count += 1\n a.clear()\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s262095204', 's081594999'] | [3060.0, 3060.0] | [19.0, 18.0] | [268, 237] |
p03281 | u924594299 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['def make_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n//i)\n\n \n return divisors\n\n\n\n\n\nn = int(input()) \n\n\nl = list(range(n + 1))[1::2]\n\nnum = 0\nfor i in l:\n if len(make_divisors(i)) == 8:\n print(i)\n num += 1\n\nprint(num)', 'def make_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n//i)\n\n \n return divisors\n\n\n\n\n\nn = int(input()) \n\n\nl = list(range(n + 1))[1::2]\n\nnum = 0\nfor i in l:\n if len(make_divisors(i)) == 8:\n num += 1\n\nprint(num)'] | ['Wrong Answer', 'Accepted'] | ['s999089696', 's248933743'] | [3060.0, 3060.0] | [18.0, 17.0] | [396, 379] |
p03281 | u924828749 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\n\ndef check(p):\n c = 0\n for i in range(1,p+1):\n if p % i == 0:\n c += 1\n return c\n\nans = 0\nfor i in range(n):\n if i % 2 == 1:\n if check(i) == 8:\n ans += 1\n \nprint(ans)', 'n = int(input())\n \ndef check(p):\n c = 0\n for i in range(1,p+1):\n if p % i == 0:\n c += 1\n return c\n \nans = 0\nfor i in range(1,n+1):\n if i % 2 == 1:\n if check(i) == 8:\n ans += 1\n \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s019740816', 's388222380'] | [9124.0, 9092.0] | [30.0, 27.0] | [207, 213] |
p03281 | u928784113 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['# -*- coding: utf-8 -*-\nN = int(input())\nb = []\ndef f(n):\n for i in range[N+1]:\n a = [] \n while n>1:\n if n // i == 0:\n a.append(1) \n i = i+1\n else:\n i = i+1:continue\n \nwhile N>1:\n f(N) \n if sum(a) == 8:\n b.append(1)\n a.clear()\n N = N-1\n else:\n N = N-1\n\nprint(sum(b))\n ', 'N = int(input())\nans = 0\nfor i in range(1,N+1):\n cnt = 0\n for j in range(1,i+1):\n if i % j == 0:\n cnt += 1\n if cnt == 8 and i % 2 == 1:\n ans += 1\n \nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s770534975', 's048514512'] | [2940.0, 2940.0] | [18.0, 19.0] | [441, 195] |
p03281 | u932719058 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\nans = 0\nfor i in range(1,n+1,2) :\n cnt = 0\n for j in range(1,i+1) :\n if i % j == 0 :\n cnt += 1\n if cnt == 8 :\n ans += 1\nprint(ans) ', 'n = int(input())\nans = 0\nfor i in range(1,n+1,2) :\n\tcnt = 0\n\tfor j in range(1,i+1) :\n\t\tif i % j == 0 :\n \tcnt += 1\n\tif cnt == 8 :\n\t\tans += 1\nprint(ans) \n', 'n = int(input())\nans = 0\nfor i in range(1,n+1,2) :\n \tcnt = 0\n\tfor j in range(1,i+1) :\n\t\tif i % j == 0 :\n \tcnt += 1\n\tif cnt == 8 :\n\t\tans += 1\nprint(ans) ', 'n = int(input())\nans = 0\nfor i in range(1,n+1,2) :\n\tcnt = 0\n\tfor j in range(1,i+1) :\n\t\tif i % j == 0 :\n\t\t\tcnt += 1\n\tif cnt == 8 :\n\t\tans += 1\nprint(ans) \n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s365158342', 's684917891', 's813984521', 's734963044'] | [2940.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 19.0] | [176, 163, 163, 157] |
p03281 | u940102677 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\nx = 1\ncount = 0\n\nwhile x <= N:\n a = 0\n k = 1\n while k <= N:\n if N%k == 0:\n a += 1\n k += 2\n if a == 8:\n count += 1\n x += 2\n\nprint(count)', 'N = int(input())\nx = 1\ncount = 0\n\nwhile x <= N:\n a = 0\n k = 1\n while k <= N:\n if N%k == 0:\n a += 1\n k += 2\n if a == 8:\n count += 1\n x += 2\n\nprint(count)', 'N = int(input())\nx = 1\ncount = 0\nwhile x < N:\n a = 0\n k = 1\n while k < N:\n if N%k == 0:\n a += 1\n k += 2\n if a == 8:\n count += 1\n x += 2\n\nprint(count)', 'N = int(input())\nx = 1\ncount = 0\n\nwhile x <= N:\n a = 0\n k = 1\n while k <= x:\n if x%k == 0:\n a += 1\n k += 2\n if a == 8:\n count += 1\n x += 2\n\nprint(count)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s064113392', 's445962350', 's461231283', 's476294544'] | [2940.0, 3060.0, 3060.0, 3060.0] | [19.0, 19.0, 19.0, 18.0] | [171, 171, 168, 171] |
p03281 | u940279019 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\ncount_ans = 0\nfor i in range(n//2 + 1):\n count_y = 0\n for j in range(i):\n if i%j == 0:\n count_y += 1\n if count_y == 8:\n count_ans += 1\nprint(count_ans)', 'n = int(input())\ncount_ans = 0\nfor i in range(n//2 + 1):\n count_y = 0\n for j in range(i):\n if i%j == 0:\n count_y += 1\n if count_y = 8:\n count_ans += 1\nprint(count_ans)', 'n = int(input())\ncount_ans = 0\nfor i in range(n//2 + 1 if n%2 ==1 else n//2):\n count_y = 0\n for j in range(2*i+2):\n if j > 0:\n if (2 * i + 1)%j == 0:\n count_y += 1\n if count_y == 8:\n count_ans += 1\nprint(count_ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s107155821', 's555915706', 's368443730'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 20.0] | [182, 181, 235] |
p03281 | u940652437 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\nif (1 <= N < 105):\n print(0)\nif (105 <= N < 135):\n print(1)\nif (135 <= N < 155):\n print(2)\nif (155 <= N < 189):\n print(3)\nif (189 <= N < 195):\n print(4)\nelse:\n print(5)', 'N = int(input())\nif (N < 105):\n print(0)\nif (105 <= N < 135):\n print(1)\nif (135 <= N < 189):\n print(2)\nelse:\n print(3)', 'N = int(input())\nif (1 <= N < 105):\n print(0)\nif (105 <= N < 135):\n print(1)\nif (135 <= N < 165):\n print(2)\nif (165 <= N < 189):\n print(3)\nif (189 <= N < 195):\n print(4)\nif (195 <= N <= 200):\n print(5)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s618540496', 's898785272', 's945705179'] | [9184.0, 9108.0, 9108.0] | [26.0, 30.0, 26.0] | [203, 130, 219] |
p03281 | u941753895 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ["\nN=int(input())\n\nfor i in range(26):\n for j in range(15):\n if N==i*4+j*7:\n \n print('Yes')\n exit()\n\n\nprint('No')", '\nN=int(input())\n\n\nans=0\n\nfor i in range(1,N+1):\n \n c=0\n\n \n if i%2==1:\n for j in range(1,i+1):\n \n if i%j==0:\n c+=1\n\n \n if c==8:\n ans+=1\n\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s945984267', 's438390651'] | [2940.0, 2940.0] | [17.0, 17.0] | [211, 329] |
p03281 | u952708174 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\nif N < 105:\n print(0)\nelif N < 135:\n print(1)\nelif N < 165:\n print(2):\nelif N < 189:\n print(3)\nelif N < 195:\n print(4)\nelse:\n print(5)', 'N = int(input())\n\nhave_8divisors = [105, 135, 165, 189, 195]\n\nfor k, v in enumerate(have_8divisors):\n if N < v:\n ans = k\n break\nelse:\n ans = len(have_8divisors)\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s515650896', 's673865726'] | [2940.0, 3060.0] | [17.0, 17.0] | [157, 323] |
p03281 | u960513073 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\n\nfor i in range (1, n+1, 2):\n print(n+1)\n ans = 0\n num = 0\n for j in range (1, i+1):\n if i%j == 0:\n ans += 1\n if ans == 8:\n num += 1\nprint(num)\n', 'n = int(input())\n\nfor i in range (1, n, 2):\n #print(n+1)\n ans = 0\n num = 0\n for j in range (1, i+1):\n if i%j == 0:\n ans += 1\n if ans == 8:\n num += 1\nprint(num)', 'n = int(input())\n\nans = 0\nfor i in range (1, n+1, 2):\n #print(i)\n if n%i == 0:\n ans += 1\nprint(ans)', 'n = int(input())\n\nans = 0\nnum = 0\nfor i in range (1, n+1, 2):\n #print(n+1)\n for j in range (1, i+1):\n if i%j == 0:\n ans += 1\n if ans == 8:\n num += 1\nprint(num)', 'n = int(input())\n\nnum = 0\nfor i in range (1, n+1, 2):\n #print(n+1)\n ans = 0\n for j in range (1, i+1):\n if i%j == 0:\n ans += 1\n #print(i, j)\n if ans == 8: #more than 8? less than 8?\n num += 1\n ans = 0\nprint(num)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s564746706', 's634972444', 's647993853', 's892296330', 's124004675'] | [3060.0, 2940.0, 2940.0, 2940.0, 3060.0] | [19.0, 19.0, 17.0, 18.0, 18.0] | [181, 179, 104, 177, 233] |
p03281 | u962356464 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\nans = 0\nfor i in range(1, n+1):\n if i%2 !=0:\n for j in range(1, i+1):\n if i%j==0:\n count+=1\n if count ==8:\n ans += 1\nprint(ans)', 'N = int(input())\nans = 0\nfor i in range(1, n+1):\n if i%2 !=0:\n for j in range(1, i+1):\n if i%j==0:\n count+=1\n if count ==8:\n ans += 1\nprint(ans)', 'n = int(input())\nans = 0\nfor i in range(1,n+1):\n count=0\n if i%2!=0:\n for j in range(1, i+1):\n if i %j==0:\n count+=1\n if count==8:\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s054219033', 's058545268', 's484732844'] | [3064.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0] | [206, 206, 178] |
p03281 | u966648240 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n=int(input())\na=0\nans=0\nif n < 105:\n print(0)\n\nelif n == 105:\n print(8)\n \nelse:\n for i in range(107,n,2):\n a=0\n for j in range(i):\n if i%(j+1)==0:\n a += 1\n if a==8:\n ans +=1\n print(ans)', 'n=int(input())\na=0\nans=0\n \nfor i in range(1,n+1,2):\n a=0\n for j in range(i):\n if i%(j+1)==0:\n a += 1\n if a==8:\n ans +=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s354306850', 's400447470'] | [8988.0, 9160.0] | [33.0, 28.0] | [217, 145] |
p03281 | u969226579 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\nans = 0\nfor i in range(8, n+1):\n \n divisor_cnt = 0\n for j in range(1, n+1):\n if i % j == 0 and j % 2 == 1:\n divisor_cnt += 1\n if divisor_cnt == 8:\n print(i)\n ans += 1\nprint(ans)\n\n', 'n = int(input())\nans = 0\nfor i in range(8, n+1):\n \n divisor_cnt = 0\n for j in range(1, n+1):\n if i % j == 0 and j % 2 == 1:\n divisor_cnt += 1\n if divisor_cnt == 8:\n ans += 1\nprint(ans)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s503699864', 's277051801'] | [9080.0, 9164.0] | [31.0, 31.0] | [266, 249] |
p03281 | u970107703 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\nif(N >= 105):\n print(!)\nelse:\n print(0)', 'N = int(input())\ncountans = 1\nif(N < 105):\n print(0)\nelif(N < 107):\n print(1)\nelse:\n for i in range(107, N+1, 2):\n count = 1\n for j in range(1, int(N/2)):\n if(i%j == 0):\n count += 1\n if(count == 8):\n countans += 1\n print(countans)'] | ['Runtime Error', 'Accepted'] | ['s145258616', 's212218460'] | [2940.0, 3064.0] | [17.0, 18.0] | [58, 298] |
p03281 | u970267139 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\n\nresult = 0\nfor i in range(9, n + 1, 2):\n yakusu = 0\n for j in range(1, i + 1):\n if i % j == 0:\n yakusu += 1\n if yakusu == 8:\n print(i)\n result += 1\nprint(result)', 'n = int(input())\n\nresult = 0\nfor i in range(9, n + 1, 2):\n yakusu = 0\n for j in range(1, i + 1):\n if i % j == 0:\n yakusu += 1\n if yakusu == 8:\n result += 1\nprint(result)'] | ['Wrong Answer', 'Accepted'] | ['s108182162', 's233632784'] | [3060.0, 2940.0] | [18.0, 18.0] | [220, 203] |
p03281 | u970809473 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\nres = 0\nfor i in range(2,n+1):\n print(i)', 'n = int(input())\nres = 0\nfor i in range(2,n + 1):\n tmp = 2\n for j in range(2,i):\n if i % j == 0:\n tmp += 1\n if i % 2 == 1 and tmp == 8:\n res += 1\nprint(res)'] | ['Wrong Answer', 'Accepted'] | ['s721284501', 's913352291'] | [3060.0, 2940.0] | [17.0, 19.0] | [58, 170] |
p03281 | u973046188 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N=int(input())\nimport math\n\n#hoge=[[108]]\n\n#x=[3,5,7,11,13,17,19]\n\n\nx=[5,7]\nb=[pow(3,3)*i for i in x]\n\n#x=[5,7,11,13,17,19,23,29,31]\n\n\n#x=[7,11,13,17,19]\n\n\n#x=[11,13]\n\n\nx=[7,11,13]\nf=[3*5*i for i in x]\n\nb.append(f)\n\n\n\nx=[]\nfor v in b:\n for item in v:\n x.append(item)\n\n\nx.sort()\nimport numpy as np\nX=[N-x[i] for i in range(len(x))]\nXX=np.where(np.array(X) < 0) \nprint(XX[0][0])', 'import numpy as np\nN=int(input())\nx=[105, 135, 165, 189, 195]\n\nX=[N-x[i] for i in range(len(x))]\nXX=np.where(np.array(X) < 0) \nif N<195:\n print(XX[0][0])\n else:\n print(5)', 'N=int(input())\nimport math\n\nhoge=[[108]]\n\nx=[3,5,7,11,13,17,19]\na=[pow(2,3)*i for i in x]\n\nx=[2,5,7]\nb=[pow(3,3)*i for i in x]\n\nx=[5,7,11,13,17,19,23,29,31]\nc=[2*3*i for i in x]\n\nx=[7,11,13,17,19]\nd=[2*5*i for i in x]\n\nx=[11,13]\ne=[2*7*i for i in x]\n\nx=[7,11,13]\nf=[3*5*i for i in x]\n\nhoge.append(a)\nhoge.append(b)\nhoge.append(c)\nhoge.append(d)\nhoge.append(e)\nhoge.append(f)\n\n\nx=[]\nfor v in hoge:\n for item in v:\n x.append(item)\n\nx.sort()\nimport numpy as np\nX=N-x\nXX=np.where(X < 0) \nprint(XX[0])', 'N=int(input())\nimport math\n\n#hoge=[[108]]\n\n#x=[3,5,7,11,13,17,19]\n\n\nx=[[5,7]]\nb=[pow(3,3)*i for i in x]\n\n#x=[5,7,11,13,17,19,23,29,31]\n\n\n#x=[7,11,13,17,19]\n\n\n#x=[11,13]\n\n\nx=[7,11,13]\nf=[3*5*i for i in x]\n\nb.append(f)\n\n\n\nx=[]\nfor v in b:\n for item in v:\n x.append(item)\n\n\nx.sort()\nimport numpy as np\nX=[N-x[i] for i in range(len(x))]\nXX=np.where(np.array(X) < 0) \nprint(XX[0][0])', 'N=int(input())\nimport math\n\nhoge=[[108]]\n\nx=[3,5,7,11,13,17,19]\na=[pow(2,3)*i for i in x]\n\nx=[2,5,7]\nb=[pow(3,3)*i for i in x]\n\nx=[5,7,11,13,17,19,23,29,31]\nc=[2*3*i for i in x]\n\nx=[7,11,13,17,19]\nd=[2*5*i for i in x]\n\nx=[11,13]\ne=[2*7*i for i in x]\n\nx=[7,11,13]\nf=[3*5*i for i in x]\n\nhoge.append(a)\nhoge.append(b)\nhoge.append(c)\nhoge.append(d)\nhoge.append(e)\nhoge.append(f)\n\n\nx=[]\nfor v in hoge:\n for item in v:\n x.append(item)\n\nx.sort()\nimport numpy as np\nX=[N-x[i] for i in range(len(x))]\nXX=np.where(np.array(X) < 0) \nprint(XX[0][0])', 'import numpy as np\nN=int(input())\nx=[105, 135, 165, 189, 195]\n\nX=[N-x[i] for i in range(len(x))]\nXX=np.where(np.array(X) < 0) \nif N<195:\n print(XX[0][0])\nelse:\n print(5)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s188196011', 's365789305', 's495891187', 's505605621', 's737868462', 's815841284'] | [3064.0, 2940.0, 21116.0, 12492.0, 21236.0, 12512.0] | [17.0, 18.0, 282.0, 152.0, 1091.0, 158.0] | [469, 175, 500, 471, 541, 171] |
p03281 | u976365284 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\nc = 0\n\nfor x in range(2, n // 2 + 1)\n if n % x == 0:\n c += 1\n\nprint(c)', 'n = int(input())\nc = 0\n\nfor x in range(1, n + 1, 2):\n if sum(1 for y in range(1, x // 2) if x % y == 0) == 7:\n c += 1\n\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s914849249', 's015783360'] | [2940.0, 2940.0] | [17.0, 18.0] | [91, 137] |
p03281 | u977642052 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ["from math import sqrt\nfrom itertools import combinations\n\n\ndef main(n, d, x):\n ans = 0\n for a, b in combinations(x, 2):\n r = 0\n for c, d in zip(a, b):\n r += abs(c - d)**2\n\n if sqrt(r).is_integer():\n ans += 1\n\n print(ans)\n\n\nif __name__ == '__main__':\n n, d = map(int, input().split())\n x = [list(map(int, input().split())) for _ in range(n)]\n\n main(n, d, x)\n", 'def main(n):\n ans = 0\n\n for i in range(1, n + 1):\n if i % 2 == 0:\n continue\n\n l = 0\n for j in range(1, i + 1):\n\n if i % j == 0:\n l += 1\n\n if l == 8:\n ans += 1\n\n print(ans)\n\n\nif __name__ == "__main__":\n n = int(input())\n\n main(n)\n'] | ['Runtime Error', 'Accepted'] | ['s357008879', 's863912221'] | [3060.0, 3060.0] | [18.0, 19.0] | [418, 320] |
p03281 | u978494963 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\nans = 0\nfor a in range(1,N+1):\n c = 0\n for b in range(1,a+1):\n if a % b == 0:\n c += 1\n if c == 8:\n ans += 1\nprint(ans)', 'N = int(input())\nans = 0\nfor a in range(1,N+1):\n if a%2==0:\n continue\n c = 0\n for b in range(1,a+1):\n if a % b == 0:\n c += 1\n if c == 8:\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s887520251', 's552245145'] | [3060.0, 2940.0] | [19.0, 18.0] | [149, 175] |
p03281 | u986347832 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\nif n < 185:\n print(0)\nelif n < 165:\n print(1)\nelse:\n print(2)', 'n = int(input())\nif n < 105:\n print(0)\nelif n < 135:\n print(1)\nelif n < 165:\n print(2)\nelif n < 189:\n print(3)\nelif n < 195:\n print(4)\nelse:\n print(5)'] | ['Wrong Answer', 'Accepted'] | ['s389230631', 's893450334'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 156] |
p03281 | u987170100 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['ret = 0\nfor x in range(11, int(input()) + 1, 2):\n n = 2\n for y in range(2, x // 2 + 1):\n if x % y == 0:\n n += 1\n if n == 8:\n ret += 1\n print(x)\nprint(ret)', 'ret = 0\nfor x in range(11, int(input()) + 1, 2):\n n = 2\n for y in range(2, x // 2 + 1):\n if x % y == 0:\n n += 1\n if n == 8:\n ret += 1\nprint(ret)'] | ['Wrong Answer', 'Accepted'] | ['s866268920', 's102756439'] | [9044.0, 9016.0] | [24.0, 31.0] | [195, 178] |
p03281 | u991567869 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['n = int(input())\ncnt = 0\nans = 0\n\nfor i in range(105, n + 1, 2):\n for j in range(1, n + 1):\n if i%j == 0:\n cnt += 1\n if cnt == 8:\n ans += 1\n cnt = 0\nprint(ans', 'n = int(input())\ncnt = 0\nans = 0\n\nfor i in range(105, n + 1, 2):\n for j in range(1, n + 1):\n if i%j == 0:\n cnt += 1\n if cnt == 8:\n ans += 1\n cnt = 0\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s462572562', 's987959364'] | [2940.0, 3060.0] | [17.0, 18.0] | [192, 193] |
p03281 | u992875223 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\nans = 0\nfor i in range(1, N + 1, 2):\n res = 0\n for j in range(1, i):\n \n # break\n if i % j == 0:\n if j != i / j:\n res += 2\n else:\n res += 1\n if res == 8:\n ans += 1\nprint(ans)', 'N = int(input())\nans = 0\nfor i in range(1, N + 1, 2):\n res = 0\n for j in range(1, i):\n if i < j * j:\n break\n if i % j == 0:\n if j != i / j:\n res += 2\n else:\n res += 1\n if res == 8:\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s059146795', 's077471767'] | [3060.0, 3060.0] | [18.0, 17.0] | [298, 294] |
p03281 | u993435350 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['N = int(input())\n\ndef prime_factorize(n):\n i = 2\n p_nums = []\n while i * i <= n:\n while n % i == 0:\n n = int(n / i)\n p_nums.append(i)\n i += 1\n if n > 1:\n p_nums.append(n)\n return p_nums\n\neights = []\nnums = []\n\nfor i in range(105,200,2):\n p = prime_factorize(i)\n if len(p) == 3:\n eights.append(p)\n nums.append(i)\n \nprint(len([i for i in nums if i < N]))', 'N = int(input())\n\nsup = (N + 1) // 2\ncon = 0\nans = 0\n\nif N < 105:\n print(ans)\n\nelse:\n for i in range(1,N + 1,2):\n for j in range(1,max(i // 2 + 1,2)):\n if i % j == 0:\n con +=1\n if con == 7:\n ans += 1\n con = 0\n \n print(ans)'] | ['Wrong Answer', 'Accepted'] | ['s123973535', 's870702747'] | [3064.0, 3060.0] | [17.0, 18.0] | [388, 256] |
p03281 | u994988729 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['def div(n):\n d=0\n for i in range(1, n+1):\n if n%i==0:\n d+=1\n return d\n\nn=int(input())\nans=0\nfor i in range(1, n+1):\n if div(i)==8:\n ans+=1\nprint(ans)', 'def div(N):\n div = set()\n for i in range(1, int(N ** 0.5 + 0.5) + 1):\n if N % i == 0:\n div.add(i)\n div.add(N // i)\n return len(div)\n\n\nN = int(input())\nans = 0\nfor x in range(1, N + 1, 2):\n if div(x) == 8:\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s163907044', 's369628132'] | [3060.0, 3060.0] | [18.0, 18.0] | [164, 273] |
p03281 | u999893056 | 2,000 | 1,024,000 | The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)? | ['def count_deivisors(n):\n devisors = 0\n for i in range(1, n**0.5+1):\n if n % i == 0:\n devisors += 1\n if i != n // i:\n devisors += 1\n\n return devisors\n\nn = int(input())\n\nprint(sum(count_deivisors(x) == 8 for x in range(1,n+1,2)))\n\n', 'def count_divisors(n):\n divisors = 0\n for i in range(1, int(n**0.5) +1):\n if n % i == 0:\n divisors += 1\n if i != n // i:\n divisors += 1\n\n return divisors\n\nn = int(input())\n\nprint(sum(count_divisors(x) == 8 for x in range(1, n+1, 2)))\n\n'] | ['Runtime Error', 'Accepted'] | ['s482776972', 's857421191'] | [3052.0, 3060.0] | [18.0, 18.0] | [282, 288] |
p03282 | u002459665 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S = int(input())\nK = int(input())\n\nif str(S)[0] == 1 and K == 1:\n print(1)\nelse:\n print(str(S)[0])\n', "S = input()\nK = int(input())\n\nn = 0\nfor si in S:\n if si == '1':\n n += 1\n else:\n break\n\n# if str(S)[0] == 1 and K == 1:\n# print(1)\n# else:\n# print(str(S)[0])\n\nif n >= K:\n print('1')\nelse:\n print(S[n])\n"] | ['Wrong Answer', 'Accepted'] | ['s935668109', 's192082227'] | [2940.0, 3064.0] | [17.0, 18.0] | [105, 234] |
p03282 | u007263493 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["s = input()\nk = int(input())\n\nfor i in range(k):\n if s[i] != '1':\n print(s[i])\n break \nprint(1) ", "s = input()\nk = int(input())\n\nfor i in range(k):\n if s[i] != '1':\n print(s[i])\n break \n else:\n print(1) ", "s = input()\nk = int(input())\n\nfor i in range(k):\n if s[i] != '1':\n print(s[i])\n break \nif i == k-1:\n if s[k-1] != '1':\n exit()\n else:\n print(1) "] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s000734234', 's781219860', 's241150776'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [109, 130, 174] |
p03282 | u007550226 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["S = input()\nK = int(input())\ni = 0\nwhile True:\n if S[i] == '1':\n if K == 1:\n break\n else:\n K-=1\n i+=1\n else:\n break", "import math\nS = input()\nK = int(input())\ni = 0\nwhile True:\n if S[i] == '1':\n if K == 1:\n print(S[i])\n else:\n K-=1\n i+=1\n else:\n d = int(math.log(int(S[i]))*10**15)\n if d<K:K-=d\n else:break\n i += 1", "import math\nS = input()\nK = int(input())\ni = 0\nwhile True:\n print('first:',S[i])\n if S[i] == '1':\n if K == 1:\n break\n else:\n K-=1\n i+=1\n else:\n d = int( (math.log(int(S[i]))) * ((2**5)*(10**15)) ) + 1\n if d<K:K-=d\n else:break\n i += 1\nprint(S[i])", "S = input()\nK = int(input())\ni = 0\nwhile True:\n if S[i] == '1':\n if K == 1:\n break\n else:\n K-=1\n i+=1\n else:\n break\nprint(S[i])"] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s258008151', 's911456008', 's925371128', 's311689252'] | [2940.0, 11248.0, 3064.0, 2940.0] | [17.0, 2104.0, 18.0, 17.0] | [175, 277, 329, 187] |
p03282 | u007808656 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["s=input()\nk=int(input())\nimport re\ns1,s2=re.match('^(1*)([2-9])?',s).groups()\nif(s1 and k<=len(s1)):\n print(1)\n else:\n print(s2)", "s=input()\nk=int(input())\nimport re\ns1,s2=re.match('^(1*)([2-9])?',s).groups()\nif(s1 and k<=len(s1)):\n print(1)\nelse:\n print(s2)"] | ['Runtime Error', 'Accepted'] | ['s820967529', 's019391233'] | [2940.0, 3188.0] | [17.0, 19.0] | [133, 129] |
p03282 | u011062360 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['c = 5*pow(10, 14)\nlist_N = list(input())\nk = int(input())\ncnt = 0\nans = 0\n\nfor i in list_N:\n i = int(i)\n cnt += pow(i, c)\n if cnt > k:\n ans = i\n break\n\nprint(ans)', 'c = 5*pow(10, 14)\nlist_N = list(input())\nk = int(input())\ncnt = 0\nans = 0\n\nfor i in list_N:\n i = int(i)\n if i != 1:\n ans = i\n break\n else:\n cnt += 1\n if cnt == k:\n ans = 1\n break\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s143092489', 's340715629'] | [158200.0, 3060.0] | [2108.0, 17.0] | [185, 249] |
p03282 | u013408661 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s=list(map(int,input().split()))\nk=int(input())\ncount=0\nfor i in range(100):\n if count==k:\n print(1)\n exit()\n if s[i]==1:\n count+=1\n else:\n print(s[i])\n exit()', 's=list(input())\ns=list(map(int,s))\nk=int(input())\ncount=0\nfor i in range(100):\n if count==k:\n print(1)\n exit()\n if s[i]==1:\n count+=1\n else:\n print(s[i])\n exit()'] | ['Wrong Answer', 'Accepted'] | ['s677155043', 's670854667'] | [3060.0, 3060.0] | [19.0, 18.0] | [177, 179] |
p03282 | u015593272 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["S = input()\nK = int(input())\nindex = 0\n\nfor i in range(K):\n if (S[i] != '1'):\n print(S[i])\n break\n\nif (index == 0):\n print('1')\nelse:\n print(S[index])\n", "S = input()\nK = int(input())\nindex = 0\n\nfor i in range(K):\n if (S[i] != '1'):\n print(S[i])\n break\n\nif (index == 0):\n print(1)\nelse:\n print(int(S[index]))\n", "S = input()\nK = int(input())\nans = 1\n\nfor i in range(K):\n if (S[i] != '1'):\n ans = int(S[i])\n break\n\nprint(ans)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s298051998', 's469949859', 's792117741'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [174, 177, 128] |
p03282 | u016901717 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s = input()\nk = int(input())\nl = []\nfor i in s:\n l.append(str(int(i)**(5*10**15)))\nprint("".join(l)[k-1])\n\n', 's = input()\nk = int(input())\ncnt = 0\nx = 0\nfor i in s:\n if i == "1":\n cnt += 1\n else:\n x = int(i)\n break\nif k<=cnt:\n print(1)\nelse:\n print(x)\n \n'] | ['Time Limit Exceeded', 'Accepted'] | ['s883428126', 's203866511'] | [197056.0, 3064.0] | [2105.0, 19.0] | [110, 184] |
p03282 | u017624958 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["S = input()\nK = int(input())\n\nfor i in range(len(S)):\n if S[i] != '1': break\n\nif i < K:\n print(1)\n\nanswer = S[i]\nprint(answer)\n", "S = input()\nK = int(input())\n\nfor i in range(len(S)):\n if S[i] != '1': break\n\nnth = i + 1\nif nth < K:\n print(1)\n\nanswer = S[i]\nprint(answer)\n", "S = input()\nK = int(input())\n\nare_all_one = True\nfor i in range(len(S)):\n if S[i] != '1':\n are_all_one = False\n break\n\nnth = i + 1\nif are_all_one or K < nth:\n print(1)\n exit()\n\nanswer = S[i]\nprint(answer)\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s414147326', 's457738893', 's694796155'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [133, 147, 228] |
p03282 | u017810624 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s=list(input())\nk=int(input())\nc=0\nfor i in range(len(s)):\n if int(s[i])!=1:\n if i<k:\n print(s[i])\n break\n else:\n print(1)\n break\u200b', "s=list(input())\nk=int(input())\nif list(set(s))==['1']:\n print(1)\nelse:\n for i in range(len(s)):\n if int(s[i])!=1:\n if i<k:\n print(s[i])\n break\n else:\n print(1)\n break"] | ['Runtime Error', 'Accepted'] | ['s101966910', 's554938335'] | [3064.0, 3060.0] | [18.0, 17.0] | [142, 183] |
p03282 | u023229441 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s=input()\ni=1\nwhile 1:\n if s[i-1]!=1:\n t=i \n ans=s[i-1]\n break\n i+=1\nif int(input())<=i:\n print(1);exit()\nprint(ans)', 's=input()\ni=1\nwhile 1:\n if i==len(s)+1:\n print(1);exit()\n if s[i-1]!="1":\n t=i \n ans=int(s[i-1])\n break\n i+=1\n# print(t)\nif int(input())<t:\n print(1);exit()\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s029733501', 's328513195'] | [8924.0, 9084.0] | [28.0, 29.0] | [146, 208] |
p03282 | u025235255 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['\ns = input()\nk = int(input())\n\nslist = list(s)\ni = 0\ncount = 0\nwhile slist[i] == 1:\n count += 1\n \nif count == 0:\n print(slist[0])\nelif count >= k:\n print(1)\nelse:\n print(slist[i+1])', '\ns = input()\nk = int(input())\n\nslist = list(s)\ni = 0\ncount = 0\nwhile slist[i] == "1":\n count += 1\n i += 1\n if i >= len(slist):\n break\n \nif count >= k:\n print(1)\nelse:\n print(slist[i])'] | ['Wrong Answer', 'Accepted'] | ['s008266708', 's889950163'] | [3060.0, 3060.0] | [18.0, 17.0] | [196, 208] |
p03282 | u026788530 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["s=input()\nk=input()\n\nfor c in s:\n if c!='1':\n print(c)\nelse:\n print('1')", "line = input()\nflag = False\nfor i in range(int(input())):\n if not(line[i]== '1'):\n print(line[i])\n flag = True\n break\n\nif flag:\n print('1')", "line = input()\nflag = True\n\nfor i in range(int(input())):\n if not(line[i]== '1'):\n print(line[i])\n flag = False\n break\n\nif flag:\n print('1')\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s415020332', 's811988335', 's642389517'] | [2940.0, 2940.0, 2940.0] | [17.0, 24.0, 17.0] | [77, 150, 152] |
p03282 | u033183216 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['days = 5000000000000000\n\ns = int(input())\nk = int(input())\n\nss = str(s)\nfor i in range(len(ss)):\n if ss[i] != "1":\n break\n if k - 1 == i:\n print(1)\n exit(0)\n\nprint(str(s)[0])\n', 'days = 5000000000000000\n\ns = int(input())\nk = int(input())\n\nss = str(s)\nfor i in range(len(ss)):\n if ss[i] != "0":\n break\n if k - 1 == i:\n print(1)\n exit(0)\n\nprint(str(s)[0])\n', 'days = 5000000000000000\n\ns = int(input())\nk = int(input())\n\nss = str(s)\nfor i in range(len(ss)):\n if ss[i] != "1":\n print(ss[i])\n break\n if k - 1 == i:\n print(1)\n break\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s241604999', 's358826817', 's490045850'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [202, 202, 203] |
p03282 | u033524082 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s=input()\nif s.count("1")==len(s):\n print(1)\nelse:\n i=0\n while s[i]!="1":\n i+=1\n print(s[i])', 's=input()\ninput()\nif s.count("1")==len(s):\n print(1)\nelse:\n i=0\n while s[i]!="1":\n i+=1\n print(s[i])', 's=input()\nk=int(input())-1\nif s.count("1")==len(s):\n t=k\n print(1)\nelse:\n i=0\n while s[i]=="1":\n i+=1\n if k<i:\n print(1)\n else:\n print(s[i])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s415244983', 's460057534', 's611510301'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [111, 119, 179] |
p03282 | u036340997 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s = input()\nk = int(input())\ninfinity = 5 * (10 ** 15) - 1\n\nimport math\n\ni = 0\nwhile k > 0:\n print(s[i])\n k -= math.floor(infinity * math.log(int(s[i]), 10)) + 1\n i += 1\n print(k)\n \nprint(s[i-1])\n', 's = input()\nk = int(input())\n\nfor i in map(int, s[:k]):\n if i != 1:\n print(i)\n break\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s681562452', 's724574719'] | [3060.0, 2940.0] | [18.0, 17.0] | [201, 109] |
p03282 | u037430802 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['n = input()\nk = input()\n\n\nif len(n) == 1:\n print(n)\nelse:\n if k == "1":\n print(n[0])\n else:\n for i in range(max(int(k), len(n))):\n if n[i] != "1":\n print(n[i])\n exit\n else:\n print(1)', 'n = input()\nk = int(input())\n\n\nfor i in range(len(n)):\n if i == k-1 or i == len(n)-1:\n print(n[i])\n exit()\n else:\n if n[i] != "1":\n print(n[i])\n exit()'] | ['Runtime Error', 'Accepted'] | ['s375591146', 's957070086'] | [3060.0, 3060.0] | [17.0, 18.0] | [223, 172] |
p03282 | u038408819 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["S = input()\nK = int(input())\n\nfor i in range(len(S)):\n if S[i] != '1':\n print(S[i])\n break\n else:\n if i == N - 1:\n print(1)\n break\n else:\n continue", "S = input()\nK = int(input())\n\nfor i in range(len(S)):\n if S[i] != '1':\n print(int(S[i]))\n break\n else:\n if i == N - 1:\n print(1)\n break\n else:\n continue\n", "S = input()\nK = int(input())\n\nfor i in range(len(S)):\n if S[i] != '1':\n print(int(S[i]))\n break\n else:\n if i == K - 1:\n print(1)\n break\n else:\n continue"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s638367494', 's971556339', 's029467529'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [214, 220, 219] |
p03282 | u041382530 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["S=input()\nK=int(input())\nco=0\nfor j in S:\n\tif j!='1' and int(j)<=K:\n\t\tprint(j)\n\t\tco=1\n\t\tbreak\n\telse:\n\t\tbreak\nif co==0:\n\tprint('1')", "S=input()\nK=int(input())\nco=0\nfor j in S:\n\tif j!='1' and j<=K:\n\t\tprint(j)\n\t\tco=1\n\t\tbreak\nif co==0:\n\tprint('1')", "S=input()\nK=int(input())\na=0\nfor j in S:\n\ta=a+1\n\tif j!='1':\n\t\tprint(j)\n\t\tbreak\n\tif a==K:\n\t\tprint('1')\n\t\tbreak"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s420895363', 's549824171', 's191692948'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [130, 110, 109] |
p03282 | u045091221 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['// #define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n\n\n\n#define REP(i, n) FOR(i, 0, n)\n#define REP1(i, n) FOR(i, 1, int(n) + 1)\n#define RREP(i, n) RFOR(i, 0, n)\n#define RREP1(i, n) RFOR(i, 1, int(n) + 1)\n#define ALL(c) begin(c), end(c)\n\nint _ = (\n#ifndef LOCAL\n std::cin.tie(nullptr), std::ios::sync_with_stdio(false),\n#endif\n std::cout.precision(10), std::cout.setf(std::ios::fixed));\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntemplate <typename T> using vec = std::vector<T>;\nusing namespace std;\n\nint main() {\n string S;\n ll K;\n cin >> S >> K;\n smatch m;\n regex_match(S, m, regex("^(1*)([1-9]*)$"));\n cout << ((m.length(1) >= K) ? \'1\' : m.str(2).front()) << endl;\n return 0;\n}\n', "import re\n\nm = re.match(r'\\A(1*)([1-9]*)\\Z', input())\nprint('1' if len(m.group(1)) >= int(input()) else m.group(2)[0])\n"] | ['Runtime Error', 'Accepted'] | ['s583360264', 's999941601'] | [8944.0, 9844.0] | [22.0, 35.0] | [842, 119] |
p03282 | u047668580 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S = list(input())\nK = int(input())\n\nif K == 1 or S[0] == 1:\n print(S[1])\nfor i,s in enumerate(S):\n if i + 1 == K:\n print(S[i])\n exit()\n if S[i] != 1:\n print(S[i])\n exit()', 'S = list(input())\nK = int(input())\n\nfor i,s in enumerate(S):\n if i + 1 == K:\n print(S[i])\n exit()\n if S[i] != "1":\n print(S[i])\n exit()\n'] | ['Runtime Error', 'Accepted'] | ['s919546579', 's733897939'] | [3060.0, 2940.0] | [17.0, 17.0] | [207, 170] |
p03282 | u055941944 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["s = input()\nk = int(input())\na=1\nfor i in range(min(len(s),k)):\n\tif s[i] == '1':\n\t\tpass\n\telse:\n\t\ta = a[i]\n\t\tbreak\nprint(a)", 's = input()\nk = int(input())\na = min(len(s),k)\nz=1\nfor i in range(a):\n\tif s[i]=="1":\n\t\tpass\n\telse:\n\t\tz=s[i]\n\t\tbreak\nprint(z)'] | ['Runtime Error', 'Accepted'] | ['s832595383', 's900792632'] | [2940.0, 3060.0] | [17.0, 19.0] | [122, 124] |
p03282 | u057429331 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S = int(input())\nK = int(input())\nl = [int(x) for x in list(str(S))]\nflag=0\ni=0\nans = 0\nif len(l)>=K:\n ans = l[K-1]\nelse:\n while flag ==0:\n if l[i] == 1 or l[i]==0:\n i = i + 1\n else:\n flag=1\n ans = l[i]\nprint(ans)', 'S = int(input())\nK = int(input())\nl = [int(x) for x in list(str(S))]\nlength = len(l)\nflag=0\ni=0\nans = 0\nwhile flag ==0:\n if l[i] == 1 or l[i]==0:\n i = i + 1\n else:\n flag=1\n ans = l[i]\nif len(l)>=K:\n ans = S[K-1]\nprint(ans)\n', 'S = int(input())\nK = int(input())\nl = [int(x) for x in list(str(S))]\nflag=0\ni=0\nj=0\nans = 0\nif len(l)>=K:\n while j<K:\n if l[j] == 1 or l[j]==0:\n j = j + 1\n else:\n ans = l[j]\nelse:\n while flag ==0:\n if l[i] == 1 or l[i]==0:\n i = i + 1\n else:\n flag=1\n ans = l[i]\nprint(ans)\n', 'S = int(input())\nK = int(input())\nl = [int(x) for x in list(str(S))]\nflag=0\ni=0\nj=0\nans = 0\nif len(l)>=K:\n while j<K:\n if l[j] == 1 or l[j]==0:\n j = j + 1\n else:\n ans = l[j]\nelse:\n while flag ==0:\n if l[i] == 1 or l[i]==0:\n i = i + 1\n else:\n flag=1\n ans = l[i]\nprint(ans)', 'S = int(input())\nK = int(input())\nl = [int(x) for x in list(str(S))]\nlength = len(l)\nflag=0\ni=0\nans = 0\nwhile flag ==0:\n if l[i] == 1 or l[i]==0:\n i = i + 1\n else:\n flag=1\n ans = l[i]\nif len(l)>=K:\n ans = l[K-1]\nprint(ans)\n', 'S = int(input())\nl = [int(x) for x in list(str(S))]\nK = int(input())\nlength = len(l)\nflag=0\ni=0\nans = 0\nwhile flag ==0:\n if l[i] == 1:\n i = i + 1\n else:\n flag=1\n ans = l[i]\nif len(S)>=K:\n ans = S[K-1]\nprint(ans)\n ', 'S = int(input())\nK = int(input())\nl = [int(x) for x in list(str(S))]\nflag=0\nflag2=0\ni=0\nj=0\nans = 0\nif K<=len(l):\n while j<K and flag2 == 0:\n if l[j] == 1 or l[j]==0:\n ans = l[j]\n j = j + 1\n else:\n flag2 =1\n ans = l[j]\nelse:\n while flag ==0:\n if l[i] == 1 or l[i]==0:\n i = i + 1\n else:\n flag=1\n ans = l[i]\nprint(ans)\n'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s144017941', 's150537221', 's571165069', 's645473999', 's693539728', 's995784284', 's758813990'] | [3064.0, 3064.0, 3064.0, 3064.0, 3060.0, 3060.0, 3064.0] | [17.0, 17.0, 2104.0, 2104.0, 17.0, 17.0, 23.0] | [266, 253, 361, 360, 253, 250, 428] |
p03282 | u057993957 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s = input()\nn = int(input())\n\nfor i in range(len(s)):\n if s[i] != "1":\n print(s[i])\n break\n \n else:\n k -= 1\n if k == 0:\n print(1)\n break\n', 's = input()\nk = int(input())\n\nfor i in range(len(s)):\n if s[i] != "1":\n print(s[i])\n break\n \n else:\n k -= 1\n if k == 0:\n print(1)\n break\n'] | ['Runtime Error', 'Accepted'] | ['s371139825', 's804194902'] | [2940.0, 2940.0] | [19.0, 17.0] | [200, 200] |
p03282 | u063052907 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S = input()\nK = int(input())\n\n\nans = 1\nfor i in range(len(S)):\n if S[i] != "1":\n ans = S[i]\n break\n\nprint(ans)\n', 'S = input()\nK = int(input())\n\n\nfor i in range(len(S)):\n if S[i] != "1":\n break\n\n\nans = "1" if K-1 < i else S[i]\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s033149392', 's511581496'] | [2940.0, 2940.0] | [17.0, 17.0] | [126, 132] |
p03282 | u063073794 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s=input()\nn=int(input())\n\nfor i in range(n):\n if s[i]!=1:\n print(s[i])\n exit()\nprint(1)', 's=input()\nn=int(input())\n\nfor i in range(n):\n if s[i]!="1":\n print(s[i])\n exit()\nprint(1)'] | ['Wrong Answer', 'Accepted'] | ['s849257560', 's200766704'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 96] |
p03282 | u068400994 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S = input()\nK = int(input())\n \ni = 0\n\nif len(S) > 1:\n while S[i] == 1:\n i += 1\n print(S[i])\nelse:\n print(S[0])', "S = input()\nK = int(input())\n \n\nans = 0\nif len(S) == 1:\n ans = S[0]\nelse:\n i = 0\n for i in range(len(S)):\n if S[i] != '1' and i < K:\n ans = S[i]\n break\n else:\n ans = S[0]\n \nprint(ans)\n"] | ['Wrong Answer', 'Accepted'] | ['s735264410', 's999436579'] | [2940.0, 2940.0] | [17.0, 21.0] | [126, 242] |
p03282 | u076917070 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['import sys\ninput=sys.stdin.readline\n\ns = input().strip()\nk = int(input())\n\nidx = -1\nfor i in range(len(s)):\n if s[i] != 1:\n idx = i\n break\nif k <= idx:\n print(1)\nelse:\n print(s[idx])\n', 'import sys\ninput=sys.stdin.readline\n\ns = input().strip()\nk = int(input())\n\nidx = -1\nfor i in range(len(s)):\n if s[i] != "1":\n idx = i\n break\nif k <= idx:\n print(1)\nelse:\n print(s[idx])\n'] | ['Wrong Answer', 'Accepted'] | ['s586934165', 's014377985'] | [3060.0, 2940.0] | [17.0, 17.0] | [206, 208] |
p03282 | u079022116 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | [" s=input()\nk=int(input())\nif s.count('1') == len(s):\n print(1)\nelse:\n count = 0\n for i in s:\n if i != '1':\n print(i)\n break\n else:\n count+=1\n if count == k:\n print(1)\n break", "s=input()\nk=int(input())\nif s.count('1') == len(s):\n print(1)\nelse:\n count = 0\n for i in s:\n if i != '1':\n print(i)\n break\n else:\n count+=1\n if count == k:\n print(1)\n break\n"] | ['Runtime Error', 'Accepted'] | ['s161187744', 's636867122'] | [2940.0, 2940.0] | [17.0, 18.0] | [216, 216] |
p03282 | u084968244 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["if __name__ == '__main__':\n \n S = str(input())\n K = int(input())\n for i, n in enumerate(S):\n if n+1 == K:\n print(i)\n break\n if i != '1':\n print(i)\n break\n", "if __name__ == '__main__':\n \n S = input()\n K = int(input())\n for i in S:\n if i == K:\n print(n)\n break\n if i != '1':\n\t print(n)\n\t break", "if __name__ == '__main__':\n \n S = str(input())\n K = int(input())\n for n, i in enumerate(S):\n if n+1 == K:\n print(i)\n break\n if i != '1':\n print(i)\n break\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s028758098', 's438281144', 's558579279'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [264, 227, 264] |
p03282 | u089142196 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S=input()\nK=float(input())\nlis=list(S)\nss=set(lis)\n\nif len(ss)==1:\n print(S[0])\nelse:\n if K<=len(S):\n check_list=lis[:K]\n check_set=set(check_list)\n if len(check_set)==1:\n print(check_list[0])\n else:\n for num in lis:\n if int(num)!=1:\n print(int(num))\n break \n else:\n for num in lis:\n if int(num)!=1:\n print(int(num))\n break', 'S=input()\nK=float(input())\nlis=list(S)\nss=set(lis)\n\nif len(ss)==1:\n print(S[0])\nelse:\n if K<=len(S):\n check_list=lis[:int(K)]\n check_set=set(check_list)\n if len(check_set)==1:\n print(check_list[0])\n else:\n for num in lis:\n if int(num)!=1:\n print(int(num))\n break \n else:\n for num in lis:\n if int(num)!=1:\n print(int(num))\n break'] | ['Runtime Error', 'Accepted'] | ['s632102463', 's347272367'] | [3064.0, 3064.0] | [17.0, 17.0] | [404, 411] |
p03282 | u090406054 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s=list(input())\nk=int(input())\nmi=5*(10**14)\ni=0\nwhile k>=0:\n k-=s[i]*mi\n i+=1\nprint(s[i])', 's=list(int(input()))\nk=int(input())\nfor i in range(len(s)):\n k-=s[i]*5(10**15)\n if k<s[i+1]:\n break\n \nprint(s[i+1])\n \n', 's=list(input())\nk=int(input())\nss=[]\nt=5*(10**15)\nfor i in range(len(s)):\n ss.append(int(s[i]))\nfor i in range(len(s)):\n k-=ss[i]**t\n if k<ss[i+1]:\n print(ss[i+1])\n break\n elif k==0:\n print(ss[i])\n break\n \n\n', 'import sys\ns=input()\nk=int(input())\nfor i in range(len(s)):\n if s[i]!="1":\n print(s[i])\n sys.exit()\n if s[i]=="1" and i+1==k:\n print(1)\n sys.exit()\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s211631205', 's335502340', 's838248022', 's115753745'] | [3060.0, 3060.0, 197056.0, 2940.0] | [17.0, 19.0, 2105.0, 17.0] | [92, 129, 239, 182] |
p03282 | u094565093 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["S=list(input().split())\nK=int(input())\ncount=0\nfor i in range(len(S)):\n if S[i]=='1':\n count+=1\n else:\n break\nif K<=count:\n print(1)\nelse:\n print(S[1])", "S=list(input())\nK=int(input())\ncount=0\nfor i in range(len(S)):\n if S[i]=='1':\n count+=1\n else:\n break\nif K<=count:\n print(1)\nelse:\n print(S[count])"] | ['Runtime Error', 'Accepted'] | ['s890152972', 's472594175'] | [2940.0, 2940.0] | [17.0, 17.0] | [178, 174] |
p03282 | u102242691 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['\ns = input()\nk = int(input())\n\nfor i in range(min(k,len(s))):\n if s[i] != "1":\n print(int(s[i]))\n break\nprint(1)', 'S = input()\nK = int(input())\nfor i in range(min(K,len(S))):\n if S[i] != "1":\n print(int(S[i]))\n exit()\nprint(1)'] | ['Wrong Answer', 'Accepted'] | ['s235853325', 's880453653'] | [2940.0, 2940.0] | [17.0, 17.0] | [129, 128] |
p03282 | u102960641 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s = input()\nk = int(input())\nfor i,j in enumerate(s):\n if j == "1"\n if (i+1) == k:\n print(j)\n break\n else:\n print(j)\n break', 's = input()\nk = int(input())\nfor i,j in enumerate(s):\n if j == "1":\n if (i+1) == k:\n print("1")\n break\n else:\n print(j)\n break\n \n \n \n \n\n\n'] | ['Runtime Error', 'Accepted'] | ['s461261221', 's913424101'] | [2940.0, 2940.0] | [18.0, 18.0] | [144, 166] |
p03282 | u103902792 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s = input()\nk = int(input())\nfor int(c) in s:\n if c != 1:\n print(c)\n exit(0)', "s = input()\nk = int(input())\n\nfor c in s:\n if c == '1':\n k -= 1\n if k == 0:\n print(1)\n break\n else:\n print(c)\n break"] | ['Runtime Error', 'Accepted'] | ['s084501457', 's961129544'] | [2940.0, 2940.0] | [18.0, 17.0] | [83, 140] |
p03282 | u107269063 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["s = int(input())\nk = int(input())\n\nfor i in str(s):\n if i == '1':\n pass\n else:\n print(i)", "s = int(input())\nk = int(input())\n\nfor i in str(s):\n if i == '1':\n if k == 1:\n print(1)\n break\n else:\n k -= 1\n else:\n print(i)\n break"] | ['Wrong Answer', 'Accepted'] | ['s563770830', 's391155947'] | [2940.0, 2940.0] | [17.0, 17.0] | [108, 200] |
p03282 | u113255362 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S=input()\na=int(input())\nList=list(S)\nres = 1\nfor i in range(a):\n if List[i] != "1":\n res = List[i]\nprint(res)', 'S=input()\na=int(input())\nList=list(S)\nres = 1\nfor i in range(a):\n if List[i] != "1":\n res = List[i]\n break\nprint(res)'] | ['Runtime Error', 'Accepted'] | ['s696925659', 's219447175'] | [9088.0, 9168.0] | [31.0, 28.0] | [114, 124] |
p03282 | u113971909 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S = input()\nK = int(input())\nans = 1\nfor i in range(K):\n if S[i] != "1":\n ans = i\n break\nprint(i)', 'S = input()\nK = int(input())\nans = 1\nfor i in range(K):\n if S[i] != "1":\n ans = S[i]\n break\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s817803996', 's672546566'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 109] |
p03282 | u123756661 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['reina@v157-7-237-130:~/magic/kyogi/Atcoder/abc/b101_125/b106$ cat ./c1.py\n#!/usr/bin/env python3\n# -*- coding: UTF-8 -*-\np=5000000000000000\ns=input()\nn=int(input())\n\nchk=1\nans=f=0\nfor i in s:\n chk=1\n if i=="1": \n ans+=1\n continue\n for j in range(p-1):\n chk*=int(i)\n if ans+chk>=p:\n print(i)\n f=1\n break\n ans+=chk\n if f==1: break\nif f==0: print(s[-1])', '#!/usr/bin/env python3\n# -*- coding: UTF-8 -*-\np=5000000000000000\ns=input()\nn=int(input())\n\nans=chk=1\nfor i in s:\n chk=1\n for j in range(2,p):\n chk*=int(i)\n ans+=chk\n if ans>=p:\n print(i)\n exit()', 'reina@v157-7-237-130:~/magic/kyogi/Atcoder/abc/b101_125/b106$ cat ./c1.py\n#!/usr/bin/env python3\n# -*- coding: UTF-8 -*-\np=5000000000000000\ns=input()\nn=int(input())\n\nchk=1\nans=f=0\nfor i in s:\n chk=1\n if i=="1": \n ans+=1\n continue\n for j in range(p-1):\n chk*=int(i)\n if ans+chk>=p:\n print(i)\n f=1\n break\n ans+=chk\n if f==1: break\nif f==0: print(s[-1])\nreina@v157-7-237-130:~/mag', 's=input()\nk=int(input())\nx=-1\ny=""\nfor a,i in enumerate(s):\n if i!="1":\n x=a\n y=i\n break\n\nif x!=-1 and x+1<=k: print(y)\nelse: print(1)\n'] | ['Runtime Error', 'Time Limit Exceeded', 'Runtime Error', 'Accepted'] | ['s436682062', 's659250755', 's965852760', 's526116673'] | [2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 2104.0, 17.0, 17.0] | [426, 244, 453, 159] |
p03282 | u126232616 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s = input()\nk = int(input())\nfor i in range(len(s)):\n if s[i] != 1:\n if k < i:\n print(1)\n else:\n print(s[i])\n\tbreak\nelse:\n print(1)', 's = input()\nk = int(input())\nfor i in range(len(s)):\n if s[i] != "1":\n if k < i+1:\n print(1)\n else:\n print(s[i])\n break\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s505617202', 's080326732'] | [2940.0, 3060.0] | [17.0, 17.0] | [150, 184] |
p03282 | u129836004 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S = [int(i) for i in input()]\nK = int(input())\nfor i in S:\n K -= i**(5*10**15)\n if K <= 0:\n print(i)', "S = input()\nK = int(input())\nfor i in S:\n if i != '1':\n print(i)\n break\n if i == '1':\n K -= 1\n if K == 0:\n print(1)\n break\n "] | ['Wrong Answer', 'Accepted'] | ['s902430114', 's237796809'] | [196968.0, 2940.0] | [2106.0, 18.0] | [113, 183] |
p03282 | u131405882 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['S = input()\nK = int(input())\n\na = 1\nfor i in range(K):\n\tif S[i] != 1:\n\t\tprint(S[i])\n\t\ta = 1\n\t\tbreak\nif a == 0:\n\tprint(a)', 'S = input()\nK = int(input())\n\ni = 0\ncounter = 0\nwhile counter < K:\n\tcounter += int(S[i])**5e15\n\ti += 1\nprint(S[i])', 'S = input()\nK = int(input())\n\na = 0\nfor i in range(K):\n\tif S[i] != 1:\n\t\tprint(S[i])\n\t\ta = 1\n\t\tbreak\nif a == 0:\n\tprint("1")', 'S = input()\nK = int(input())\n\na = 1\nfor i in range(K):\n\tif int(S[i]) != 1:\n\t\tprint(int(S[i]))\n\t\ta = 0\n\t\tbreak\nif a == 1:\n\tprint(a) '] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s039312075', 's164839846', 's298644492', 's830843078'] | [2940.0, 3188.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0] | [120, 114, 122, 131] |
p03282 | u131406102 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ["s = input()\nk = int(input())\nanswer = 0\n\nif len(s)>=k:\n for i in range(k):\n if s[i]=='1':\n answer = 1\nelif s[0]!= '1' and len(s)>1:\n answer = s[0]\nelse:\n if k ==0 or len(s)==1:\n answer =s[0]\n else:\n answer =s[1]\n\nprint(answer)", "s = input()\nk = int(input())\nanswer = 0\nsub = 0\n\n \nif s[0]!= '1':\n answer = s[0]\n sub = 1\nelse:\n if k ==0 or len(s)==1:\n answer =s[0]\n sub = 1\n else:\n if len(s)>=k:\n for i in range(k):\n s[i]!='1'\n sub = 1\n else:\n answer =s[1]\n sub = 1\n\nif sub ==0:\n answer = '1'\nprint(answer)", "s = input()\nk = int(input())\nanswer = 0\nsub = 0\n\n \nif s[0]!= '1' and len(s)>1:\n answer = s[0]\n sub = 1\nelse:\n if k ==0 or len(s)==1:\n answer =s[0]\n sub = 1\n else:\n if len(s)>=k:\n for i in range(k):\n s[i]!='1'\n sub = 1\n else:\n answer =s[1]\n\nif sub ==0:\n answer = '1'\nprint(answer)", "s = input()\nk = int(input())\nanswer = 0\nsub = 0\ncount = k\n\n \nif s[0]!= '1':\n answer = s[0]\nelse:\n if k ==0 or len(s)==1:\n answer =s[0]\n else:\n if len(s)>=k:\n for i in range(k):\n s[i]!='1'\n sub = 1\n count = min(i,count)\n if sub ==0:\n answer = '1'\n else:\n answer =s[count]\n\nprint(answer)", "s = input()\nk = int(input())\nanswer = 0\nsub = 0\ncount = len(s)\n\nfor i in range(len(s)):\n if s[i]!='1':\n count = min(i,count)\n\nif k <= count:\n answer = '1'\nelse:\n answer = s[count]\nprint(answer)"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s102269791', 's147838172', 's320148432', 's496268354', 's203901335'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [270, 392, 385, 411, 209] |
p03282 | u131634965 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s=input()\nk=int(input())\nfor i in range(len(s)):\n if s[i]!=1:\n if (i+1)>=k:\n print("1")\n else:\n print(s[i])\n break', 's=input()\nk=int(input())\nfor i in range(len(s)):\n if s[i]!=1:\n print(s[i])\n break', 's=input()\nk=int(input())\nfor i in range(k):\n if s[i]!="1":\n print(s[i])\n exit()\nprint("1")\n '] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s509111412', 's728796980', 's592127243'] | [2940.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [160, 98, 116] |
p03282 | u134387396 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['import sys\n\nstr_s = input()\nk = input()\n\nint_s = int(str_s)\nk = int(k)\n\ngosentyo = 5000000000000000\ncount = 0\n\n# print(2 ** gosentyo)\n\n\nfor s in str_s:\n now_count = 1\n\n if int(s) == 1:\n count += 1\n else:\n for i in range(gosentyo):\n print(count,now_count)\n if (now_count + count >= k):\n print(s)\n sys.exit()\n now_count *= int(s)\n else:\n count += now_count\n', 'import sys\n\nstr_s = input()\nk = input()\n\nint_s = int(str_s)\nk = int(k)\n\ngosentyo = 5000000000000000\ncount = 0\n\n# print(2 ** gosentyo)\n\n\nfor s in str_s:\n now_count = 1\n\n if int(s) == 1:\n count += 1\n if count >= k:\n print(s)\n sys.exit()\n else:\n for i in range(gosentyo):\n # print(count,now_count)\n if (now_count + count >= k):\n print(s)\n sys.exit()\n now_count *= int(s)\n else:\n count += now_count\n'] | ['Wrong Answer', 'Accepted'] | ['s118454626', 's277688710'] | [3064.0, 3064.0] | [17.0, 17.0] | [459, 528] |
p03282 | u136090046 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['n = input()\nm = input()\n\nif n[0] == 1 and len(n) == 1:\n\tprint(1)\nelif n[0] == 1:\n\tprint(n[1])\nelse:\n\tprint(n[0])\n', 's = int(input())\nk = int(inout())\n\nprint(s[0] if s[0] != 1 else s[1])', 's = int(input())\nk = int(input())\n\nprint(s[0] if s[0] != 1 else s[1])', 'S = input()\nK = input()\n\n#A = int(l[0])\n\n\nlength_1 = len(S)\nK = int(K)\n\ni =int(S)\nv_1 = []\n#cnt = []\nwhile i > 0:\n v_1.append( i % 10 )\n #cnt.append(1)\n i //= 10 \nv_1.reverse()\n\nlength_n = 0\ntarget_v_num = 0\n\nwhile length_n < K:\n V = v_1[target_v_num]\n length_n = length_n + 1\n if V > 1:\n length_n = length_n + K\n target_v_num = target_v_num + 1\n\n\nprint(V)\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s308766269', 's473871360', 's959732158', 's346965274'] | [2940.0, 3064.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [113, 69, 69, 393] |
p03282 | u138486156 | 2,000 | 1,024,000 | Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows: * Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`. For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days? | ['s,k = [input() for i in range(2)]\nfor i in range(k):\n if int(s[i]) > 1:\n print(s[i])\n exit()\nprint(1)\n\n', 's = input()\nk = int(input())\ndays = int(5e15)\nfor i in range(days):\n for j in range(2,10):\n s = s.replace(str(j), str(j)*j)\n\nprint(s[k-1])\n', 's,k = [input() for i in range(2)]\nfor i in range(int(k)):\n if int(s[i]) > 1:\n print(s[i])\n exit()\nprint(1)\n\n'] | ['Runtime Error', 'Time Limit Exceeded', 'Accepted'] | ['s300799500', 's452988909', 's253178137'] | [2940.0, 493568.0, 2940.0] | [17.0, 2105.0, 18.0] | [120, 150, 125] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.