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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02801 | u630004940 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["N,K,M = map(int,input().split())\n\nA = []\n\nA = list(map(int, input().split()))\n\nS = sum(A)\nScore = M * N\n\nn = Score - S\n\nif n >=0 and n < 100:\n print(n)\nelif n >= 100:\n print('-1')\nelse:\n print(0)", "N,K,M = map(int,input().split())\n\nA = []\n\nA = list(map(int, input().split()))\n\nS = sum(A)\nScore = M * N\n\nn = Score - S\n\nif n >=0 and n <= 100:\n print(n)\nelif n > 100:\n print('-1')\nelse:\n print(0)\n", 'x = input()\nl = [chr(i) for i in range(97, 97+26)]\n\nfor i in range(26):\n if l[i]== x:\n k = i\n \nprint(l[k+1])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s456285867', 's683204779', 's367102651'] | [3060.0, 3064.0, 2940.0] | [18.0, 18.0, 17.0] | [204, 205, 125] |
p02801 | u633320358 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["import numpy as np\nh,w=map(int,input().split())\ns=[[0 for i in range(w)] for j in range(h)]\nfor i in range(h):\n\ts[i]=list(input())\n# h,w=3,3\n# s=[['.', '.', '.'], ['.', '.', '.'], ['.', '.', '.']]\nv=[[1000000 for i in range(w)] for j in range(h)]\ns=np.array(s)\nv=np.array(v)\ndef search(H,W,p):\n\tm=0\n\tif H<h-1 and s[H+1][W]=='.' and v[H+1][W]>p+1:\n\t\tv[H+1][W]=p+1\n\t\tm=p+1\n\tif H>0 and s[H-1][W]=='.' and v[H-1][W]>p+1:\n\t\tv[H-1][W]=p+1\n\t\tm=p+1\n\tif W>0 and s[H][W-1]=='.' and v[H][W-1]>p+1:\n\t\tv[H][W-1]=p+1\n\t\tm=p+1\n\tif W<w-1 and s[H][W+1]=='.' and v[H][W+1]>p+1:\n\t\tv[H][W+1]=p+1\n\t\tm=p+1\n\treturn m\n\ndef dijk():\n\tf=False\n\tglobal P\n\tglobal M\n\tfor i in range(h):\n\t\tfor j in range(w):\n\t\t\tif v[i][j]==P:\n\t\t\t\tm=search(i,j,P)\n\t\t\t\tM=max(m,M)\n\t\t\t\tf=True\n\n\tP+=1\n\tif f==False:\n\t\treturn 0\n\tdijk()\nM_=0\nfor i in range(h):\n\tfor j in range(w):\n\t\tv[i][j]=0\n\t\tP=0\n\t\tM=0\n\t\tif s[i][j]!='.':\n\t\t\tcontinue\n\t\tdijk()\n\t\tM_=max(M,M_)\n\t\tv=[[1000000 for i in range(w)] for j in range(h)]\nprint(M_)", 'C=input()\n\ni=ord(C)+1\nprint(chr(i))'] | ['Runtime Error', 'Accepted'] | ['s389870833', 's347512340'] | [12436.0, 2940.0] | [151.0, 17.0] | [964, 35] |
p02801 | u634046173 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["l = ['abcdefghijklmnopqrstuvwxyz']\n\nprint(l[l.index(input()) + 1])", "c =input()\nl = 'abcdefghijklmnopqrstuvwxyz'\n \nprint(l[l.index(c) + 1])"] | ['Runtime Error', 'Accepted'] | ['s415939017', 's673323779'] | [2940.0, 2940.0] | [18.0, 17.0] | [66, 70] |
p02801 | u636157062 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["N,M = [int(i) for i in input().split()]\nsubmissions = {str(i):[] for i in range(1,N+1)}\nAC,WA = 0,0\nfor i in range(M):\n P,S = [j for j in input().split()]\n submissions[P].append(S)\nfor i in submissions:\n if 'AC' not in submissions[i]:\n continue\n for j in submissions[i]:\n if j == 'AC':\n AC+=1\n break\n WA +=1\nprint(AC,WA)", "N,M = [int(i) for i in input().split()]\nsubmissions = {str(i):[] for i in range(1,N+1)}\nAC,WA = 0,0\nfor i in range(M):\n P,S = [j for j in input().split()]\n submissions[P].append(S)\nfor i in submissions:\n if(not 'AC' in submissions[i]):\n continue\n for j in submissions[i]:\n if j == 'AC':\n AC+=1\n break\n WA +=1\nprint(AC,WA)", "N,M = [int(i) for i in input().split()]\nsubmissions = {str(i):[] for i in range(1,N+1)}\nAC,WA = 0,0\nfor i in range(M):\n P,S = [j for j in input().split()]\n submissions[P].append(S)\nfor i in submissions:\n for j in submissions[i]:\n if not 'AC' in j:\n break\n if j == 'AC':\n AC+=1\n break\n WA +=1\nprint(AC,WA)\n\n", "N,M = [int(i) for i in input().split()]\nsubmissions = {str(i):[] for i in range(1,N+1)}\nAC,WA = 0,0\nfor i in range(M):\n P,S = [j for j in input().split()]\n submissions[P].append(S)\nfor i in submissions:\n if 'AC' not in submissions[i]:\n continue\n for j in submissions[i]:\n if j == 'AC':\n AC+=1\n break\n WA +=1\nprint(AC,WA)", 'C = input()\nalphs = "abcdefghijklmnopqrstuvwxyz"\nprint(alphs[alphs.find(C)+1])'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s024090847', 's271124526', 's641703065', 's830685966', 's058830313'] | [3064.0, 3064.0, 3060.0, 3064.0, 2940.0] | [17.0, 18.0, 19.0, 17.0, 17.0] | [375, 376, 369, 375, 78] |
p02801 | u637918426 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["N, M = map(int, input().split())\n\nA = [[0] * 2 for i in range(M)]\n\nfor i in range(M):\n A[i][0], A[i][1] = input().split()\n\n\nAC = [0] * M\nWA = [0] * M\n\nfor j in range(M)[::-1]:\n if A[j][1] == 'AC' and (A[j][0] in AC) is False:\n AC[j] = A[j][0]\n elif A[j][1] == 'WA' and (A[j][0] in AC) is True:\n WA[j] = A[j][0]\n\nprint(len(AC) - AC.count(0), len(WA) - WA.count(0))\n", "C = input()\n\nL = list('abcdefghijklmnopqrstuvwxyz')\n\nfor i in range(26):\n if C == L[i]:\n print(L[i + 1])\n break\n"] | ['Runtime Error', 'Accepted'] | ['s481856645', 's426157897'] | [3064.0, 2940.0] | [18.0, 17.0] | [387, 129] |
p02801 | u647287452 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['print(int("a"))', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s187435463', 's490039452'] | [2940.0, 2940.0] | [17.0, 17.0] | [15, 26] |
p02801 | u652656291 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["A = input()\nif A = 'a':\n print('b')\nelif A = 'b':\n print('c')\nelif A = 'c':\n print('d')\nelif A = 'd':\n print('e')\nelif A = 'e':\n print('f')\nelif A = 'f':\n print('g')\nelif A = 'g':\n print('h')\nelif A = 'h':\n print('i')\nelif A = 'i':\n print('j')\nelif A = 'j':\n print('k')\nelif A = 'k':\n print('l')\nelif A = 'l':\n print('m')\nelif A = 'm':\n print('n')\nelif A = 'n':\n print('o')\nelif A = 'o':\n print('p')\nelif A = 'p':\n print('q')\nelif A = 'q':\n print('r')\nelif A = 'r':\n print('s')\nelif A = 's':\n print('t')\nelif A = 't':\n print('u')\nelif A = 'u':\n print('v')\nelif A = 'v':\n print('w')\nelif A = 'w':\n print('x')\nelif A = 'x':\n print('y')\nelse:\n print('z')\n\n", "A = str(input(''))\nif A = 'a':\n print('b')\nelif A = 'b':\n print('c')\nelif A = 'c':\n print('d')\nelif A = 'd':\n print('e')\nelif A = 'e':\n print('f')\nelif A = 'f':\n print('g')\nelif A = 'g':\n print('h')\nelif A = 'h':\n print('i')\nelif A = 'i':\n print('j')\nelif A = 'j':\n print('k')\nelif A = 'k':\n print('l')\nelif A = 'l':\n print('m')\nelif A = 'm':\n print('n')\nelif A = 'n':\n print('o')\nelif A = 'o':\n print('p')\nelif A = 'p':\n print('q')\nelif A = 'q':\n print('r')\nelif A = 'r':\n print('s')\nelif A = 's':\n print('t')\nelif A = 't':\n print('u')\nelif A = 'u':\n print('v')\nelif A = 'v':\n print('w')\nelif A = 'w':\n print('x')\nelif A = 'x':\n print('y')\nelse:\n print('z')\n\n", 'c=str(input())\n\nif len(c)==1 and c!="z":\n\tprint(chr(ord(c)+1))\nelse:\n\tprint(\'a\')\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s316391621', 's357734217', 's701059275'] | [2940.0, 3068.0, 2940.0] | [17.0, 17.0, 17.0] | [678, 685, 81] |
p02801 | u658288444 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['print(char(ord(input())+1))', 'print(input()+1)', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s360073869', 's740975874', 's168014627'] | [8900.0, 9036.0, 8960.0] | [22.0, 26.0, 28.0] | [27, 16, 26] |
p02801 | u667024514 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['s = str(input())\nprint(char(ord(s)+1))', 's = str(input())\nprint(chr(ord(s)+1))'] | ['Runtime Error', 'Accepted'] | ['s372690435', 's596939736'] | [2940.0, 2940.0] | [20.0, 17.0] | [38, 37] |
p02801 | u671787293 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['tmp = Input()\nans = chr(ord(tmp) + 1)\nprint(ans)', "N, K, M = map(int, input().split())\nA = list(map(int, input().split()))\n \nif N*M - sum(A) >= K:\n print('-1')\nelse:\n print(N*M - sum(A))", 'tmp = input()\nans = chr(ord(tmp) + 1)\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s517055485', 's604486088', 's074362219'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [48, 140, 48] |
p02801 | u674052742 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['al = [ord(i) for i in range(ord("a"), ord("a")+26)]\n\nstr = input()\n\nprint(al[al.index(str)+1])', 'al = [chr(i) for i in range(ord("a"), ord("a")+26)]\n\nstr = input()\n\nprint(al[al.index(str)+1])\n'] | ['Runtime Error', 'Accepted'] | ['s861671083', 's026465435'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 95] |
p02801 | u674190122 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['from strings import ascii_lowercase as lc\ngiven = input()\nprint(lc[lc.index(given) + 1])', 'from string import ascii_lowercase as lc\ngiven = input()\nprint(lc[lc.index(given) + 1])'] | ['Runtime Error', 'Accepted'] | ['s257375573', 's641529534'] | [8924.0, 9816.0] | [24.0, 36.0] | [88, 87] |
p02801 | u674588203 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['c=input()\nl=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]\nprint(l[l.index(c)+1])', "c=input()\nl=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\nprint(l[l.index(c)+1])\n"] | ['Runtime Error', 'Accepted'] | ['s670602674', 's698529804'] | [2940.0, 2940.0] | [17.0, 17.0] | [88, 141] |
p02801 | u685244071 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["C = input()\nprint(chr(ord('C') + 1))\n", "C = input()\nprint chr(ord('C') + 1)", 'C = input()\nprint(chr(ord(C) + 1))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s482430169', 's846207903', 's351553806'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [37, 35, 34] |
p02801 | u685662874 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['S=input()\n\nprint(chr(ord(S)+1)', 'S=input()\n\nprint(chr(ord(S)+1))\n'] | ['Runtime Error', 'Accepted'] | ['s960454596', 's762073102'] | [2940.0, 2940.0] | [17.0, 17.0] | [30, 32] |
p02801 | u686036872 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["C=str(input())\nabc=['a', 'b', 'c', 'd' , 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\nprint(abc[abc.index(C)+1)])\n", "C=str(input())\nabc=['a', 'b', 'c', 'd' , 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\nprint(abc[abc.index(C)+1])\n"] | ['Runtime Error', 'Accepted'] | ['s523145536', 's064890510'] | [2940.0, 2940.0] | [17.0, 17.0] | [179, 178] |
p02801 | u688564053 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N, K, M =map(int, input().split())\nA = list(map(int, input().split()))\n\n\nif K >= N * M - sum(A) >= 0:\n print(N * M -sum(A))\nelif sum(A) >= N * M - M:\n print("0")\nelse:\n print("-1")\n\n\n\n', 'alphabet = input()\nprint(chr(ord(alphabet) + 1))'] | ['Runtime Error', 'Accepted'] | ['s487403488', 's316424735'] | [2940.0, 2940.0] | [17.0, 17.0] | [241, 48] |
p02801 | u695079172 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | [' c = input()\n print(chr(ord(c)+1))', 'c = input()\nprint(chr(ord("")+1))', 'c = input()\n\nprint(chr(ord(c)+1))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s256975978', 's903281411', 's285811968'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [40, 33, 33] |
p02801 | u699944218 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["A = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\nC = input()\nfor i in range(len(A)):\n elif C == A[i]:\n break\nprint(A[i+1])", "A = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\nC = input()\nfor i in range(len(A)):\n if C == A[i]:\n break\nprint(A[i+1])"] | ['Runtime Error', 'Accepted'] | ['s083945681', 's008330180'] | [2940.0, 3060.0] | [17.0, 18.0] | [185, 185] |
p02801 | u703969935 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['c = input()\nprint chr(ord(c) + 1)', 'c = str(input())\n\nprint(chr(ord(c)+1))'] | ['Runtime Error', 'Accepted'] | ['s089471802', 's192185282'] | [2940.0, 2940.0] | [17.0, 17.0] | [33, 38] |
p02801 | u708378905 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['print(str(ord(input())+1))', 'print(str(ord(input())+1))', 'print(chr(ord(input())+1))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s807481372', 's872344752', 's268018344'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [26, 26, 26] |
p02801 | u709052417 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C = input()\nalphabetlist = [chr(i) for i in range(97, 97+26)]\nnext_index = alphabetlist.index(C)+1\nprint(alphabetlist(next_index))', 'C = input()\nalphabetlist = [chr(i) for i in range(97, 97+26)]\nnext_index = alphabetlist.index(C)+1\nprint(alphabetlist[next_index])'] | ['Runtime Error', 'Accepted'] | ['s900429979', 's984033870'] | [2940.0, 2940.0] | [17.0, 17.0] | [130, 130] |
p02801 | u714284234 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["N, M = input().split()\nN = int(N)\nM = int(M)\np = []\nS = []\nfor i in range(M):\n a, b = input().split()\n a = int(a)\n p.append(a)\n S.append(b)\nright = 0\nwrong = 0\nfor j in range(M):\n if right[p[j] - 1] == 0:\n if S[k] == 'WA':\n wrong += 1\n elif S[k] == 'AC' and :\n right += 1\nprint(str(right) + ' ' + str(wrong))", "N, M = input().split()\nN = int(N)\nM = int(M)\np = []\nS = []\nfor i in range(M):\n a, b = input().split()\n a = int(a)\n p.append(a)\n S.append(b)\nright = []\nwrong = []\nfor j in range(N):\n right.append(0)\n wrong.append(0)\nfor k in range(M):\n if S[k] == 'WA' and right[p[k] - 1] == 0:\n wrong[p[k] - 1] += 1\n else if S[k] == 'AC':\n if right[p[k] - 1] == 0:\n right[p[k] - 1] += 1\nprint(str(sum(right)) + ' ' + str(sum(wrong)))", "x = input()\ny = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\nfor i in range(26):\n if y[i] == x:\n print(y[i + 1])"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s375127358', 's663121887', 's315954173'] | [3060.0, 3064.0, 3060.0] | [18.0, 17.0, 18.0] | [359, 465, 208] |
p02801 | u718411265 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['print(chr(ord(input())+1)', 'C=input()\nc=ord(C)\nd=c+1\nD=chr(d)\nprint(D)'] | ['Runtime Error', 'Accepted'] | ['s276370913', 's564961886'] | [2940.0, 2940.0] | [17.0, 17.0] | [25, 42] |
p02801 | u718548482 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['lt=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]\nc=input()\nfor i in range(26):\n if c=lt[i]:\n break\nprint(lt[i+1])', 'lt=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]\nc=input()\nfor i in range(26):\n if c==lt[i]:\n break\nprint(lt[i+1])'] | ['Runtime Error', 'Accepted'] | ['s898891675', 's476023421'] | [2940.0, 3060.0] | [17.0, 17.0] | [177, 178] |
p02801 | u723583932 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['#c welcome to atcoder\nimport sys\nn,m=map(int,input().split())\nps=[]\nnum={}\n\nac=0\npena=0\nif m==0:\n print(\'0 0\')\n sys.exit()\nfor i in range(m):\n result=input().split()\n ps.append(result)\n\nfor x in ps:\n print(x[0])\n if x[0] not in num:\n num[x[0]]=0\n print(num[x[0]])\n if x[1]=="WA" and num[x[0]]==0:\n pena+=1\n if x[1]=="AC" and num[x[0]]==0:\n ac+=1\n num[x[0]]=1\n\nprint(num)\n\nprint(ac,pena)', '#a \nc=input()\nans=ord(c)+1\nprint(chr(ans))'] | ['Runtime Error', 'Accepted'] | ['s397316347', 's094307219'] | [3064.0, 2940.0] | [17.0, 17.0] | [448, 42] |
p02801 | u723711163 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['num_of_subs, full_score, avg = [ int(i) for i in input().split(" ") ]\nprevScores = 0\nfor i in input().split(" "):\n prevScores += int(i)\n\nlast_score = (avg * num_of_subs) - prevScores\n\nif last_score <= 0:\n print(0)\nelse:\n if last_score >= 100:\n print(-1)\n else:\n print(last_score)', 'inp = input()\n\nimport string\nalphabets = list(string.ascii_lowercase)\n\nprint(alphabets[alphabets.index(inp) + 1])'] | ['Runtime Error', 'Accepted'] | ['s763878645', 's165342837'] | [3060.0, 3768.0] | [17.0, 24.0] | [290, 113] |
p02801 | u726284577 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['n,k,m=map(int, input().split())\nfor i in range(n-1):\n a[i]=int(input()) \n Sum+=a[i]\nif (Sum+k)/n<m:\n print(-1)\n break\nelse:\n print(n＊m-Sum)', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s473086596', 's690757388'] | [2940.0, 2940.0] | [17.0, 17.0] | [146, 26] |
p02801 | u726953384 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['alphabet = input()\nalphabet = ord(alphabet)+1\nprint(chr(alphabet)', 'moji =input()\nmoji = ord(moji)+1\n\nprint(chr(moji))'] | ['Runtime Error', 'Accepted'] | ['s862896917', 's002559841'] | [2940.0, 2940.0] | [17.0, 17.0] | [65, 50] |
p02801 | u728318205 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['n,k,m = map(int,input().split())\nlist = list(map(int,input().split()))\n\nk = n*m-sum(list)\nif 0<= k <=100:\n print(k)\nelif k<0:\n print(0)\nelse:\n print(-1)', "c=input()\ns='abcdefghijklmnopqrstuvwxyz'\nlist=list(s)\n\nn=list.index(c)\nprint(list[n+1])"] | ['Runtime Error', 'Accepted'] | ['s393175112', 's552641499'] | [2940.0, 2940.0] | [17.0, 17.0] | [161, 87] |
p02801 | u732061897 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["c = input()\nal = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\ni = al.find('c')\nprint(al[i+1])", 'S = input()\nprint(chr(ord(S) + 1))\n'] | ['Runtime Error', 'Accepted'] | ['s446836767', 's476135348'] | [3060.0, 8864.0] | [17.0, 24.0] | [154, 35] |
p02801 | u732607917 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['Alp="abcdefghijklmnopqrstuvwxyz"\nAlp[Alp.index(input())+1]', 'Alp="abcdefghijklmnopqrstuvwxyz"\nprint(Alp[Alp.index(input())+1])'] | ['Wrong Answer', 'Accepted'] | ['s429143756', 's531020013'] | [2940.0, 2940.0] | [17.0, 17.0] | [58, 65] |
p02801 | u732870425 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\nmod = 10 ** 9 + 7\n\nA.sort()\nfor i in range(N-K):\n fs = A[i+K] - A[i]\n ans += fs % mod\n\nprint(ans % mod)', 'c = input()\nprint(chr(ord(c)+1))'] | ['Runtime Error', 'Accepted'] | ['s187587940', 's980469418'] | [3060.0, 2940.0] | [17.0, 17.0] | [187, 32] |
p02801 | u734603233 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['n, m = map(int, input().split())\nac = [0] * n\npen = [0] * n\npen_count = 0\nfor i in range(m):\n p, s = input().split()\n p = int(p) - 1\n if ac[p] == "AC":\n continue\n elif s == "AC":\n ac[p] = "AC"\n else:\n pen[p] += 1\n \nfor i in range(n):\n if ac[i] == "AC":\n pen_count += pen[i]\n \nprint(ac.count("AC"), pen_count)', 'n, m = map(int, input().split()) \nac = [0] * n\npen = [0] * n\npen_count = 0\nfor i in range(m):\n p, s = input().split()\n p = int(p) - 1\n if ac[p] == "AC":\n continue\n elif s == "AC":\n ac[p] = "AC"\n else:\n pen[p] += 1\n\nfor i in range(n):\n if ac[i] == "AC":\n pen_count += pen[i]\n\nprint(ac.count("AC"), pen_count)', 'n, m = map(int, input().split())\nac = [0] * n\npen = [0] * n\npen_count = 0\nfor i in range(m):\n p, s = input().split()\n p = int(p) - 1\n if ac[p] == "AC":\n continue\n elif s == "AC":\n ac[p] = "AC"\n else:\n pen[p] += 1\n\nfor i in range(n):\n if ac[i] == "AC":\n pen_count += pen[i]\n\nprint(ac.count("AC"), pen_count)\n', 'c = input()\nprint(chr(ord(c) + 1))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s264155006', 's423721550', 's672698194', 's037750385'] | [3064.0, 3064.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [354, 396, 353, 34] |
p02801 | u735175408 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['import sys\ninput = sys.stdin.readline\n \ndef main():\n N, M = map(int, input().split())\n \n ac_check = [False] * N\n p_counts = [0] * N\n \n for i in range(M):\n p, s = input().strip().split()\n p = int(p) - 1\n if s == "AC":\n if not ac_check[p]:\n ac_check[p] = True\n else:\n if not ac_check[p]:\n p_counts[p] += 1\n \n ac_count = 0\n p_count = 0\n for i in range(N):\n if ac_check[i]:\n ac_count += 1\n p_count += p_counts[i]\n print(ac_count, p_count)\n \n \nif __name__ == "__main__":\n main()', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s399494625', 's409553205'] | [3064.0, 2940.0] | [17.0, 17.0] | [703, 26] |
p02801 | u736149053 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["N, M = map(int, input().split())\nacc = [False] * N\npen = 0\nfor _ in range(M):\n p, S = input().split()\n p = int(p) - 1\n if S[0] == 'A':\n acc[p] = True\n else:\n if not acc[p]:\n pen += 1\nprint('{} {}'.format(sum(acc), pen))", "import numpy as np\n\ndef main():\n C = input()\n print('{}'.format(chr(ord(C) + 1)))\n\n\nif __name__ == '__main__':\n main()"] | ['Runtime Error', 'Accepted'] | ['s422730375', 's014512996'] | [3064.0, 12484.0] | [17.0, 152.0] | [256, 127] |
p02801 | u736995123 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N, K, M = map(int,input().split())\nA = list(map(int,input().split(\' \')))\n\ngoal = N*M\n\nif K < M or (sum(A)+K) < goal:\n print("-1")\nelif 0 <= goal - sum(A) <= K:\n print(goal - sum(A))\nelif goal - sum(A) < 0:\n print("0")\n', 'C = input()\nprint(chr(ord(C) + 1))'] | ['Runtime Error', 'Accepted'] | ['s724050737', 's284013834'] | [3060.0, 2940.0] | [17.0, 17.0] | [227, 34] |
p02801 | u737298927 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N, M = map(int, input().split())\np_list = []\nS = []\nfor _ in range(M):\n n, s = input().split()\n p_list.append(int(n))\n S.append(s)\n\nwa = 0\nac = 0\nac_list = []\nfor i, p in enumerate(p_list):\n if p not in ac_list:\n if S[i] == "WA":\n wa += 1\n else:\n ac += 1\n ac_list.append(p)\n\nprint(ac, wa)', 's = input()\nprint(chr(ord(s) + 1))\n'] | ['Runtime Error', 'Accepted'] | ['s538475987', 's018666194'] | [3064.0, 2940.0] | [17.0, 17.0] | [359, 35] |
p02801 | u739843002 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C = input()\n\nary = "abcdefghijklmnopqrstuvwxyz".split("")\n\nprint(ary[ary.index(C) + 1])', 'C = input()\n \nary = "a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z".split(",")\n \nprint(ary[ary.index(C) + 1])'] | ['Runtime Error', 'Accepted'] | ['s453418035', 's378619661'] | [8972.0, 9072.0] | [23.0, 29.0] | [87, 115] |
p02801 | u745687363 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N, K, M = map(int, input().split())\nL = list(map(int, input().split()))\ndiff = N*M-sum(L)\nif diff <= K:\n print(max(0, diff))\nelse:\n print(-1)', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s713108439', 's680370655'] | [2940.0, 2940.0] | [16.0, 18.0] | [143, 26] |
p02801 | u749614185 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N,K,M = map(int,input().split())\na = list(map(int,input().split()))\nnow = sum(a)\ngoal = N*M\nif now + K >= goal:\n if now >= goal:\n print(0)\n else:\n print(goal-now)\nelse:\n print(-1)', 'C=input()\nN=ord(C)+1\nM=chr(N)\nprint(M)'] | ['Runtime Error', 'Accepted'] | ['s204728466', 's951630873'] | [9112.0, 9020.0] | [25.0, 33.0] | [188, 38] |
p02801 | u752115287 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['# -*- coding: utf-8 -*-\n\nfrom collections import OrderedDict\n\nn = int(input())\ndic = OrderedDict()\n\nfor i in range(n):\n l,d = list(map(str,input().split()))\n dic[l] = d\n\na = str(input())\n\nflag = False\ntime = 0\n\nfor key,value in dic.items():\n if flag == False:\n if key == a:\n flag = True\n else:\n time += int(value)\n\nprint(time)', '# -*- coding: utf-8 -*-\n\na = str(input())\n\nalpha = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]\n\nprint(alpha[alpha.index(a)+1])'] | ['Runtime Error', 'Accepted'] | ['s425617315', 's298470182'] | [3444.0, 2940.0] | [27.0, 17.0] | [363, 188] |
p02801 | u752522099 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['al = list("abcdefghijklmnopqistuvwxyz")\n\nc = input()\n\nprint(al[al.index(c)]', 'al = list("abcdefghijklmnopqistuvwxyz")\n\nc = input()\n\nprint(al[al.index(c)+1])'] | ['Runtime Error', 'Accepted'] | ['s556064138', 's339546593'] | [2940.0, 2940.0] | [17.0, 18.0] | [75, 78] |
p02801 | u756195685 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N, K, M = map(int, input().split())\nList = [int(i) for i in input().split()]\n\nGoal = N * M\n\nsub = Goal - sum(List)\nif sub > K:\n print(-1)\nelse:\n print(sub)\n', 'a = input()\n\nprint(chr(ord(a)+1))\n'] | ['Runtime Error', 'Accepted'] | ['s990273452', 's361956324'] | [2940.0, 2940.0] | [17.0, 17.0] | [162, 34] |
p02801 | u756553422 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['from itertools import combinations as cc\n\nn,k = map(int,input().split())\n\na = list(map(int,input().split()))\n\ntotal=0\nmod = 10**9+7\nfor i in list(cc(a,k)):\n\tmaxx=max(i)%mod\n\tminx=min(i)%mod\n\ttotal=(total%mod+(maxx-minx)%mod)%mod\n\t\nprint(total)\n\n', 's=input()\nprint(chr(ord(s)+1))'] | ['Runtime Error', 'Accepted'] | ['s575145113', 's908971444'] | [3060.0, 2940.0] | [18.0, 17.0] | [245, 30] |
p02801 | u756693875 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["a = input()\nabc = 'abcdefghijklmnopqrstuvwxyz'\n\nfor i in range(26):\n if a = abc[i]:\n print(abc[i+1])\n break", "a = input()\nabc = 'abcdefghijklmnopqrstuvwxyz'\n\nfor i in range(26):\n if a == abc[i]:\n print(abc[i+1])\n break\n"] | ['Runtime Error', 'Accepted'] | ['s820609165', 's527934082'] | [2940.0, 2940.0] | [17.0, 18.0] | [124, 126] |
p02801 | u761000575 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['import sys\n\nargs = sys.argv\n\na = "abcdefghijklmnopqrstuvwxyz"\n\nc = args[1]\nidx = a.index(c)\nprint(a[idx + 1])\n', 'import sys\n\nargs = sys.argv\n\na = "abcdefghijklmnopqrstuvwxyz"\n\nc = input()\nidx = a.index(c)\nprint(a[idx + 1])\n'] | ['Runtime Error', 'Accepted'] | ['s556171083', 's679514013'] | [2940.0, 2940.0] | [17.0, 17.0] | [110, 110] |
p02801 | u765401716 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N,K,M = input().split()\ni = input().split() \ni2 = [int(s) for s in i]\nscore = sum(i2)\naim = int(N) * int(M)\nd = aim - score\nK = int(K)\nif d > K:\n d = -1\nelif 0 >= d:\n d = 0\nprint(d)', 'c = input()\nlist=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]\nl = list.index(c) + 1\nc = list[l]\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s427959548', 's359267117'] | [3060.0, 2940.0] | [18.0, 17.0] | [188, 165] |
p02801 | u766349820 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N, M = map(int, input().split())\n\nl = [list(input().split()) for _ in range(M)]\n\nanswers = {}\nwrongs = {}\n\nfor a in l:\n if a[1] == "AC":\n answers[a[0]] = a[1]\n elif a[1] == "WA":\n if not a[0] in answers:\n if a[0] in wrongs:\n wrongs[a[0]] = wrongs[a[0]] + 1\n else:\n wrongs[a[0]] = 1\n\n\n\nresult = [len(answers.keys()), sum(wrongs.values())]\n\nprint(result[0], result[1])\n\n', 'C = input()\nletters = "abcdefghijklmnopqrstuvwz"\nlist_letters = list(letters)\nprint(list_letters[letters.find(C)])\n', 'N, K, M = map(int, input().split())\ntests = map(int, input().split())\n\ntotal = sum(tests)\n\nfor i in range(K):\n if (total + i) / N >= M:\n print(i)\n exit(0)\nprint(-1)\n', 'N, M = map(int, input().split())\n\nl = [list(input().split()) for _ in range(M)]\n\nanswers = {}\nwrongs = {}\n\nfor a in l:\n if a[1] == "AC":\n answers[a[0]] = a[1]\n elif a[1] == "WA":\n if not a[0] in wrongs:\n wrongs[a[0]] = 1\n elif a[0] in wrongs:\n wrongs[a[0]] = wrongs[a[0]] + 1\n\n\nwc = 0\nfor k, v in wrongs.items():\n if k in answers.keys():\n wc += 1\nresult = [len(answers.keys()), wc]\n\nprint(result[0], result[1])\n\n', 'C = input()\nletters = "abcdefghijklmnopqrstuvwxyz"\nlist_letters = list(letters)\nprint(list_letters[letters.find(C)+1])\n'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s489060426', 's679566578', 's817197032', 's939767782', 's428836931'] | [3064.0, 2940.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [448, 115, 182, 479, 119] |
p02801 | u766566560 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['str = input()\n\nprint chr(ord(str) + 1)', 'str = input()\n\nprint(chr(ord(str) + 1))'] | ['Runtime Error', 'Accepted'] | ['s278982869', 's028465440'] | [2940.0, 2940.0] | [17.0, 17.0] | [38, 39] |
p02801 | u769383879 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["c = input()\nalp = 'abcdefghijklmnopqrstuvwxyz'\n\nans = alp[s.find(c)+1]\n", "c = input()\nalp = 'abcdefghijklmnopqrstuvwxyz'\n\nans = alp[s.find(c)+1]\nprint(ans)\n", "c = input()\nalp = 'abcdefghijklmnopqrstuvwxyz'\n\nans = alp[alp.find(c)+1]\nprint(ans)\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s173309960', 's931016149', 's478689471'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [71, 82, 84] |
p02801 | u771167374 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C = input()\nalpha = iter("abcdefghijklmnopqrstuvwxyz")\nif C in alpha :\n A = alpha.next()\nprint(A)', 's = input()\nt = chr(ord(s)+1)\nprint(t)'] | ['Runtime Error', 'Accepted'] | ['s917923586', 's478225910'] | [2940.0, 2940.0] | [17.0, 17.0] | [100, 38] |
p02801 | u774985302 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C = input()\nprint(chr(ord(C)+1) ', 'A = input()\nprint(chr(ord(A)+1))\n'] | ['Runtime Error', 'Accepted'] | ['s484412922', 's448785660'] | [2940.0, 3060.0] | [17.0, 17.0] | [35, 33] |
p02801 | u777922433 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C = input()\nprint(chr(ord(C)+1)', 'C = input()\nprint(chr(ord(C)+1))'] | ['Runtime Error', 'Accepted'] | ['s989967548', 's809828090'] | [2940.0, 2940.0] | [17.0, 17.0] | [31, 32] |
p02801 | u785470389 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['n, k, m = map(int, input().split())\na = list(map(int, input().split()))\nif sum(a) + k < n * m:\n ans = -1\nelse :\n ans = n * m - sum(a)\n if ans < 0:\n ans = 0\nprint(ans)', 'x = input()\nans = ord(x) + 1\nprint(chr(ans))\n'] | ['Runtime Error', 'Accepted'] | ['s756526237', 's556641098'] | [2940.0, 2940.0] | [17.0, 17.0] | [172, 45] |
p02801 | u794910686 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['from collections import deque\n\nH,W=[int(i) for i in input().split()]\n# c=[[i for i in input().split()] for _ in range(h)]\nC=list(input() for _ in range(H))\nC=list(list(i) for i in C) \n\ndef bfs(maze,s1,s2,g1,g2):\n for y in range(H):\n for x in range(W):\n if maze[y][x]!=\'#\':\n maze[y][x]=10**9\n\n maze[s1][s2]=0\n que=deque([[s1,s2]])\n while que:\n y,x=que.popleft()\n for i,j in [(1,0),(0,1),(-1,0),(0,-1)]:\n nexty,nextx=y+i,x+j\n if nexty >= 0 and nexty < H and nextx >= 0 and nextx < W:\n dist=maze[nexty][nextx]\n if dist!=\'#\':\n if dist>maze[y][x]+1:\n maze[nexty][nextx]=maze[y][x]+1\n que.append([nexty,nextx])\n return maze[g1][g2]\n\nans=0\nfor s1,c_w in enumerate(C):\n for s2,c in enumerate(c_w):\n if C[s1][s2]!="#":\n for g1,c_w in enumerate(C):\n for g2,c in enumerate(c_w):\n if C[g1][g2]!="#":\n temp=bfs(C,s1,s2,g1,g2)\n ans=max(temp,ans)\nprint(ans)\n', 'z="ABCDEFGHIJKLMNOPQRSTUVWXYZ".lower()\nc=input()\nprint(z[z.find(c)+1])'] | ['Runtime Error', 'Accepted'] | ['s359198904', 's838218682'] | [3316.0, 2940.0] | [21.0, 17.0] | [1202, 70] |
p02801 | u796044734 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['c = str(input())\n\nalp = abcdefghijklmnopqrstuvwxyz\n\nk=0\nwhile k<25:\n if c == alp[k]:\n print(alp[k+1])\n else:\n k+=1\n ', "c=input()\nal='abcdefghijklmnopqrstuvwxyz'\nfor x in range(26):\n if c==al[x]:\n print(al[x+1])\n"] | ['Runtime Error', 'Accepted'] | ['s367498712', 's410639856'] | [2940.0, 3064.0] | [17.0, 17.0] | [127, 102] |
p02801 | u796708718 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['in_char = input()\n\nalpha_bete = {"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"}\n\nfor cnt, charct in enumerate(alpha_bete):\n\tif charact == in_char\n \t\tprint(alpha_bete[cnt+1])', 'char = ord(input())\nchar += 1\nprint(chr(char))'] | ['Runtime Error', 'Accepted'] | ['s182395510', 's006492902'] | [2940.0, 2940.0] | [17.0, 17.0] | [232, 46] |
p02801 | u799635973 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["alpha2num=lambda c:ord(c)-ord('a')+1\n\nresult=(alpha2num(input()))\nprint(result)\nif result==1:\n print('b')\nelif result==2:\n print('c')\nelif result==3:\n print('d')\nelif result==4:\n print('e')\nelif result==5:\n print('f')\nelif result==6:\n print('g')\nelif result==7:\n print('h')\nelif result==8:\n print('i')\nelif result==9:\n print('j')\nelif result==10:\n print('k')\nelif result==11:\n print('l')\nelif result==12:\n print('m')\nelif result==13:\n print('n')\nelif result==14:\n print('o')\nelif result==15:\n print('p')\nelif result==16:\n print('q')\nelif result==17:\n print('r')\nelif result==18:\n print('s')\nelif result==19:\n print('t')\nelif result==20:\n print('u')\nelif result==21:\n print('v')\nelif result==22:\n print('w')\nelif result==23:\n print('x')\nelif result==24:\n print('y')\nelif result==25:\n print('z')\n", 'n, m = list(map(int, input().split()))\n\nac = [0] * (n+1)\nwa = [0] * (n+1)\npena = 0\n\nfor i in range(m):\n question, answer = input().split()\n question = int(question)\n if (answer == "AC") and (ac[question] == 0):\n ac[question] = 1\n pena += wa[question]\n elif (answer == "WA") and (ac[question] == 0):\n wa[question] += 1\n\nprint(sum(ac), pena)', "alpha2num=lambda c:ord(c)-ord('a')+1\n\nresult=(alpha2num(input()))\n\nif result==1:\n print('b')\nelif result==2:\n print('c')\nelif result==3:\n print('d')\nelif result==4:\n print('e')\nelif result==5:\n print('f')\nelif result==6:\n print('g')\nelif result==7:\n print('h')\nelif result==8:\n print('i')\nelif result==9:\n print('j')\nelif result==10:\n print('k')\nelif result==11:\n print('l')\nelif result==12:\n print('m')\nelif result==13:\n print('n')\nelif result==14:\n print('o')\nelif result==15:\n print('p')\nelif result==16:\n print('q')\nelif result==17:\n print('r')\nelif result==18:\n print('s')\nelif result==19:\n print('t')\nelif result==20:\n print('u')\nelif result==21:\n print('v')\nelif result==22:\n print('w')\nelif result==23:\n print('x')\nelif result==24:\n print('y')\nelif result==25:\n print('z')\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s441809054', 's954254133', 's349188061'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [869, 372, 856] |
p02801 | u810356688 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['h,a=map(int,input().split())\nprint(-(-h//a))', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s629459401', 's433694093'] | [2940.0, 2940.0] | [17.0, 17.0] | [44, 26] |
p02801 | u816631826 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["n = input()\nprint(n,'is followed by',chr(ord(n) + 1))", "n = input()\na='funcionaaaaaaaaaaa'\nprint(chr(ord(n) + 1))"] | ['Wrong Answer', 'Accepted'] | ['s353668571', 's420409705'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 57] |
p02801 | u816637025 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["n, m = map(int, input().split())\n\nac = 0\nwa = [0]*n\nd = [False]*n\n\nfor _ in range(m):\n p, s = input().split()\n p = int(p)-1\n if not d[p] and s == 'AC':\n ac += 1\n d[p] = True\n elif not d[p] and s == 'WA':\n wa[p] += 1\np = 0\nfor i in range(n):\n if d[i]:\n p += wa[i]\nprint(ac, p)", 'c = input()\nprint(chr(ord(c)+1))'] | ['Runtime Error', 'Accepted'] | ['s309973838', 's599009632'] | [3064.0, 2940.0] | [17.0, 17.0] | [318, 32] |
p02801 | u819465503 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['nm = list(map(int, (input().split())))\nif nm[1] == 0:\n print(0, 0)\n\nelse: \n ans_dict = {}\n ans_list = [input().split() for i in range(nm[1])]\n for i in range(len(ans_list)):\n key_val = ans_list[i][0]\n\n try:\n ans_dict[key_val].append(ans_list[i][1])\n except:\n ans_dict[key_val] = [ans_list[i][1]]\n ans_cnt = 0\n wa_cnt = 0\n for key_val in ans_dict.keys():\n check_list = ans_dict[key_val]\n\n if "AC" in check_list:\n ans_cnt += 1\n else:\n pass\n try:\n wa_cnt += len(check_list[:check_list.index("AC")])\n except:\n pass\nprint(ans_cnt, wa_cnt) ', "word = input()\nword_list = [chr(ord('a') + i) for i in range(26)]\nprint(word_list[word_list.index(word) + 1])"] | ['Runtime Error', 'Accepted'] | ['s533767852', 's983341121'] | [3064.0, 2940.0] | [17.0, 17.0] | [683, 109] |
p02801 | u823885866 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["import sys, string\nc = sys.stdin.readline().rstrip()\na = string.ascii_lowercase\ni = a.index('c') + 1\nprint(a[i])\n", 'import sys, string\nc = sys.stdin.readline().rstrip()\na = string.ascii_lowercase\ni = a.index(c) + 1\nprint(a[i])'] | ['Wrong Answer', 'Accepted'] | ['s825070949', 's282472205'] | [3768.0, 3768.0] | [28.0, 25.0] | [113, 110] |
p02801 | u829859091 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['from collections import deque\n\ndef search(h, w, pre_h, pre_w):\n can = []\n if h > 0:\n can.append((h-1, w))\n if h < H-1:\n can.append((h+1, w))\n if w > 0:\n can.append((h, w-1))\n if w < W-1:\n can.append((h, w+1))\n res = []\n for h, w in can:\n if S[h][w]==\'.\' and (h, w) != (pre_h, pre_w):\n res.append((h, w))\n return res\n\ndef bfs(h, w):\n d = [[float(\'inf\') for _ in range(W)] for _ in range(H)]\n d[h][w] = 0\n pre_h, pre_w = h, w\n adj_list = search(h, w, pre_h, pre_w)\n open_list = deque([])\n closed_list = []\n closed_list = set(closed_list)\n for adj in adj_list:\n open_list.append((adj[0], adj[1], pre_h, pre_w))\n cnt = 0\n while True:\n cnt+=1\n if H==20 and W==20:\n if cnt > 2200:\n break\n if len(open_list) == 0:\n break\n h, w, pre_h, pre_w = open_list.popleft()\n closed_list.add((h, w, pre_h, pre_w))\n d[h][w] = min(d[h][w], d[pre_h][pre_w] + 1)\n adj_list = search(h, w, pre_h, pre_w)\n for adj in adj_list:\n if (adj[0], adj[1], h, w) in closed_list:\n continue\n open_list.append((adj[0], adj[1], h, w))\n\n res = 0\n for h in range(H):\n for w in range(W):\n if not d[h][w] == float(\'inf\'):\n res = max(res, d[h][w])\n return res\n\ndef bounday():\n for h in range(H):\n for w in range(W):\n if S[h][w] == \'#\':\n return False\n return True\n\nH, W = map(int, input().split())\nS = []\nfor i in range(H): \n S.append(list(input()))\n\nif __name__ == "__main__":\n\n if bounday():\n print(H+W-2)\n exit(0)\n\n ans = 0\n for h in range(H):\n for w in range(W):\n if S[h][w] == \'#\':\n continue\n maxd = bfs(h, w)\n ans = max(maxd, ans)\n print(ans)', 'c = input()\nprint(chr(ord(c) + 1))'] | ['Runtime Error', 'Accepted'] | ['s725230012', 's473911112'] | [3316.0, 3060.0] | [21.0, 19.0] | [1905, 34] |
p02801 | u831835224 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['import sys\n\nx = sys.argv[1]\n\ny = ord(x)\ny += 1\nx = chr(y)\nprint(x)', "params = input().split(' ')\nn = eval(params[1])\n \nacfoundfor = []\n \npenalties = 0\npoints = 0\n \nfor i in range(n):\n submission = input().split(' ')\n p = eval(submission[0])\n status = submission[1]\n \n if p in acfoundfor:\n continue\n \n if status == 'AC':\n points += 1\n acfoundfor.append(p)\n else:\n penalties += 1\n \nprint(points, penalties)", 'x = input()\ny = ord(x)\ny += 1\nx = chr(y)\nprint(x)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s368324449', 's394071201', 's491344454'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [66, 391, 49] |
p02801 | u832594912 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['c = input()\nimport string\nalphStr = string.ascii_lowercase\nprint(alphStr.index(c)[alph+1])\n', 'c = input()\nimport string\nalphStr = string.ascii_lowercase\nprint(alphStr[alphStr.index(c)+1])\n'] | ['Runtime Error', 'Accepted'] | ['s932215009', 's552042575'] | [3772.0, 3768.0] | [24.0, 24.0] | [91, 94] |
p02801 | u836737505 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['s = int(input())\nprint(str(ord(s)+1))', 'l = a = [chr((ord("a") + i)) for i in range(26)]\nprint(l[l.index(input())-25])'] | ['Runtime Error', 'Accepted'] | ['s285720854', 's809225835'] | [2940.0, 2940.0] | [17.0, 17.0] | [37, 78] |
p02801 | u841557163 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C = input()\n\nc_l = [chr(i) for i in range(65, 65+26)]\n\nfor i in range(len(c_l)):\n if c_l[i] == C:\n print(c_l[i+1])', 'C = input()\n\nc_l = [chr(i) for i in range(97, 97+26)]\n\nfor i in range(len(c_l)):\n if c_l[i] == C:\n print(c_l[i+1])'] | ['Wrong Answer', 'Accepted'] | ['s999403292', 's522672787'] | [2940.0, 2940.0] | [17.0, 18.0] | [159, 159] |
p02801 | u841568901 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['al = abcdefghijklmnopqrstuvwxyz\nC = input()\nprint(al[al.index(C)+1])', 'al = "abcdefghijklmnopqrstuvwxyz"\nC = input()\nprint(al[al.index(C)+1])'] | ['Runtime Error', 'Accepted'] | ['s803293884', 's138487638'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 70] |
p02801 | u841599623 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["C = input()\nlis = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',\n 'p', 'q', 'r', 's', 't'. 'u', 'v', 'w', 'x', 'y', 'z']\nfor x in range(len(lis)):\n if C == lis[x]:\n print(lis[x+1])\n break", "C = input()\nlis = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',\n 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\nfor x in range(len(lis)):\n if C == lis[x]:\n print(lis[x+1])\n break"] | ['Runtime Error', 'Accepted'] | ['s955341006', 's343043674'] | [2940.0, 3060.0] | [18.0, 17.0] | [229, 229] |
p02801 | u848678027 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["from sys import stdin\ninput = stdin.readline()\nalpha = 'abcdefghijklmnopqrstuvwxyz'\n\nflag = False\nfor i in alpha:\n if flag:\n print(i)\n flag =False\n if i == input:\n flag = True", "from sys import stdin\ninput = stdin.readline().rstrip()\nalpha = 'abcdefghijklmnopqrstuvwxyz'\n\nflag = False\nfor i in alpha:\n if flag:\n print(i)\n flag =False\n if i == input:\n flag = True"] | ['Wrong Answer', 'Accepted'] | ['s445646056', 's020168310'] | [2940.0, 2940.0] | [17.0, 17.0] | [230, 239] |
p02801 | u848680818 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['n,k,m = map(int,input().split())\na = list(map(int,input().split()))\n\nt = n*m - sum(a)\nif 0<=t<=k:\n print(t)\nif k<t:\n print(-1)\nelse:\n print(0', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s435265987', 's365337399'] | [2940.0, 2940.0] | [17.0, 17.0] | [142, 26] |
p02801 | u853728588 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['c = int(input())\nC = ord(c)\nprint(chr(C))', 'c = input()\nC = ord(c)\nprint(chr(C+1))'] | ['Runtime Error', 'Accepted'] | ['s586430149', 's091785127'] | [8944.0, 9048.0] | [24.0, 24.0] | [41, 38] |
p02801 | u854685063 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['l = list("abcdefghijklmnopqrstuvwxyz")\na = input()\nprint(l[l.index(a)])\n', 'l = list("abcdefghijklmnopqrstuvwxyz")\na = input()\nprint(l[l.index(a)+1])\n'] | ['Wrong Answer', 'Accepted'] | ['s316223922', 's928465228'] | [2940.0, 2940.0] | [17.0, 17.0] | [72, 74] |
p02801 | u856965888 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['import sys\ninput = sys.stdin.readline\n\nc = input()\nprint(chr(ord(c)+1))', 'import sys\ninput = sys.stdin.readline\n\nc = input()\nprint(chr(ord(c)+1))', 'import sys\ninput = sys.stdin.readline\n\nc = input()\nprint(chr(ord(c)+1))', 'import sys\ninput = sys.stdin.readline\n\nc = input()\nans = ord(c)+1\nprint(chr(ans))', 'import sys\ninput = sys.stdin.readline\n\nc = input()\nprint(chr(ord(c)+1))', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s010193458', 's044599131', 's359224089', 's404677367', 's795537365', 's986158240'] | [3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 26.0, 17.0, 17.0, 17.0] | [71, 71, 71, 81, 71, 26] |
p02801 | u857070771 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C=input()\nalp=list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")\nx=alp.index(C)\nprint(alp[x+1])', 'C=input()\nalp=list("abcdefghijklmnopqrstuvwzyz")\nx=alp.index(C)\nprint(alp[x+1])'] | ['Runtime Error', 'Accepted'] | ['s221899972', 's841282705'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 79] |
p02801 | u857673087 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["C = input()\n\nabc ='abcdefghijklmnopqrstuvwxyz'\n\nprint(abc[abc.index(C+1))]", "C = input()\n\nabc ='abcdefghijklmnopqrstuvwxyz'\n\nprint(abc[abc.index(C) +1])\n"] | ['Runtime Error', 'Accepted'] | ['s108509184', 's166950346'] | [2940.0, 2940.0] | [17.0, 17.0] | [74, 76] |
p02801 | u860966226 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["char = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\nprint(char[char.index(input())])\n", "char = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\nprint(char[char.index(input()) + 1])"] | ['Wrong Answer', 'Accepted'] | ['s154224284', 's470349932'] | [2940.0, 2940.0] | [17.0, 17.0] | [146, 149] |
p02801 | u862417957 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['# !/usr/bin/python3\n\n\n\n\nif __name__ == "__main__":\n n, m = list(map(int, input().split()))\n\n accepted = [False for _ in range(n+5)]\n wrong = [0 for _ in range(n+5)]\n ac = wa = 0\n\n for _ in range(m):\n p, s = input().split()\n p = int(p)\n\n if accepted[p]: continue\n elif s == "WA": wrong[p] += 1\n elif s == "AC":\n ac += 1\n wa += wrong[p]\n accepted[p] = True\n\n print(ac, wa)\n\n', '# !/use/bin/python3\n\n\n\ndef solve(c):\n print(c)\n ans = ord(c)\n return chr(ans+1)\n\nif __name__ == "__main__":\n c = input()\n print(solve(c))\n', '# !/use/bin/python3\n\n\n\ndef solve(c):\n ans = ord(c)\n return chr(ans+1)\n\nif __name__ == "__main__":\n c = input()\n print(solve(c))\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s283610562', 's548238018', 's513444632'] | [9104.0, 8816.0, 8944.0] | [20.0, 28.0, 29.0] | [534, 225, 212] |
p02801 | u863370423 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C=input()\nCN=ord(C)\nprint(C+" is followed by "+chr((CN)+1)+".")', "n = str(input())\na = string.ascii_lowercase.index(n) \nletters = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\nprint (n,'is followed by',letters[a+1])", '\nC= input ()\nprint (chr (ord (C)+1))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s160494577', 's298550580', 's069703845'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0] | [63, 234, 54] |
p02801 | u864559654 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C = input()\n\nprint(chr(ord(C)+1)', 'C = input()\n\nprint(chr(ord(C)+1)', 'C = input()\n\nprint(chr(ord(C)+1))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s200390939', 's743845238', 's619415700'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [32, 32, 33] |
p02801 | u880911340 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N,K,M=map(int,input().split())\nl = input().split()\nL = [int(i) for i in l]\n\nLsum=sum(L)\n\nif M*N-Lsum>K:\n print(-1)\nelif M*N-Lsum<0:\n print(0)\nelse:\n print(M*N-Lsum)\n', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s880400861', 's642462375'] | [3060.0, 2940.0] | [17.0, 17.0] | [174, 26] |
p02801 | u895536055 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['print(input() + 1)', 'print(str(ord(input())+1))', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s127885758', 's872316199', 's721300036'] | [3064.0, 2940.0, 2940.0] | [20.0, 17.0, 17.0] | [18, 26, 26] |
p02801 | u896741788 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['mod=10**9+7\nn,k=map(int,input().split())\nl=sorted(map(int,input().split()))\nans=0\nll=1\nans+=ll*l[k-1]%mod\nb,s=1,1\nfor i in range(k,n):\n ll=ll*i//(i-k+1)\n ans+=l[i]*ll%mod\n s*=i\n b*=(i-k+1)\nml=s//b\n\nans-=ml*l[0]\nans%=mod\nfor i in range(1,n-k+1):\n ml=ml*(n-i-k+1)//(n-i)\n ans-=ml*l[i]%mod\n\nprint(ans%mod)\n', 's=input()\nl="abcdefghijklmnopqrstuvwxyz"\nprint(l[l.index(s)+1])'] | ['Runtime Error', 'Accepted'] | ['s539264479', 's226557338'] | [3064.0, 2940.0] | [17.0, 17.0] | [309, 63] |
p02801 | u897940702 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['n, m = map(int, input().split())\nli = []\nseitou = 0\npenalty = 0\n\nif m == 0:\n print(0, 0)\n\nelse:\n for x in range(m):\n i, j = map(str, input().split())\n if i in li:\n pass\n else:\n if j == "WA":\n penalty += 1\n if j == "AC":\n li.append(i)\n seitou += 1\n\n print(seitou, penalty)', 'n, k, m = map(int, input().split())\nli = list(map(int, input().split()))\ngenzai = sum(li)\nmokuhyou = n*m\ntheta = mokuhyou-genzai\nif theta > k:\n print(-1)\nelif k >= theta:\n print(theta)\nelif theta < 0:\n print(0)', "x = str(input())\nalph = 'abcdefghijklmnopqrstuvwxyz'\na = alph.find(x) + 1\nb = alph[a]\nprint(b)"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s448750938', 's540125463', 's856431014'] | [3060.0, 3060.0, 2940.0] | [17.0, 18.0, 17.0] | [379, 219, 94] |
p02801 | u898109279 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['print(chr(ord(int(input())) + 1))', 'print(chr(ord(input()) + 1))'] | ['Runtime Error', 'Accepted'] | ['s109275319', 's674177699'] | [9152.0, 8796.0] | [24.0, 27.0] | [33, 28] |
p02801 | u914671452 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['n, k, m = map(int, input().split())\na = list(map(int, input().split()))\ncount = 0\ntotal_score = 0\nwhile count <= n - 2:\n total_score += a[count]\n count += 1 \nlast_score = n * m - total_score\nif last_score < 0:\n print(0) \nelse:\n print(last_score)', 'c = input()\nalp = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"]\ncount1 = 0\ncount2 = 0\nwhile count2 <= 26:\n if alp[count1] == c:\n count1 += 1\n count2 += 27\n else:\n count1 += 1\n count2 += 1\nprint(alp[count1])'] | ['Runtime Error', 'Accepted'] | ['s261398784', 's517811565'] | [3060.0, 3060.0] | [17.0, 17.0] | [249, 307] |
p02801 | u916662650 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["\n\nc = raw_input()\n\n\n\nls = [chr(ord('a') + i) for i in range(26)]\n\nfor i in range(len(ls)):\n if ls[i] == c:\n print(ls[i + 1])\n break\n\n", 'import string\n\nc = raw_input()\n\n\n\nls = string.ascii_lowercase\n\nfor i in range(len(ls)):\n if ls[i] == c:\n print(ls[i + 1])\n break\n\n', "\n\nc = input()\n\n\n\nls = [chr(ord('a') + i) for i in range(26)]\n\nfor i in range(len(ls)):\n if ls[i] == c:\n print(ls[i + 1])\n break\n\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s012955341', 's513034605', 's252527880'] | [2940.0, 3956.0, 2940.0] | [17.0, 31.0, 17.0] | [150, 147, 146] |
p02801 | u919902859 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['print chr(ord(input())+1)', 'print(chr(ord(input()) + 1))'] | ['Runtime Error', 'Accepted'] | ['s004131670', 's860218466'] | [2940.0, 2940.0] | [17.0, 17.0] | [25, 28] |
p02801 | u920103253 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['c=input()\nl="qwertyuioplkjhgfdsazxcvbnm"\nl.sort()\nprint(l[l.index(c)+1])', 'c=input()\nprint(chr(ord(c)+1))'] | ['Runtime Error', 'Accepted'] | ['s877159937', 's178168973'] | [2940.0, 2940.0] | [17.0, 17.0] | [72, 30] |
p02801 | u923010184 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['alphabet = map(str,input().split())\nif alphabet == "a":\n\tprint("b")\n\nelif alphabet == "b":\n\tprint("c")\n\nelif alphabet == "c":\n\tprint("d")\n\nelif alphabet == "d":\n\tprint("e")\n\nelif alphabet == "e":\n\tprint("f")\n\nelif alphabet == "f":\n\tprint("g")\n\nelif alphabet == "g":\n\tprint("h")\n\nelif alphabet == "h":\n\tprint("i")\n\nelif alphabet == "i":\n\tprint("j")\n\nelif alphabet == "j":\n\tprint("k")\n\nelif alphabet == "k":\n\tprint("l")\n\nelif alphabet == "l":\n\tprint("m")\n\nelif alphabet == "m":\n\tprint("n")\n\nelif alphabet == "n":\n\tprint("o")\n\nelif alphabet == "o":\n\tprint("p")\n\nelif alphabet == "p":\n\tprint("q")\n\nelif alphabet == "q":\n\tprint("r")\n\nelif alphabet == "r":\n\tprint("s")\n\nelif alphabet == "s":\n\tprint("t")\n\nelif alphabet == "t":\n\tprint("u")\n\nelif alphabet == "u":\n\tprint("v")\n\nelif alphabet == "v":\n\tprint("w")\n\nelif alphabet == "w":\n\tprint("x")\n\nelif alphabet == "x":\n\tprint("y")\n\nelif alphabet == "y":\n\tprint("z")\n\n', 'alphabet = str(input())\nif alphabet == "a":\n\tprint("b")\nelif alphabet == "b":\n\tprint("c")\nelif alphabet == "c":\n\tprint("d")\nelif alphabet == "d":\n\tprint("e")\nelif alphabet == "e":\n\tprint("f")\nelif alphabet == "f":\n\tprint("g")\nelif alphabet == "g":\n\tprint("h")\nelif alphabet == "h":\n\tprint("i")\nelif alphabet == "i":\n\tprint("j")\nelif alphabet == "j":\n\tprint("k")\nelif alphabet == "k":\n\tprint("l")\nelif alphabet == "l":\n\tprint("m")\nelif alphabet == "m":\n\tprint("n")\nelif alphabet == "n":\n\tprint("o")\nelif alphabet == "o":\n\tprint("p")\nelif alphabet == "p":\n\tprint("q")\nelif alphabet == "q":\n\tprint("r")\nelif alphabet == "r":\n\tprint("s")\nelif alphabet == "s":\n\tprint("t")\nelif alphabet == "t":\n\tprint("u")\nelif alphabet == "u":\n\tprint("v")\nelif alphabet == "v":\n\tprint("w")\nelif alphabet == "w":\n\tprint("x")\nelif alphabet == "x":\n\tprint("y")\nelif alphabet == "y":\n\tprint("z")\n\n'] | ['Wrong Answer', 'Accepted'] | ['s601903184', 's868816253'] | [3064.0, 3064.0] | [17.0, 18.0] | [909, 873] |
p02801 | u927807968 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['A=int(input())\nprint(chr(B+1))', 'A=int(input())\nprint("A+1")', 'A=int(input())\nB=chr(A+1)\nprint("" + B)', 'A=chr(input())\nprint(chr(B+1))', 'A=ord(input())\nprint(chr(A+1))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s224810308', 's375028084', 's446850166', 's530481932', 's627429884'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 17.0] | [30, 27, 39, 30, 30] |
p02801 | u932370518 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['\n\nC = input()\nC_asc ord(C)\nret = chr(C_asc + 1)\nprint(ret)\n', '\nC = input()\nC_asc = ord(C)\nret = chr(C_asc + 1)\nprint(ret)\n\n\n'] | ['Runtime Error', 'Accepted'] | ['s236541320', 's952820300'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 62] |
p02801 | u934442292 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['import string\n\nAL = string.lowercase\n\nC = input()\nidx = AL.find(C)\nidy = (idx + 1) % 26\nprint(AL[idy])\n', 'import sys\nfrom string import ascii_lowercase as a2z\n\ninput = sys.stdin.readline\n\n\ndef main():\n C = input().rstrip()\n\n i = a2z.index(C)\n ans = a2z[i + 1]\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s068085135', 's033419614'] | [3772.0, 9800.0] | [24.0, 35.0] | [103, 218] |
p02801 | u935840914 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ["c = input()\ns = 'abcdefghijklmnopqrstuvwxyz'\nflg = True\nwhile flg:\n if c == s[i] and c != 'z':\n print(s[i + 1])\n flg = False\n elif c == 'z':\n print('a')\n flg = False", "c = input()\ns = 'abcdefghijklmnopqrstuvwxyz'\nflg = True\nwhile flg:\n if c == s[i] and c != 'z':\n print(s[i + 1])\n flg = False\n elif c == 'z':\n print('a')\n flg = False", 'C = input()\n\nprint(chr(ord(C[0]) + 1))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s108122769', 's756370335', 's702537025'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [199, 199, 38] |
p02801 | u937745164 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['if __name__=="__main__":\n n, m = map(int, input().split())\n p, s=[], []\n for i in range(m):\n pin, sin = map(str, input().split())\n p.append(int(pin))\n s.append(sin)\n\n cnt_wa = 0\n cnt_ac = 0\n pfin = 0\n for i in range(m):\n if pfin < p[i]:\n if s[i]=="WA": \n cnt_wa += 1\n else:\n cnt_ac += 1\n pfin = p[i]\n if pfin==n:\n break\n \n print("{} {}".format(cnt_ac, cnt_wa))', 'abts = "abcdefghijklmnopqrstuvwxyz"\ncin = str(input())\nfor i in range(len(abts)):\n if cin == abts[i]:\n print(abts[i+1])'] | ['Runtime Error', 'Accepted'] | ['s010363267', 's584881530'] | [3064.0, 2940.0] | [17.0, 17.0] | [521, 123] |
p02801 | u944643608 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['C = input()\nk = [a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]\nfor i in range(len(k)):\n if C == k[i]:\n print(k[i+1])\n', 'C = input()\nk = [a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,g]\nfor i in range(len(k)):\n if C == k[i]:\n print(k[i+1])', "from intertools import chain\nfrom collections import deque\nH, W = map(int,input().split())\nS = [list(map(str,input().split())) for _ in range(H)]\ndhw = [[0,1],[0,-1],[1,0],[-1,0]]\n\nans = 0\nfor h in range(H):\n for w in range(W):\n d = deque([h,w])\n maze = [[-1] * W for _ in range(H)]\n if S[h][w] == '#':\n continue\n maze[h][w] = 0\n while d:\n ht , hw = d.popleft()\n for dh, dw in dhw:\n nh = ht + dh\n nw = wt + dw\n if 0 <= nh < H and 0 <= nw < W:\n if maze[nh][nw] == -1 and S[nh][nw] == '.':\n d.append([nh,nw])\n maze[nh][nw] = maze[ht][wt] + 1\n ans = max(ans,max(chain(*maze))\nprint(ans)\n", "C = input()\nk = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\nfor i in range(len(k)):\n if C == k[i]:\n print(k[i+1])\n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s086392396', 's430266940', 's973772906', 's467257287'] | [2940.0, 3060.0, 3064.0, 2940.0] | [17.0, 18.0, 18.0, 18.0] | [128, 127, 670, 180] |
p02801 | u953655640 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['N, M = map(int, input().split())\nA = {}\nac = []\ntotal=0\ncount = 0\nfor i in range(M):\n p, s = map(str, input().split())\n if int(p) not in ac:\n if int(p) not in A.keys(): \n if int(p) >0 and int(p) <=N :\n if s == "WA":\n A[int(p)] =1\n elif s =="AC":\n A[int(p)] =0\n ac.append(int(p))\n elif int(p) in A.keys():\n if s == "WA":\n A[int(p)] +=1\n elif s =="AC":\n A[int(p)] +=0\n ac.append(int(p))\n count += 1\n total += A[int(p)]\n\nprint(count,total)', 'c = str(input())\nd=int(ord(c)+1)\nprint(chr(d))'] | ['Runtime Error', 'Accepted'] | ['s970972587', 's393504353'] | [3064.0, 2940.0] | [18.0, 17.0] | [671, 46] |
p02801 | u957872856 | 2,000 | 1,048,576 | Given is a lowercase English letter C that is not `z`. Print the letter that follows C in alphabetical order. | ['from collections import defaultdict\nN, M = map(int, input().split())\nP = []\nS = []\nfor i in range(M):\n p, s = input().split()\n P.append(int(p))\n S.append(s)\nd = defaultdict(int)\nd1 = defaultdict(int)\nfor i in range(M):\n if S[i] == "WA":\n if d[P[i]] != 1:\n d1[P[i]] += 1\n elif S[i] == "AC":\n d[P[i]] = 1\nfor i in range(M):\n if d[P[i]] == 0 and d1[P[i]] > 0:\n d1[P[i]] = 0\nprint(sum(d.values()), sum(d1.values()))', 'c=input()\nl = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]\nfor i in range(len(l)):\n if l[i] == c:\n print(l[i+1])'] | ['Runtime Error', 'Accepted'] | ['s991895136', 's180429523'] | [3700.0, 3060.0] | [31.0, 17.0] | [431, 177] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.