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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03136 | u477343425 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n = int(input())\nl = [int.input() for i in range(n)]\ns = sorted(l)\nsum_of_s = sum(s)\nif sum_of_s > 2 * s[-1]:\n print('Yes')\nelse:\n print('No')", "n = int(input())\nl = list(map(int, input().split()))\nif sum(l) > 2 * max(l):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s846259854', 's141349612'] | [3056.0, 3064.0] | [17.0, 17.0] | [144, 111] |
p03136 | u478588435 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['input()\nls = list(map(int, input().split()))\nlmax = max(ls)\nlmaxi = ls.index(lmax)\nlss = ls[:lmaxi] + ls[lmaxi+1:]\n\nprint("Yes" if sum(lss) < lmax else "No")', 'input()\nls = list(map(int, input().split()))\nlmax = max(ls)\nlmaxi = ls.index(lmax)\nlss = ls[:lmaxi] + ls[lmaxi+1:]\nprint("Yes" if lmax < sum(lss) ... | ['Wrong Answer', 'Accepted'] | ['s611220168', 's618016853'] | [2940.0, 2940.0] | [17.0, 17.0] | [157, 157] |
p03136 | u482157295 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['num = input()\nnumlist = map(int, input().split())\nnumlistmax = max(numlist)\ntotalnum = sum(numlist)\nif totalnum - numlistmax > numlistmax:\n print("Yes")\nelse:\n print("No")', 'num = input()\nnumlist = map(int, input().split())\nnumlist = list(numlist)\nnumlistmax = max(numlist)\ntotalnum = sum(numlist)\nif to... | ['Wrong Answer', 'Accepted'] | ['s928255363', 's177577134'] | [2940.0, 2940.0] | [17.0, 17.0] | [173, 199] |
p03136 | u493247921 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['c=list(map(int, input().split(" ")))\n\nfrom statistics import mean, median,variance,stdev\n\nif sum(list1)-max(list1)< max(list1):\n print("Yes")\nelse:\n print("No")', 'a=input()\nc=list(map(int, input().split(" ")))\n \nfrom statistics import mean, median,variance,stdev\n \nif sum(list1)-max(list1)< max(list... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s300081989', 's889629621', 's995352888'] | [5144.0, 5148.0, 2940.0] | [36.0, 37.0, 17.0] | [166, 178, 165] |
p03136 | u496280557 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N = int(input())\nL = list((int,input().split()))\n\nif max(L) - (sum(L) - max(L)) < 0:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nL = list((int,input().split()))\n\nif max(L) - (sum(L) - max(L)) < 0:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nL = list(map(int,input().split()))... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s225739687', 's479938550', 's062212038'] | [9112.0, 9072.0, 9120.0] | [24.0, 26.0, 32.0] | [123, 123, 122] |
p03136 | u497310132 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["s = [input() for i in range(2)]\nN = int(s[0])\nL = map(int, s[1].split())\nprint(if('Yes', max(L) < sum(L) - max(L), 'No'))", "s = [input() for i in range(2)]\nN = int(s[0])\nL = list(map(int, s[1].split()))\nprint('Yes' if max(L) < sum(L) - max(L) else 'No')"] | ['Runtime Error', 'Accepted'] | ['s579440690', 's365748658'] | [2940.0, 3064.0] | [17.0, 18.0] | [121, 129] |
p03136 | u497326082 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n=int(input())\nl=list(map(int,input().split()))\ns=max(l)\nl.sort()\nl.remove(s)\nif sum(s[0:len(s)+1]) > s:\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nl=list(map(int,input(),split()))\ns=max(l)\nl.sort()\nl.remove(s)\nif sum(s[0:len(s)+1]) > s:\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nl=li... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s376124068', 's452384543', 's312181406'] | [3060.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0] | [137, 137, 137] |
p03136 | u505893372 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N = int(input())\nL = sorted(list(map(int, input().split())))\n\nif sum(L[:-1]) > L[:-1] :\n\tprint('Yes')\nelse:\n\tprint('No')\n\nprint(L)", "N = int(input())\nL = sorted(list(map(int, input().split())))\n\nif sum(L[:-1]) > L[-1] :\n\tprint('Yes')\nelse:\n\tprint('No')\n"] | ['Runtime Error', 'Accepted'] | ['s352784442', 's024991538'] | [2940.0, 2940.0] | [17.0, 18.0] | [130, 120] |
p03136 | u514118270 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N,M = map(int,input().split())\nX = list(map(int,input().split()))\nX.sort()\nA = []\nfor i in range(M-1):\n A.append(X[i+1]-X[i])\nA.sort()\nprint(sum(A[:M-N]))', "N = int(input())\nL = list(map(int,input().split()))\nif max(L) < sum(L)-max(L):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s710135451', 's394519385'] | [3060.0, 2940.0] | [17.0, 17.0] | [157, 117] |
p03136 | u514429645 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n=int(input())\nl=list(map(int,input().split()))\nsum=0\n\nfor i in range(n-1):\n sum+=l[i]\n\nif(sum>=l[n-1]):\n print("No")\nelse:\n print("Yes")', 'n=int(input())\nl=[input() for i in range(n)]\nl.sort()\nsum=0\n\nfor i in range(n-1):\n sum+=l[i]\n\nif(sum>=l[n-1]):\n print("No")\nelse:\n print("Yes")', 'n=i... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s452552567', 's575563532', 's997030041'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [140, 146, 148] |
p03136 | u516272298 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['import random\nn = int(input())\n\nx = [random.randint(1,100) for i in range(n)]\n\nfor i in range(n):\n if x[i] < n:\n x[i] += i\n print("Yes")\n break\nelse:\n print("No")\n ', 'n = int(input())\nl = list(map(int,input().split()))\nif max(l) < sum(l)-max(l):\n print("Yes")\nelse:\n ... | ['Wrong Answer', 'Accepted'] | ['s419143527', 's165691972'] | [3824.0, 2940.0] | [34.0, 18.0] | [194, 117] |
p03136 | u518556834 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nt = list(map(int,input().split()))\na = max(t)\nif a < sum(t.remove(a)):\n print("Yes")\nelse:\n print("No")\n', 'n = int(input())\nt = list(map(int,input().split()))\na = max(t)\nif a < (sum(t) - a):\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s604682836', 's493732348'] | [2940.0, 2940.0] | [18.0, 17.0] | [123, 119] |
p03136 | u518958552 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nm = str(input())\nl = m.split()\nif max(l) >= sum(l) - max(l):\n print("No")\nelse:\n print("Yes")', 'n = int(input())\nl = list(map(int,input().split()))\nif max(l) < sum(l) - max(l):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s908047852', 's025142885'] | [2940.0, 2940.0] | [18.0, 17.0] | [116, 119] |
p03136 | u537782349 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['a = int(input())\nb = list(map(int, input().split()))\nb.sort()\nc = 0\nfor i in range(0, a-1):\n c += b[i]\nif b[-1] < c:\n print("YES")\nelse:\n print("NO")\n', 'a = int(input())\nb = list(map(int, input().split()))\nb.sort()\nc = 0\nfor i in range(0, a-1):\n c += b[i]\nif b[a-1] < c:\n print("YES")\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s147246129', 's339315819', 's385792803', 's803709304', 's743807065'] | [2940.0, 2940.0, 3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0] | [159, 160, 160, 156, 145] |
p03136 | u540761833 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N = int(input())\nLarray = list(map(int,input().split()))\nlmax = max(Larray)\nLarray.remove(lmax)\nltot = 0\nfor i in range(Larray):\n ltot += i\nif lmax > ltot:\n print('Yes')\nelse:\n print('No')\n", "N = int(input())\nLarray = list(map(int,input().split()))\nlmax = max(Larray)\nLarray.remove(lmax)\nltot = 0\nf... | ['Runtime Error', 'Accepted'] | ['s824088269', 's257911220'] | [2940.0, 3060.0] | [17.0, 17.0] | [192, 184] |
p03136 | u541786453 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n = int(input())\nl = list(map(int, input().split()))\nl.sort()\nsum = 0\nfor i in range(n-1):\n\tsum += i\nif sum > a[n-1]:\n\tprint('Yes')\nelse:\n\tprint('No')", "n = int(input())\nl = list(map(int, input().split()))\nl.sort()\nsum = 0\nfor i in range(n-1):\n\tsum += l[i]\nif sum > l[n-1]:\n\tprint('Yes')\nelse:\n... | ['Runtime Error', 'Accepted'] | ['s545755417', 's753099422'] | [2940.0, 3060.0] | [17.0, 17.0] | [150, 153] |
p03136 | u543411290 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['a=input()\nb=list(map(int,input().split()))\nb.sort()\nif b[len(b)-1]> sum(b[:len(b)-1]):\n print("Yes")\nelse:\n print("No")', 'a=input()\nb=list(map(int,input().split()))\nb.sort()\nif b[len(b)-1]< sum(b[:len(b)-1]):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s318428969', 's608803264'] | [2940.0, 2940.0] | [17.0, 17.0] | [121, 121] |
p03136 | u543521991 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["import functools\n\nn = input()\nl = input().split()\n\nif n < 3 or 10 < n:\n return 'No'\n\nfor _l in l:\n\tif _l < 1 or 100 < _l:\n\t\treturn 'No'\n\nlongest = functools.reduce(lambda x,y: x if x > y else y, l)\nsum = functools.reduce(lambda x,y: x + y, l) - longest\n\nif longest > sum:\n\treturn 'Yes'\nelse\n\tre... | ['Runtime Error', 'Accepted'] | ['s188880163', 's523280421'] | [2940.0, 3572.0] | [17.0, 23.0] | [306, 259] |
p03136 | u546853743 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["\nn=int(input())\nL=list(map(int,input().split()))\nL.sort()\nans=sum(L[:n-1])\nif ans>L[n-1:n]:\n print('Yes')\nelse:\n print('No')", "n=int(input())\nL=list(map(int,input().split()))\nL.sort()\nans=sum(L)-L[n-1]\nif ans>L[n-1]:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s744693397', 's227548615'] | [9152.0, 9176.0] | [26.0, 26.0] | [130, 128] |
p03136 | u548545174 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n = int(input())\nL = list(map(int, input().split()))\nLmax = L.max()\nL.remove(Lmax)\nprint('Yes' if Lmax < L.sum() else 'No')", "n = int(input())\nL = list(map(int, input().split()))\nLmax = max(L)\nL.remove(Lmax)\nprint('Yes' if Lmax < sum(L) else 'No')\n"] | ['Runtime Error', 'Accepted'] | ['s627864507', 's720313834'] | [3064.0, 2940.0] | [18.0, 18.0] | [123, 122] |
p03136 | u551109821 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N = int(input())\nL = list(map(int,input().split()))\n\nm = L.pop(max(L))\nif sum(L) > m:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nL = list(map(int,input().split()))\n\nm = L.pop(L.index(max(L)))\nif sum(L) > m:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s102128517', 's629903451'] | [2940.0, 2940.0] | [17.0, 17.0] | [124, 133] |
p03136 | u553070631 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["li = list(map(int,input().split()))\nli[0] = 0\nif max(li)<(sum(li)-max(li)):\n\tprint ('Yes')\n \nelse:\n\tprint ('No')", "a=input()\nli = list(map(int,input().split()))\nli[0] = 0\nif max(li)<(sum(li)-max(li)):\n\tprint ('Yes')\n \nelse:\n\tprint ('No')", "li = list(map(int,input().split()))\n\nif max(li)<(sum(li... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067402726', 's345836498', 's948626598', 's833658372'] | [3064.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [113, 123, 104, 113] |
p03136 | u555291433 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N=int(input())\nlengths=[float(val) for val in input().split()]\nmax=max(lengths)\nif sum(lengths)-max>max:\n print('yes')\nelse:\n print('no')", "N=int(input())\nlengths=[float(val) for val in input().split()]\nmax=max(lengths)\nif sum(lengths)-max>max:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s109714452', 's306788854'] | [2940.0, 2940.0] | [18.0, 18.0] | [139, 139] |
p03136 | u562550538 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n=int(input())\na=[int(x) for x in input().split()]\nmx=max(a)\nrem=sum(a)-mx\nif mx > rem:\n print("Yes")\nelse:\n print("No")', 'n=int(input())\na=[int(x) for x in input().split()]\nmx=max(a)\nrem=sum(a)-mx\nif mx >= rem:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s526081184', 's768253169'] | [2940.0, 2940.0] | [17.0, 17.0] | [126, 127] |
p03136 | u566428756 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n=int(input())\nlst=list(map(int,input().split()))\nmaxval=max(lst)\nsumval=sum(lst)\nif maxval<sumval-maxval:\n print('YES')\nelse:\n print('NO')", "n=int(input())\nlst=list(map(int,input().split()))\nmaxval=max(lst)\nlst.remove(maxval)\nsumval=sum(lst)\nif maxval<sumval:\n print('YES')\nelse:\n print('N... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s739277043', 's757793756', 's893550773', 's128271070'] | [2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [145, 157, 168, 146] |
p03136 | u566574814 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["\nLs = sorted(map(int, input().split()))\nif Ls[-1] < sum(Ls) - Ls[-1]:\n print('Yes')\nelse:\n print('No')", 'n = int(input())\nl = list(map(int, input().split()))\n\nl.sort()\n\nans = 0\nfor i+1 in l:\n\tans += l[i+1]\n \nif l[0] < ans:\n print("Yes")\nelse:\n print("No")', "N = int(input())\nLs = sorted... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s309386759', 's844667529', 's098018703'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [108, 155, 124] |
p03136 | u569898420 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\n\nL = []\n\nL = list(map(int, input().split(" ")))\n\nsaidai = max(L)\n\ngoukei = sum(L)\n\ngoukei = goukei - saidai\n\nif saidai < goukei :\n print("yes")\nelse:\n print("no")\n', 'N = int(input())\n\nL = []\n\nL = list(map(int, input().split(" ")))\n\nsaidai = max(L)\n\ngoukei = sum(L)\n\n... | ['Wrong Answer', 'Accepted'] | ['s425514951', 's786001340'] | [2940.0, 2940.0] | [19.0, 17.0] | [187, 190] |
p03136 | u577942884 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nb = list(map(int, input().rstirip().split()))\nc = max(b)\nd = 0\nfor i in b:\n d +=i\nd -= c\nif c < d:\n print(Yes)\nelse:\n print(No)', 'n = int(input())\nb = list(map(int, input().rstrip().split()))\nc = max(b)\nd = 0\nfor i in b:\n d +=i\nd -= c\nif c < d:\n print(Yes)\nelse:\n print(No)'... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s269541320', 's496193405', 's143987701'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [147, 146, 150] |
p03136 | u580327099 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['# -*- coding: utf-8 -*-\n\ndef main():\n int(input())\n l = [int(e) for e in input().split(" ")]\n max_l = max(l)\n s = 0\n once = True\n for e in l:\n if e != max_l and once:\n s += e\n once = False\n\n if max_l < s:\n print("Yes")\n else:\n print("N... | ['Wrong Answer', 'Accepted'] | ['s714896688', 's791492676'] | [3060.0, 3060.0] | [17.0, 20.0] | [314, 331] |
p03136 | u580697892 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['#coding: utf-8\nN = int(input())\nL = list(map(int, input().split()))\nmax_ = max(L)\nif max_ < sum(L) - max_:\n print("YES")\nelse:\n print("NO")', '#coding: utf-8\nN = int(input())\nL = list(map(int, input().split()))\nmax_ = max(L)\nif max_ < sum(L) - max_:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s798148845', 's570340075'] | [2940.0, 2940.0] | [17.0, 18.0] | [141, 141] |
p03136 | u580873239 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n=int(input())\n\nl=[]\nfor i in range(n):\n l.append(int(input()))\n\na=sum(l)-2*max(l)\n\nif a<0 :\n print("Yes")\n \nelse:\n print("No")', 'N = int(input())\nL=[int(x) for x in input().split()]\nif sum(L)-max(L) > max(L):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s523286903', 's343978224'] | [2940.0, 2940.0] | [17.0, 17.0] | [131, 118] |
p03136 | u583276018 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\na = [int(i) for i in input().split()]\nif(max(a) > (sum(a) - max(a)):\n print("NO")\nelse:\n print("YES")', 'n = int(input())\na = [int(i) for i in input().split()]\nif(max(a) >= (sum(a) - max(a))):\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s352922881', 's470627537'] | [2940.0, 2940.0] | [17.0, 17.0] | [122, 124] |
p03136 | u585336982 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['li = [int(x) for x in input().split() if x != "0"]\nlmax = max(li)\na = sum(li) - lmax\nif a > lmax:\n print("Yes")\nelse:\n print("No")', 'li = [int(x) for x in input().split() if x != "0"]\nlmax = max(li)\na = sum(li) - lmax\nif a > lmax:\n print("Yes")\nelse:\n print("No")', 'li = list(map(int,input().split())... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s400944701', 's581869845', 's620547780', 's797608145', 's305416992'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0, 18.0] | [132, 132, 117, 120, 137] |
p03136 | u585482323 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['#!usr/bin/env python3\nfrom collections import defaultdict\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef I(): return int(sys.stdin.readline())\ndef LS():return list(map(list, sys.stdin.readline().split())... | ['Runtime Error', 'Accepted'] | ['s259108698', 's211961986'] | [3700.0, 4592.0] | [26.0, 40.0] | [2200, 2200] |
p03136 | u589432040 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N = int(input())\nL = []\nL = list(map(int, input().split()))\n\nM = max(L)\nL2 = L.remove(M)\nif M < sum(L2):\n\tprint('Yes')\nelse:\n\tprint('No')", "N = int(input())\nL = []\nL = list(map(int, input().split()))\n\nM = max(L)\nL.remove(M)\nif M < sum(L):\n\tprint('Yes')\nelse:\n\tprint('No')"] | ['Runtime Error', 'Accepted'] | ['s959665390', 's861864794'] | [2940.0, 3060.0] | [17.0, 18.0] | [137, 131] |
p03136 | u589578850 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nls = input().split()\n\nmax_ls = int(max(ls))\n\nsum_ls = 0\n\nfor i in range(n):\n sum_ls += int(ls[0])\n\nif sum_ls - max_ls > max_ls :\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nls = list(map(int,input().split()))\n\nmax_ls = max(ls)\n\nsum_ls = sum(ls)\n\n\nif sum_ls - max... | ['Wrong Answer', 'Accepted'] | ['s876128795', 's524533763'] | [2940.0, 2940.0] | [17.0, 17.0] | [187, 159] |
p03136 | u593019570 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n = input()\nm = list(map(int,input().split()))\nm = m.sorted()\nif m[-1] < sum(m) - m[-1]:\n print('Yes')\nelse:\n print('No')", "n = input()\nm = list(map(int,input().split()))\nm.sort()\nif m[-1] < sum(m) - m[-1]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s842404707', 's393300294'] | [2940.0, 2940.0] | [17.0, 18.0] | [123, 118] |
p03136 | u595764679 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N = input();\nl = list(int(input().split))\nl.sort()\nsum = 0\nfor i in range(N-1):\n sum += l[i]\n \nif sum >= l[N-1]:\n print('No')\nelse:\n print('Yes')\n\n\n\n", "N = input()\nN = int(N)\nl = list(int(input().split))\nl.sort()\nsum = 0\nfor i in range(N-1):\n sum += l[i]\n \nif sum >= l[N-1]:\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s783003785', 's897472445', 's291169716'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [161, 171, 176] |
p03136 | u597017430 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N = int(input())\nL = list(map(int, input().split()))\nfor i in range(N):\n if sum(L) - L(i) <= L(i):\n print('No')\n exit()\nprint('Yes')", "N = int(input())\nL = list(map(int, input().split()))\nif sum(L) <= max(L)*2:\n print('No')\n exit()\nprint('Yes')"] | ['Runtime Error', 'Accepted'] | ['s941226260', 's813561017'] | [2940.0, 2940.0] | [17.0, 17.0] | [139, 113] |
p03136 | u600261652 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nlist = list(map(int, input().split()))\nprint("Yes" if (max(list))<((sum(list))-(max(list))) else "No"))', 'N = int(input())\nlist = list(map(int, input().split()))\nprint("Yes" if max(list)*2 < sum(list) else "No"))', 'N = int(input())\nlist = list(map(int, input().split()))\nprint("Yes" if max(lis... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s082151966', 's212377043', 's258413102', 's415172543', 's831402758'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [120, 106, 118, 116, 105] |
p03136 | u603324902 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\n\nL = list(map(int,input().split()))\n\nsum = int(0)\na = max(L)\n\nfor i in range(n):\n sum += L[i]\n \nif 2*a > sum:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\n\nL = [map(int,input().split())]\n\nsum = int(0)\na = max(L)\n\nfor i in range(n):\n sum += L[i]\n \nif 2*a > sum:\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s399655465', 's833151981', 's127174270'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [163, 159, 163] |
p03136 | u608671031 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nL = list(map(int,input().split()))\nL.sort()\nL.reverse()\nsum = 0\nfor i in range(1,N):\n sum += L[i]\nprint(L)\nprint(sum)\nif sum < L[0]:\n print("No")\nelse:\n print("Yes")', 'N = int(input())\nL = list(map(int,input().split()))\nL.sort()\nL.reverse()\nsum = 0\nfor i in range(1,N):\n ... | ['Wrong Answer', 'Accepted'] | ['s520019272', 's945971810'] | [3060.0, 3060.0] | [18.0, 17.0] | [191, 172] |
p03136 | u609814378 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nL = list(map(int, input().split()))\n\n\nL_max = max(L)\n\nL_Down = L.sort(reverse=True)\n\nL_Down_Re = L.Down[1:len(L_Down)]\n\nL_Down_Re_Sum = sum(L_Down_Re)\n\nif L_max <= L_Down_Re_Sum:\n print("No")\nelse:\n print("Yes")', 'N = int(input())\nL = list(map(int, input().split()))\n\nL_max =... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s873889195', 's923375632', 's238710416'] | [3060.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [235, 304, 131] |
p03136 | u611090896 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = input()\nL = [int(input()) for i in range(N)]\nprint("Yes" if sum(L) > 2*max(L) else "No")', "N = int(input())\nL = [int(input()) for i in range(N)]\nprint('Yes' if sum(L)-max(L) > max(L) else 'No')", "N = int(input())\nL = [int(input()) for i in range(N)]\nprint('Yes' if sum(L)-max(L) > max(L) and sum(L) -max(L)... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s096507263', 's470453317', 's690547996', 's576839765'] | [2940.0, 3056.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 17.0] | [92, 102, 136, 87] |
p03136 | u612968535 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['input()\nli = list(map(int,input().split()))\n\nmax = 0\nignore = 0\ntemp = 0\n\nfor i, value in enumerate(li):\n if value > max:\n max = value\n ignore = i\n\nfor i, value in enumerate(li):\n if i == ignore:\n continue\n else:\n temp += value\n \nif max < temp:\n print("YES")\nelse:\n print("NO")... | ['Wrong Answer', 'Accepted'] | ['s768886544', 's202924207'] | [3064.0, 3064.0] | [18.0, 17.0] | [297, 297] |
p03136 | u613128408 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["from sys import stdin\nN = int(stdin.readline().rstrip())\nL = [int(x) for x in stdin.readline().rstrip().split()]\n\nif max(L) < sum(L) - max(L):\n print('YES')\nelse:\n print('NO')\n", "import itertools\nN = map(int, input().split())\nL = [map(int, input().split())]\nif max(L) < sum(L) - max(L):\n print('Y... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s383969033', 's607533016', 's453423610'] | [2940.0, 3060.0, 2940.0] | [18.0, 18.0, 18.0] | [182, 147, 182] |
p03136 | u619455726 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['# -*- coding: utf-8 -*-\n\nn=int(input()) \nh=list(map(int, input().split())) \ncnt=0\nL=0\nwhile L != len(h):\n if h[L] != 0:\n for r in range(L+1 ,len(h)):\n if h[r] == 0:\n \n for k in range(L,r):\n h[k]-=1\n cnt+=1\n ... | ['Wrong Answer', 'Accepted'] | ['s297590731', 's174211078'] | [3064.0, 2940.0] | [17.0, 17.0] | [603, 269] |
p03136 | u626337957 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N = int(input())\nL = map(int, input().split())\n\nL.sort(key=lambda x:-x)\n\nif L[0] >= sum(L[1::]):\n print('No')\nelse:\n print('Yes')", "N = int(input())\nL = list(map(int, input().split()))\n\nL.sort(key=lambda x:-x)\n\nif L[0] >= sum(L[1::]):\n print('No')\nelse:\n print('Yes')\n"] | ['Runtime Error', 'Accepted'] | ['s820794432', 's707406506'] | [2940.0, 2940.0] | [17.0, 17.0] | [131, 138] |
p03136 | u626468554 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['#!/usr/bin/env python3\n\nN = int(input())\nL = input().split()\nL_num = []\n\nfor i in range(len(L)):\n L_num.append(int(L[i]))\n\nL_num.sort()\n\ntotal = 0\nfor j in range(len(L) - 1):\n total += L_num[j]\n\nif total <= L_num[N-1]:\n print("No")\nelse:\n print("Yes")\n\nprint(total)\nprint(L_num[N-1])\n... | ['Wrong Answer', 'Accepted'] | ['s062151150', 's509781304'] | [3060.0, 3064.0] | [17.0, 18.0] | [296, 266] |
p03136 | u629607744 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nl = [int(i) for i in input().split()]\n\nl.sort()\nl.reverse()\ncnt = 0\nfor i in range(n-1):\n\tcnt += l[i]\nif cnt > l[n]:\n\tprint("Yes")\nelse:\n\tprint("No")', 'n = int(input())\nl = [int(i) for i in input().split()]\n\nl.sort()\ncnt = 0\nfor i in range(n-1):\n\tcnt += l[i]\nif cnt > l[n-1]:\n\... | ['Runtime Error', 'Accepted'] | ['s847668949', 's792448020'] | [9008.0, 9068.0] | [28.0, 28.0] | [166, 157] |
p03136 | u632997108 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nl = list(map(int,input().split(" ")))\n\nprint(sum(l))\nm=max(l)\nif m - (sum(l)-m):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nl = list(map(int,input().split(" ")))\n\nm=max(l)\nif m < (sum(l)-m):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s414044258', 's627664280'] | [9112.0, 9168.0] | [29.0, 33.0] | [136, 122] |
p03136 | u635182517 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n = int(input())\nl = list(map(int, input().split()))\na = max(l)\nb = l.remove(a)\nc = sum(b)\nif a < c:\n print('Yes')\nelse:\n print('No')", "import numpy as np\nn = int(input())\nl = list(map(int, input().split()))\na = max(l)\nb = l.remove(a)\nc = np.sum(b)\nif a < c:\n print('Yes')\nelse:\n print('N... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s020695309', 's385342413', 's976350781'] | [2940.0, 21528.0, 2940.0] | [17.0, 290.0, 18.0] | [139, 161, 157] |
p03136 | u637742907 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["num = int(input())\nlens = [int(a) for a in input().split(' ')]\nmax_len = max(len)\nlens.remove(max_len)\nsum_lens = sum(lens)\n\nif max_len < sum_lens:\n print('Yes')\nelse:\n print('No') ", "num = int(input())\nlens = [int(a) for a in input().split(' ')]\nmax_len = max(lens)\nlens.remove(max_len)\nsum_lens = su... | ['Runtime Error', 'Accepted'] | ['s291708785', 's494619787'] | [2940.0, 3060.0] | [17.0, 18.0] | [184, 186] |
p03136 | u641734381 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nlist_L = map(int, input().split())\n\nmax_ = list_L.pop(list_L.index(max(list_L)))\n\nif max_ > sum(list_L):\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\nlist_L = list(map(int, input().split()))\n\nmax_ = list_L.pop(list_L.index(max(list_L)))\n\nif max_ >= sum(list_L):\n print... | ['Runtime Error', 'Accepted'] | ['s177830460', 's926867988'] | [2940.0, 2940.0] | [19.0, 17.0] | [161, 168] |
p03136 | u647796955 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["import sys\nN = int(sys.stdin.readline().rstrip())\nl = list(map(int, sys.stdin.readline().rstrip().split()))\n\nlm = 0\nL = 0\nfor n in range(N):\n if l[n] > lm:\n L += lm\n lm = l[n]\n else:\n L += l[n]\n \nif lm > L:\n print('Yes')\nelse:\n print('No')", "import sys\nN = int(sys.stdin.readline().rs... | ['Wrong Answer', 'Accepted'] | ['s937491251', 's726624115'] | [3060.0, 3060.0] | [17.0, 17.0] | [255, 256] |
p03136 | u651058930 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N = int(input())\nL_list = list(map(int, input().split()))\n\nif max(L_list) * 2 > sum(L_list):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nL_list = list(map(int, input().split()))\n\nif max(L_list) * 2 < sum(L_list):\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s993770194', 's280479589'] | [3188.0, 2940.0] | [20.0, 18.0] | [131, 132] |
p03136 | u651793628 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nB = list(map(int, input().split(" ")))\n\nmax_b = max(B)\nif sum(B) - max_b > max_b:\n print("YES")\nelse:\n print("NO")\n', 'N = int(input())\nB = list(map(int, input().split(" ")))\n\nmax_b = max(B)\nif sum(B) - max_b > max_b:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s282137929', 's153582023'] | [2940.0, 2940.0] | [17.0, 17.0] | [138, 138] |
p03136 | u655975843 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["num = int(input())\nl = list(map(int, input().split()))\nmax = l.pop(l.index(max(l)))\nsum = 0\nfor i in range(len(l)):\n sum = sum + l[i]\nif sum > max:\n print('No')\nelse:\n print('Yes')\n", "num = int(input())\nl = list(map(int, input().split()))\nmax = l.pop(l.index(max(l)))\nsum = 0\nfor i in range(len... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s114437421', 's188410165', 's853188912', 's572800067'] | [2940.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [190, 191, 167, 191] |
p03136 | u657994700 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['10\n1 8 10 5 8 12 34 100 11 3', "N = input()\nL = list(map(int,input().split()))\n\nL.sort()\nL.reverse()\n\nif L[0] < sum(L)-L[0]:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s724644134', 's686219008'] | [2940.0, 2940.0] | [17.0, 17.0] | [28, 132] |
p03136 | u658288444 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["def resolve():\n n = int(input())\n L = map(int, input().split())\n M = max(L)\n R = sum(L) - M\n if R > M:\n print('Yes')\n else:\n print('No')\nresolve() ", "def resolve():\n input()\n L = list(map(int, input().split()))\n M = max(L)\n R = sum(L) - M\n if R > M:... | ['Wrong Answer', 'Accepted'] | ['s840767241', 's343097884'] | [9156.0, 9040.0] | [28.0, 29.0] | [186, 183] |
p03136 | u658993896 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N=int(input())\nL=list(map(int,input().split()))\n\nsum_=sum(L)\nmax_=max(L)\nif(max_>sum_-max_):\n print('Yes')\nelse:\n print('No')", "N=int(input())\nL=list(map(int,input().split()))\n\nsum_=sum(L)\nmax_=max(L)\nif(max_<sum_-max_):\n print(max_,sum_-max_)\n print('Yes')\nelse:\n print('No')", "N=int... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s092886042', 's649840058', 's653358080'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [131, 157, 131] |
p03136 | u659712937 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N=int(input())\nL=list(map(int, input().split()))\n\na=max(L)\nb=sum(L)-a\n\nif a>=B:\n print('No')\nelse:\n print('Yes')", "N=int(input())\nL=list(map(int, input().split()))\n\na=max(L)\nb=sum(L)-a\n\nif a>=b:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s811132729', 's071220642'] | [2940.0, 2940.0] | [18.0, 18.0] | [114, 114] |
p03136 | u665038048 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nL = list(map(int, input().split()))\nL.sort()\nmax_L = L[-1]\ndel L[-1]\nif max_L > sum(L):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nL = list(map(int, input().split()))\nL.sort()\nmax_L = L[-1]\ndel L[-1]\nif max_L >= sum(L):\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s756372734', 's959026281'] | [2940.0, 2940.0] | [17.0, 19.0] | [143, 144] |
p03136 | u666415539 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n=int(input())\na=list(map(int,input().split()))\n\n\nif max(a)*2 >= sum(a):\n print("Yes")\nelse:\n print("No")', 'n=int(input())\na=list(map(int,input().split()))\n\n\nif max(a)*2 < sum(a):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s678506287', 's907585937'] | [3064.0, 2940.0] | [17.0, 17.0] | [107, 106] |
p03136 | u672316981 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n = int(input())\nl = list(map(int, input().split()) for _ in range(n))\n\nprint('Yes' if max(l) < sum(l)-max(l) else 'No')", "n = int(input())\nl = list(map(int, input().split()))\n\nprint('Yes' if max(l) < sum(l)-max(l) else 'No')"] | ['Runtime Error', 'Accepted'] | ['s142666540', 's060930514'] | [2940.0, 2940.0] | [17.0, 17.0] | [120, 102] |
p03136 | u678505520 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n = int(input())\nL = [input() for i in range(n)]\nkekka = 0\nfor i in range(n):\n if 2*L[i] > sum(L):\n kekka = 1\n break\n \nif kekka == 1:\n print('No')\nelse:\n print('Yes')", "n = int(input())\nL = list(map(int,input().split()))\nkekka = 0\nfor i in range(n):\n if 2*L[i] >= sum(L):\n kekka = 1\n ... | ['Runtime Error', 'Accepted'] | ['s879920250', 's622184327'] | [3056.0, 2940.0] | [17.0, 17.0] | [178, 182] |
p03136 | u679089096 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nlist = [map(int, input().split())]\nif max(list) < sum(list) - max(list):\n print("Yes")\nelse:\n print("No")', "n = int(input())\ndeta = list(map(int,input().split()))\n\nif max(deta) < sum(deta) - max(deta):\n print('Yes')\nelse:\n print('No')\n \n"] | ['Runtime Error', 'Accepted'] | ['s521011774', 's183456731'] | [2940.0, 2940.0] | [18.0, 17.0] | [124, 138] |
p03136 | u682467216 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nl = [int(i) for _ in input().split()]\nif max(l) < sum(l) - max(l):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nl = list(map(int,input().split()))\nif max(l) < sum(l) - max(l):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s467102111', 's339174213'] | [2940.0, 2940.0] | [17.0, 18.0] | [118, 115] |
p03136 | u687044304 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['# -*- coding:utf-8 -*-\n\ndef solve():\n N = int(input())\n L = list(map(int, input().split()))\n L.sort()\n \n longest = L[-1]\n sum = 0\n for i in range(len(L)-1):\n sum += L[i]\n \n if longest <= sum:\n print("No")\n else:\n print("Yes")\n\n\nif __name__ == "__mai... | ['Wrong Answer', 'Accepted'] | ['s162013454', 's022750463'] | [3060.0, 3060.0] | [17.0, 17.0] | [317, 316] |
p03136 | u688126754 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\n\nL_lst = map(int, input().split())\n\nL_lst.sort()\nL_sum = sum(L_lst)\nL_max = L_lst[-1]\n\nif L_max * 2 >= L_sum:\n print("No")\nelse:\n print("Yes")', 'N = int(input())\n \nL_lst = list(map(int, input().split()))\n \nL_lst.sort()\nL_sum = sum(L_lst)\nL_max = L_lst[-1]\n \nif L_max * 2 >= L_sum... | ['Runtime Error', 'Accepted'] | ['s707155177', 's781697113'] | [2940.0, 2940.0] | [17.0, 19.0] | [161, 170] |
p03136 | u691766194 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['s = int(input())\nn = "1"\nstring_list = [input() for i in range(n)]\nint_list = (int(s) for s in string_list)\nm = max(int_list)\nif sum(int_list) - int(m) > int(m):\n print("Yes")\nelif print("NO")', 's = int(input())\nn = "1"\nstring_list = [input() for i in range(n)]\nint_list = (int(s) for s in string_list)\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s134507136', 's315277236', 's382736060', 's689274951'] | [2940.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 20.0, 17.0] | [195, 195, 211, 158] |
p03136 | u691896522 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nL = list(map(int, input().split()))\nL.sort().reverse()\nif L[0] < sum(L[1:n]):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nL = list(map(int, input().split()))\nL.sort()\nL.reverse()\nif L[0] < sum(L[1:n]):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s944053257', 's801866547'] | [2940.0, 3316.0] | [17.0, 20.0] | [129, 131] |
p03136 | u692311686 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N=int(inout())\nL=list(map(int,input().split()))\nT=0\nfor i in range(N):\n T+=L[i] \nif max(L)>T-max(L):\n print("Yes")\nelse:\n print("No")\n \n', 'N=int(input())\nL=list(map(int,input().split()))\nT=0\nfor i in range(N):\n T+=L[i] \nif max(L)<T-max(L):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s743233215', 's012732639'] | [2940.0, 3060.0] | [17.0, 20.0] | [141, 137] |
p03136 | u698868214 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nL = list(map(int,input().split()))\nif max(L) > (sum(L) - max(L)):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nL = list(map(int,input().split()))\nif max(L) < (sum(L) - max(L)):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s972602677', 's958580621'] | [3064.0, 2940.0] | [17.0, 17.0] | [117, 117] |
p03136 | u711539583 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nls = list(map(int, input().split()))\nmaxl = max(ls)\nls.pop(ls.index(maxl))\nif sum(ls) < maxl:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nls = list(map(int, input().split()))\nmaxl = max(ls)\nls.pop(ls.index(maxl))\nif sum(ls) > maxl:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s711851427', 's132822136'] | [2940.0, 2940.0] | [18.0, 20.0] | [145, 146] |
p03136 | u712768978 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nlengths = list(map(int, input().split()))\n\ntruth = True\nfor i in range(len(lengths)):\n\tcurr = lengths[:i]+lengths[i+1:]\n\tif curr < lengths[i]:\n\t\ttruth = False\n\t\tbreak\n\t\nprint(["No","Yes"][truth])', 'n = int(input())\nlengths = list(map(int, input().split()))\n\ntruth = True\nfor i in... | ['Runtime Error', 'Accepted'] | ['s296057080', 's044075591'] | [3060.0, 3060.0] | [18.0, 17.0] | [212, 218] |
p03136 | u716263716 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N=int(input())\nL = [int(i) for i in input().split()]\n\nLd = sorted(L, reverse=False)\nprint(Ld)\n\nL_other=0\nfor i in range(N-1):\n L_other += Ld[i]\n\nprint(L_other)\nprint(Ld[N-1])\nif (Ld[N-1] < L_other):\n print('Yes')\nelse:\n print('No')\n", "N=int(input())\nL = [int(i) for i in input().split()]\n\nLd = s... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s474254093', 's476443141', 's272740895'] | [3060.0, 3060.0, 3060.0] | [18.0, 20.0, 17.0] | [235, 205, 194] |
p03136 | u717671569 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nl = list(map(int, input().split()))\nmax_num = 0\nmax_index = 0\ntotal = 0\n\nfor i in range(n):\n if max_num < l[i]:\n max_num = l[i]\n max_index = i\n\n\nl.pop(max_index)\nprint(l)\n\nfor i in range(n - 1):\n total += l[i]\n\nif total > max_num: print("Yes")\nelse: print("No")\n\n\n\n', 'n... | ['Wrong Answer', 'Accepted'] | ['s899325016', 's655500925'] | [3060.0, 3060.0] | [24.0, 17.0] | [290, 277] |
p03136 | u721425712 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n = int(input())\na = list(map(int, input().split()))\nprint(a)\nif max(a) > sum(a.remove(max(a))):\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int, input().split()))\nM = max(a)\na.remove(M)\n\nif M > sum(a):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nL = list(map(int, inp... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s076804113', 's285060247', 's786431158'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [131, 126, 150] |
p03136 | u722189950 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['#ABC117 B\nN = int(input())\nLn = [input() for i in range(N)]\nLn.sort()\nmax = L[0]\nsun = 0\nfor i in N-1:\n sum += L[i+1]\n \nif max < sum:\n print("Yes")\nelse:\n print("No")\n', '#ABC117 B\nN = int(input())\nLn = list(map(int, input().split()))\nLn.sort()\nmax = L[0]\nsum = sum(ln)\n \nif max < ma... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s369005968', 's454138722', 's626644101', 's695796800'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0, 17.0] | [179, 163, 174, 176] |
p03136 | u727051308 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(inout())\nL = int(input().split())\nflag = 0\n\nfor i in range(N):\n total += L[i]\n\nfor i in range(N):\n if A[i]*2 >= total:\n print("No")\n flag = 1\n break\n\nif flag == 0:\n print("Yes")', 'N = int(inout())\nL = int(input().split())\nflag = 0\n\nfor i in range(N):\n total += L[i]\n\nfor i in... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s207845821', 's475107768', 's654479957', 's700025144', 's731432399'] | [9008.0, 9112.0, 8944.0, 2940.0, 9132.0] | [24.0, 29.0, 25.0, 17.0, 30.0] | [197, 198, 212, 192, 221] |
p03136 | u727057618 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['a = input()\nl = map(int, input().split())\n\nl_max = max(l)\nl_sum = sum(l)\n\nif l_max < l_sum - l_max:\n\tprint("Yes")\nelse:\n\tprint("No")', 'a = input()\nl = map(int, input().split())\n\nl_max = max(l)\nl_sum = sum(l)\n\nif 2 * l_max < l_sum:\n\tprint("Yes")\nelse:\n\tprint("No")', 'a = input()\nl = list(map(in... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s671426742', 's923719947', 's024387260'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0] | [132, 128, 138] |
p03136 | u728498511 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nnums = list(map(int, input().split()))\nmx = nums.pop(max(nums))\nif mx < sum(nums):\n print("Yes")\nelse :\n print("No")\n ', 'n = int(input())\nnums = list(map(int, input().split()))\nmx = nums.pop(nums.index(max(nums)))\nif mx < sum(nums):\n print("Yes")\nelse :\n print("No")\n '] | ['Runtime Error', 'Accepted'] | ['s731553989', 's321295857'] | [2940.0, 2940.0] | [18.0, 18.0] | [138, 150] |
p03136 | u729133443 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["input();s=map(int,input().split());print('YNeos'[sum(s)-max(s)*2<1::2])", "_,a=open(0);*a,=map(int,a.split());print('YNeos'[sum(a)<=max(a)*2::2])"] | ['Runtime Error', 'Accepted'] | ['s256650824', 's566388293'] | [2940.0, 2940.0] | [17.0, 17.0] | [71, 70] |
p03136 | u730043482 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nsl = input()\nl = [int(n) for n in sl.split(" ")]\n\nmax = max(l);\nl.remove(max);\n\nall = 0\n\nfor p in l:\n all+=p\n\nif all > max:\n\tprint("No")\nelse:\n\tprint("Yes")\n\t', 'n = int(input())\nsl = input()\nl = [int(n) for n in sl.split(" ")]\n\nmax = max(l);\nl.remove(max);\n\nall = 0\n\nfo... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s032741461', 's337115573', 's992062355'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [178, 180, 178] |
p03136 | u731665172 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N=int(input())\nbars=list(map(int,input().split()))\nif max(list)<sum(list)-max(list):\n print('Yes')\nelse:\n print('No')", "N=int(input())\nbars=list(map(int,input().split()))\nif max(bars)<sum(bars)-max(bars):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s993681346', 's294647059'] | [2940.0, 2940.0] | [18.0, 17.0] | [119, 119] |
p03136 | u732870425 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nl = list(map(int, input().split()))\n\nif l.count(max(l)) >= 2:\n print("No")\n break\nelif max(l) < sum(l) - max(l):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nl = list(map(int, input().split()))\n\nif l.count(max(l)) >= 2:\n print("No")\n break\nelif max(l) < sum(l)... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s079930388', 's381757226', 's519125945'] | [3060.0, 2940.0, 2940.0] | [18.0, 19.0, 17.0] | [174, 174, 119] |
p03136 | u733774002 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nL = input().split()\nL = [int(s) for s in L]\ni = 0\nL_max = 0\nfor i in range(len(L)):\n if L_max < L[i]:\n L_max = L[i]\nif L_max > sum(L):\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\nL = input().split()\nL = [int(s) for s in L]\ni = 0\nL_max = 0\nfor i in range(len(... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s397991734', 's450198759', 's715697372', 's338885040'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0, 17.0] | [201, 211, 209, 212] |
p03136 | u738898077 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['input_a = int(input())\ninput_list = list(map(int, input().split()))\ninput_list.sort()\nsum = 0\nfor i in range(input_a - 1):\n sum += input_list[i]\n\nif input_list[input_a - 1] < sum:\n print("yes")\nelse:\n print("No")', 'input_a = int(input())\ninput_list = list(map(int, input().split()))\ninput_list.so... | ['Wrong Answer', 'Accepted'] | ['s671439411', 's101428123'] | [2940.0, 2940.0] | [17.0, 17.0] | [221, 222] |
p03136 | u740904749 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['import sys\n\nn = input()\nlengths = list(map(int,input().split(" ")))\n\nlengths = sorted(lengths)\nmax = length.pop(-1)\nif max < sum(length) :\n print("Yes")\nelse :\n print("No")', 'import sys\n\nn = input()\nlengths = list(map(int,input().split(" ")))\n\nlengths = sorted(lengths)\nmax = lengths.pop(-1)\nif... | ['Runtime Error', 'Accepted'] | ['s071260334', 's612813403'] | [3060.0, 3060.0] | [18.0, 19.0] | [178, 180] |
p03136 | u740964967 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['nums = int(input())\ninput_list = [int(x) for x in input().split()]\ninput_list.sort(reverse=True)\nmax_num = input_list.pop(0)\nprint(input_list)\nif max_num < sum(input_list):\n print("Yes")\nelse:\n print("No")\n\n', 'nums = int(input())\ninput_list = [int(x) for x in input().split()]\ninput_list.sort(revers... | ['Wrong Answer', 'Accepted'] | ['s105689397', 's740797115'] | [2940.0, 3060.0] | [17.0, 17.0] | [213, 195] |
p03136 | u745906650 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['_ = input()\nl = map(int,input().split())\nprint("Yes" if 2*max(l)<sum(l) else "No")', '_ = input()\nl = [int(i)for i in input().split()]\nprint(l)\nprint("Yes" if 2*max(l) < sum(l) else "No")\n', '_ = input()\nl = [int(i)for i in input().split()]\nprint("Yes" if 2*max(l) < sum(l) else "No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s280554725', 's789054239', 's250599811'] | [3060.0, 2940.0, 3064.0] | [19.0, 18.0, 18.0] | [82, 102, 93] |
p03136 | u746206084 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nli = map(int,input().split())\nli = list(li)\nli.sort()\ns=0\nfor i in range(n-1):\n s+=li[i]\nif s<=li[-1]:\n print(No)\nelse:\n print(Yes)', 'n = int(input())\nli = list(map(int,input().split()))\nli.sort()\ns=0\nfor i in range(n-1):\n s+=li[i]\nif s<=li[-1]:\n print(No)\nelse:\n print(Yes)'... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s190316074', 's668365802', 's962766313'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 19.0] | [151, 143, 155] |
p03136 | u756429062 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nsu = [ int(i) for i in input().split() ]\nsu.sort()\nlastn = su.pop(n-1)\n\nif sum(su) < lastn:\n\tprint("Yes")\nelse:\n\tprint("No")', "trash = input()\ninput_1 = map(int,input().split(' '))\nif max(input_1) < (sum(input_1) - max(input_1)):\n\tprint('Yes')\nelse:\n\tprint('No')", "trash = input()\n... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s757798279', 's766315924', 's820569646', 's892536617'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 18.0] | [141, 135, 126, 141] |
p03136 | u757030836 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n = int(input())\nl = [int(i) for i in input().split()]\n\nl.sort(reverse=True)\n\nmax = l[0]\nels = sum(l[1:])\n\nif max > else:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nl = [int(i) for i in input().split()]\n\nl.sort(reverse=True)\n\nmax = l[0]\nels = sum(l[1:])\n\nif max < els:\n print("Yes")\ne... | ['Runtime Error', 'Accepted'] | ['s461528060', 's642014564'] | [2940.0, 2940.0] | [18.0, 17.0] | [156, 158] |
p03136 | u764956288 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["X,T = map(int, input().split(' '))\n\nprint(f'{T/X/1.0}000')", "X,T = map(int, input().split(' '))\n\nprint(f'{T/X/1.0}000)", "N = input()\nL = list(map(int, input().split(' ')))\n\nflg = 0\nfor l in L:\n if not sum(L)-l > l:\n print('No')\n flg = 1\n\nif not flg: print('Yes')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s044247501', 's551235172', 's897315265'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [58, 57, 149] |
p03136 | u767121254 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['n=int(input())\nl = list(map(int, input().split()))\nmaxi = max(l)\nl[l.index(max(l))]=0\ntmp=0\nfor x in l:\n tmp+=x\n\nif tmp<=maxi:\n print("no")\nelse:\n print("yes")\n \n', 'n=int(input())\nl = list(map(int, input().split()))\nmaxi = max(l)\nl[l.index(max(l))]=0\nprint(l)\ntmp=0\nfor x in l:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s208291140', 's286954346', 's633677456', 's424518145'] | [3572.0, 3060.0, 3060.0, 2940.0] | [21.0, 18.0, 17.0, 18.0] | [178, 187, 190, 159] |
p03136 | u769411997 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["n = int(input())\nL = list(map(int, input().split()))\nidx = L.index(max(L))\nprint(idx)\nsum_L = 0\nfor i in range(len(L)):\n if i == idx:\n pass\n else:\n sum_L += L[i]\n\nif L[idx] < sum_L:\n print('Yes')\nelse:\n print('No')\n ", "n = int(input())\nL = list(map(int, input().split()))\... | ['Wrong Answer', 'Accepted'] | ['s423098620', 's833286910'] | [3060.0, 3060.0] | [18.0, 17.0] | [245, 234] |
p03136 | u771532493 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ["N=int(input())\nL=[int(i) for i in input().split()]\nM=max(L)\ndel L[M]\nif M>=sum(L):\n print('No')\nelse:\n print('Yes')", "N=int(input())\nL=[int(i) for i in input().split()]\nM=max(L)\nL.remove(M)\nif M>=sum(L):\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s537978729', 's686791806'] | [2940.0, 3060.0] | [18.0, 17.0] | [117, 120] |
p03136 | u774160580 | 2,000 | 1,048,576 | Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem** : an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the le... | ['N = int(input())\nL = [int(i) for i in range(N)]\nlongest = L[0]\nfor i in range(1, len(L)):\n if L[i] > longest:\n longest = L[i]\nif 2 * longest < sum(L):\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\nL = [int(i) for i in input().split()]\nlongest = L[0]\nfor i in range(1, len(L)):\n ... | ['Wrong Answer', 'Accepted'] | ['s345168416', 's810776014'] | [3060.0, 3064.0] | [18.0, 17.0] | [200, 207] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.