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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03319 | u038854253 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['def sunuke_sum(arg):\n sum_digit = 0\n for char in arg:\n sum_digit += int(char)\n return sum_digit\n\n\ninput_num = int(input())\n\nsunuke_list = []\nmin_sunuke_div = 10 ** 20\nfor d in reversed(range(1, 16)):\n for n in reversed(range(10, 100)):\n i = n * (10 ** d) + (10 ** d - 1)\n ... | ['Runtime Error', 'Accepted'] | ['s797120708', 's572311595'] | [3064.0, 14584.0] | [17.0, 50.0] | [714, 430] |
p03319 | u050428930 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N,K=map(int,input().split())\nprint(-(1-N)//(K-1))\n', 'N,K=map(int,input().split())\nif N-1%(K-1):\n n=0\nelse:\n n=1\nprint((N-1)//(K-1)+n)\n', 'N,K=map(int,input().split())\nprint(-((1-N)//(K-1)))\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s023602135', 's911301044', 's932217517'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [50, 87, 52] |
p03319 | u057964173 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import sys\ndef input(): return sys.stdin.readline().strip()\n\ndef resolve():\n n,k=map(int, input().split())\n l=list(map(int,input().split()))\n cnt=0\n if n<=k:\n print(1)\n else:\n\n while True:\n n-=k\n n+=1\n cnt+=1\n if n<=k:\n ... | ['Runtime Error', 'Accepted'] | ['s332370180', 's920397450'] | [2940.0, 13812.0] | [17.0, 45.0] | [368, 306] |
p03319 | u076306174 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\n\nN,K=map(int, inp[0].split()) \nA=list(map(int, inp[0].split())) \n\n\nif N==K:\n print(1)\nelse:\n print(math.ceil((N-1)/(K-1)))\n', 'import math\n\nN,K=map(int, input().split()) \nA=list(map(int, input().split())) \n\n\nif N==K:\n print(1)\nelse:\n print(math.ceil((N-1)/(K-1)))\n'] | ['Runtime Error', 'Accepted'] | ['s365862707', 's981251964'] | [2940.0, 13812.0] | [17.0, 40.0] | [302, 304] |
p03319 | u077003677 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ["import sys\nimport os\n\ndef file_input():\n f = open('ARC099/input.txt', 'r')\n sys.stdin = f\n\ndef main():\n #file_input()\n # int(input())\n N,K=map(int, input().split())\n A_li=list(map(int, input().split()))\n # print(min)\n\n print(-(-(N-K)//(K-1)))\n\nif __name__ == '__main__':\n ma... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s422861600', 's580492960', 's701117041'] | [13880.0, 2940.0, 13880.0] | [39.0, 17.0, 40.0] | [306, 301, 308] |
p03319 | u090406054 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int,input().split())\na=list(map(int,input().split()))\ns=0\nfor i in range(n):\n if a[i]==1:\n s+=(i+1)\n break\n\nif s%k!=0 and n%k!=0:\n print(n//k+1)\nelif s%k!=0 and n%k==0:\n print(n//k)\nelse:\n print(n//k+2)\n\n', 'n,k=map(int,input().split())\na=list(map(int,input().split()))\ns=0\nfor i in... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s513568542', 's927210982', 's325052143'] | [14008.0, 14008.0, 13880.0] | [46.0, 46.0, 45.0] | [222, 261, 271] |
p03319 | u135116520 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\nN,K=map(int,input().split())\nA=list(map(int,input().split()))\nprint(math.floor(N/K))', 'N,K=map(int,input().split())\nA=list(map(int,input().split()))\nprint((N-1)/(K-1))\n', 'N,K=map(int,input().split())\nA=list(map(int,input().split()))\nprint(math.ceil((N-1)/(K-1)))', 'import math\nN,K=map(int,input... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s280704842', 's657191079', 's972487133', 's693927271'] | [13812.0, 14008.0, 13880.0, 13812.0] | [40.0, 40.0, 40.0, 40.0] | [96, 81, 91, 103] |
p03319 | u136090046 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['from math import ceil\n\nn, k = map(int, input().split())\narray = [int(x) for x in input().split()]\n\nif n <= k:\n print(1)\n exit()\nres = 0\n\nrange_left = array.index(1)\nrange_right = n - range_left - 1\nprint(range_left, range_right)\n\nk -= 1\nif range_left == 0:\n res += ceil(range_right / k)\n p... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s243206481', 's629829853', 's554196854'] | [13812.0, 13812.0, 13812.0] | [46.0, 45.0, 48.0] | [812, 331, 781] |
p03319 | u170324846 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\nN, K = map(int, input().split())\nA = input().split()\nt = A.index("1")\nprint(t)\nif (N - 1) % (K - 1) == 0 and t % (K - 1) == 0 and t != 0 and t != N - 1 and K != 2:\n print(math.ceil((N - 1)/(K - 1)) + 1)\n print(1)\nelse:\n print(math.ceil((N - 1)/(K - 1)))', 'import math\nN, K = map(int, input().... | ['Wrong Answer', 'Accepted'] | ['s910004028', 's944085785'] | [10420.0, 10420.0] | [26.0, 25.0] | [268, 249] |
p03319 | u184070848 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import numpy as np\nfrom math import ceil\n\nN, K = tuple(map(int, input().split()))\nA = np.array([int(x) for x in input().split()])\n\nI = np.argmin(A)\nD = min(N - I, I) - 1\nC = K - 1\nsmall_part = ceil(D / C)\nrem = C * small_part - D\n\nprint(small_part + ceil((N - rem) / C))', 'import numpy as np\nfrom math im... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s008860281', 's778880894', 's901675172'] | [23444.0, 23436.0, 23392.0] | [260.0, 191.0, 188.0] | [270, 266, 280] |
p03319 | u226233437 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int,input().split())\nprint((N-1)//(K-1))', 'import math\nN, K = map(int,input().split())\nprint(math.ceil((N-1)/(K-1)))'] | ['Wrong Answer', 'Accepted'] | ['s823007825', 's441711217'] | [3064.0, 3060.0] | [17.0, 18.0] | [51, 73] |
p03319 | u227082700 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k,*_=open(0);print(((int(n)-2)//(int(k)-1))+1)', 'n,k=map(int,input().split())\na=list(map(int,input().split()))\nprint((n-2)//(k-1)+1)'] | ['Runtime Error', 'Accepted'] | ['s291418845', 's672705458'] | [4084.0, 14004.0] | [18.0, 40.0] | [48, 83] |
p03319 | u252883287 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import numpy as np\nprint(0)', "def ii():\n return int(input())\n\n\ndef lii():\n return list(map(int, input().split(' ')))\n\n\ndef lvi(N):\n l = []\n for _ in range(N):\n l.append(ii())\n return l\n\n\ndef lv(N):\n l = []\n for _ in range(N):\n l.append(input())\n return l\n\n\... | ['Wrong Answer', 'Accepted'] | ['s155575786', 's857739710'] | [12424.0, 13812.0] | [150.0, 43.0] | [27, 1070] |
p03319 | u257374434 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['\n\n\ndef n_snuke(n):\n return n /sum(map(int,str(n)))\n\n\n# (100o+10x+y)/(o+x+y) > (100o+99)/(o+9+9)\n# 100o*18+(10x+y)(o+18) > 100o(x+y) +99(o+x+y)\n\n\n#\n#1 - 10 , 19,29,39,49,59,69,79,89,99\n\n\n# print(i,n_snuke(i))\n\n\nK = int(input())\ntmp =0\n\ntmp_list = []\nfor i in range(K*3):\n tmp = tmp+ 10*... | ['Runtime Error', 'Accepted'] | ['s783502164', 's903685833'] | [3064.0, 3060.0] | [17.0, 18.0] | [594, 80] |
p03319 | u268792407 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int,input().split())\nprint((n-k)//(k-1) +1)', 'n,k=map(int,input().split())\nprint((n-2)//(k-1) +1)'] | ['Wrong Answer', 'Accepted'] | ['s509726841', 's299767001'] | [2940.0, 2940.0] | [17.0, 17.0] | [51, 51] |
p03319 | u276204978 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nif A.index(1) + N - A.index(1) - 1 < K:\n print(1)\nelse:\n print(int(np.ceil(A.index(1)/(K-1))+np.ceil((N - A.index(1) - 1)/(K-1))))', 'N, K = map(int, input().split())\nA = list(map(int, input().split()))\n \nprint((N-2)//(K-1)+1)'] | ['Runtime Error', 'Accepted'] | ['s002624247', 's446463589'] | [13880.0, 13940.0] | [42.0, 41.0] | [206, 92] |
p03319 | u278886389 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\n\nN,K = map(int,input().split(" "))\n\nprint(math.ceil((N-1)/K-1))', 'import math\n\nN,K = map(int,input().split(" "))\n\nprint(math.ceil((N-1)/(K-1)))'] | ['Wrong Answer', 'Accepted'] | ['s780636779', 's196560306'] | [3060.0, 3060.0] | [17.0, 17.0] | [75, 77] |
p03319 | u285443936 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nA =list(map(int, input().split()))\n\nif K >= N:\n print(1)\n exit()\n\nidx = A.index(1)\nR = (N - 1 - idx) // (K - 1) if (N - 1 - idx) % (K - 1) == 0 else (N -1 - idx) // (K - 1) + 1 \nL = (idx - 0) // (K - 1) if (idx - 0) % (K - 1) == 0 else (idx - 0) // (K - 1)\nprint(R, L)\npri... | ['Wrong Answer', 'Accepted'] | ['s956260690', 's032030958'] | [13812.0, 14008.0] | [41.0, 42.0] | [316, 447] |
p03319 | u287500079 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int, input().split())\na=[int(i) for in input().split()]\nif n==k:\n print(1)\nelse:\n k-=1\n print((n+k-1)//k)', 'n,k=map(int, input().split())\na=[int(i) for i in input().split()]\nif n==k:\n print(1)\nelse:\n k-=1\n print((n+k-2)//k)'] | ['Runtime Error', 'Accepted'] | ['s626150233', 's673688134'] | [2940.0, 13880.0] | [17.0, 44.0] | [122, 124] |
p03319 | u301624971 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ["from math import ceil\ndef myAnswer(N:int,K:int,A:list) -> int:\n return ceil(N-1 + K -1)\n\ndef modelAnswer():\n return\ndef main():\n N,K = map(int,input().split())\n A = list(map(int,input().split()))\n print(myAnswer(N,K,A[:]))\nif __name__ == '__main__':\n main()", "from math import ceil\ndef myAnswe... | ['Wrong Answer', 'Accepted'] | ['s788003984', 's899163365'] | [13812.0, 13812.0] | [41.0, 40.0] | [269, 275] |
p03319 | u311636831 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nm=min(A)\na=A.index(m)\ntmp=0\ntmp+=math.ceil(a/(K-1))\ntmp+=math.ceil((N-a-1)/(K-1))', 'import math\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\nans = math.ceil((N-K) / (K - 1)) + 1\nprint(ans)\n '] | ['Wrong Answer', 'Accepted'] | ['s451367076', 's104174957'] | [13812.0, 13812.0] | [43.0, 40.0] | [164, 130] |
p03319 | u339199690 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import sys\n\nN, K = map(int, input().split())\nA = list(map(int, sys.stdin.readline().rsplit()))\n\nprint((N - 1) // (K - 1))\n', 'import sys, math\n\nN, K = map(int, input().split())\nA = list(map(int, sys.stdin.readline().rsplit()))\n\nprint(math.ceil((N - 1) / (K - 1)))\n'] | ['Wrong Answer', 'Accepted'] | ['s550830077', 's574883435'] | [13876.0, 13876.0] | [39.0, 40.0] | [122, 138] |
p03319 | u340781749 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n, k = map(int, input().split())\nprint((n - 2) // (k - 2) + 1)\n', 'n, k = map(int, input().split())\nprint((n - 2) // (k - 1) + 1)\n'] | ['Runtime Error', 'Accepted'] | ['s889271078', 's646284826'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 63] |
p03319 | u355853184 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\n\nN, K = map(int, input().split())\nA_list = list(map(int, input().split()))\n\nans = (N-1)//(K-1)\nif K != N:\n print(ans)\nelse:\n print(1)\n\n\npos_1 = 0 \nfor i in range(N):\n if A_list[i] == 1:\n pos_1 = i\n\nans1 = math.ceil((pos_1)/(K-1)) + math.ceil((N-1-pos_1)/(K-1))\nans2 = math... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s032967594', 's196899030', 's775810511'] | [20320.0, 20480.0, 20632.0] | [60.0, 48.0, 51.0] | [486, 151, 127] |
p03319 | u394721319 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ["n,k = map(int,input().split())\nl = list(map(int,input().split()))\n\na = l.index(min(l))\nb = a\n\ncount = 0\nwhile b>0:\n b -= k-1\n count += 1\n print('a')\n\nwhile a<n-1:\n a += k-1\n count += 1\n print('b')\n\nprint(count)\n", 'n,k = map(int,input().split())\nl = list(map(int,input().split()))\... | ['Wrong Answer', 'Accepted'] | ['s989055166', 's526047092'] | [13880.0, 14008.0] | [76.0, 54.0] | [229, 358] |
p03319 | u442030035 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nA = input().split()\ncount = 0\nif N = K:\n print(1)\nelse:\n count += 1\n rem = N-K\n add = 1 if (N-K)%(K-1) else 0\n count += (N-K)//(K-1) + add\n print(count)', 'import math\n\nN, K = map(int, input().split())\nA = input()\nprint(math.ceil((N-1)/(K-1)))\n'] | ['Runtime Error', 'Accepted'] | ['s058067990', 's622705418'] | [2940.0, 4724.0] | [17.0, 18.0] | [203, 88] |
p03319 | u452786862 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['\nK = int(input())\naaa = 1\nans_array = []\n\ndef sunuke(n):\n re = 0\n tmp = n\n while n:\n re += n % 10\n n = n//10\n re = tmp/re\n print(re)\n\ndef print_sunuke():\n global aaa\n num = aaa % 10\n if num == 0:\n aaa += 1\n print_sunuke()\n return\n nine... | ['Runtime Error', 'Accepted'] | ['s508051106', 's403363923'] | [3192.0, 14008.0] | [18.0, 40.0] | [2411, 270] |
p03319 | u453642820 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['from math import ceil\nN,K=map(int,input().split())\nA=list(map(int,input().split()))\na=A.index(1)\nif N==2:\n print(1)\nelse:\n print(min(ceil(a/(K-1))+ceil((N-1-a)/(K-1)),1+ceil((a-1)/(K-1))+ceil((N-1-(a+1))/(K-1))),ceil((N-1)/(K-1)))', 'from math import ceil\nN,K=map(int,input().split())\nA=list(map(int,inp... | ['Wrong Answer', 'Accepted'] | ['s942265383', 's956880714'] | [13812.0, 13812.0] | [41.0, 41.0] | [236, 160] |
p03319 | u467826805 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k = int(input().split())\nprint((n+k-3)/(k-1))\n', 'n,k = map(int,input().split())\nprint((n+k-3)/(k-1))\n', 'n,k = map(int(),input().split())\nprint((n+k-3)/(k-1))\n', 'n,k = int(input().split)\nprint((n+k-3)/(k-1))', 'n,k = map(int,input().split())\nprint((n+k-3)//(k-1))\n'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s045027402', 's114885382', 's316390577', 's496197629', 's429216006'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [48, 52, 54, 45, 53] |
p03319 | u470542271 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nimport math\n\nmath.ceil((n-1) / (k-1))\n', 'n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nimport math\n\nprint(math.ceil((n-1) / (k-1)))\n'] | ['Wrong Answer', 'Accepted'] | ['s249675617', 's121979560'] | [13880.0, 13880.0] | [41.0, 40.0] | [108, 115] |
p03319 | u472883337 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nlis = list(map(int, input().split()))\nl = lis.index(1)\ni = 0\nj = 0\nr = (l + 1) % K\nR = (N - l) % K\n\nif r >= R:\n while l - i * K + i > 0:\n i += 1\n\n while l + r + j * K - j < N - 1:\n j += 1\n \n print(i + j)\n \nelse:\n while l - R - i * K + i > 0:\n i += 1\n... | ['Wrong Answer', 'Accepted'] | ['s390332831', 's889998703'] | [20500.0, 20592.0] | [60.0, 59.0] | [358, 623] |
p03319 | u496131003 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int,input().split())\nA = list(map(int,input().split()))\nn = A.index(min(A))\nn2 = N-1-n\na,b = divmod(n,K-1)\nc,d = divmod(n2,K-1)\nif b == d == 0:\n print(a+c)\nelif b+d < K\n print(a+c+1)\nelse:\n print(a+c+2)', 'N, K = map(int,input().split())\nA = list(map(int,input().split()))\nn = A.index(... | ['Runtime Error', 'Accepted'] | ['s617913707', 's999704187'] | [2940.0, 14008.0] | [17.0, 44.0] | [222, 223] |
p03319 | u499106786 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['args = int(input().rstrip())\n\ndef snuke(number):\n temp = list(str(number))\n arr = [ int(t) for t in temp] \n return sum(arr)\n\ndef find_snuke(args):\n result = []\n i = 1\n while len(result) < args:\n push = True\n for power in range(0,len(str(i))):\n if((i+10**power)/s... | ['Runtime Error', 'Accepted'] | ['s700196064', 's934042635'] | [3064.0, 10420.0] | [17.0, 25.0] | [529, 259] |
p03319 | u526094365 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nif K == 1:\n print(N - 1)\nelif N == K:\n print(1)\nelse:\n if (N - K) % (K - 1) != 0:\n print((N - K) // (K - 1) + 1)\n else:\n print((N - K) // (K - 1))\n', 'N, K = map(int, input().split())\nA = list(map(int, input()... | ['Wrong Answer', 'Accepted'] | ['s562748051', 's224742375'] | [13880.0, 13880.0] | [40.0, 41.0] | [243, 144] |
p03319 | u532806301 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['print(-(-(N-1)//(K-1)))', 'N,K = map(int, input().split())\nprint(-(-(N-1)//(K-1)))'] | ['Runtime Error', 'Accepted'] | ['s612955750', 's623768139'] | [2940.0, 3060.0] | [17.0, 17.0] | [23, 55] |
p03319 | u536034761 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nmini = min(A)\nidx = N + 1\nmid = N / 2\n\nfor i, a in enumerate(A):\n if a == mini and abs(idx - mid) > abs(i - mid):\n idx = i\n\nans = i // (K - 1)\nrem = i % (K - 1)\nif rem:\n ans += 1\n if (N - i - 1 - (K - rem)) // (K - 1) > 0:\n ... | ['Runtime Error', 'Accepted'] | ['s256320119', 's556308386'] | [9000.0, 9156.0] | [25.0, 26.0] | [543, 87] |
p03319 | u539517139 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int,input().split())\nprint((n-1)//(k-1))', 'n,k=map(int,input().split())\nprint(-1*((1-n)//(k-1)))'] | ['Wrong Answer', 'Accepted'] | ['s148615353', 's058501278'] | [2940.0, 3316.0] | [17.0, 21.0] | [48, 53] |
p03319 | u569272329 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nA = list(map(int, input().split()))\nx = A.index(1)+1\nleft = x//K + 1 if x % K != 0 else 0\nright = (N-x+1)//K + 1 if (N-x+1) % K != 0 else 0\nprint(left+right)\n', 'from math import ceil\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\nprint(ceil((N-1)/(K-1... | ['Wrong Answer', 'Accepted'] | ['s451556724', 's404640957'] | [13880.0, 13812.0] | [41.0, 40.0] | [191, 117] |
p03319 | u588558668 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int,input().split())\na=list(map(int,input().split()))\nfor i in range(n):\n if a[i]==1:\n x=i\n y=n-1-i\nimport math\n\nprint(math.ceil(n-1,k))', 'n,k=map(int,input().split())\na=list(map(int,input().split()))\nfor i in range(n):\n if a[i]==1:\n x=i\n y=n-1-i\nimport math\n\nprint(math.ceil(n-1... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s456255956', 's738789408', 's740591618'] | [13880.0, 13812.0, 14008.0] | [48.0, 50.0, 49.0] | [151, 153, 160] |
p03319 | u590672038 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n, k = map(int, input().split())\nprint((n - 2) / (k - 1) + 1)', 'n, k = map(int, input().split())\nprint((n - 2) // (k - 1) + 1)\n'] | ['Wrong Answer', 'Accepted'] | ['s387704218', 's169174200'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 63] |
p03319 | u593567568 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N,K = map(int,input().split())\nA = list(map(int,input().split()))\n\none = A.index(1)\n\nans = None\nif one == 0 or one == N-1:\n ans = -(-(N-1) // (K-1))\nelse:\n left = -(-i // (K-1))\n right = -(-(N - i - 1 - (i % (K-1)))//(K-1))\n ans = left + right\n \nprint(ans)\n \n ', 'N,K = map(int,input().split())\n... | ['Runtime Error', 'Accepted'] | ['s338910812', 's540863918'] | [13812.0, 13880.0] | [40.0, 40.0] | [267, 112] |
p03319 | u607563136 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k = map(int,input().split())\na = list(map(int,input().split()))\n\nni = a.index(1)\n\nans = ni//(k-1)+1 +(n-ni-1 + (ni-1)%(k-1))//(k-1)\nprint(ans)', 'n,k = map(int,input().split())\na = list(map(int,input().split()))\n\nni = a.index(1)\n\nans = ni//(k-1) +(n-ni-1 + ni%(k-1))//(k-1)\nprint(ans)', 'n,k = map(int,in... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s379770095', 's678087279', 's692734223', 's664580299'] | [20552.0, 20452.0, 20376.0, 20412.0] | [51.0, 54.0, 51.0, 52.0] | [144, 138, 142, 93] |
p03319 | u614181788 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k = map(int,input().split())\na = list(map(int,input().split()))\nif k == n:\n print(1)\nelse:\n print(1+math.ceil((n-k)/(k-1)))', 'n,k = map(int,input().split())\na = list(map(int,input().split()))\nans = 1\nans += -(-(n-k)//(k-1))\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s193085719', 's945970472'] | [13812.0, 20324.0] | [41.0, 50.0] | [131, 108] |
p03319 | u619819312 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int,input().split())\na=list(map(int,input().split()))\nprint((n+1)//k)', 'n,k=map(int,input().split())\na=list(map(int,input().split()))\nprint((n-k-1)//(k-1)+2)'] | ['Wrong Answer', 'Accepted'] | ['s253864821', 's043193764'] | [13880.0, 13880.0] | [41.0, 42.0] | [77, 85] |
p03319 | u629350026 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int,input().split())\na=list(map(int,input().split()))\nimport numpy as np\na=np.array(a)\ntemp=np.argmin(a)\nimport math\nif n==k:\n print(1)\nelse:\n print(math.ceil(temp/(k-1))+math.ceil((n-temp-1-(temp+1)%(k-1))/(k-1)))\n', 'n,k=map(int,input().split())\na=list(map(int,input().split()))\nimport numpy as... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s066013566', 's371948705', 's099071714'] | [17200.0, 17176.0, 17196.0] | [178.0, 181.0, 179.0] | [225, 221, 227] |
p03319 | u670961163 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\nk, m = map(int, input().split())\nx = math.ceil((k-1)/(n-1))\n\nprint(x)', 'import math\nk, m = map(int, input().split())\nx = math.ceil((k-1)/(m-1))\n \nprint(x)'] | ['Runtime Error', 'Accepted'] | ['s703767313', 's463894383'] | [3060.0, 3064.0] | [18.0, 17.0] | [81, 82] |
p03319 | u687574784 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k = list(map(int, input().split()))\na = list(map(int, input().split()))\n\n\nidx = a.index(min(a))\nright = n - idx - 1\nleft = idx\n\nq1,r1 = divmod(left, k-1)\nq2,r2 = divmod(right, k-1)\nprint(q1, q2, r1, r2)\nprint(q1 + q2 + min(r1,1) + min(r2,1))', 'n,k = list(map(int, input().split()))\na = list(map(int, inp... | ['Wrong Answer', 'Accepted'] | ['s333315222', 's858169563'] | [20528.0, 20636.0] | [55.0, 170.0] | [275, 357] |
p03319 | u697690147 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['index = a.index(1)\ncnt = 0\n\nif (n==k):\n print(1)\nelse:\n if index <= (k - 1):\n cnt += 1\n i = k - 1\n while i <= (len(a) - 2):\n i += (k-1)\n cnt += 1\n elif index >= (n - k):\n cnt += 1\n i = n - k\n while i >= 1:\n i -= (k-1)\... | ['Runtime Error', 'Accepted'] | ['s197123680', 's306808510'] | [8928.0, 20464.0] | [27.0, 48.0] | [528, 117] |
p03319 | u703823201 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = int((N-1)/(K-1))\n\nif (N-1)%(K-1) == 0:\n print(ans+1)\nelse:\n print(ans)', 'N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = int((N-1)/(K-1))\n\nif (N-1)%(K-1) == 0:\n print(ans)\nelse:\n print(... | ['Wrong Answer', 'Accepted'] | ['s802262130', 's686953344'] | [20452.0, 20508.0] | [52.0, 50.0] | [152, 152] |
p03319 | u703890795 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nA = list(map(int, input().split()))\n \nprint((N-1)//(K-1))', 'N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nprint(N//K)', 'N, K = map(int, input().split())\nA = list(map(int, input().split()))\nimport math\nprint(math.ceil((N-1)/(K-1)))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s461191831', 's776868932', 's015892152'] | [13880.0, 13880.0, 13880.0] | [40.0, 39.0, 40.0] | [90, 81, 110] |
p03319 | u704845096 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['a,b=map(int,input().split())\nprint((a-b)//(b-1)+(1 if a%b > 0 else 0))', 'import math;a,b=map(int,input().split());print(math.ceil((a-1)/(b-1)))'] | ['Wrong Answer', 'Accepted'] | ['s918945036', 's374820903'] | [3060.0, 3060.0] | [17.0, 17.0] | [70, 70] |
p03319 | u742899538 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = list(map(int, input().split()))\nA = [0] + list(map(int, input().split()))\n\n\nzero_index = 0\nfor i in range(len(A)):\n if A[i] == 1:\n zero_index = i\n break\n\ncount = 0\n\n\nzero_left_index = len(A)\n\nzero_left_index -= K\ncount += 1\nwhile zero_left_index > zero_index:\n zero_left_in... | ['Wrong Answer', 'Accepted'] | ['s817767631', 's596512737'] | [13880.0, 13812.0] | [53.0, 49.0] | [893, 910] |
p03319 | u762420987 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int, input().split())\nAlist = list(map(int, input().split()))\nif K >= N:\n print(1)\nelse:\n from math import ceil\n one = Alist.index(1)\n left = N\n right = N - one - 1\n print(ceil(left / K) + ceil(right / K))\n', 'N, K = map(int, input().split())\nAlist = list(map(int, input().split... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s476677504', 's488774659', 's570202036'] | [13812.0, 14004.0, 13812.0] | [40.0, 41.0, 40.0] | [235, 235, 119] |
p03319 | u767664985 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\none = A.index(1)\n\nprint(math.ceil((one+1)/(K-1)) + math.ceil((N-one)/(K-1)))\n', 'from math import ceil\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nif K >= N:\n print(1)\n exit()\n\none = A.... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s287158993', 's324526457', 's573949552', 's779818986', 's990174282', 's699128682'] | [13812.0, 13812.0, 14008.0, 13812.0, 14008.0, 13812.0] | [41.0, 40.0, 41.0, 41.0, 40.0, 41.0] | [160, 206, 118, 159, 130, 135] |
p03319 | u782654209 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ["N,K=map(int,input().split(' '))\nA=list(map(int,input().split(' ')))\nans=0\nposition=0\nwhile True:\n\tif ans==0:\n\t\tposition+=K\n\t\tans+=1\n\telse:\n\t\tif position>=N-1:\n\t\t\tbreak\n\t\telse:\n\t\t\tposition+=K-1\n\t\t\tans+=1\nprint(ans)\n", "N,K=map(int,input().split(' '))\nA=list(map(int,input.split(' ')))... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s424163439', 's540504135', 's550530515'] | [13880.0, 3060.0, 14008.0] | [51.0, 17.0, 51.0] | [214, 158, 160] |
p03319 | u842964692 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N,K=map(int,input().split())\nA=list(map(int,input().split()))\n\nif N<=K:\n print(1)\nelif (N-3)%(K-1)==0:\n print((N-3)//(K-1))\nelse:\n print((N-3)//(K-1)+1)', 'N,K=map(int,input().split())\nA=list(map(int,input().split()))\n\nif N<=K:\n print(1)\nelif (N-K)%(K-1)==0:\n print(1+(N-K)//(K-1))\nelse:\... | ['Wrong Answer', 'Accepted'] | ['s606333208', 's187504650'] | [13880.0, 13880.0] | [39.0, 40.0] | [161, 166] |
p03319 | u848647227 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['ar = list(map(int,input().split(" ")))\ni = ar.index(1)\ncount = 0\nam = 0\nif i % (m - 1) == 0:\n count += i // (m - 1)\nelse:\n count += i // (m - 1) + 1\n am += i % (m - 1)\nif (n - 1 - i) % (m - 1) == 0:\n count += (n - 1 - i) // (m - 1)\nelse:\n count += (n - 1 - i) // (m - 1) + 1\n am += (n - ... | ['Runtime Error', 'Accepted'] | ['s283428029', 's484746485'] | [9144.0, 20636.0] | [27.0, 56.0] | [365, 325] |
p03319 | u852367841 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import numpy as np\nn, k = map(int, input().split())\na_list = list(map(int, input().split()))\n\nif n == k:\n ans = 1\nelse:\n m = int(n / (k - 1))\n s = k\n for i in range(1, m+2):\n s += (k - 1) \n print(s)\n if s >= n:\n ans = i + 1\n break\n else:\n ... | ['Wrong Answer', 'Accepted'] | ['s958217779', 's683502692'] | [23352.0, 24976.0] | [208.0, 321.0] | [329, 242] |
p03319 | u859897687 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int,input().split())\na=list(map(int,input().split()))\nm=a.find(1)\nans=m//(k-1)+(n-m-1)//(k-1)\nkk=m%(k-1)+(n-m-1)%(k-1)+1\nans+=1+(kk>k)\nprint(ans)', 'n,k=map(int,input().split())\na=list(map(int,input().split()))\nm=a.index(1)\nans=m//(k-1)+(n-m-1)//(k-1)\nkk=m%(k-1)+(n-m-1)%(k-1)+1\nif m!=0 and m!=n-1:\... | ['Runtime Error', 'Accepted'] | ['s964598750', 's185762341'] | [14008.0, 13880.0] | [40.0, 41.0] | [153, 218] |
p03319 | u865741247 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\nN,K = list(map(int,input().split(" ")))\nlengths = [] \nnums = list(map(int,input().split(" ")))\ncounts = []\nco = [0,0]\nminnum = min(nums)\nind = 0\n\nfor num in nums:\n if num == 1:\n ind += 1\n else:\n co[ind] += 1\n\nprint(co)\nans = 0\n# print(counts)\nK = K -1\nfor count in co... | ['Wrong Answer', 'Accepted'] | ['s688693329', 's751628799'] | [13812.0, 4724.0] | [60.0, 18.0] | [346, 111] |
p03319 | u874723578 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['import math\nN, K, *A = map(int, open(0).read().split())\nprint(math.ceil((N-1)//(K-1)))\n', 'import math\nN, K = map(int, input().split())\nprint(math.ceil((N-1)/(K-1)))\n'] | ['Wrong Answer', 'Accepted'] | ['s966562652', 's909798369'] | [13852.0, 3060.0] | [40.0, 19.0] | [87, 75] |
p03319 | u882620594 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N, K = map(int,input().split())\nA = list(map(int,input().split()))\nprint(str((N-1) // (K-1)))', 'N, K = map(int,input().split())\nA = list(map(int,input().split()))\nans = (N-1) // (K-1) if (N-1)%(K-1) == 0 else (N-1) // (K-1) + 1\nprint(str(ans))'] | ['Wrong Answer', 'Accepted'] | ['s415510082', 's279412758'] | [13880.0, 14008.0] | [39.0, 44.0] | [93, 147] |
p03319 | u884982181 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['N = int(input())\na =[1,2,3,4,5,6,7,8,9]\nfor i in range(1,10000):\n b = 10**i - 1\n for j in range(1,10):\n a.append(b + j * 10 ** i)\n \nfor i in range(N):\n print(a[i])', 'N,K = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nc = a.index(1)\nnaga = len(a)-K\nif naga <= 0:\n print(1... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s482540720', 's687339815', 's675212510'] | [3060.0, 14008.0, 14008.0] | [17.0, 41.0, 79.0] | [170, 739, 1088] |
p03319 | u888092736 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n, k = map(int, input().split())\na = list(map(int, input().split()))\nif n == k:\n print(1)\n exit()\npos_1 = a.index(1)\nleft = (pos_1 + k - 2) // (k - 1)\nright = (n - pos_1 + k - 3) // (k - 1)\nprint(left, right)\nprint(left + right)', 'N, K = map(int, input().split())\nA = input()\nans = (N - 1) // (K - 1)... | ['Wrong Answer', 'Accepted'] | ['s255203501', 's846033664'] | [13880.0, 4724.0] | [42.0, 18.0] | [234, 137] |
p03319 | u896726004 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n, k = map(int, input())\n\nif (n-1)%(k-1)==0:\n print((n-1)//(k-1))\nelse:\n print((n-1)//(k-1)+1)', 'n, k = map(int, input().split())\n\nif (n-1)%(k-1)==0:\n print((n-1)//(k-1))\nelse:\n print((n-1)//(k-1)+1)'] | ['Runtime Error', 'Accepted'] | ['s825535586', 's221851821'] | [3060.0, 3060.0] | [17.0, 17.0] | [100, 108] |
p03319 | u896741788 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int,input().split())\nl=list(map(int,input().split()))\ni=l.index(1)\nk-=1\na=-(-i//k)+0 if i%k!=1 else -1\nb=-(-(n-i-1)//k)+0 if (n-i-1)%k!=1 else -1\nprint(a+b)', 'n,k=map(int,input().split())\nl=list(map(int,input().split()))\ni=l.index(1)\nk-=1\na=-(-i//k)- int(i%k==1)\nb=-(-(n-i-1)//k)- int((n-i-1)%k==1... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s062056371', 's145058723', 's714482208'] | [14008.0, 13880.0, 3060.0] | [41.0, 41.0, 17.0] | [164, 151, 51] |
p03319 | u916098128 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k = map(int,input().split())\nprint( ( (n-1 + k-2)//(k-1) )+1 )', 'n,k = map(int,input().split())\nprint( ( (n-1 + k-2)//(k-1) ) )'] | ['Wrong Answer', 'Accepted'] | ['s089321730', 's677298300'] | [3060.0, 2940.0] | [17.0, 17.0] | [64, 62] |
p03319 | u944209426 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int, input().split())\na=list(map(int, input().split()))\nfor i in range(n):\n if a[i]==1:\n mi=i\nx=n-(mi+1)\ny=mi\nif x%(k-1)==0:\n ax=x//(k-1)\nelse:\n ax=x//(k-1)+1\nif y%(k-1)==0:\n ay=y//(k-1)\nelse:\n ay=y//(k-1)+1\nif 0<x%(k-1)+y%(k-1)<k:\n print(ax+ay-1)\nelse:\n print(ax+... | ['Wrong Answer', 'Accepted'] | ['s961411758', 's552924317'] | [13812.0, 14004.0] | [49.0, 39.0] | [347, 138] |
p03319 | u997641430 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n, k = map(int, input().split())\nprint((n-1)//(k-1))\n', 'n, k = map(int, input().split())\nprint(-(-(n-1)//(k-1)))\n'] | ['Wrong Answer', 'Accepted'] | ['s098562198', 's652930675'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 57] |
p03319 | u999503965 | 2,000 | 1,048,576 | There is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N. On this sequence, Snuke can perform the following operation: * Choose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen element... | ['n,k=map(int,input().split())\nl=list(map(int,input()))\n\ncnt=1\nnum=k\nwhile num<n:\n num+=(k-1)\n cnt+=1\n \nprint(cnt)\n', 'n,k=map(int,input().split())\nl=list(map(int,input()))\n\ncnt=1\nnum=3\nwhile num<n:\n num+=2\n cnt+=1\n \nprint(cnt)', 'n,k=map(int,input().split())\nl=list(map(int,input().split()))\n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s023471514', 's453180295', 's617087533'] | [10252.0, 10032.0, 20400.0] | [25.0, 27.0, 58.0] | [116, 111, 124] |
p03320 | u098240946 | 2,000 | 1,048,576 | Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6. We will call an integer n a **Snuke number** when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds. Given an integer K, list the K smallest Snuke numbers. | ['K = int(input())\nmaxnum = 10**20\nal = []\nERROR = 10**(-10)\n\ndef sunuke(i):\n s = 0\n old = i\n while i>0:\n s += i%10\n i = i//10\n return [old/s,old]\n\nfor i in range(1,100):\n al.append(sunuke(i))\nfor j in range(3,17):\n for k in range(10,100):\n al.append(sunuke(k*(10... | ['Wrong Answer', 'Accepted'] | ['s887997132', 's602842807'] | [3316.0, 4288.0] | [21.0, 44.0] | [519, 505] |
p03320 | u141610915 | 2,000 | 1,048,576 | Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6. We will call an integer n a **Snuke number** when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds. Given an integer K, list the K smallest Snuke numbers. | ['K = int(input())\nsnuke = ""\ni = 1\nwhile True:\n snuke = str(i % 10) + "9" * (i // 10)\n if snuke[0] == "0":\n i += 1\n continue\n if int(snuke) >= K:\n break\n print(snuke)\n i += 1', 'K = int(input())\na = 0\nb = 1\nfor i in range(K):\n a += b\n print(a)\n if b < (a + b) / sum(map(int,str(a + b))... | ['Wrong Answer', 'Accepted'] | ['s426552585', 's956793589'] | [2940.0, 3188.0] | [17.0, 20.0] | [187, 126] |
p03320 | u239528020 | 2,000 | 1,048,576 | Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6. We will call an integer n a **Snuke number** when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds. Given an integer K, list the K smallest Snuke numbers. | ['#!/usr/bin/env python3\n\nk = int(input())\n\nketa = 4\n\nans_c = []\nsunuke = []\nfor i in range(1, 10**keta): # 1~9999\n a = i\n b = sum([int(j) for j in str(i)])\n tmp_sunuke = a/b\n ans_c.append(a)\n sunuke.append(tmp_sunuke)\n\nbase = 10\nnines = 9\nwhile(len(ans_c) <= 9000000):\n for i in ran... | ['Time Limit Exceeded', 'Runtime Error', 'Accepted'] | ['s213876660', 's733955513', 's898824831'] | [230368.0, 9000.0, 9128.0] | [2214.0, 25.0, 31.0] | [760, 403, 413] |
p03320 | u327466606 | 2,000 | 1,048,576 | Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6. We will call an integer n a **Snuke number** when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds. Given an integer K, list the K smallest Snuke numbers. | ["K = int(input())\n\ns = ''\nwhile K > 0:\n for i in range(1,min(10,K+1)):\n print(i,s, sep='')\n s += '9'\n K -= 10\n", "K = int(input())\nd = 0\nn = 1\nwhile K > 0:\n if ((n+1)*10**d-1)*(sum(map(int,str(n+1)))+9*d) <= ((n+2)*10**d-1)*(sum(map(int,str(n)))+9*d):\n print(n,'9'*d, sep='')\n K -= 1\n n +... | ['Wrong Answer', 'Accepted'] | ['s623294932', 's463090671'] | [3188.0, 3316.0] | [18.0, 21.0] | [115, 224] |
p03320 | u499106786 | 2,000 | 1,048,576 | Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6. We will call an integer n a **Snuke number** when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds. Given an integer K, list the K smallest Snuke numbers. | ['args = int(input().rstrip())\n\ndef snuke(number):\n temp = list(str(number))\n arr = [ int(t) for t in temp] \n return sum(arr)\n\ndef find_snuke(args):\n result = []\n i = 1\n while len(result) < args:\n\n if((i+1)/snuke(i+1))>=(i/snuke(i)):\n result.append(i)\n i=i+1\n ... | ['Wrong Answer', 'Accepted'] | ['s741395573', 's443774072'] | [3060.0, 3188.0] | [17.0, 1323.0] | [330, 557] |
p03320 | u550574002 | 2,000 | 1,048,576 | Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6. We will call an integer n a **Snuke number** when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds. Given an integer K, list the K smallest Snuke numbers. | ['def s(n):\n if n<10:\n return n\n else:\n return n%10+s(n//10)\n\nk =int(input())\nn=0\nfor _ in [0]*k:\n n +=1 \n minn = n\n d = 10\n while n>=d:\n m = (n//d+1)*d-1\n if minn*s(m)>m*s(minn):\n minn = m\n n = minn\n print(n)\n', 'def s(n):\n if n<10... | ['Time Limit Exceeded', 'Accepted'] | ['s779089241', 's029186192'] | [2940.0, 3188.0] | [2104.0, 56.0] | [274, 286] |
p03320 | u814171899 | 2,000 | 1,048,576 | Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6. We will call an integer n a **Snuke number** when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds. Given an integer K, list the K smallest Snuke numbers. | ["def s(n):\n ret=0 \n for i in range(15):\n ret+=(n%10**(i+1))//10**i\n return ret\n\nk=int(input())\nksnk=set()\n\nfor i in range(13):\n for j in range(1,1000):\n n=int(str(j)+'9'*i)\n ksnk.add(n)\nksnk=sorted(list(ksnk), reverse=True)\n\nfmin=float('inf')\nans=[]\nfor a in ksnk:\n... | ['Wrong Answer', 'Accepted'] | ['s375298637', 's116114768'] | [4076.0, 4076.0] | [149.0, 151.0] | [402, 418] |
p03320 | u925364229 | 2,000 | 1,048,576 | Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6. We will call an integer n a **Snuke number** when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds. Given an integer K, list the K smallest Snuke numbers. | ["K = int(input())\ncnt = 0\nb = 1\nans = 1\nwhile cnt <= K:\n\tprint(ans)\n\tcnt += 1\n\tif str(ans)[0] == '9':\n\t\tb *= 10\n\tans += (b)\n", 'lst = [999999999999999,989999999999999,979999999999999,969999999999999,959999999999999,949999999999999,939999999999999,929999999999999,919999999999999,909999999999999,8999999... | ['Wrong Answer', 'Accepted'] | ['s549595380', 's048585151'] | [3060.0, 3576.0] | [18.0, 19.0] | [124, 9262] |
p03320 | u996395152 | 2,000 | 1,048,576 | Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6. We will call an integer n a **Snuke number** when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds. Given an integer K, list the K smallest Snuke numbers. | ['def main():\n seq = [2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1099, 1199, 1299, 1399, 1499, 1599, 1699, 1799, 1899, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 10999, 11999, 12999, 13999, 14999, 15999, 16999, 17999, 18999, 19999, 20999, 21999,... | ['Wrong Answer', 'Accepted'] | ['s066801133', 's689414548'] | [3576.0, 3576.0] | [19.0, 19.0] | [10126, 10090] |
p03323 | u000123984 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['a, b = input().split()\nif a > 8 or b > 8: print(":(")\nelse: print("Yay!")', 'a, b = map(int, input().split())\nif a>8 or b>8: print(":(")\nelse: print("Yay!")'] | ['Runtime Error', 'Accepted'] | ['s488389738', 's764538375'] | [3060.0, 2940.0] | [18.0, 17.0] | [73, 79] |
p03323 | u001024152 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ["a = int(input())\nb = int(input())\n\nif max(a, b) > 8:\n print(':(')\nelse:\n print('Yay!')", "a = int(input())\nb = int(input())\n\nif max(a, b) > 8:\n print(':(')\nelse:\n print('Yay!')", "a,b = map(int, input().split())\n\nif max(a, b) > 8:\n print(':(')\nelse:\n print('Yay!')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s435641608', 's814647074', 's741096077'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [92, 92, 90] |
p03323 | u002459665 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['\n\na, b = map(int, input().split())\nif a <= 8 and b <= 8:\n print("Yay")\nelse:\n print(":(")', 'a, b = map(int, input().split())\nif a <= 8 and b <= 8:\n print("Yay!")\nelse:\n print(":(")\n'] | ['Wrong Answer', 'Accepted'] | ['s278126728', 's116401249'] | [2940.0, 2940.0] | [18.0, 18.0] | [95, 95] |
p03323 | u006425112 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['import sys\n\na, b = map(int, sys.stdin.readline())\n\nif a <= 8 and b <= 8:\n print(\'Yay!\')\nelse:\n print(":(")', 'import sys\n\na, b = map(int, sys.stdin.readline().split()))\n\nif a <= 8 and b <= 8:\n print(\'Yay!\')\nelse:\n print(":(")', 'import sys\n\na, b = map(int, sys.stdin.readline().split())... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s488951203', 's978183905', 's222875380'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [112, 121, 120] |
p03323 | u006657459 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ["line = raw_input().split()\na = line[0]\nb = line[1]\n\nif a > 8 or b > 8:\n return ':('\nelse:\n return 'Yay!'", "line = input().split()\na = line[0]\nb = line[1]\n\nif a > 8 or b > 8:\n return ':('\nelse:\n return 'Yay!'", "line = input().split()\na = line[0]\nb = line[1]\n\nif a > 8 or b > 8:\n prin... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s523021288', 's612424958', 's760778625', 's126579917'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [110, 106, 106, 95] |
p03323 | u007263493 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['a ,b = map(int,input().split())\nif a =< 8 and b=<8:\n print("Yay")\nelse:\n print(":(")', 'a ,b = map(int,input().split())\nif a <= 8 and b <= 8:\n print("Yay!")\nelse:\n print(":(")'] | ['Runtime Error', 'Accepted'] | ['s031876210', 's951282967'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 93] |
p03323 | u010090035 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ["a,b=map(int,input())\nif(a+b%2==0):\n print('Yay!')\nelif(a < 9 and b < 9):\n print('Yay!')\nelse:\n print(':(')", "a,b=map(int,input().split())\nif(a+b%2==0):\n print('Yay!')\nelif(a < 9 and b < 9):\n print('Yay!')\nelse:\n print(':(')"] | ['Runtime Error', 'Accepted'] | ['s629706976', 's247061957'] | [2940.0, 2940.0] | [17.0, 17.0] | [115, 123] |
p03323 | u010512738 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['a, b = map(input().split())\nif a < 8 and b < 8:\n print("Yay!")\nelse:\n print(":(")', 'a, b = map(int, input().split())\nif a <= 8 and b <= 8:\n print("Yay!")\nelse:\n print(":(")'] | ['Runtime Error', 'Accepted'] | ['s914866739', 's330507768'] | [9024.0, 9164.0] | [26.0, 26.0] | [83, 90] |
p03323 | u013296940 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['\nA = int(input())\nB = int(input())\n\nif A>8 or B>8:\n print(":(")\nelif A<=8 and B<=8:\n print("Yay!")\n', '\nA,B = map(int, input().split())\n \nif A>8 or B>8:\n print(":(")\nelif A<=8 and B<=8:\n print("Yay!")'] | ['Runtime Error', 'Accepted'] | ['s538253272', 's587632310'] | [2940.0, 2940.0] | [18.0, 17.0] | [112, 110] |
p03323 | u016901717 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['a,b=map(int,input().split()) \nprint("Yay" if a<=8 and b<=8 else ":(" )', 'a,b=map(int,input().split()) \nprint("Yay!" if a<=8 and b<=8 else ":(" )'] | ['Wrong Answer', 'Accepted'] | ['s468665058', 's912181550'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 71] |
p03323 | u017415492 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['a,b=map(int,input().split())\n\nif a>8 or b>8:\n print(":(")\nelse:\n print("Yay")', 'a,b=map(int,input().split())\n\nif a>8 or b>8:\n print(":(")\nelse:\n print("Yay!")'] | ['Wrong Answer', 'Accepted'] | ['s816858904', 's762997394'] | [2940.0, 2940.0] | [18.0, 17.0] | [79, 80] |
p03323 | u018679195 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['line = input()\nnum_a, num_b = [int(n) for n in line.split()][0]\nis_it_possible = "Yay!"\nif num_a > 8 or num_b > 8:\n is_it_possible = ":("\nprint(is_it_possible)', "a, b = map(int, input().split())\n\nif a > 8 or b > 8:\n print('Yay!')\nelse:\n print(':(')", 'line = input()\nnum_a, num_b = [int(n) for n i... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s321029630', 's984890169', 's650842085'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [162, 92, 159] |
p03323 | u019584841 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ["a = int(input())\nb = int(input())\nif max(a,b) <= 6:\n print('Yay!')\nelse:\n print(':(')", "a = int(input())\nb = int(input())\nif max(a,b) <= 8:\n print('Yay!')\nelse:\n print(':(')", "a,b = map(int,input().split())\nif max(a,b) <= 8:\n print('Yay!')\nelse:\n print(':(')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s387106130', 's456407957', 's112692685'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [87, 87, 85] |
p03323 | u020390084 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['a, b = (int(i) for i in input().split())\n\nif a <= 8 & b<= 8:\n print ("Yay!")\nelse:\n print(":(")\n\n\n', 'a, b = [int(i) for i in input().split()]\n \nif a <= 8 and b<= 8:\n print ("Yay!")\nelse:\n print(":(")'] | ['Wrong Answer', 'Accepted'] | ['s604645286', 's429905941'] | [2940.0, 3060.0] | [18.0, 22.0] | [104, 104] |
p03323 | u020801333 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['A, B = map(int, input().split())\nif A== 8 and B==8:\n print("Yay!")\nif A>8 and b<8:\n print(":(")\nif A<8 and b>8:\n print(":(")\nelse:\n print("Yay!")\n ', 'A, B = map(int, input().split())\nif A<8 and B <8:\n print("Yay!")\nelif A==8 and B == 8:\n print("Yay!")\nelse:\n print(":(")\n'] | ['Runtime Error', 'Accepted'] | ['s664771898', 's886479793'] | [2940.0, 2940.0] | [17.0, 17.0] | [152, 130] |
p03323 | u021770165 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['a,b = map(int,input().split())\n\nfor a<9 and b<9:\n print("Yay!")\nelse:\n print(":(")', 'a,b = map(int,input().split())\n\nif a<9 and b<9:\n print("Yay!")\nelse:\n print(":(")'] | ['Runtime Error', 'Accepted'] | ['s427111833', 's099757239'] | [9008.0, 9024.0] | [26.0, 27.0] | [84, 83] |
p03323 | u023185908 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['import numpy as np\n\na = input()\nb = input()\n\na = int(a)\nb = int(b)\nif a > 8:\n print(\':(\')\n\nelif b > 8:\n print(\':(\')\n\nelif a+b > 16:\n print(":(")\n\nelse:\n print("Yay!")\n', 'i = int(input())\nii = input().split()\n\na = int(0)\nn = int(0)\nm = int(0)\nk = int(0)\nfor n in ii:\n a = i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s181407076', 's444103849', 's146195361'] | [12636.0, 3060.0, 3316.0] | [157.0, 17.0, 19.0] | [179, 229, 162] |
p03323 | u024782094 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['a,b=map(int,input().split)\nprint("Yay!" if a<=8 and b<=8 else ":(")', 'a,b=map(int,input().split)\nprint("Yay!" if (a<=8 and b<=8) else ":(")', 'a,b=map(int,input().split())\nprint("Yay!" if a<=8 and b<=8 else ":(")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s048633887', 's482438689', 's825407221'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [67, 69, 70] |
p03323 | u026155812 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ["A, B = map(int input().split())\nif max(A, B) > 8:\n print(':(')\nelse:\n print('Yay!')", "A, B = map(int, input().split())\nif max(A, B) > 8:\n print(':(')\nelse:\n print('Yay!')"] | ['Runtime Error', 'Accepted'] | ['s507466135', 's735582182'] | [3064.0, 2940.0] | [17.0, 17.0] | [89, 90] |
p03323 | u026686258 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ['D, N = map(int,input().split())\n\ncount = N\nx = (100 ** D) * (N - (N-1)//99) \nprint(x)', 'A, B = map(int, input().split())\n\nmax = max(A,B)\nmin = min(A,B)\nprint("max: {}".format)\nif(A==B):\n print("Yay!")\nelif((min*2+1)+(max-min) +2 <=... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s496559457', 's827803663', 's897775355', 's493168774'] | [2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0] | [157, 191, 94, 96] |
p03323 | u029568245 | 2,000 | 1,024,000 | E869120's and square1001's 16-th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan- shaped pieces. E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should ... | ["a b = list(map(int, input().split()))\nif a <= 8 and b <= 8:\n print('Yay!')\nelse:\n print(':(')", "a, b = list(map(int, input().split()))\nif a <= 8 and b <= 8:\n print('Yay!')\nelse:\n print(':(')"] | ['Runtime Error', 'Accepted'] | ['s433849122', 's261991408'] | [8852.0, 9092.0] | [24.0, 24.0] | [95, 96] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.