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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02993 | u905715926 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['s = input()\nans = True\nfor i in s:\n if(abs(s.find(i)-s.rfind(i)) == 1):\n ans = False\nif ans == True:\n print("Yes")\nelse:\n print("No")\n', 's = input()\nans = True\nfor i in s:\n if(s.count(i+i)):\n ans = False\nif ans == True:\n print("Good")\nelse:\n print("Bad")\n'] | ['Wrong Answer', 'Accepted'] | ['s319093491', 's865151482'] | [2940.0, 2940.0] | [17.0, 17.0] | [150, 134] |
p02993 | u906195369 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['from math import gcd\na,b,c,d = map(int, input().split())\nc_n = b//c - (a-1)//c\nd_n = b//d - (a-1)//d\nl = (c*d)//gcd(c,d)\nl_n = b//l - (a-1)//l\nprint(b - a - c_n - d_n + l_n + 1)', 's = input()\nif s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:\n print("Bad")\nelse:\n print("Good")'] | ['Runtime Error', 'Accepted'] | ['s661674042', 's805422774'] | [3060.0, 2940.0] | [18.0, 17.0] | [177, 95] |
p02993 | u907223098 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['s=input()\nr="g↨ood"\nfor i in range(len(s)-1):\n if s[i]==s[i+1]:\n r="b↨ad"\n break\nprint(r)', 's=input()\nr="good"\nfor i in range(len(s)-1):\n if s[i]==s[i+1]:\n r="bad"\n break\nprint(r)', 's=input()\nr="Good"\nfor i in range(len(s)-1):\n if s[i]==s[i+1]:\n r="Bad"\n break\nprint(r)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s529031951', 's560174195', 's531912323'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [100, 94, 94] |
p02993 | u908383794 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["import re\n\nsecurity_code = input()\nregex = r'(.)\\1'\nresult = re.match(regex, security_code)\n\nif result is None:\n print('Good')\nelse:\n print('Bad')", "import re\n\nsecurity_code = input()\nregex = r'.*(.)\\1.*'\nresult = re.match(regex, security_code)\n\nif result is None:\n print('Good')\nelse:\n print(... | ['Wrong Answer', 'Accepted'] | ['s342801603', 's391653742'] | [3188.0, 3188.0] | [22.0, 22.0] | [148, 152] |
p02993 | u908424816 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['def main():\n inp = input()\n before =None\n for a in inp:\n if before is None:\n before = a\n continue\n if before == a:\n print("Bad")\n return\n before = a\n print("Good")', 'def main():\n inp = input()\n before =None\n for a in inp:\n if before is None:\n before = a\n ... | ['Wrong Answer', 'Accepted'] | ['s456860557', 's151346801'] | [2940.0, 2940.0] | [17.0, 17.0] | [196, 204] |
p02993 | u910830417 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['import fractions\na, b, c, d = map(int, input().split())\n \ndef wareruzu(x):\n start_a = a if a % x == 0 else a - (a % x) + x\n end_b = b - (b % x)\n m = end_b - start_a\n return int(m / x) + 1\n \nall_n = b - a + 1\nprint(all_n - wareruzu(c) - wareruzu(d) + wareruzu((c*d) / fractions.gcd(c,d)))', "S = i... | ['Runtime Error', 'Accepted'] | ['s711892351', 's863396991'] | [5048.0, 2940.0] | [36.0, 17.0] | [299, 117] |
p02993 | u912862653 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['S = input()\nn = ""\nfor i in range(4):\n if S[i:i+1]==n:\n print("Bad")\n break\n n = S[i:i+1]\nprint("Good")', 'S = input()\nn = S[0]\nfor i in range(1, 4):\n if S[i:i+1]==n:\n print("Bad")\n break\n n = S[i:i+1]\nprint("Good")', 'S = input()\nn = S[0]\nfor i in range(4):\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s115952856', 's584525369', 's848042325', 's870775308'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [123, 128, 125, 230] |
p02993 | u917101497 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["pass = int( input() )\n\nfor i range(3):\n if pass[i] == pass [i+1]:\n \tprint('Bad')\n \tbreak\n elif i == 2:\n print('Good')\n \n ", "password = input()\n\nfor i in range(3):\n if password[i] == password[i+1]:\n print('Bad')\n break\n elif i == 2:\n print('Good')"] | ['Runtime Error', 'Accepted'] | ['s251164013', 's430224933'] | [2940.0, 2940.0] | [17.0, 18.0] | [132, 149] |
p02993 | u918009437 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['import collections\n\n\nS = list(input())\n\nc = collections.Counter(S)\n\nif max(c.values) >= 2:\n print("Bad")\nelse:\n print("Good")\n', "import collections\n\n\nS = list(input())\n\nanswer = 'Good'\nfor i in range(1, len(S)):\n if S[i] == S[i-1]:\n answer = 'Bad'\n\nprint(answer)"] | ['Runtime Error', 'Accepted'] | ['s255199372', 's343968828'] | [3316.0, 3316.0] | [21.0, 21.0] | [128, 137] |
p02993 | u918422508 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["s = input()\n \nfor i in range(3):\n if s[i] == s[i+1]:\n print('Bad')\n break\nprint('Good')", "s = input()\n \nfor i in range(3):\n if s[i] == s[i+1]:\n print('Bad')\n exit()\nprint('Good')"] | ['Wrong Answer', 'Accepted'] | ['s306160780', 's695913395'] | [9076.0, 9036.0] | [27.0, 23.0] | [104, 105] |
p02993 | u919689206 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["import sys\n\ndef def1(s):\n \n if s[0] == s[1]:\n return True\n \n if len(s) == 2:\n return False\n \n return def1(s[1:])\n\ndef main():\n input = sys.stdin.readline\n S = input()\n \n print('bad' if def1(S) else 'good')\n\nif __name__ == '__main__':\n main()", "import ... | ['Wrong Answer', 'Accepted'] | ['s418705730', 's889467840'] | [2940.0, 3060.0] | [17.0, 17.0] | [288, 288] |
p02993 | u920694585 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["a = list(input())\nprint(a)\nflag = 0\nfor i in range(3):\n if a[i] == a[i+1]:\n flag = 1\nif flag == 1:\n print('Bad')\nelse:\n print('Good')\n", "a = list(input())\nflag = 0\nfor i in range(3):\n if a[i] == a[i+1]:\n flag = 1\nif flag == 1:\n print('Bad')\nelse:\n print('Good')"] | ['Wrong Answer', 'Accepted'] | ['s239631382', 's050108813'] | [2940.0, 2940.0] | [17.0, 17.0] | [150, 140] |
p02993 | u921178362 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['\npas = input("password: ")\npas = list(pas)\n\nfor i in range(3):\n if pas[i] == pas[i+1]:\n print("Bad")\n exit()\n a = i\nprint("Good")\n', '\npas = input("password: ")\npas = list(pas)\n\nfor i in range(3):\n if pas[i] == pas[i+1]:\n print(\'Bad\')\n exit()\n a = i\nprint(\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s126602255', 's735420212', 's261018480'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [150, 150, 138] |
p02993 | u921811474 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['import fractions\ndef lcm(a,b):\n return a*b //fractions.gcd(a, b)\n\nA, B,C,D = map(int, input().split())\n\nb_num = B//C + B//D - B//lcm(C, D)\na_num = (A-1)//C + (A-1)//D - (A-1)//lcm(C, D)\nprint((B-(A-1))-(b_num-a_num))', 'def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef lcm(a, b):\n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s254426330', 's499120196', 's815032196'] | [5600.0, 3060.0, 2940.0] | [52.0, 17.0, 17.0] | [217, 267, 167] |
p02993 | u925836726 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["def main():\n\n s = map( int, input().split())\n s = str(s)\n\n if(s[0] == s[1]):\n print('Bad')\n \n elif(s[1] == s[2]):\n print('Bad')\n \n elif(s[2] == s[3]):\n print('Bad')\n \n else:\n print('Good')\n\nif __name__ == '__main__':\n main()\n\n", "def main()... | ['Wrong Answer', 'Accepted'] | ['s066905920', 's188011554'] | [2940.0, 3064.0] | [17.0, 17.0] | [284, 362] |
p02993 | u926212097 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['a=list(input())\nflag=True\nfor i in range(len(a)-1):\n if a[i]==a[i+1]:\n print("Bad")\n return\nprint("Good")', 'a=list(input())\nflag=True\nfor i in range(len(a)-1):\n if a[i]==a[i+1]:\n flag=False\nprint("Good" if flag else "Bad")'] | ['Runtime Error', 'Accepted'] | ['s986640025', 's263673100'] | [2940.0, 2940.0] | [17.0, 17.0] | [112, 118] |
p02993 | u930574673 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["s = input()\nif s[0] == s[1] or s[1] == s[2] 0r s[2] == s[3]:\n print('Bad')\nelse:\n print('Good')", "s = input()\nif s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:\n print('Bad')\nelse:\n print('Good')"] | ['Runtime Error', 'Accepted'] | ['s311376173', 's139603447'] | [2940.0, 2940.0] | [17.0, 17.0] | [97, 97] |
p02993 | u931394483 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['s = input()\nif len(set(sort(s))) == 4:\n print("Good")\nelse:\n print("No")', 's = input()\nif len(set(s)) == 4:\n print("Good")\nelse:\n print("No")', 's = input()\nif len(set(s.sort())) == 4:\n print("Good")\nelse:\n print("No")', 's = input()\nif s[0] != s[1] != s[2] != s[3]:\n print("Good")\... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s024569613', 's218048870', 's375953404', 's912353914'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [78, 72, 79, 85] |
p02993 | u932913455 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['import fractions\nA, B, C, D = (int(x) for x in input().split())\n\nC_ = int(B/C) - int(A/C)\nif A%C == 0: \n C_ += 1 ... | ['Runtime Error', 'Accepted'] | ['s194160239', 's859215854'] | [5044.0, 2940.0] | [35.0, 18.0] | [1036, 858] |
p02993 | u933214067 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['作成したプログラムには欠陥がある。今回の課題ではない1度ずつ探索を行いその中でも最もスコアが高かった時の角度を最後の出力しているが、自分が想定した角度とは違う角度が最大となっている例として画像2-2では自分は最適な角度が0度であると考えているのに対して、出力では最適な角度は----と自分が想定している角度ではなかった。このようになった理由として考えられるのはキティの特徴の考え方の一つであると思われる黄色の目と鼻の位置が元からある場所よりも近いのがあったからと考えられる。また画像2-2や2-3であった複数のキティを検出だが検出することはできたものの最終出力では複数の赤枠の出力ができなかった。2ー3のファイルでは画像を回転させるごと... | ['Runtime Error', 'Accepted'] | ['s666849081', 's083079948'] | [2940.0, 23348.0] | [17.0, 355.0] | [1068, 1408] |
p02993 | u937618939 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['n, l = map(int, input().split())\nif l>=0:\n\tprint(n**2/2+l*n-n/2-l)\nif l<0 and n-1<l:\n \tprint(n**2/2+l*n-n/2)\nelse:\n \tprint((n**2/2)+l*n-n/2-l-n+1)', 'n, l = map(int, input().split())\nif l>=0:\n\tprint(int(n**2/2+l*n-n/2-l))\nif l<0 and n-1<l:\n \tprint(int(n**2/2+l*n-n/2))\nelse:\n \tprint(int((n**2/2)+... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s547032668', 's601419557', 's366992611'] | [3060.0, 3060.0, 2940.0] | [17.0, 18.0, 17.0] | [148, 163, 97] |
p02993 | u940449872 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["def judge(S):\n S = [int(i) for i in str(S)]\n delta1 = S[1]-S[0]\n delta2 = S[2]-S[1]\n delta3 = S[3]-S[2]\n \n if delta1 * delta2 * delta3 == 0:\n print('Bad')\n else:\n print('Good')", "def judge(S):\n S = [int(i) for i in S]\n delta1 = S[1]-S[0]\n delta2 = S[2]-S[1]\n delta3 = S[3]-S[2]\n \n if... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s093766565', 's785578084', 's739526727'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [189, 189, 165] |
p02993 | u943117333 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['from sys import stdin\n\n\n\n\ndef gcd(n,m):\n if n<m:\n return gcd(m,n)\n if n%m==0:\n return m\n else:\n return gcd(m,n%m)\n\n\n\na,b,c,d = [int(x) for x in stdin.readline().rstrip().split()]\n\nc_num = b//c-(a-1)//c\nd_num = b//d-(a-1)//d\n\nLCM = d*c//gcd(c,d)\n\nLCM_num = int(b//(LC... | ['Runtime Error', 'Accepted'] | ['s356573345', 's083624227'] | [3064.0, 2940.0] | [17.0, 17.0] | [380, 256] |
p02993 | u947327691 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['s=input()\n\ncnt=0\n\nfor i in range(1,len(s):\n if s[i]==s[i-1]:\n cnt += 1\n\nif cnt > 1:\n print("Bad")\nelse:\n print("Good")', 's=input()\n\ncnt=0\n\nfor i in range(1,len(s)):\n if s[i]==s[i-1]:\n cnt += 1\n\nif cnt >= 1:\n print("Bad")\nelse:\n print("Good")'] | ['Runtime Error', 'Accepted'] | ['s830239948', 's827653530'] | [2940.0, 2940.0] | [17.0, 17.0] | [134, 136] |
p02993 | u952854963 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['import fractions\n\na, b, c, d = map(int, input().split())\n\nb_c = b//c - (a-1)//c\nd_c = b//d - (a-1)//d\ncd = (c * d) // fractions.gcd(c, d)\ncd_c = b//cd - (a-1)//cd\n\nprint((b - a + 1) - (b_c + d_c - cd_c))\n', 'import fractions\n\na, b, c, d = map(int, input().split())\n\nb_c = b//c - (a-1)//c\nd_c = b//d - (a... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s092079231', 's639391646', 's574641535'] | [5304.0, 5048.0, 2940.0] | [38.0, 36.0, 17.0] | [204, 199, 126] |
p02993 | u955251526 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["s = set(input())\nans = True\nfor i in range(3):\n ans = ans and (s[i] != s[i+1])\nif ans: print('Good')\nelse: print('Bad')", "s = input()\nans = True\nfor i in range(3):\n ans = ans and (s[i] != s[i+1])\nif ans: print('Good')\nelse: print('Bad')"] | ['Runtime Error', 'Accepted'] | ['s648920660', 's650307287'] | [2940.0, 2940.0] | [17.0, 19.0] | [122, 117] |
p02993 | u956547804 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["s=input()\nfor i in range(len(s)):\n if s[i]==s[i+1]:\n result='Bud'\n break\n else:\n result='Good'\nprint(result)\n", "s=input()\nfor i in range(len(s)-1):\n if s[i]==s[i+1]:\n result='Bad'\n break\n else:\n result='Good'\nprint(result)"] | ['Runtime Error', 'Accepted'] | ['s569688609', 's544283635'] | [2940.0, 2940.0] | [18.0, 17.0] | [136, 137] |
p02993 | u960171798 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['s = input()\nflag = True:\n for i in range(1,4):\n if s[i-1]==s[i]:\n flag = False\nprint("Bad" if flag==False else "Good")', 's = input()\nflag = True\n for i in range(1,4):\n if s[i-1]==s[i]:\n flag = False\nprint("Bad" if flag==False else "Good")\n', 's = input()\nflag = True\nfor i in range(1,4)... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s717249389', 's896707607', 's323728138'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 24.0] | [127, 127, 121] |
p02993 | u960570220 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["S = str(input())\nif S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:\n print('Yes')\nelse:\n print('No')", "S = str(input())\nif S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:\n print('Bad')\nelse:\n print('Good')"] | ['Wrong Answer', 'Accepted'] | ['s377037250', 's663859086'] | [8960.0, 9084.0] | [29.0, 26.0] | [104, 106] |
p02993 | u960770433 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['x = input()\ndef samenum(string):\n for i in range(3):\n \tif string[i] == string[i+1]:\n \treturn "Bad"\n \t\tquit()\n return "Good"\n\nprint(samenum(x))', 'x = input()\ndef samenum(string):\n for i in range(3):\n if string[i] == string[i+1]:\n return "Bad"\n quit()\n return "Good"\n ', 'x ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s399464287', 's694093402', 's392470365'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [149, 140, 158] |
p02993 | u962356464 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['S = input()\ncount = 0\nfor i in range(3):\n if S[i]==S[i+1]:\n count += 1\n else:\n count = 0\nif count == 0:\n print("Good")\nelse:\n print("Bad")', 'S = input()\nans = "Good"\nfor i in range(3):\n if S[i]==S[i+1]:\n ans ="Bad"\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s656008031', 's662818219'] | [2940.0, 2940.0] | [17.0, 17.0] | [164, 94] |
p02993 | u963903527 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['pre = None\nfor i in list(input()):\n\tif i == pre:\n \tprint("Bad")\n exit()\n pre = i\nprint("Good")', 'a,b,c,d=map(int,input().split())\nfrom fractions import gcd\nlcm=(c*d)//gcd(c,d)\nn=(b//c)-((a-1)//c)\nn+=(b//d)-((a-1)//d)\nprint(b-a+1-n+((b//lcm)-((a-1)//lcm)))\n', 'pre = 0\nfor i in list(input... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s626954413', 's784508208', 's921990685'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [109, 159, 110] |
p02993 | u965937045 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['i=list(input())\nprint(i)\nif(i[0]==i[1] or i[1]==i[2] or i[2]==i[3]):\n print("Bad")\nelse:\n print("Good")', 'i=list(input())\nif(i[0]==i[1] or i[1]==i[2] or i[2]==i[3]):\n print("Bad")\nelse:\n print("Good")'] | ['Wrong Answer', 'Accepted'] | ['s073588341', 's304914794'] | [8968.0, 9096.0] | [30.0, 26.0] | [109, 100] |
p02993 | u968258816 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["a, b, c, d = map(int, input().split())\nif (a + b) // 2 == a;\n print('Bad')\nelif (b + c) // 2 == b;\n print('Bad')\nelif (c + d) // 2 == c;\n print('Bad')\nelse;\n print('Good')\n", "a, b, c, d = map(int, input().split())\nif (a + b) / 2 == a:\n print('Bad')\nelif (b + c) / 2 == b:\n print('Bad')\nelif (c + d... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s031674062', 's361929916', 's770340196', 's044853337'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [176, 173, 176, 70] |
p02993 | u968846084 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['s=input()\na=s//1000\nb=(s-a*1000)//100\nc=(s-a*1000-b*100)//10\nd=s-a*1000-b*100-c*10\nif a==b :\n print"Bad"\n elif b==c:\n print"Bad"\n elif c==d:\n print"Bad"\nelse:\n print"Good"', 'N,L=map(int, input().split())\nif N+L-1<=0:\n print(int(L*(N-1)+N*(N-1)/2-N+1))\nelif L>=0:\n print(int... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s549943198', 's923120084', 's984134423'] | [2940.0, 3060.0, 3060.0] | [18.0, 18.0, 17.0] | [197, 164, 194] |
p02993 | u970082363 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['list = input()\nchk = 10\nfor code in list :\n if chk == code :\n print("bad")\n break\n chk = code\nelse :\n print("good")', 'A,B,C,D = (int(x) for x in input().split())\nn = A\ncount = 0\nwhile n <= B:\n if n%C != 0 \n if n%D != 0:\n count += 1\n n += 1\nprint(count)\n... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s130649289', 's512546480', 's889100306'] | [2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0] | [138, 159, 139] |
p02993 | u970197315 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['import numpy as np\nimport math\nA, B, C, D = list(map(int, input().split()))\n\ndef lcm(x, y):\n return (x * y) / math.gcd(x, y)\nE = lcm(C, D)\n\nu = np.arange(A,B+1)\ncount_U = len(u)\nu_c = [i for i in u if i % C == 0]\ncount_C = len(u_c)\nu_d = [i for i in u if i % D == 0]\ncount_D = len(u_d)\nu_e = [i for i ... | ['Runtime Error', 'Accepted'] | ['s171700783', 's240524614'] | [12420.0, 3064.0] | [148.0, 17.0] | [406, 156] |
p02993 | u971237642 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['# -*- coding: utf-8 -*-\nimport numpy as np\n\n\n\n\n\nspline = input().split()\nN = int(spline[0])\nL = int(spline[1])\n\n\ntaste = []\nfor i in range(1,N+1): \n taste.append(L+i-1) \n#print(taste)\n\n\ntaste_max = sum(taste)\n#print("max"+str(taste_max))\n\n\n\ntaste_any = []\nfor k in range(0,N):\n taste_an... | ['Runtime Error', 'Accepted'] | ['s847260768', 's407026937'] | [12508.0, 2940.0] | [148.0, 18.0] | [930, 368] |
p02993 | u972658925 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["S = list(input())\n\nc = 0\nfor i in range(3):\n if S[i] != S[i+1]:\n c += 1\nif c == 3:\n print('GOOD')\nelse:\n print('BAD')\n", "S = list(int(input()))\n\nc = 0\nfor i in range(3):\n if S[i] != S[i+1]:\n c += 1\nif c == 3:\n print('GOOD')\nelse:\n print('BAD')\n", "S = list(int(input()))\n\nc = 0\nfor ... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s045235394', 's419326619', 's602337777', 's628826530'] | [2940.0, 2940.0, 2940.0, 2940.0] | [19.0, 17.0, 17.0, 17.0] | [124, 129, 129, 124] |
p02993 | u972892985 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['s = list(input())\nif s[0] == s[1] or s[1] == s[2] or s[2] = s[3]:\n print("Good")\nelse:\n print("Bad")', 's = list(input())\nif s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:\n print("Good")\nelse:\n print("Bad")\n', 's = list(input())\nif s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:\n print("Bad")\nelse:\n p... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s528281721', 's598861128', 's173447464'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [102, 104, 103] |
p02993 | u974100230 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['s = set(int(input()))\nprint("Good" if len(s) == 4 else "Bad")', 'def resolve():\n s = list(input())\n prev = \'-1\'\n for i in s:\n if i == prev:\n print("Bad")\n return\n prev = i\n print("Good")\n\nresolve()'] | ['Runtime Error', 'Accepted'] | ['s059023001', 's919328153'] | [3316.0, 2940.0] | [20.0, 17.0] | [61, 180] |
p02993 | u975261985 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['from collections import Counter\ncode = input()\ncnt = 0\nfor i in range(len(code) - 1):\n if c[i] == c[i + 1]:\n cnt += 1\n break\nif cnt:\n print("Bad")\nelse:\n print("Good")\n ', 'from collections import Counter\ncode = input()\nmax_c = Counter(list(code)).most_common()[0]\nif max_c > 1:\n print("Bad")... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s163309824', 's988901571', 's554815771'] | [3316.0, 3316.0, 3316.0] | [21.0, 21.0, 20.0] | [179, 142, 185] |
p02993 | u975485663 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['S=list(input())\nN=len(S)\nflg=0\nfor i in range(S-1):\n if S[i]==S[i+1]:\n print("Bad")\n break\nif flg:\n print("Good")', 'S=list(input())\nN=len(S)\nflg=1\nfor i in range(N-1):\n if S[i]==S[i+1]:\n print("Bad")\n flg=0\n break\nif flg:\n print("Good")'] | ['Runtime Error', 'Accepted'] | ['s771200656', 's883601563'] | [2940.0, 2940.0] | [17.0, 18.0] | [121, 131] |
p02993 | u978962055 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['S = list(input().split())\nfor i in range(1, len(S)):\n if S[i-1]==S[i]:\n print("Bad")\n exit()\nprint("Good")\n', 'S = list(input().split())\nfor i in range(4):\n if S[i]==S[i+1]:\n print("Bad")\n exit()\nprint("Good")\n', 'S = list(map(int, input().rstrip()))\nfor i in range(3):\n if S[i]==S[i+1]:\n... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s709936217', 's962644164', 's950632554'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [114, 106, 116] |
p02993 | u981040490 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["# -*- coding: utf-8 -*-\nimport math\ndef main():\n A,B,C,D = map(int,input().split())\n E = (C*D)//math.gcd(C,D)\n Cc = B / C\n Dd = B / D\n Ee = B / E\n flo = A-1\n Cf = flo / C\n Df = flo / D\n Ef = flo / E\n All = B-(math.floor(Cc)+math.floor(Dd)-math.floor(Ee))\n Sub = flo-(math.... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s398690166', 's564866931', 's993104418', 's284597008'] | [3064.0, 5076.0, 3060.0, 3060.0] | [17.0, 40.0, 17.0, 17.0] | [404, 391, 359, 375] |
p02993 | u981304949 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['s = list(int,input())\nif s.count(s[0])>=2:\n print("Bad")\nelif s.count(s[1])>=2:\n print("Bad")\nelif s.count(s[2])>=2:\n print("Bad")\nelse:\n print("Yes")', 's = input()\nif s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:\n print("Bad")\nelse:\n print("Good")'] | ['Runtime Error', 'Accepted'] | ['s177435650', 's746388570'] | [2940.0, 2940.0] | [17.0, 17.0] | [154, 91] |
p02993 | u985648232 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["password = input()\n\nresult = 'Good'\n\nfor i in range(len(password)-1):\n ):\n if password[i] == password[i+1]:\n result = 'Bad'\n break\n \nprint(result)\n ", "password = input()\n\nresult = 'Good'\n\nfor i in range(len(password)-1):\n if password[i] == password[i+1]:\n result = 'Bad'\n... | ['Runtime Error', 'Accepted'] | ['s464647749', 's671949767'] | [2940.0, 2940.0] | [17.0, 17.0] | [168, 164] |
p02993 | u987001487 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ["import math\nimport fractions\n\n\ndef lcm(x, y):\n return (x * y) // fractions.gcd(x, y)\n\n\nif __name__ == '__main__':\n a, b, c, d = map(int, input().split())\n warikireru_c = b // c - (- (-a // c)) + 1\n warikireru_d = b // d - (-(-a // d)) + 1\n lcm_1 = lcm(c, d)\n warikireru_lcm = b // lcm_1 ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s162483965', 's165458328', 's987345499', 's569141429'] | [5088.0, 5048.0, 5048.0, 3188.0] | [38.0, 35.0, 36.0, 19.0] | [413, 466, 467, 92] |
p02993 | u988586873 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['code = input()\nans = "Bad"\nif code[0] == code[1] or code[1] == code[2] or code[2] == code[3] or code[3] == code[4]:\n ans = "Good"\nprint(ans)', 'code = input()\nans = "Good"\nif code[0] == code[1] or code[1] == code[2] or code[2] == code[3]:\n ans = "Bad"\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s400175325', 's324108392'] | [2940.0, 3064.0] | [17.0, 17.0] | [143, 121] |
p02993 | u988957245 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['S = "3247"\ntext = "Good"\nfor i in range(3):\n if S[i] == S[i+1]:\n text = "Bad"\nprint(text)', 'def gcd(m,n):\n x = max(m,n)\n y = min(m,n)\n if x%y == 0:\n return y\n else:\n while x%y!=0:\n z = x%y\n x = y\n y = z\n else:\n ret... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s768936392', 's796293890', 's345342820'] | [2940.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [99, 506, 100] |
p02993 | u995193964 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['N = int(input())\nL = int(input())\n \naji = [(i+1)+L-1 for i in range(N)]\nmin = min(list(map(abs, aji)))\nprint(sum(aji)-min)', "input_number = int(input())\n\na = input_number//1000\nb = (input_number-1000*a)//100\nc = (input_number-1000*a-100*b)//10\nd = input_number-1000*a-100*b-c*10\nif a==b;\n\tprint('Bad')\ne... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s003966367', 's565033174', 's186478349'] | [3060.0, 2940.0, 3060.0] | [19.0, 17.0, 17.0] | [122, 250, 251] |
p02993 | u998082063 | 2,000 | 1,048,576 | The door of Snuke's laboratory is locked with a security code. The security code is a 4-digit number. We say the security code is _hard to enter_ when it contains two consecutive digits that are the same. You are given the current security code S. If S is hard to enter, print `Bad`; otherwise, print `Good`. | ['a= input()\n\ncounter = 0\nans = ""\n\nfor i in a:\n if counter == 0:\n ans = i\n else:\n if ans == i:\n print("Bad")\n exit(0)\n ans = i\n\nprint("Good")', 'a= input()\n\nans = ""\n\nfor i in a:\n if i == "a" or i == "i" or i == "u" or i == "e" or i == "o":\n co... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s265987863', 's713283110', 's957931435'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [185, 140, 105] |
p02994 | u003501233 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l=map(int,input().split())\n\nif l <= 0:\n if -1 * l >= n:\n n -= 1\nelse:\n l += 1\n n -= 1\n\nprint(int(n *(2+l+n-1)/2))', 'n,l=map(int,input().split())\n\nif l <= 0:\n if -1 * l >= n:\n n -= 1\nelse:\n l += 1\n n -= 1\n\nprint(int(n*(2*l+n-1)/2))'] | ['Wrong Answer', 'Accepted'] | ['s909489231', 's395017657'] | [2940.0, 2940.0] | [17.0, 17.0] | [121, 120] |
p02994 | u006251926 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N, L = map(int, input().split())\n \nif L > -1:\n N_eat = 1\nelif N+L-1 < 1:\n N_eat = N\nelse:\n N_eat = 1-L\n \npie = N*(N+1)/2 +N*(L-1) - (L + N_eat-1) \nprint(pie)', 'N, L = map(int, input().split())\n \nif L > -1:\n N_eat = 1\nelif N+L-1 < 1:\n N_eat = N\nelse:\n N_eat = 1-L\npie = N*N/2 +N*(L-1) - (L + N_... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s051721776', 's253166303', 's815312665', 's900360822', 's983063295', 's105467522'] | [3060.0, 3060.0, 3060.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 18.0, 17.0, 17.0] | [160, 154, 174, 164, 174, 166] |
p02994 | u007263493 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n ,l =map(int,input().split())\naji = []\n\napple = min(range(l,l+n),key=abs)\nprint(sum(aji)-apple)\n', 'n ,l =map(int,input().split())\naji = []\n\napple = min(range(l,l+n),key=abs)\nprint(sum(range(l,l+n))-apple)'] | ['Wrong Answer', 'Accepted'] | ['s354152198', 's009462666'] | [2940.0, 2940.0] | [17.0, 17.0] | [97, 105] |
p02994 | u007550226 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N,L = map(int,input().split())\nif L > 0:\n k = N*(L-1) + (N * (N+1))//2 - L\n print(k)\nif L == 0:\n print( (N-1) * N //2)\nelse: \n if L+N-1 >=0:\n k = N*(L-1) + (N * (N+1))//2\n print(k)\n else:\n k = N*(L-1) + (N * (N+1))//2 - (L+N-1)\n print(k)', 'if L > 0:\n k = N*(... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s044319780', 's077614215', 's475750005'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [280, 251, 282] |
p02994 | u015316911 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N, L = list(map(int, input().split()))\nresultList = []\ntasteList = []\nfor i in range(N):\n x = int(L + i)\n resultList.append(x)\n tasteList.append(abs(x))\n\nlistMin = min(tasteList)\nlistNum = tasteList.index(listMin)\nif tasteList[listNum] > 0:\n listSum = sum(resultList) + listMin\nelse:\n listS... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s513320622', 's988012211', 's543062476'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [351, 351, 353] |
p02994 | u016622494 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N , X =map(int,input().split())\nsums = []\ni = X\nresult =[]\na = []\nfor i in range(N):\n sums.append(i+X)\nfor j in range(N):\n a.append(abs(sums[j]))\n\nprint(sum(sums) - min(a) * 2)\n', 'N , X =map(int,input().split())\nsums = []\ni = X\nresult =[]\nfor i in range(N):\n sums.append(i+X)\nfor j in range(... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s789049415', 's802438930', 's476311065'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [183, 278, 251] |
p02994 | u018776180 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n, l = [int(s) for s in input().split(" ")]\n\nrng = list(range(l, l+n))\n\nmin_abs = 0\nval = 0\nfor r in rng:\n if min_abs > abs(r):\n min_abs = abs(r)\n val = r\n\nprint(sum(rng) - val)', 'n, l= [int(s) for s in input().split(" ")]\n\nrng = list(range(l, l+n))\nmin_abs = 400\nval = 0\nfor r in rng:\n if mi... | ['Wrong Answer', 'Accepted'] | ['s986622367', 's706148446'] | [2940.0, 3060.0] | [20.0, 17.0] | [184, 184] |
p02994 | u020959776 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ["import io\nimport sys\n\n\ndef IN_S():\n return input()\n\n\ndef IN_I():\n return int(input())\n\n\ndef IN_L_I():\n return list(map(int, input().split()))\n\n\ndef IN_L_S():\n return list(map(str, input().split()))\n\n\ndef STR_SPLIT(s, n):\n for l in range(0, len(s), n):\n yield s[0 + l:n + l]\n\n\ndef T_IN(... | ['Wrong Answer', 'Accepted'] | ['s819882644', 's399191717'] | [3064.0, 3064.0] | [18.0, 17.0] | [708, 710] |
p02994 | u021906447 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N,L = map(int, input().split())\n\napple = [L+i for i in range(N)]\nprint(apple)\nmin = 500\nfor k in range(len(apple)):\n if abs(apple[k])<min:\n min = abs(apple[k])\n\napple.remove(min)\nprint(sum(apple))', 'N,L = map(int, input().split())\n\napple = [L+i for i in range(N)]\nprint(apple)\nmin = 500\nfor k... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s100696270', 's541576826', 's712188536'] | [9160.0, 9120.0, 9176.0] | [28.0, 28.0, 26.0] | [206, 206, 193] |
p02994 | u023229441 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l=map(int,input().split())\nA=l-1+n*(n-1)//2\nif 1<=1-l and 1-l<=n:\n print(A)\nelif 1>1-l:\n print(A-(l-2))\nelse:\n print(A-n+1-l)', 'n,l=map(int,input().split())\nA=n*(l-1)+n*(n+1)//2\nif 1<=1-l and 1-l<=n:\n print(A)\nelif 1>1-l:\n print(A-l)\nelse:\n print(A-n+1-l)\n'] | ['Wrong Answer', 'Accepted'] | ['s354746155', 's836308072'] | [3060.0, 2940.0] | [18.0, 17.0] | [130, 131] |
p02994 | u024245528 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['import bisect\n\nN,L = map(int,input().split())\n\nL_list =[]\n\nfor i in range(1,N+1):\n L_list.append(L+i-1)\n\nL_list.sort()\n\nindex = bisect.bisect_left(L_list, 0)\n\nif index == N :\n L_list.pop(index-1)\n\nprint(sum(L_list))\n', 'N,L = map(int, input().split())\n\nN_list = [ i for i in range(1,N+1)]\n\na... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s617272262', 's666666835', 's001320632'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [222, 192, 191] |
p02994 | u026862065 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n, l = map(int, input().split())\na = [l + i for i in range(n)]\nif l + n - 2 < 0:\n a.pop(n - 1)\nelif l > 0:\n a.pop(0)\n print(a)\nprint(sum(a))', 'n, l = map(int, input().split())\na = [l + i for i in range(n)]\nif l + n - 1 < 0:\n a.pop(n - 1)\nelif l > 0:\n a.pop(0)\n print(a)\nprint(sum(a))',... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s442656409', 's861052341', 's961829452'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [149, 149, 136] |
p02994 | u028014940 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['import numpy as np\nfrom numba import jit\n@jit\nn,l=map(int,input().split())\na = np.arange(l,l+n)\nd = abs(a).argmin() \nprint(a.sum() - a[d])', 'import numpy as np\na = np.arange(L, L + N)\nd = abs(a).argmin() \nprint(a.sum() - a[d])', 'import numpy as np\nn,l=map(int,input().split())\na = np.arange(l,l+n)\nd = ab... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s341732888', 's711123229', 's175117880'] | [2940.0, 12412.0, 20504.0] | [17.0, 147.0, 292.0] | [252, 153, 179] |
p02994 | u033524082 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l=map(int,input().split())\ns=int(n*(n+l*2)/2)\nm=[]\nfor i in range(n):\n m.append(abs(s-l+i))\nprint(min(m))', 'n,l=map(int,input().split())\nL=[i+l for i in range(n)]\ns=sum(L)\nabsorute=1000\nm=0\nfor i in L:\n if absorute>abs(i):\n absorute=abs(i)\n m=i\nprint(s-m)'] | ['Wrong Answer', 'Accepted'] | ['s734733501', 's137707036'] | [3316.0, 3060.0] | [20.0, 17.0] | [110, 164] |
p02994 | u036340997 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n, l = map(int, input().split())\n\nif l+n-1<=-1:\n print((n-1)*l + (n-2)*(n-1)/2)\n \nelif l>=1:\n print((n-1)*l + n*(n-1)/2)\n \nelse:\n print(l*n + (n-1)*n/2)\n', 'n, l = map(int, input().split())\n\nif l+n<=-1:\n print((n-1)*l + (n-2)*(n-1)/2)\n \nelif l>=1:\n print((n-1)*l + n*(n-1)/2)\n \nelse:\n prin... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s037248621', 's174616758', 's290120751'] | [2940.0, 3188.0, 2940.0] | [17.0, 18.0, 17.0] | [158, 155, 173] |
p02994 | u040141413 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N,L=map(int,input().split())\ntaste_abs=[]\ntaste=[]\nfor i in range(N):\n taste_abs.append(abs(L+i))\n taste.append(L+i)\n print(taste[i])\n \na=taste_abs.index(min(taste_abs))\nb=sum(taste)-taste[a]\nprint(b)\n', 'N,L=map(int,input().split())\ntaste_abs=[]\ntaste=[]\nfor i in range(N):\n taste_abs.ap... | ['Wrong Answer', 'Accepted'] | ['s317238262', 's978242627'] | [3060.0, 3060.0] | [18.0, 17.0] | [213, 193] |
p02994 | u041783158 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N, L = map(int, input().strip().split())\n\nif L > 0:\n print(sum([i + L for i in range(1, N)]))\nif L + N > 0:\n print(sum([i + L for i in range(0, N)]))\nelse:\n print(sum([i + L for i in range(0, N - 1)]))\n', 'N, L = map(int, input().strip().split())\n\nif L > 0:\n print(sum([i + L for i in range(1, N)]))\nel... | ['Wrong Answer', 'Accepted'] | ['s915753384', 's225800551'] | [2940.0, 3064.0] | [17.0, 18.0] | [205, 206] |
p02994 | u044442911 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['from sys import stdin\n\n\ndef main():\n N, L = [int(x) for x in stdin.readline().rstrip().split()]\n\n apple_list = []\n\n for i in range(N):\n apple_list.append(L+i)\n\n s = sorted(apple_list, key=abs)\n s.pop(0)\n print(sum(s))\n //print(123)\n\n\nif __name__ == "__main__":\n main()\... | ['Runtime Error', 'Accepted'] | ['s582296330', 's314494458'] | [2940.0, 2940.0] | [17.0, 17.0] | [300, 283] |
p02994 | u046585946 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l=map(int,input().split())\nans=(2*l+n-2)*n//2\nif l-1>=0:\n ans-=l\nelif l-1<=0 and abs(l-1)>=n:\n ans-=l+n-1\nprint(ans)', 'n,l=map(int,input().split())\nans=(2*l+n-1)*n//2\nif l-1>=0:\n ans-=l\nelif l-1<=0 and abs(l-1)>=n:\n ans-=l+n-1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s788089642', 's021771496'] | [2940.0, 2940.0] | [17.0, 18.0] | [120, 120] |
p02994 | u055687574 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N, L = map(int, input().split())\n\napple = [L + n for n in range(N)]\neat_apple = min(map(abs, apple))\nprint(sum(apple) + eat_apple)\n', 'N, L = map(int, input().split())\n\nL_max= N + L -1\nans = (L + L_max) * N // 2\n\nif L * L_max <= 0:\n print(ans)\nelif ans > 0:\n print(ans - L)\nelse:\n print(ans - L... | ['Wrong Answer', 'Accepted'] | ['s651399254', 's420773677'] | [2940.0, 3316.0] | [17.0, 19.0] | [131, 174] |
p02994 | u057079894 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,k=map(int,input().split())\nans=10000\nfor i in range(n):\n ans=min(ans,abs(k+i))\nprint(n*k+(n-2)*(n-1)//2-ans)\n', 'n,k=map(int,input().split())\nju=False\nfor i in range(n):\n if k+i==0:\n ju=True\n break\nans=0\nif ju:\n if k<0:\n for i in range(n-1):\n ans+=k+i\n else:\n for i in range(1,n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s467690582', 's741387925', 's577911377'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [112, 254, 258] |
p02994 | u062847046 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N,L = map(int,input().split())\ns = []\nfor i in range(N):\n s.append(L+i)\nans_pre = abs(np.array([s]))\nif L + N < 0:\n print(-1*(sum(ans_pre[0])-min(ans_pre[0])))\nelse:\n print(sum(s)-min(ans_pre[0]))', 'import numpy as np\nN,L = map(int,input().split())\ns = []\nfor i in range(N):\n s.append(L+i)\nan... | ['Runtime Error', 'Accepted'] | ['s391735878', 's874963951'] | [3060.0, 21404.0] | [17.0, 366.0] | [205, 225] |
p02994 | u075303794 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l = map(int, input().split())\na = []\nans = 0\nfor i in range(1, n+1):\n a.append([l + i - 1, abs(l + i - 1)])\na = sorted(a, key = lambda x:x[1], reverse = True)\na.pop()\nfor _ in range(n-1):\n ans += a[0]\nprint(ans)\n\n', 'n,l = map(int, input().split())\na = []\nans = 0\nfor i in range(1, n+1):\n a.append(... | ['Runtime Error', 'Accepted'] | ['s955570648', 's148784274'] | [3060.0, 3064.0] | [17.0, 17.0] | [217, 218] |
p02994 | u075595666 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n, l = [int(i) for i in input().split()]\nans = (l-1)*n+n*(n+1)//2\nif l-1<=0 and l-1+n>=0:\n print(ans)\nelif l+n-1<0:\n print(ans-(l+n-1))\nelif l-1 >0:\n print(ans-l+1)', 'n, l = [int(i) for i in input().split()]\nans = (l-1)*n+n*(n+1)//2\nif l<=0 and l-1+n>=0:\n print(ans)\nelif l+n-1<0:\n print(ans-(l+n-1))... | ['Wrong Answer', 'Accepted'] | ['s252482369', 's736640507'] | [3060.0, 3060.0] | [18.0, 17.0] | [167, 161] |
p02994 | u076306174 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['aji=0\neat=99999\n\nfor i in range(1,N+1):\n aji=aji+i+L-1\n if abs(aji) < abs(eat):\n eat = aji\n \nprint(aji)', 'N,L=map(int, input().split()) \n\naji_sum=0\neat=99999\n\nfor i in range(1,N+1):\n \n aji_sum=aji_sum+i+L-1\n print(aji_sum,i+L-1)\n if abs(i+L-1) < abs(eat):\n ea... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s087609834', 's170697097', 's496767178'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [123, 281, 256] |
p02994 | u084320347 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l = list(map(int,input().split()))\nn_l = []\nfor i in range(n):\n n_l.append(i+l)\n\nprint(n_l)\nmin_i = n_l[0]\nfor i in n_l:\n print(i)\n if abs(i) < abs(min_i):\n min_i = i\n\nprint(sum(n_l) - min_i)\n', 'n,l = list(map(int,input().split()))\nn_l = []\nfor i in range(n):\n n_l.append(i+l)\n ... | ['Wrong Answer', 'Accepted'] | ['s086525239', 's167046044'] | [3060.0, 2940.0] | [17.0, 17.0] | [210, 190] |
p02994 | u085035133 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['# -*- coding: utf-8 -*-\ndef pop_min_abs(l):\n abs = map(abs, l)\n return l.pop(abs.index(min(abs)))\n\n\n\nn, l = map(int, input().split())\n\napples = [l+i-1 for i in range(1,n+1)]\nprint(sum(pop_min_abs(apples)))\n', '# -*- coding: utf-8 -*-\ndef pop_min_abs(l):\n abs_l = list(map(abs, l))\n l.pop(abs_... | ['Runtime Error', 'Accepted'] | ['s227995500', 's023093899'] | [9060.0, 9040.0] | [22.0, 26.0] | [212, 230] |
p02994 | u086503932 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N,L=map(int,input().split())\ntaste=0\nfor i in range(N):\n taste += (L + i)\n\nans=10*6\nfor j in range(N):\n tmp = L+j\n if abs(tmp) < abs(ans):\n ans = tmp\nprint(taste - tmp)\n', 'N,L=map(int,input().split())\na = []\nfor i in range(N):\n a.append(L+i)\n\nans=10*6\ns = sum(a)\nfor j in range(N):\n t = s -... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s041215196', 's524305310', 's578650189', 's708711682', 's468424396'] | [3064.0, 3060.0, 3060.0, 2940.0, 2940.0] | [18.0, 18.0, 19.0, 20.0, 17.0] | [175, 175, 189, 184, 187] |
p02994 | u095756391 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n, l = map(int, input().split())\n\naji = []\nfor i in range(n):\n a = l + i\n aji.append(a)\n\ns = sum(aji)\nans = 1000000000\nfor i in range(n):\n sd = s - aji[i]\n b = abs(s-sd)\n ans = min(ans, b)\n\nprint(ans)\n\n', 'n, l = map(int, input().split())\n\naji = []\nfor i in range(n):\n a = l + i\n... | ['Wrong Answer', 'Accepted'] | ['s149197359', 's335751057'] | [3060.0, 3060.0] | [17.0, 17.0] | [217, 253] |
p02994 | u096616343 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N, L = map(int,input())\nl, r = L, L + N - 1\ntotal = (L - 1) * N + N * (N + 1) // 2\nif l <= 0 and r >= 0:\n print(total)\nif l > 0:\n total -= l\n print(total)\nif r < 0:\n total -= r\n print(total)', 'N, L = map(int,input().split())\nl, r = L, L + N - 1\ntotal = (L - 1) * N + N * (N + 1) // 2\nif l ... | ['Runtime Error', 'Accepted'] | ['s142419090', 's749580837'] | [3060.0, 3064.0] | [18.0, 17.0] | [205, 213] |
p02994 | u098065136 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l = map(int,input().split())\n\nsum = n * (l - 1) + (n * (n + 1)) / 2.0\n\nif n + l - 1 < 0:\n print(int(sum - (n + l - 1)))\nelif l > 0:\n print(int(sum - (l - 1)))\nelse:\n print(int(sum))', 'n,l = map(int,input().split())\n\nsum = n * (l - 1) + (n * (n + 1)) / 2.0\n\nif n + l - 1 < 0:\n print(sum - (... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s172844413', 's842593254', 's927696646', 's942080325', 's992723789'] | [3060.0, 3060.0, 3060.0, 2940.0, 3060.0] | [17.0, 19.0, 18.0, 18.0, 18.0] | [192, 181, 176, 197, 188] |
p02994 | u100800700 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N,L=map(int,input().split())\na=[abs(L+i-1) for i in range(1,N+1)]\nprint(a)\nprint(N*L-L+sum([i for i in range(1,N+1)])-N-a.index(min(a)))', 'N,L=map(int,input().split())\na=[abs(L+i-1) for i in range(1,N+1)]\nprint(N*L-L+sum([i for i in range(1,N+1)])-N-a.index(min(a)))'] | ['Wrong Answer', 'Accepted'] | ['s871863690', 's733080581'] | [3060.0, 3060.0] | [18.0, 22.0] | [136, 127] |
p02994 | u103146596 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l= map(int, input().split())\nans=[l]\nb=[]\n\n \nif l > 0:\n for i in range(n-1):\n ans.append(l+1)\n l=l+1\n print(sum(ans)-ans[0])\nif l == 0:\n for i in range(n-1):\n ans.append(l+1)\n l=l+1 \n print(sum(ans))\n \nif l < 0:\n for i in range(n-1):\n ... | ['Wrong Answer', 'Accepted'] | ['s058507617', 's683631093'] | [3064.0, 3064.0] | [17.0, 17.0] | [440, 521] |
p02994 | u106181248 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n, l = map(int,input().split())\nm = list(range(l, n))\n\nif 0 in m:\n print(sum(m))\n \nelse:\n if m[0] < 0:\n print(sum(m)-max(m))\n else:\n print(sum(m)-min(m))', 'n, l = map(int,input().split())\nm = list(range(l, l+n))\n\nif 0 in m:\n print(sum(m))\n \nelse:\n if m[0] < 0:\n print(sum(m)-max(m))\... | ['Runtime Error', 'Accepted'] | ['s868919226', 's882688417'] | [3060.0, 3060.0] | [17.0, 18.0] | [163, 165] |
p02994 | u116233709 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l=map(int,input().split())\nans=(((2*l)+n-1)*n)/2\n\nif l>=0:\n ans-=l\nelif l<0 and (l+n-1)>0:\n ans+=0\nelse:\n ans-=(l+n-1)\n \nprint(ans) \n ', 'n,l=map(int,input().split())\nans=(((2*l)+n-1)*n)/2\n\nif l>=0:\n ans-=2*l\nelif l<0 and (l+n-1)>=0:\n ans+=0\nelse:\n ans-=(l+n-1)*2\n \nprint(ans) \n \n'... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s245242163', 's506563235', 's272159406'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [142, 148, 149] |
p02994 | u119566015 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['import sys\ninput = sys.stdin.readline\nN,L = map(int,input().split())\nlst = [L]\nfor i in range(n-1):\n lst.append(lst[-1]-1)\narr = [abs(i) for i in lst]\ndel lst[arr.index(min(arr))]\nprint(sum(lst))\n', 'import sys\ninput = sys.stdin.readline\nN,L = map(int,input().split())\nlst = [L]\nfor i in range(n-1):\n l... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s519848538', 's828957329', 's369047985'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [197, 197, 197] |
p02994 | u119947188 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N,L = map(int,input().split())\na = [0]*N\nfor i in range(N):\n a[i] = L+i\nall_apple_pie = sum(a)\napple_pie = [0]*N\ndef_apple_pie = [0]*N\nfor i in range(N):\n t = a[i]\n a[i] = 0\n apple_pie[i] = sum(a)\n def_apple_pie[i] = abs(all_apple_pie-apple_pie[i])\n a[i] = t\nprint(min(def_apple_pie))', 'N,L = map(i... | ['Wrong Answer', 'Accepted'] | ['s807990990', 's071488454'] | [9232.0, 9152.0] | [27.0, 29.0] | [290, 336] |
p02994 | u123745130 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l=map(int,input().split())\nlst_kazu=[i for i in range(1,n+1)]\nlst_aji=[i-l+1 for i in range(1,n+1)]\nlst_aji_sum=sum(lst_aji)\naji_ans=0\nfor i in range(n):\n\tif lst_aji[i]==int(lst_aji_sum/n):\n \taji_ans=(lst_aji_sum-lst_aji[i])\n break\n else:\n \taji_ans=min(aji_ans,abs(lst_aji[i]-(lst_aji_... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s468134335', 's756779602', 's225555958'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [339, 328, 181] |
p02994 | u125269142 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n, l = map(int, input().split())\n\ntaste_lists = []\nfor i in range(n):\n taste = l+i-1\n taste_lists.append(taste)\n\nfor i in taste_lists:\n if i<0:\n taste_lists[i] = abs(i)\n\ntaste_lists.sort()\ntaste_lists.pop(0)\n\nans = 0\nfor i in taste_lists:\n ans += i\n \nprint(ans)', 'n, l = map(int, input().spl... | ['Runtime Error', 'Accepted'] | ['s837706526', 's742239622'] | [9156.0, 9100.0] | [26.0, 27.0] | [269, 373] |
p02994 | u125845436 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['import sys\nimport math\n\nargs = sys.argv\nn = args[0]\nl = args[1]\n\nn = int(n)\nl = int(l)\n\nall = []\nfor i in range(n):\n all.append(l+i)\nall_sum = sum(all)\n\nminus = 10000\nans = 0\nfor i in range(len(all)):\n if math.fabs(all_sum - (all_sum - all[i])) < math.fabs(minus):\n minus = math.fabs(al... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s733762173', 's807824056', 's321454236'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0] | [367, 336, 355] |
p02994 | u127499732 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l=map(int,input().split())\ns=(l-1)*n+n*(n+1)/2\nif n>=1:\n print(s-1)\nelif n>=1-l:\n print(s-1+l)\nelse:\n print(s-n)', 'n,l=map(int,input().split())\ns=(l-1)*(n-1)+n*(n+1)//2\nif l>=1:\n print(s-1)\nelif n>=1-l:\n print(s-1+l)\nelse:\n print(s-n)'] | ['Wrong Answer', 'Accepted'] | ['s127617496', 's502103769'] | [3060.0, 3060.0] | [17.0, 17.0] | [117, 122] |
p02994 | u130645445 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['\nN,L = map(int,input().split())\nL2 = L\ncount=0\nwhile L2 < 0:\n L2+=1\n count+=1\n\nsum =0\nif L < -1:\n j = N\nelse:\n j = N+1\nfor i in range(1,j):\n if i-1 != count:\n sum += L+i-1\n print(sum)\nprint(sum)', '\nN,L = map(int,input().split())\nL2 = L\ncount=0\nwhile L2 < 0:\n L2+=... | ['Wrong Answer', 'Accepted'] | ['s573151191', 's228021147'] | [3060.0, 3060.0] | [18.0, 18.0] | [223, 205] |
p02994 | u131264627 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n, l = map(int, input().split())\nctn = 0\nif 0 < l:\n for i in range(2, n):\n ctn += l + i - 1\n print(ctn)\nelif n + l < 0:\n for i in range(1, n - 1):\n ctn += l + i - 1\n print(ctn)\nelse:\n for i in range(1, n):\n ctn += l + i - 1\n print(ctn)', 'n, l = map(int, input().spl... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s196629485', 's728497538', 's315696006'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [274, 84, 84] |
p02994 | u131406572 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['n,l=map(int,input().split())\ns=[]\nfor i in range(n):\n s.append(l+i-1)\ns.remove(min(abs(s)))\na=0\nfor i in s:\n a+=i\nprint(a)', 'n,l=map(int,input().split())\naji=[]\nfor i in range(n):\n aji.append(l+i)\ne=aji.index(min(abs(aji)))\nprint(sum(aji)-aji[e])', 'n,l=map(int,input().split())\naji=[]\nfor i i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s229895660', 's827235961', 's774732723'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [128, 124, 181] |
p02994 | u135116520 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N,L=map(int,input().split())\ns=[]\nfor i in range(1,N+1):\n s.append(L+i-1)\nt=s.remove(min(abs(s)))\nprint(sum(t))', 'N,L=map(int,input().split())\ns=[]\nfor i in range(1,N+1):\n s.append(L+i-1)\nt=min(abs(s[i-1]))\ns.remove(t)\nprint(sum(s))', 'N,L=map(int,input().split())\n＃リンゴの味のリスト\ns=[]\nfor i in range(1,N+1... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s260680979', 's409978027', 's599289514', 's628293712', 's649799797', 's180480663'] | [2940.0, 2940.0, 3064.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 20.0, 17.0, 17.0, 18.0] | [112, 119, 193, 110, 121, 126] |
p02994 | u136869985 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N, L = map(int, input().split())\nA = [] \n\nfor i in range(N):\n A.append(L + i) \n\ntotal = sum(A) \n\n\nb = 10000\nj = 0 \nfor i in range(N):\n if abs(A[i]) < b:\n j = i\n\nprint(total - A[j])\n', 'N, L = map(int, input().split())\nA = [] \n\nfor i in range(N):\n A.append(L + i) \n\ntotal = sum(A) ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s150189683', 's865548529', 's002993443'] | [3060.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0] | [402, 404, 426] |
p02994 | u141410514 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['N,L = map(int,input().split())\nt = N*L + N*N/2 - N/2\nif L <= 0 and L+N >=0:\n pass\nelif L <= 0:\n t = t-(L+N)\nelse:\n t = t-L\nprint(t)', 'N,L = map(int,input().split())\nmin = 99999\nfor x in range(N):\n t = L+x\n tmp = abs(t)\n if tmp < abs(min):\n min = t\nsum = (2*L+N-1)*N//2\nprint(s... | ['Wrong Answer', 'Accepted'] | ['s910087040', 's460594647'] | [2940.0, 2940.0] | [17.0, 17.0] | [140, 165] |
p02994 | u143051858 | 2,000 | 1,048,576 | You have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The _flavor_ of Apple i is L+i-1, which can be negative. You can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used. You planned to make an apple pie using all of the apples... | ['import math\nN,L = map(int,input().split())\nr = []\ntotal=0\nap=0\nmax = -100100100100\nfor i in range(1,N+1):\n r.append(L+i-1)\nfor i in range(N):\n for j in range(N):\n if j != i:\n total+=r[j]\n if max < total:\n ap = total\n total=0\nprint(ap)', 'import math\nN,L = map(int,input().split())\nr = [... | ['Wrong Answer', 'Accepted'] | ['s553445728', 's547467816'] | [3064.0, 3064.0] | [20.0, 19.0] | [249, 366] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.