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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03012 | u864276028 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nX = list(map(int, input().split()))\nA = 10**10\nR = sum(X)\nL = 0\nfor i in range(N-1):\n\tL += X[i]\n\tR -= X[i]\n\tA = min(A, abs(l-r))\nprint(A)', 'N = int(input())\nX = list(map(int,input().split()))\nA = 10**10\nR = sum(X)\nK = 0\nfor i in range (N-1):\n\tK += X[i]\n\tR -= X[i]\n\tA = min(A, a... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s535259507', 's862651062', 's707836162'] | [3060.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0] | [154, 154, 154] |
p03012 | u868237899 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nW = list(map(int, input().split()))\nans = 1000000\n\nfor T in range(N-1):\n tmp = abs(sum(W[1:T]) - sum(W[T+1:N]))\n if ans > tmp:\n ans = tmp\n \nprint(ans)', 'N = int(input())\nM = list(map(int, input().split()))\nans = sum(M)\n\nfor T in range(N - 1):\n ans = min(abs(sum(M[0:T]) ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s133672247', 's376030166', 's926113949', 's240650445'] | [3060.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [180, 152, 166, 151] |
p03012 | u877415670 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n = int(input())\nw = [int(i) for i in input().split()]\nsumw=-sum(w)\ndif=[]\nfor i in range(0,n):\n sumw += 2*w[i]\n if sumw>=0:\n dif.append(abs(sumw))\n if i>=1:\n dif.append(abs(sumw-2*w[i]))\n else:\n break\n break\nprint(dif)\nprint(min(dif))', 'n = int(i... | ['Wrong Answer', 'Accepted'] | ['s949239483', 's186727628'] | [3064.0, 3060.0] | [17.0, 17.0] | [291, 280] |
p03012 | u882359130 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nW = [int(w) for w in input().split\nans = 10000000\nfor t in range(N):\n less_T = W[:t]\n more_T = W[t:]\n S_l = sum(less_T)\n S_m = sum(more_T)\n d = abs(S_l - S_m)\n if ans > d:\n ans = d\nprint(ans)', 'N = int(input())\nW = [int(w) for w in input().split()]\nans = 100000000\nfor t in ra... | ['Runtime Error', 'Accepted'] | ['s598232145', 's939424452'] | [2940.0, 3064.0] | [19.0, 17.0] | [218, 222] |
p03012 | u888275483 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ["#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nN = int(input())\nW = input().split(' ')\n\nT = 2\nmin = 1000\nwhile True:\n if N < T:\n break\n S1 = sum(map(int, W[0:T]))\n S2 = sum(map(int, W[T:]))\n print(S1, S2)\n T += 1\n\n if abs(S1-S2) < min:\n min = abs(S1-S2)\n\nprint(min)",... | ['Wrong Answer', 'Accepted'] | ['s118982406', 's150717305'] | [3064.0, 3060.0] | [21.0, 19.0] | [297, 279] |
p03012 | u888387803 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['import sys\n\nn = int(input())\nlst = []\nlst = input().split()\n\ns = 0\nfor i in range(n):\n s += int(lst[i])\n # print(i, lst[i], s)\n\nt = int(s / 2)\n# print(s, t)\n\nu = 0\nfor j in range(n):\n u += int(lst[j])\n if u >= t:\n print(abs(s-u))\n sys.exit()\n', 'n = int(input())\nw = list... | ['Wrong Answer', 'Accepted'] | ['s919750916', 's482162916'] | [3060.0, 3060.0] | [18.0, 17.0] | [268, 213] |
p03012 | u899866702 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n = int(input())\nl = [int(x) for x in input().split()]\nsort(l)\n\nprint(n,l)', 'n = int(input())\nl = [int(x) for x in input().split()]\n\nans = 100000000000\nfor i in range(1,n):\n ans1 = sum(l[:i])\n ans2 = sum(l[i:])\n diff = abs(ans1 - ans2)\n if diff < ans:\n ans = diff\n \nprint(ans)\n '] | ['Runtime Error', 'Accepted'] | ['s861627770', 's818396304'] | [2940.0, 3060.0] | [17.0, 17.0] | [74, 212] |
p03012 | u901466816 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ["N = int(input())\nw = list(map(int, input().split(' ')))\n\n\nborder = N // 2\nw1 = sum(w[:border])\nw2 = sum(w[border:])\n\nsub = w1 - w2\ndirection = None\nif sub < 0:\n \n direction = -1\nelif sub > 0:\n \n direction = 1\nelse:\n \n print('0')\n return\n\nprev_sub = 0\nwhile(True):\n prev_sub = sub\n w1 +... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s017875726', 's579449877', 's165716131'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0] | [517, 504, 519] |
p03012 | u905582793 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nA = [int(input()) for _ in range(N)]\nans = 10000\nfor i in range(1,N):\n ans = min(ans, abs(sum(A[:i]-A[i+1:]))\nprint(ans)', 'N = int(input())\nA = list(map(int,input().split()))\nans = 10000\nfor i in range(1,N):\n ans = min(ans, abs(sum(A[:i])-sum(A[i:])))\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s483400414', 's921293400'] | [2940.0, 2940.0] | [17.0, 17.0] | [138, 140] |
p03012 | u908342865 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['import sys\ninput = sys.stdin.readline\nimport numpy\n\nN =int(input())\nWs = np.array([int(i) for i in input().split(" ")])\n\nsub = np.sum(Ws)\n\npre_sub = sub\nfor W in Ws:\n sub = sub - W*2\n\n# print("sub={}".format(sub))\n if abs(pre_sub) < abs(sub):\n\n print(abs(pre_sub))\n break\n pre_sub = sub', ... | ['Runtime Error', 'Accepted'] | ['s486673779', 's888530106'] | [12444.0, 20332.0] | [152.0, 321.0] | [431, 270] |
p03012 | u910369451 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nW = list(map(int,input().split()))\nm = sum(W)\n\nfor j in range(N-1):\n W1 = W[:j+1]\n W2 = W[j+1:N]\n print(W1, W2)\n s = abs(sum(W1) - sum(W2))\n m = min(m, s)\n\nprint(m)\n', 'N = int(input())\nW = list(map(int,input().split()))\nm = sum(W)\n\nfor j in range(N-1):\n W1 = W[:j+1... | ['Wrong Answer', 'Accepted'] | ['s201194962', 's300557549'] | [9168.0, 9048.0] | [29.0, 28.0] | [197, 179] |
p03012 | u913965975 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nl = list(map(int,input().split()))\n\nfor T in range(N-1):\n S1 = 0\n S2 = 0\n for i in range(T+1):\n S1 += l[i]\n for i in range(T+1,N):\n S2 += l[i]\n if T == 0:\n min = abs(S1-S2)\n else if abs(S1-S2) < min:\n min = abs(S1-S2)\n\nprint(min)\n', 'N = i... | ['Runtime Error', 'Accepted'] | ['s085633713', 's279673068'] | [2940.0, 3064.0] | [17.0, 18.0] | [293, 290] |
p03012 | u925712467 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n = int(input())\nlist1 = list(map(int, input().split()))\ngreat = 9999999\nfor i in range(n - 1):\n temp = int(abs(sum(list1[:i + 1]) - sum(list1[i + 1:])))\n if temp < great:\n great = temp\nprint(samin)\n', 'n = int(input())\nlist1 = list(map(int, input().split()))\ngreat = 9999999\nfor i in range(n - 1):\n ... | ['Runtime Error', 'Accepted'] | ['s896185763', 's591978893'] | [9096.0, 9120.0] | [27.0, 29.0] | [204, 204] |
p03012 | u927534107 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n = int(input())\nw = list(map(int,input().split()))\ns = sum(w)\ns_old = s\nfor i in range(len(w)):\n s_new = abs(2*s-sum(w[0:i]) )\n if s_new >=s_old:\n print(s_old)\n exit()\n s_old = s_new ', 'n = int(input())\nw = list(map(int,input().split()))\ns = sum(w)\ns_old = s\nfor i in range(n):\n s_new = abs(s-2*sum(w... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s438664283', 's530353086', 's939476939', 's957416850', 's049575244'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [186, 181, 181, 181, 194] |
p03012 | u931636178 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n = int(input())\ns = list(map(int,input().split()))\ns_sum = sum(s)\nans = s_sum\nfor i in range(1,len(s)+1)\n diff = abs(s[:i]-s[i:])\n if ans >= diff:\n ans = diff\n else:\n break\nprint(ans)', 'N = int(input())\nnumbers = list(map(int,input().split()))\nmin_abs = sum(numbers)\nfor i in range(N-... | ['Runtime Error', 'Accepted'] | ['s987017663', 's142839640'] | [2940.0, 3060.0] | [17.0, 17.0] | [203, 186] |
p03012 | u934119021 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n, x = map(int, input().split())\nl = list(map(int, input().split()))\nd = 0\nans = 1\nfor i in range(n):\n d += l[i]\n if d <= x:\n ans += 1\nprint(ans)', 'n = int(input())\nw = list(map(int, input().split()))\narr = []\nfor i in range(n):\n a = w[:i]\n b = w[i:]\n arr.append(abs(sum(a) - sum(b)))\nprint(min... | ['Runtime Error', 'Accepted'] | ['s467457573', 's553475298'] | [2940.0, 3060.0] | [17.0, 17.0] | [150, 155] |
p03012 | u934868410 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n = int(input())\nw = list(map(int, input().split()))\ns2 = ans = sum(w)\ns1 = 0\nfor i in range(n-1):\n s2 -= w[i]\n s1 += w[i]\n if ans < abs(s2-s1):\n break\n else:\n\tans = abs(s2-s1)\n\nprint(ans)', 'n = int(input())\nw = list(map(int, input().split()))\ns2 = ans = sum(w)\ns1 = 0\nfor i in range(n-1):\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s157600688', 's475749261', 's501224978'] | [3188.0, 2940.0, 3060.0] | [18.0, 18.0, 17.0] | [195, 196, 198] |
p03012 | u941438707 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n=int(input())\nw=[int(i) for i in input().split()]\na=[]\nfor i in range(n-1):\n a.append(abs(sum(w[:i])-sum(w[i:])))\nprint(min(a)) ', 'n=int(input())\nw=[int(i) for i in input().split()]\na=[]\nfor i in range(n):\n a.append(abs(sum(w[:i])-sum(w[i:])))\nprint(min(a)) '] | ['Wrong Answer', 'Accepted'] | ['s113339359', 's427864906'] | [3060.0, 3060.0] | [18.0, 17.0] | [134, 132] |
p03012 | u941458732 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n=input()\nws=list(map(int, list(input().split())))\nwsi=[]\nfor i in range(len(ws)-1):\n wsi.append(abs(sum(ws[:i+1])-sum(ws[i+1:])))\nprint(wsi)\nprint(min(wsi))', 'n=input()\nws=list(map(int, list(input().split())))\nwsi=[]\nfor i in range(len(ws)-1):\n wsi.append(abs(sum(ws[:i+1])-sum(ws[i+1:])))\nprint(min... | ['Wrong Answer', 'Accepted'] | ['s175616883', 's104384476'] | [3060.0, 3060.0] | [18.0, 19.0] | [160, 149] |
p03012 | u942033906 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nW = list(map(int,input().split()))\nans = 100*100\nfor i in range(1, N-1):\n ans = min(abs(sum(W[:i]) - sum(W[i:])), ans)\nprint(ans)', 'N = int(input())\nW = list(map(int,input().split()))\nans = 100*100\nfor i in range(N):\n ans = min(abs(sum(W[:i]) - sum(W[i:])), ans)\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s858723389', 's862820338'] | [3060.0, 2940.0] | [17.0, 17.0] | [147, 142] |
p03012 | u945200821 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['import sys\n\nn = int(sys.stdin.readline())\nw = [int(ball) for ball in sys.stdin.readline().rstrip().split()]\n\ntotal = sum(w)\nhalf = total // 2\n\ncur_sum = 0\ns_1 = 0\n\nfor i in range(n):\n pre_sum = cur_sum\n cur_sum += w[i]\n if cur_sum > half:\n break\n\npre_diff = abs(2 * pre_sum - total)\ncur_diff = ... | ['Wrong Answer', 'Accepted'] | ['s567703489', 's660694643'] | [3064.0, 3060.0] | [17.0, 17.0] | [381, 357] |
p03012 | u947327691 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n=int(input())\nw=list(map(int,input().split()))\n\ntotal=sum[w]\ns1=w[0]\nans=total-s1\n\nfor in range(1,n):\n s1+=w[i]\n ans=min(ans,abs(total-s1*2))\n\nprint(ans)', 'n=int(input())\nw=list(map(int,input().split()))\n\ntotal=sum[w]\ns1=w[0]\nans=total-s1\n\nfor i in range(1,n):\n s1+=w[i]\n ans=min(ans,... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s411614379', 's535716265', 's395388302'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [160, 162, 162] |
p03012 | u952406466 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['8\n27 23 76 2 3 5 62 52', 'n = int(input())\n\nw = list(map(int,input().split()))\ncount = 0\nmin = 1000\nfor t in range(1,n):\n count = abs(sum(w[:t]) - sum(w[t:n])) \n if count < min:\n min = count\nprint(min)\n'] | ['Runtime Error', 'Accepted'] | ['s986959796', 's132762996'] | [2940.0, 2940.0] | [17.0, 17.0] | [22, 182] |
p03012 | u952491523 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['\n\nn = int(input())\nw = list(map(int, input().split()))\n\nlist_sum = sum(list)\n\nans = 1000000\ns1 = 0\ns2 = list_sum\nfor i in range(n):\n s1 += w[i]\n s2 -= w[i]\n ans = min(ans,max(s1-s2,s2-s1))\n\nprint(ans)', '\n\nn = int(input())\nw = list(map(int, input().split()))\n\nlist_sum = sum(w)\n\nans = 1000000\... | ['Runtime Error', 'Accepted'] | ['s055303189', 's013937975'] | [3064.0, 3064.0] | [17.0, 17.0] | [203, 200] |
p03012 | u962356464 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nW = list(map(int,input().split()))\nS = []\nfor i in range (1, N + 1):\n S.append((abs(sum(W[0: i+1])-sum(W[i+1:N+1])))\nprint(min(S))', 'N = int(input())\nW = list(map(int,input().split()))\ns = []\nfor i in range (1, N + 1):\n s.append(abs(sum(W[1:i +1])- sum(W[i +1:N +1])))\nprint(min(s))',... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s126050954', 's319652611', 's554698928'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [150, 152, 162] |
p03012 | u963963908 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nW = list(map(int,input().split()))\nT = []\nfor t in range(1,N):\n Q = [W[i] for i in range(t)]\n R = [W[i] for i in range(t,N)]\n T.append(abs(sum(Q)-sum(R)))\n \n\nprint(T)', 'N = int(input())\nW = list(map(int,input().split()))\nT = []\nQ = []\nR = []\nfor t in range(1,N):\n for i ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s031743557', 's380784999', 's801736569'] | [9184.0, 9244.0, 9184.0] | [32.0, 35.0, 31.0] | [195, 305, 224] |
p03012 | u965075144 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['n = input()\nw = [int(i) for i in input().split()]\n\ns = sum(w)\nss = 0\nll = []\n\nfor i in w:\n ss += i\n rest = s - ss\n ll.append(abs(ss - rest))\n \nreturn(min(ll))', 'n = input()\nw = [int(i) for i in input().split()]\n\ns = sum(w)\nss = 0\nll = []\n\nfor i in w:\n ss += i\n rest = s - ss\n ll.append(ab... | ['Runtime Error', 'Accepted'] | ['s474163457', 's308001881'] | [3060.0, 3060.0] | [18.0, 18.0] | [162, 161] |
p03012 | u967594789 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['import sys\nfrom scipy.special import comb\n\nN,M = list(map(int, input().split()))\n\nA = [0]*M\n\nfor i in range(M):\n A[i] = int(input())\n\nA.append(N+1)\n\ntotal_combo = 1\nNOW = 0\nfor a in A:\n if NOW == a:\n print(0)\n sys.exit()\n L = a-1-NOW\n combo = 0\n for i in range(L//2 +1)... | ['Runtime Error', 'Accepted'] | ['s510345785', 's586097690'] | [14416.0, 3064.0] | [188.0, 18.0] | [427, 488] |
p03012 | u973108807 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ["n = input()\nws = list(map(int, input().split()))\nans = float('inf')\ns = 0\nwhole = sum(ws)\n\nfor i in range(n-1):\n s += ws[i]\n ans = min(ans, abs(whole- 2*s))\n\nprint(ans)", "n = int(input())\nws = list(map(int, input().split()))\nans = float('inf')\ns = 0\nwhole = sum(ws)\n\nfor i in range(n-1):\n s += ws[... | ['Runtime Error', 'Accepted'] | ['s247377865', 's033963497'] | [3060.0, 3064.0] | [17.0, 17.0] | [170, 175] |
p03012 | u974918235 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nW = list(map(int, input().split()))\nans = float("inf")\nfor i in range(1, N-1):\n ans = min(abs(sum(W[:i]) - sum(W[i:])), ans)\nprint(ans)', 'N = int(input())\nW = list(map(int, input().split()))\nS = [0]\nfor i in range(N):\n S.append(S[i] + W[i])\nans = float("inf")\nfor j in range(N):\n ans =... | ['Wrong Answer', 'Accepted'] | ['s447800093', 's425528871'] | [9116.0, 9200.0] | [25.0, 28.0] | [153, 190] |
p03012 | u982591663 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['# ABC-129-B\nN = int(input())\nW = list(map(int, input().split()))\nans = 10**9\n\nfor i in range(1, n):\n S1 = sum(W[:i])\n S2 = sum(W[i:])\n sa = abs(S1-S2)\n ans = min(ans, sa)\nprint(ans)', 'N = int(input())\nW = list(map(int, input().split()))\nans = 10**9\n\nfor i in range(1, n):\n S1 = sum(W[:i]... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s176342698', 's501335301', 's705073714'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [193, 181, 181] |
p03012 | u984276646 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nA = list(map(int, input().split()))\nL, R = [0 for _ in range(N)], [0 for _ in range(N)]\nL[0] = A[0]\nR[N-1] = A[N-1]\nfor i in range(N):\n L[i+1] = L[i] + A[i+1]\n R[N-2-i] = R[N-1-i] + A[N-2-i]\nm = int(1e15)\nfor i in range(1, N):\n a = abs(L[i-1] - R[i])\n if a < m:\n m = a\nprint(m)', '... | ['Runtime Error', 'Accepted'] | ['s627715214', 's981297732'] | [3064.0, 3188.0] | [17.0, 18.0] | [301, 304] |
p03012 | u989385104 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['N = int(input())\nW = list(int(i) for i in input().split()) \nsumW = sum(W)\nW1 = 0\nfor w in W:\n W1 += w\n if W1 > sumW//2:\n if abs(W1 - w - sumW//2) > W1 - sumW//2:\n print(abs(sumW - (2*W1)))\n break\n else:\n print(abs(sumW - (2*W1) - (2*w)))\n break', 'N = int(input())\nW = list(in... | ['Wrong Answer', 'Accepted'] | ['s579258648', 's151478034'] | [3060.0, 3068.0] | [17.0, 17.0] | [273, 273] |
p03012 | u995526718 | 2,000 | 1,048,576 | We have N weights indexed 1 to N. The mass of the weight indexed i is W_i. We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be th... | ['text = input().split("\\n")\nT = int(text[0])\nW = [int(i) for i in text[1]]\nS_1 = sum(W[:T])\nS_2 = sum(W[T:])\nprint(abs(S_1 - S_2))\n', 'text = input()\nN, W = text.split("\\n")[0], text.split("\\n")[1]\n\nN = int(N)\nW = [int(i) for i in W]\n\nans = 100*100\n\nfor T in range(N):\n ans_tmp = abs(sum(W[:T]) - sum... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s391938632', 's393444845', 's417573420', 's502237755', 's586669308', 's628696590', 's630230153', 's708600135', 's855408492', 's935205601'] | [2940.0, 3064.0, 2940.0, 2940.0, 3060.0, 3060.0, 3064.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [130, 224, 227, 248, 236, 241, 228, 247, 247, 223] |
p03013 | u002459665 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\n\nsys.setrecursionlimit(100000)\n\nN, M = map(int, input().split())\nA = []\n\nfor _ in range(M):\n a = int(input())\n A.append(a)\n\n# d = {}\n\n\ndef f(x):\n print(d)\n if x in A:\n return 0\n if x > N:\n return 0\n if x == N:\n return 1\n\n if d.get(x):\n ... | ['Runtime Error', 'Accepted'] | ['s591692905', 's851500720'] | [7000.0, 460056.0] | [186.0, 374.0] | [620, 334] |
p03013 | u007991836 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m = map(int,input().split())\na = [list(int(input()) for i in range(m))]\n\nmod = 1000000007\nb = [0]*(m + 1)\nif m != 0:\n b[0] = a[0] - 1\n b[m] = n - a[m - 1] - 1\nelse:\n b[0] = n\n\nfor i in range(1,m):\n b[i] = a[i] - a[i-1] - 2\n\nb.sort()\nans = 1\nif b[0] == -1:\n ans = 0\nelse:\n pattern... | ['Runtime Error', 'Accepted'] | ['s230449091', 's115647807'] | [460020.0, 460020.0] | [458.0, 372.0] | [506, 511] |
p03013 | u011062360 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\nlist_score = set([int(input()) for _ in range(m)])\n\ndp = [0] * (n + 1)\nmod = pow(10, 9) + 7\n\ndp[0] = 1\nif list_score[0] == 1:\n dp[1] = 0\nelse:\n dp[1] = 1\n\nfor i in range(2, n + 1):\n if i in list_score:\n continue\n dp[i] = dp[i - 1] + dp[i - 2]\n dp[... | ['Runtime Error', 'Accepted'] | ['s809965361', 's579278676'] | [13192.0, 18104.0] | [172.0, 162.0] | [325, 319] |
p03013 | u015593272 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\nDP = [1 for i in range(N+1)]\nMOD = 10**9 + 7\n\nfor i in range(M):\n DP[int(input())] = 0\n\nfor i in range(2,N+1):\n \n if (DP[i] != 0):\n DP[i] = DP[i-1] + DP[i-2]\nprint(MOD)\nprint(DP[N]%MOD)', 'N, M = map(int, input().split())\nDP = [1 for i in range(N+1)]\nMOD ... | ['Wrong Answer', 'Accepted'] | ['s990652679', 's427370323'] | [460056.0, 460056.0] | [483.0, 455.0] | [234, 223] |
p03013 | u020390084 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int,input().split())\na = [int(input()) for i in range(m)]\ndp = [float("inf")] * (n+1)\ndp[0] = 1\ndp[1] = 1\nfor i in a:\n dp[i] = 0\nfor i in range(2, n+1):\n dp[i] = min(dp[i], (dp[i-1] + dp[i-2])%10**9+7)\nprint(dp[n])\n', '#!/usr/bin/env python3\nimport sys\n\nMOD = 1000000007 # type: int\n\nd... | ['Wrong Answer', 'Accepted'] | ['s050895147', 's339350446'] | [7848.0, 7840.0] | [220.0, 88.0] | [232, 768] |
p03013 | u020401041 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\nS = []\ntmp = int(input())\ns = tmp + 1\nfor _ in range(m-1):\n a = int(input())\n S.append(a-tmp)\n tmp = a\ng = n-tmp+1\n\nfib = [1 for _ in range(n+1)]\nfor i in range(2, n-1):\n fib[i+2] = fib[i] + fib[i+1]\ntotal = fib[s]*fib[g]\n\nfib[1] = 0\n\nfor x in S:\n total *= fib[x... | ['Runtime Error', 'Accepted'] | ['s353050641', 's570332049'] | [461736.0, 460848.0] | [554.0, 678.0] | [343, 331] |
p03013 | u020962106 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["n,m = map(int,input().split())\nxx = [int(input()) for _ in range(m)]\n\nf = [0]*(n+3)\nf[0] = 1\nendf = 0\nfor i in range(1,n+1):\n if i in xx:\n endf += 1\n print('skip',i)\n if endf ==2:\n print(0)\n break\n continue\n else :\n if endf == 1:\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s544375209', 's794713291', 's110079333'] | [460020.0, 460020.0, 460020.0] | [2119.0, 455.0, 473.0] | [443, 230, 192] |
p03013 | u021548497 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N,M = map(int, input().split())\na = []\nfor _ in range(M):\n a.append(int(input()))\n \ndef fibonacci(n):\n listf = [0]+[1]*n\n a, b = 1, 0\n for i in range(n-1):\n a, b = (a+b)%1000000007 , a\n listf[i+2] = a\n return listf \n\nfib = fibonacci(N+1)\n\nif a:\n ans = [a[0]]\n \n f... | ['Wrong Answer', 'Accepted'] | ['s703018873', 's425483458'] | [8616.0, 11660.0] | [229.0, 233.0] | [583, 586] |
p03013 | u022979415 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['def main():\n mod = 1000000007\n N, M, *A = map(int, open(0).read().split())\n A = set(A)\n F = [0] * (N + 1)\n F[0] = 1\n if 1 in A:\n F[1] = 1\n for i in range(2, N + 1):\n if i not in A:\n F[i] = (F[i-1] + F[i-2]) % mod\n print(F[N])\n\n\nif __name__ == "__main__":\... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s285262322', 's301755988', 's482299065', 's628242529', 's795957013', 's881751480', 's934881662', 's467117399'] | [14180.0, 13940.0, 9000.0, 9000.0, 5132.0, 9304.0, 460020.0, 462744.0] | [49.0, 2104.0, 187.0, 188.0, 115.0, 196.0, 480.0, 575.0] | [315, 300, 516, 516, 538, 529, 315, 534] |
p03013 | u023958502 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m = map(int,input().split())\nstair = [0,1] + [0 for i in range(n)]\nba = 2\nfor i in range(m):\n\ta = int(input()) + 1\n\tfor j in range(ba,a):\n\t\tstair[j] = stair[j - 1] + stair[j - 2]\n\tba = a + 1\nfor i in range(ba,n + 2):\n\tstair[i] = stair[i - 1] + stair[i - 2]\nprint(stair[n + 1])\nprint(stair)', 'N, M =... | ['Wrong Answer', 'Accepted'] | ['s015032195', 's343706721'] | [500836.0, 11884.0] | [2138.0, 189.0] | [291, 353] |
p03013 | u024340351 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['H, W = map(int, input().split())\nS = [int(input()) for _ in range(W)]\n \nfloor = list(range(0,H+1))\n \nif S.count(1) >0:\n\tfloor[1]=0\n\tfloor[2]=1\n\tif S.count(2) >0:\n\t\tfloor[2]=0\nelif S.count(2) >0:\n\tfloor[1]=1\n\tfloor[2]=0\n \nteiou = [0]*H\nfor i in range (0, H):\n\tteiou[i] = S.count(i)\n \nfor... | ['Wrong Answer', 'Accepted'] | ['s807737560', 's675343695'] | [11816.0, 465364.0] | [2104.0, 514.0] | [469, 504] |
p03013 | u025287757 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\na = []\nfor i in range(M):\n a.append(int(input()))\ndp = []\ndp.append(1)\nif a:\n cantuse = a.pop(0)\n if cantuse == 1:\n dp.append(0)\n cantuse = a.pop(0)\nelse:\n cantuse = -1\n dp.append(1)\n\nfor i in range(N-1):\n if (i+2) == cantuse:\n dp.append(0)\n if a:\n ... | ['Runtime Error', 'Accepted'] | ['s829139198', 's853930691'] | [460020.0, 460020.0] | [1710.0, 1674.0] | [383, 422] |
p03013 | u033524082 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\nn,m=map(int,input().split())\nl=[]\nfor i in range(m):\n l.append(int(input()))\nif n==1:\n if 1 in l:\n print(0)\n else:\n print(1)\n sys.exit()\nans1=0\nans2=0\nif 1 in l:\n if 2 in l:\n print(0)\n sys.exit()\n else:\n ans2=1\nelse:\n ans1=1\n i... | ['Runtime Error', 'Accepted'] | ['s349885562', 's409430666'] | [3064.0, 7416.0] | [17.0, 175.0] | [510, 593] |
p03013 | u035605655 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\nmod = 1e+9+7\nflags = [True for i in range(N)]\nfor i in range(M):\n tmp = int(input())\n flags[tmp-1] = False\ndp = [0 for i in range(N)]\ndp[0] = 1\ndp[1] = 2\n\nif not flags[0]:\n dp[0] = 0\n dp[1] = 1\nif not flags[1]:\n dp[1] = 0\nfor i in range(2, N):\n if fl... | ['Runtime Error', 'Accepted'] | ['s469596174', 's973931169'] | [11028.0, 7832.0] | [206.0, 193.0] | [371, 385] |
p03013 | u038854253 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["import operator\nfrom functools import reduce\n\n\ndef ncr(n, r):\n r = min(r, n-r)\n numer = reduce(operator.mul, range(n, n-r, -1), 1)\n denom = reduce(operator.mul, range(1, r+1), 1)\n return numer // denom\n\n\ndef calc_step2patterns(num_step):\n pats = 0\n for j in range(0, (num_step//2)+1):\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s176299877', 's259814191', 's395654684', 's407765306', 's528613320', 's638897853', 's807306435', 's934164825', 's901756229'] | [3572.0, 14260.0, 14308.0, 15224.0, 39132.0, 39132.0, 14300.0, 15232.0, 468608.0] | [112.0, 296.0, 242.0, 2108.0, 2110.0, 2110.0, 2108.0, 2109.0, 448.0] | [1064, 931, 925, 977, 972, 972, 1011, 980, 642] |
p03013 | u040537497 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\ninput = sys.stdin.readline\n\nn, m = map(int, input().split())\n\na_set=set()\n\nfor index in range(m):\n a_set.add(int(input()))\n\nans_list=[0 * (n+1)]\n\nfor index in range(n + 1):\n if index == 0:\n ans_list[index] += 1\n continue\n if index == 1 and (index not in a_set):\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s513158399', 's836698289', 's287323814'] | [11884.0, 11884.0, 11884.0] | [77.0, 70.0, 116.0] | [672, 689, 592] |
p03013 | u047023156 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\na = []\nfor _ in range(M):\n a.append(int(input()))\n\nif M = 0:\n arr = N\nelse:\n arr = [a[0] - 1]\n for i in range(M-1):\n print(a[i], a[i+1])\n diff = a[i+1] - a[i] - 1\n arr.append(diff)\n if diff ... | ['Runtime Error', 'Accepted'] | ['s478504070', 's864407341'] | [2940.0, 10124.0] | [17.0, 71.0] | [560, 517] |
p03013 | u048320062 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['\n\nN, M = map(int, input().split())\nhoal = [int(input()) for i in range(M)]\n\n\ndp = list()\ndp = [0]*N\ndp[0] = 1\ndp[1] = 2\n\n\nif 1 in hoal:\n dp[0] = 0\n dp[1] = 1\n\nif 2 in hoal:\n dp[1] = 0\n \ndp_check = list()\ndp_check = [0]*N\n\nfor i in range(M):\n dp_check[hoal[i]-1]=1\n if dp_check... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s649424681', 's813385235', 's403978753'] | [10864.0, 8616.0, 8616.0] | [166.0, 170.0, 170.0] | [1188, 1330, 1376] |
p03013 | u057415180 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\na = [tuple(int(input()) for _ in range(m))]\n\ns = [1]*(n+1)\n\nif 1 in a:\n s[1] = 0\n\nfor i in range(n-1):\n if i+2 in a:\n s[i+2] = 0\n continue\n s[i+2] = (s[i+1] + s[i]) % (10**9+7)\n \nprint(s[-1])', 'n, m = map(int, input().split())\na = (int(input()... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s290110963', 's414557676', 's661676338', 's547293135'] | [11028.0, 6892.0, 3064.0, 11884.0] | [214.0, 206.0, 17.0, 193.0] | [250, 243, 244, 243] |
p03013 | u057948305 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["def fib(n, broken):\n a = 1\n b = 1\n for i in range(n-2):\n \n\n a, b = b, a + b\n print(b)\n\n\nt = int(input())\nfor _ in range(t):\n n, m = [int(x) for x in input().split()]\n broken = set()\n for _ in range(m):\n broken.add(int(input()))\n\n x = 0\n y = 1\n i = ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s315161480', 's596149578', 's974958573'] | [3064.0, 11884.0, 11884.0] | [18.0, 180.0, 188.0] | [1162, 1870, 2511] |
p03013 | u058640635 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['def fib(x):\n if x==0:\n return 0\n elif x==1 or x==2\n \treturn 1\n else\n \treturn fib(x-2)+fib(x-1)\n\nN,M=(int(x) for xin input().split())\na=[int(input()) for i in range(M)]\nx=1\nfor i in range(1,M):\n x*=fib(a[i]-a[i-1])\n\nprint (a%((10e+9)+7))', 'def fib(x):\n if x=0:\n return 0\n elif x=1 or x... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s441969141', 's495002986', 's633134438', 's645303210', 's732698369', 's786519017', 's927064098', 's388461922'] | [2940.0, 2940.0, 3064.0, 2940.0, 460056.0, 464040.0, 460056.0, 460020.0] | [17.0, 18.0, 17.0, 17.0, 2104.0, 601.0, 2104.0, 465.0] | [245, 242, 335, 247, 208, 317, 207, 310] |
p03013 | u059436995 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\nmod = 1000000007\na = [True] * (n + 1)\nfor i in range(m):\n a[int(input())] = False\ndp = [0] * (n + 1)\ndp[0] = 1\n\ndp[1] = dp[0] if a[1] else 0\n\nfor i in range(2, n + 1):\n if a[i]:\n dp[i] = (dp[i - 1] + dp[i - 2]) % mod\n\nprint(dp)', 'n, m = map(int, input().spl... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s069246101', 's735161230', 's785182616', 's938364994'] | [10864.0, 7796.0, 7824.0, 7668.0] | [179.0, 187.0, 2104.0, 67.0] | [273, 301, 282, 300] |
p03013 | u060793972 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m,*a=map(int,open(0).read().split())\nmod=10**9+7\np=[1]\na=iter(a)\nb=a.__next__()\nif 1==b:\n p.append(0)\n b=next(a,-1)\nelse:\n p.append(1)\nfor i in range(2,n+1):\n if i==b:\n p.append(0)\n b=next(a,-1)\n print(i)\n else:\n p.append((p[i-1]+p[i-2])%mod)\nprint(p[-1])'... | ['Runtime Error', 'Accepted'] | ['s191823791', 's968674969'] | [13940.0, 13940.0] | [133.0, 64.0] | [300, 281] |
p03013 | u067694718 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = [int(i) for i in input().split()]\nfibo_l = [1, 1] + [None] * (n - 2)\na = [int(input()) for i in range(m)]\n\ndef fibo(x):\n if x not in a and x >= 0:\n if fibo_l[x] is None:\n fibo_l[x] = fibo(x - 1) + fibo(x - 2)\n return fibo_l[x]\n else: return 0\n \nprint(fib... | ['Runtime Error', 'Accepted'] | ['s016000743', 's864960178'] | [7780.0, 84068.0] | [164.0, 171.0] | [326, 387] |
p03013 | u075303794 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m = map(int, input().split())\ndiv = 1000000007\nok [True] * (n + 1)\nfor _ in range(m):\n a = int(input())\n ok[a] = False\ndp = [0] * (n + 1)\ndp[0] = 1\nif ok[1]:\n dp[1] = 1\nelse:\n dp[1] = 0\n\nfor i in range(2, n+1):\n if ok[i]:\n dp[i] = dp[i-1] + dp[i-2]\n dp[i] %= div\n\nprint(dp[n])\n ', 'n,m... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s009178091', 's211096412', 's716841538', 's480362668'] | [3064.0, 3064.0, 3064.0, 7668.0] | [18.0, 17.0, 17.0, 181.0] | [292, 290, 286, 294] |
p03013 | u076917070 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\ninput=sys.stdin.readline\n\nn,m = map(int, input().split())\na = []\nfor i in range(m):\n a.append(int(input()))\nif len(a) >= 2:\n for i in range(m-1):\n if a[i]+1 == a[i+1]:\n print(0)\n exit()\ndef fib(n):\n a, b = 1, 0\n for _ in range(n):\n a, b = a + b... | ['Wrong Answer', 'Accepted'] | ['s860353786', 's191858667'] | [7080.0, 460020.0] | [150.0, 455.0] | [460, 299] |
p03013 | u085717502 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['#!/usr/bin/env python\n# coding: utf-8\n\n# In[15]:\n\n\nfrom collections import deque\n\n\n# In[33]:\n\n\nN,M = map(int, input().split())\nalist = [True]*N\nfor _ in range(M):\n alist[int(input())-1] = False\n\n\n# In[35]:\n\n\ndp = deque([0]*2)\ndp[0] = 1\nans = 0\nmod = 1000000007\nif N == 1:\n ans = 1\nelse... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s561681844', 's921328200', 's823605553'] | [9924.0, 9888.0, 9988.0] | [163.0, 167.0, 161.0] | [563, 560, 547] |
p03013 | u089230684 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['// Fibonacci \n#include <bits/stdc++.h> \nusing namespace std; \nlong long dp[1000];\nlong long MOD {1000000007}; \nint main () {\n ios::sync_with_stdio(false);\n\n int n; cin >> n; \n int m; cin >> m; \n vector<int> broken(100010, 0);\n int x;\n for (int i = 0; i < m; i++) {\n cin >> x; \n ... | ['Runtime Error', 'Accepted'] | ['s238658994', 's588488732'] | [2940.0, 3064.0] | [17.0, 212.0] | [759, 280] |
p03013 | u090266528 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = list(map(int, input().split()))\na = []\nfor _ in range(M):\n a.append(int(input()))\n\ndif = [a[0]-1]\ndif.extend([(a[i]-1)-(a[i-1]+1) for i in range(1,len(a))])\ndif.extend([N-a[-1]-1])\nmax_dif = max(dif)\nprint(dif, max_dif)\n\nFiblist = {-1:0,0:1,1:1,2:2}\nfor n in range(3,max_dif+1):\n Fiblist[n]=F... | ['Runtime Error', 'Accepted'] | ['s123340154', 's024406018'] | [8868.0, 468604.0] | [221.0, 373.0] | [414, 451] |
p03013 | u091051505 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['inf = 7 + (10 ** 9)\nn, m = map(int, input().split())\ndp1 = [0] * (n + 1)\ndp1[0] = 1\nfor _ in range(m):\n a = int(input())\n dp1[a] = - inf\nfor i in range(n):\n if i < n:\n if (dp1[i + 1] != inf) & (dp1[i] != inf):\n dp1[i + 1] = dp1[i + 1] + dp1[i]\n if i + 1 < n:\n if (d... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s601936813', 's798362517', 's250457602'] | [463476.0, 6900.0, 462708.0] | [839.0, 195.0, 683.0] | [412, 410, 416] |
p03013 | u093041722 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\nsys.setrecursionlimit(100000000000)\ninput = sys.stdin.readline\n\nN,M = (int(x) for x in input().split())\na = set(int(input()) for _ in range(M))\nmem = [0] * N\ndef count_steps(n):\n if mem[n-1]:\n return mem[n-1]\n elif n - 1 in a and n - 2 in a:\n return 0\n elif n - 1 in a:\n ... | ['Runtime Error', 'Accepted'] | ['s994554858', 's703919884'] | [3064.0, 11884.0] | [17.0, 181.0] | [760, 667] |
p03013 | u096736378 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import math\nn, m = map(int, input().split())\np = []\npre = 0\n\ndef pattern_count(a,b):\n if a == 0 or b == 0:\n return 1\n else:\n return math.factorial(a+b)//(math.factorial(a)*math.factorial(b))\n\ndef count(a):\n ret = 0\n for i in range(a//2 + 1):\n ret += pattern_count(i, a-i*... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s133491776', 's960732140', 's699701089'] | [4400.0, 4400.0, 460020.0] | [2104.0, 2104.0, 462.0] | [683, 670, 399] |
p03013 | u098012509 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['from collections import defaultdict\n\nN, M = [int(x) for x in input().split()]\na = []\n\nfor _ in range(M):\n a.append(int(input()))\n\nMOD = 1000000007\n\ndict = defaultdict(int)\nans = 1\nfor i in range(M):\n dict[a[i]] = -10 ** 1000000000\n if i >= 1 and a[i] - a[i - 1] == 1:\n print("0")\n ... | ['Time Limit Exceeded', 'Accepted'] | ['s489792793', 's813752055'] | [11156.0, 468500.0] | [2104.0, 569.0] | [450, 346] |
p03013 | u102367647 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['\n\n#import list\nfrom sys import stdin\n\ninput = stdin.readline\n\n#constant\n#N = int(input())\nN, M = list(map(int,input().split()))\nA = [int(input()) for _ in range(M)]+[N+1]\n\n#variable\n\n#function\ndef partition(two_steps,total_steps):\n if two_steps == 0:\n return 1\n elif two_steps == 1:\n ... | ['Wrong Answer', 'Accepted'] | ['s790948212', 's241649164'] | [7848.0, 21088.0] | [2104.0, 386.0] | [1234, 574] |
p03013 | u102731033 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m = map(int,input().split())\na = list(int(input())for i in range(m))\nmod = 10**9+7\nb = [0] * (n-1)\nb[0] = 1\nb[1] = 1\nfor i in a:\n b[i] = -1\n\nfor i in range(2,n+1):\n if b[i] == -1:\n continue\n if b[i-1] != -1:\n b[i] += b[i-1]\n if b[i-2] != -1:\n b[i] += b[i-2]\n\nprint(b... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s126024158', 's308535256', 's366825967', 's949815994'] | [462708.0, 7068.0, 3064.0, 462708.0] | [602.0, 176.0, 18.0, 628.0] | [310, 310, 310, 291] |
p03013 | u103208639 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\na = [int(input()) for _ in range(m)]\nmod=10**9+7\ndp=[0]*(n+1)\ndp[0]=1\nfor i in range(1,n+1):\n if i in a:\n dp[i]=0\n a.pop(0)\n else:\n dp[i]=(dp[i-2]+dp[i-1])%mod\nprint(dp)\n', 'n,m=map(int,input().split())\na = [int(input()) for _ in range(m)]\n\nmod=10... | ['Wrong Answer', 'Accepted'] | ['s977329865', 's368775956'] | [10096.0, 8592.0] | [2104.0, 196.0] | [226, 249] |
p03013 | u104005543 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["def fiv(n):\n return int((((1+(5)**(1/2))/2)** (n + 1) - ((1-(5)**(1/2))/2)** (n + 1))//(5**(1/2)))\n\nn, m = map(int, input().split())\nbroken = []\nfor i in range(m):\n\tbroken.extend(map(int, input()))\n\np = [0] * (m + 1) \n\nfor i in range(m + 1):\n if i == 0: \n if broken[0] == 1:\n p[0]... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s156655573', 's518016275', 's576204251', 's636167948', 's704871621', 's794125354', 's260589575'] | [7812.0, 10256.0, 7812.0, 7820.0, 10280.0, 10280.0, 7064.0] | [270.0, 144.0, 265.0, 271.0, 133.0, 124.0, 181.0] | [840, 741, 771, 787, 632, 739, 250] |
p03013 | u104442591 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\na = []\nfor i in range(m):\n a.append(int(input()))\nans = 0\nflag = 0\na = set[a]\n\n\ndp = [0] * (n+1)\ndp[0] = 1\nif 1 in a:\n dp[1] = 0\nelse:\n dp[1] = 1\n \nfor i in range(2, n+1):\n if dp[i-2] == 0 and dp[i-1] == 0:\n ans = 0\n flag = 1\n break\n elif i in a:\n ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s035136298', 's042759665', 's484290712', 's693649285', 's773875509', 's968362516', 's219302700'] | [7080.0, 7080.0, 7080.0, 3064.0, 3064.0, 7080.0, 13212.0] | [176.0, 2108.0, 2104.0, 17.0, 18.0, 187.0, 178.0] | [440, 463, 463, 463, 409, 353, 460] |
p03013 | u105302073 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['MOD = 1e9 + 7\n\nN, M = [int(i) for i in input().split()]\nissafe = [True] * (N + 1)\nfor i in range(M):\n a = int(input())\n \n issafe[a] = False\n\n# dp\ndp = [0] * (N + 1)\n\ndp[0] = 1\nif issafe[1]:\n dp[1] = 1\n\nfor i in range(2, N + 1):\n \n if issafe[i - 1]:\n dp[i] += dp[i - 1]\n ... | ['Wrong Answer', 'Accepted'] | ['s955616911', 's776721651'] | [6900.0, 7828.0] | [211.0, 253.0] | [475, 352] |
p03013 | u106103668 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m= map(int,input().split())\nc = [True]*(n+1)\nfor _ in range(m):\n c[int(input())] = False\nd = [0]*(n)\nif c[1] : d[1] = 1\nif c[2] : d[2] = d[1] + 1\nfor i in range(3,n+1):\n if c[i] : d[i] = ( d[i-1] + d[i-2] ) % 1000000007\nprint(d[n])', 'def resolve():\n n,m= map(int,input().split())\n a = [int(in... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s628194614', 's876798307', 's759762497'] | [7668.0, 3064.0, 7864.0] | [185.0, 17.0, 261.0] | [239, 286, 355] |
p03013 | u106778233 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\ndp=[0]*(n+3)\nfor i in range(m):\n dp[int(input())]=-1\n\nfor i in range(1,n+1):\n if dp[i]==-1:\n continue \n else:\n if dp[i-1]!=-1:\n dp[i]+=dp[i-1]\n if dp[i-2]!=-1:\n dp[i]+=dp[i-2]\n\nprint(dp[n]%1000000007)', 'n,m=map(int,input()... | ['Wrong Answer', 'Accepted'] | ['s536503448', 's348329247'] | [3828.0, 462708.0] | [191.0, 614.0] | [281, 289] |
p03013 | u106797249 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\nsys.setrecursionlimit(10000000) \n\ndef resolve():\n (N, M) = list(map(int, input().split(" ")))\n As = [int(input()) for i in range(M)]\n # mems = [False] * (N+1)\n\n cnts = [False] * (N+1)\n for i in range(N+1):\n c = 0\n if i in As:\n c = 0\n elif i == 0:\... | ['Wrong Answer', 'Accepted'] | ['s878148215', 's446048897'] | [66280.0, 7844.0] | [2106.0, 181.0] | [1128, 570] |
p03013 | u113971909 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N,M=map(int,input().split())\nmod = 10**9+7\ndef framod(n, mod, a=1):\n for i in range(1,n+1):\n a=a * i % mod\n return a\n\ndef power(n, r, mod):\n if r == 0: return 1\n if r%2 == 0:\n return power(n*n % mod, r//2, mod) % mod\n if r%2 == 1:\n return n * power(n, r-1, mod) % mod\n\... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s099742035', 's789519225', 's879728084'] | [3064.0, 3064.0, 13216.0] | [17.0, 17.0, 191.0] | [691, 693, 512] |
p03013 | u114920558 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\nA = set([int(input()) for _ in range(M)])\nmod = 10**9 + 7\nans = [0] * (N+1)\nans[0] = 1\nans[1] = 1 if i not in a else 0\nfor i in range(2, N+1):\n ans[i] = (ans[i-1]+ans[i-2])%mod if i not in a else 0\nprint(ans[N])', 'N, M = map(int, input().split())\nA = set([int(input()) for _... | ['Runtime Error', 'Accepted'] | ['s076499893', 's957748720'] | [13192.0, 13216.0] | [172.0, 182.0] | [245, 245] |
p03013 | u116233709 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\nmod=10**9+7\na=[0]*(n+1)\ndp=[0]*(n+1)\ndp[0]=1\nfor i in range(m):\n a[int(input())]=1\n \nif 1 in a:\n dp[1]=0\nelse:\n dp[1]=1\n \nfor j in range(2,n+1):\n if a[j]==0:\n dp[j]=dp[j-1]+dp[j-2] \n \nprint(dp[n]%mod) \n\n \n \n\n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s327147998', 's409901112', 's424340976', 's583143176', 's625877046', 's774407422', 's812301236', 's771061862'] | [460788.0, 6900.0, 6900.0, 2940.0, 6900.0, 6900.0, 7884.0, 460788.0] | [431.0, 69.0, 63.0, 17.0, 65.0, 64.0, 2104.0, 429.0] | [296, 259, 266, 266, 268, 280, 317, 296] |
p03013 | u118211443 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\np = {int(input()) for _ in range(m)}\ns = 10 ** 9 + 7\n\ndp = [0] * (n + 1)\ndp[0] = 1\ndp[1] = 1\nif 1 in p:\n dp[1] = 0\n\nfor i in range(2, n):\n if i in p:\n continue\n dp[i] = (dp[i - 1] + dp[i - 2]) % s\nprint(dp[-1])\n', 'n, m = map(int, input().split())\np = {... | ['Wrong Answer', 'Accepted'] | ['s320629826', 's755645656'] | [11884.0, 11884.0] | [186.0, 173.0] | [260, 263] |
p03013 | u127499732 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\nx=set(int(input()) for _ in range(m)\nf=[0]*(n+1)\nf[0]=1\nfor i in range(1,n+1):\n f[i]=(f[i-1]+f[i-2])%(10**9+7)\n if i in x:\n f[i]=0\nprint(f[n]%(10**9+7))', 'n,m=map(int,input().split())\nx=[int(input()) for _ in range(m)]\nf=[0]*(n+1)\nf[0]=1\nf[1]=1\nfor i in range(n):\n if ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s058892669', 's584998622', 's612020867'] | [2940.0, 7824.0, 13192.0] | [17.0, 2104.0, 210.0] | [186, 187, 189] |
p03013 | u128646083 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["n,m=map(int,input().split())\na=[]\nb=0\nc=0\nd=1\ne=0\nfor i in range(m):\n a.append(int(input()))\nfor j in range(m-1):\n if(a[j]+1==a[j+1]):\n print('0')\n break \nz=list(set(a))\nz=sorted(z)\nz.append(0) \nfor i in range(n):\n if(z[b]==i+1):\n b+=1 \n continue \n ... | ['Runtime Error', 'Accepted'] | ['s142994174', 's643497571'] | [3064.0, 7832.0] | [17.0, 211.0] | [375, 348] |
p03013 | u135847648 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\nsys.setrecursionlimit(10**6)\nreadline = sys.stdin.readline\n\nn,m = [int(i) for i in readline().split()]\na = [int(sys.stdin.readline()) for i in range(m)]\nprint(a)\ndp = [1]*2 + [0]*(n-1)\nmod = 1000000007\n \nfor i in range(n-1):\n if i+1 in a:\n dp[i+2] = dp[i]\n dp[i+1] = 0\n else:\n dp... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s127311631', 's605256545', 's798912819', 's856000111', 's720309121'] | [460004.0, 460004.0, 3828.0, 460004.0, 7668.0] | [2117.0, 2123.0, 21.0, 371.0, 75.0] | [346, 346, 274, 389, 298] |
p03013 | u139112865 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['#129_C\nn,m=map(int,input().split())\na=[int(input()) for _ in range(m)]\nmod=10**9+7\ndp=[1 for i in range(n+1)]\nfor i in range(1,n+1):\n if i in a:\n dp[i]=0\n elif i==1:\n dp[i]=dp[i-1]\n else:\n dp[i]=(dp[i-1]+dp[i-2])%mid\n \nprint(dp[n]%mod)', '#129_C\nn,m=map(int,input().s... | ['Runtime Error', 'Accepted'] | ['s072448684', 's508089248'] | [7848.0, 11884.0] | [470.0, 180.0] | [272, 239] |
p03013 | u141610915 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\nmod = 10 ** 9 + 7\n\ndef fibonacci(n):\n if n == 1:\n return 1\n if n == 2:\n return 2\n \n return fibonacci(n - 1) + fibonacci(n - 2)\n\n\ntemp = 0\npos = 0\nfor i in range(M):\n if pos == i:\n print(0)\n break\n \n temp += fibonacci(i - 1 - pos) % mod\n pos = ... | ['Wrong Answer', 'Accepted'] | ['s005369945', 's098874166'] | [3064.0, 463476.0] | [17.0, 564.0] | [315, 272] |
p03013 | u145950990 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m = map(int,input().split())\noks = [True]*(n+1)\nfor i in range(m):\n a = int(input())\n oks[a] = False\nprint(oks)\ndp = [0]*(n+1)\ndp[0] = 1\nfor i in range(n+1):\n for j in range(i+1,min(n+1,i+3)):\n if oks[j]:\n dp[j] += dp[i]\n dp[j] %= 1000000007\nprint(dp[n])\n', 'n,m =... | ['Wrong Answer', 'Accepted'] | ['s826947245', 's362930070'] | [8312.0, 13216.0] | [264.0, 224.0] | [295, 307] |
p03013 | u148540382 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = list(map(int, input().split()))\na = [input() for i in range(m)]\nb = []\nc = []\ntotal_act = 0\ntotal_act2 = 1\ntotal = 1\nb.append(int(a[0]))\nfor i in range(len(a) - 1):\n b.append(int(a[i + 1]) - int(a[i]) - 1)\nprint(b)\nfor i in range(max(b)):\n total_act3 = total_act2 + total_act\n total_act2 =... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s200272069', 's960136416', 's864528302'] | [11056.0, 9388.0, 9384.0] | [208.0, 183.0, 186.0] | [468, 1263, 917] |
p03013 | u149991748 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['def factorial(x, mod=10**9+7):\n # x!\n \n # ex) factorial(5) = 120\n tmp = 1\n for i in range(1, x+1):\n tmp = (tmp * i)\n return tmp\n\n\n\ndef step(t):\n total = 0\n buf2 = int(t/2)\n\n for i in range(buf2+1):\n buf1 = t-(i*2)\n buf12 = buf1 + i\n buf_ue = fac... | ['Wrong Answer', 'Accepted'] | ['s438417072', 's263381449'] | [3548.0, 7768.0] | [2107.0, 204.0] | [792, 307] |
p03013 | u150664457 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['def cmb(n, r):\n if n - r < r: r = n - r\n if r == 0: return 1\n if r == 1: return n\n\n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n\n for p in range(2,r+1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n ... | ['Runtime Error', 'Accepted'] | ['s498780212', 's609904049'] | [3064.0, 7832.0] | [18.0, 198.0] | [1320, 366] |
p03013 | u151285327 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\nsys.setrecursionlimit(10**10)\nN, M = map(int, input().split())\nA = [int(input()) for _ in range(M)]\nMOD = 1000000007\ndef Fib(n, A, MOD, memo={}):\n if n in A:\n return 0\n elif n == 0:\n return 1\n elif n == 1:\n return 1\n elif n in memo:\n return memo[n]\n ... | ['Runtime Error', 'Accepted'] | ['s234262568', 's431020150'] | [9036.0, 98444.0] | [27.0, 139.0] | [430, 414] |
p03013 | u152638361 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import math\nN, M = map(int,input().split())\na = [int(input()) for i in range(M)]\nb = [0]\nb.extend(a)\nb.extend([N+1])\nans = 1\nfor i in range(M+1):\n dan = b[i+1] - b[i]\n tori = int(1/math.sqrt(5)*(((1+math.sqrt(5))/2)**dan-((1-math.sqrt(5))/2)**dan)+0.01)\n ans *= tori\nprint(ans)', "import math\nN, M... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s214233472', 's398424661', 's476079814', 's541337497'] | [7848.0, 7848.0, 10080.0, 11672.0] | [345.0, 170.0, 225.0, 217.0] | [286, 535, 552, 269] |
p03013 | u152861889 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N,M = map(int, input().split())\nA = [int(input()) for i in range(M)]\n\ndp = [0]*(N+1)\ndp[0] = 1\n\nfor next in range(1,N+1):\n if next in A:\n dp[next] = 0\n else:\n dp[next] = dp[next-1] + dp[next-2]\n\nprint(dp)\nprint(dp[N]%1000000007)', 'N,M = map(int, input().split())\nA = set([int(input()... | ['Wrong Answer', 'Accepted'] | ['s468277237', 's533349486'] | [499188.0, 13196.0] | [2133.0, 180.0] | [248, 245] |
p03013 | u163501259 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["import sys\ninput = sys.stdin.readline\nfrom collections import deque\ndef main():\n N, M = map(int, input().split())\n A = deque([int(input()) for i in range(M)])\n dp = [0]*N\n \n if len(A) != 0:\n out = A.popleft \n else:\n out = 0\n \n if out != 1:\n dp[0] = 1\n ... | ['Runtime Error', 'Accepted'] | ['s237350035', 's654793788'] | [464376.0, 460380.0] | [471.0, 469.0] | [901, 1059] |
p03013 | u167908302 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['#coding:utf-8\n\n\nn, m = map(int, input().split())\na = [int(input()) for i in range(m)]\n\n\nbroken = [0] * (n+1)\n\n\ndp = [0] * (n+1)\n\ndp[0] = 1\n\n\n\nfor i in range(m):\n broken[a[i]] = 1\n\n\nif broken[1] == 1:\n dp[2] = 0\nelse:\n \n dp[2] = 1\n\n\nfor i in range(2, n+1):\n if broken[i] == 1:... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s128334051', 's427408659', 's834452152'] | [8616.0, 8616.0, 7668.0] | [194.0, 187.0, 189.0] | [770, 770, 741] |
p03013 | u169138653 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['def fib_memo(n):\n memo=["EMPTY"]*(n+1)\n def _fib(n):\n if n == 1:\n return 0\n elif n == 2:\n return 1\n elif memo[n] != "EMPTY":\n return memo[n]\n else:\n memo[n] = _fib(n-1)+_fib(n-2)\n return memo[n]\n return _fib(n)\nn,... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s194088828', 's590753389', 's840386036', 's011274632'] | [7080.0, 7072.0, 464040.0, 460020.0] | [162.0, 226.0, 528.0, 469.0] | [479, 596, 158, 244] |
p03013 | u169696482 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['def Fib(n):\n a, b = 1, 1\n if n == 1:\n return a\n elif n == 2:\n return b\n else:\n for i in range(n-2):\n a, b = b, a + b\n return b\nN, M = map(int, input().split())\na = [int(input(i)) for i in range(M)]\nm = 0\nfor i in range(M-1):\n if a[i] + 1 == a[i+1]:\n... | ['Wrong Answer', 'Accepted'] | ['s450048669', 's291181822'] | [7464.0, 7080.0] | [2104.0, 166.0] | [445, 648] |
p03013 | u173374079 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m = map(int,input().split())\n\nh = []\na = 1\nb = 1\nmod = 10 ** 9 + 7\n\nfor i in range(m):\n h += [int(input()),]\n\nfor i in range(1,n+1):\n if i in h:\n a,b = 0,a\n # b %= mod\n else:\n a,b = a + b,a\n # a %= mod\n # b %= mod\n\nprint(a % mod)', 'n,m = map(int,input(... | ['Wrong Answer', 'Accepted'] | ['s096835756', 's327633018'] | [7080.0, 7080.0] | [2104.0, 227.0] | [275, 285] |
p03013 | u175590965 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m = map(int,input().split())\na = set([int(input())for _ in range(m)])\ndp = [0]*(n+1)\ndp[0] = 1\nif 1 in a:\n dp[1] = 0\nelse:\n dp[1] = 1\n\nfor i in range(2,n+1):\n if i in a:\n continue\n dp[i] = (dp[i-1]+dp[i+2])%1000000007\nprint(dp[n])', 'n,m = map(int,input().split())\na = set([int(input... | ['Runtime Error', 'Accepted'] | ['s945609354', 's651255721'] | [13192.0, 18980.0] | [179.0, 156.0] | [251, 252] |
p03013 | u175743386 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = list(map(int, input().split()))\nA = set(int(input()) for i in range(M))\nx = [0] * (n+1)\nx[0] = 1\n\nfor i in range(1, n+1): \n if x[i] in A:\n x[i] = 0\n else:\n x[i] = (x[i-1] + x[i-2])%(10**9+7)\nreturn x[n]', 'N, M = map(int, input().split())\nA = set(int(input()) for i in range(M))\nx = [0] * (N... | ['Runtime Error', 'Accepted'] | ['s578597489', 's634822854'] | [3060.0, 11884.0] | [17.0, 196.0] | [217, 210] |
p03013 | u177645323 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m = map(int,input().split(" "))\na=[]\nans = 1\nfor i in range(m):\n a.append(int(input()))\n if a[i]-1 == a[i-1]:\n ans = 0\nif ans == 1:\n t,w,v = 0,0,0\n for j in range(len(a)):\n if j+1 == m:\n if n-a[j] >= 3:\n v += 1\n w += n-a[j]\n ... | ['Runtime Error', 'Accepted'] | ['s622866360', 's605289255'] | [7112.0, 7668.0] | [208.0, 187.0] | [558, 295] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.