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 | u288001809 | 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,b,c=(int(x) for x in input().split())\ns = list(map(int, input().split()))\nt = 0\nfor x in s:\n t += x\nl = a + 1\nchk = l * c\nchk -= t\nif chk > b:\n print(-1)\nelseif chk < 0:\n print(0)\nelse:\n print(chk)', 's = input()\nprint chr(ord(s[0]) + 1)', 's = input()\nprint chr(ord(s) + 1)', 's = input()\nprint(chr(ord(s)+1))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s182786364', 's658238814', 's730523610', 's993937688'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 16.0, 17.0] | [203, 36, 33, 32] |
p02801 | u300018211 | 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. | ['str1 = input()\nasc = ord(str1) + 1\nprint(asc)\nans = chr(asc)\nprint(ans)\n', 'str1 = input()\nans = chr(ord(str1) + 1)\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s526350840', 's131399566'] | [2940.0, 2940.0] | [17.0, 17.0] | [72, 50] |
p02801 | u306142032 | 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. | ['m = input()\nprint(chr(rd(m)+1))', 'm = input()\nprint(chr(ord(m)+1))'] | ['Runtime Error', 'Accepted'] | ['s442682777', 's706589210'] | [2940.0, 2940.0] | [17.0, 17.0] | [31, 32] |
p02801 | u307622233 | 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 = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\na_sum = sum(A)\nx = N * M - a_sum\n\nif K < x:\n x = -1\nelif x < 0:\n x = 0\nprint(x)\n', "c = input()\n\ntxt = 'abcdefghijklmnopqrstuvwxyz'\nfor i in range(26):\n if txt[i] == c:\n print(txt[i + 1])\n"] | ['Runtime Error', 'Accepted'] | ['s011684617', 's014806735'] | [2940.0, 2940.0] | [17.0, 17.0] | [165, 114] |
p02801 | u309423187 | 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()\nans = char(ord(a) + 1)\n\nprint(ans)', 's = input()\n\nprint(chr(ord(s) + 1)\n', 's = input()\n\nprint(char(ord(s) + 1)\n', 's = input()\n\nprint(char(ord(s) + 1))\n', 's = input()\n\nprint(chr(ord(s) + 1))\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s038868761', 's268050099', 's413471387', 's631562748', 's568130042'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [46, 35, 36, 37, 36] |
p02801 | u310035060 | 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. | ['chr1 = input(chr)\nnew = ord(chr1)+1\nprint(chr(new))', 'str = input(str)\nprint(chr(ord(str)+1))', 'str1 = input()\nnew = ord(str1)+1\nprint(chr(new))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s190733924', 's655659073', 's885638559'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [51, 39, 48] |
p02801 | u312666261 | 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()\nn = ord(n)\nn += 1', 'n = input()\nn = ord(n)\nn += 1\nprint (n)', 'n = input()\nn = ord(n)\nn += 1\nn = chr(n)\nprint(n)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s737468493', 's890791692', 's891184735'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [29, 39, 49] |
p02801 | u313445895 | 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()\nlist_S = ["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 list_s:\n if list_s[i] == s:\n print(list_s[i+1])\n ', 's = input()\nlist_s = list(range(97, 97+26))\nfor i in range(26):\n if ord(s) == list_s[i]:\n print(chr(list_s[i+1]))'] | ['Runtime Error', 'Accepted'] | ['s734096964', 's662383170'] | [8984.0, 8976.0] | [24.0, 26.0] | [216, 123] |
p02801 | u318740143 | 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()\n\nM = ord('N')+1\n\nJ = chr(M)\n\nprint(J)\n", "N = input()\n\nans = chr(ord('N'+1))\n\nprint(ans)\n ", "a = input()\nprint chr(ord('a') + 1)", 'a = input()\nprint(chr(ord(a) + 1))'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s095547895', 's361572171', 's818976611', 's425288563'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [50, 57, 35, 34] |
p02801 | u328510800 | 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\n', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s483262419', 's385990970'] | [2940.0, 2940.0] | [17.0, 17.0] | [2, 26] |
p02801 | u329865314 | 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(ord(ord(input())+1))', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s714196825', 's373610336'] | [2940.0, 2940.0] | [17.0, 17.0] | [26, 26] |
p02801 | u331360010 | 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\nprint(char(ord(input()[0])+1))', 'print(chr(ord(input()[0])+1))'] | ['Runtime Error', 'Accepted'] | ['s946272150', 's070446750'] | [12392.0, 2940.0] | [159.0, 16.0] | [49, 29] |
p02801 | u333700164 | 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()))\nmod=10**9+7\na.sort()\ndef fact(n):\n if n==0:\n return 1\n else:\n s=1\n for i in range(1,n+1):\n s=s*i\n return s\ndef comb(n,k,mod):\n return (fact(n)//fact(k)//fact(n-k))%mod\n\nif k>1:\n s=0\n for i in range(0,n-k):\n for j in range(i+k-1,n-1):\n s+=((a[j]-a[i])*comb(j-i-1,k-2,mod))%mod\n print(s%mod)\nelse:\n print(0)\n', 'C=str(input())\na=ord(C)\nprint(chr(a+1))'] | ['Runtime Error', 'Accepted'] | ['s599991496', 's279125468'] | [3064.0, 2940.0] | [17.0, 17.0] | [400, 39] |
p02801 | u342369573 | 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. | ["nput()\nif x =='a':\n print('b')\nif x =='b':\n print('c')\nif x =='c':\n print('d')\nif x =='d':\n print('e')\nif x =='e':\n print('f')\nif x =='f':\n print('g')\nif x =='g':\n print('h')\nif x =='h':\n print('i')\nif x =='i':\n print('j')\nif x =='j':\n print('k')\nif x =='k':\n print('l')\nif x =='l':\n print('m')\nif x =='m':\n print('n')\nif x =='n':\n print('o')\nif x =='o':\n print('p')\nif x =='p':\n print('q')\nif x =='q':\n print('r')\nif x =='r':\n print('s')\nif x =='s':\n print('t')\nif x =='t':\n print('u')\nif x =='u':\n print('v')\nif x =='v':\n print('w')\nif x =='w':\n print('x')\nif x =='x':\n print('y')\nif x =='y':\n print('z')\n", "import numpy as np\nN, K, M = map(int,input().split())\nA = list(map(int,input().split()))\nA = np.array(A)\nif M*N-np.mean(A)*(N-1) < 0:\n print(0)\nelif M*N-np.mean(A)*(N-1)<K:\n print(Decimal(str(M*N-np.mean(A)*(N-1))).quantize(Decimal('0'), rounding=ROUND_HALF_UP))\nelse:\n print(-1)\n\n", "x = input()\nif x =='a':\n print('b')\nif x =='b':\n print('c')\nif x =='c':\n print('d')\nif x =='d':\n print('e')\nif x =='e':\n print('f')\nif x =='f':\n print('g')\nif x =='g':\n print('h')\nif x =='h':\n print('i')\nif x =='i':\n print('j')\nif x =='j':\n print('k')\nif x =='k':\n print('l')\nif x =='l':\n print('m')\nif x =='m':\n print('n')\nif x =='n':\n print('o')\nif x =='o':\n print('p')\nif x =='p':\n print('q')\nif x =='q':\n print('r')\nif x =='r':\n print('s')\nif x =='s':\n print('t')\nif x =='t':\n print('u')\nif x =='u':\n print('v')\nif x =='v':\n print('w')\nif x =='w':\n print('x')\nif x =='x':\n print('y')\nif x =='y':\n print('z')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s003473403', 's124139742', 's292771605'] | [9084.0, 27000.0, 9136.0] | [20.0, 111.0, 29.0] | [682, 290, 687] |
p02801 | u345483150 | 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()\nabcStr = "abcdefghijklmnopqrstuvwxyz"\nprint(abcStr[index(a)+1])', 'c=input()\nabcStr = "abcdefghijklmnopqrstuvwxyz"\nd=abcStr[abcStr.index(c)+1]\nprint(d)'] | ['Runtime Error', 'Accepted'] | ['s040301534', 's677964737'] | [2940.0, 2940.0] | [17.0, 18.0] | [73, 84] |
p02801 | u347452770 | 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. | ['\nn,m = map(int, input().split())\np = []\ns = []\nwacounter = 0\nwalist = []\nfor i in range(0, n):\n walist.append(0)\npoint = 0\npoint_to_num = [] \nfor i in range(0, m):\n list = input().split()\n p.append(int(list[0]))\n s.append(list[1])\n \nfor i in range(0, m):\n if s[i] == "AC" and not p[i] in point_to_num: \n point_to_num.append(p[i]) \n \n elif s[i] == "WA" and not p[i] in point_to_num: \n wacounter += 1\n walist[p[i]-1] += 1\nfor i in range(0, n):\n if not i + 1 in point_to_num:\n wacounter = wacounter - walist[i]\nprint(len(point_to_num), wacounter)\n \n', 's = input()\nn = ord(s)\n\nprint(chr(n+1))'] | ['Runtime Error', 'Accepted'] | ['s099849672', 's134117536'] | [3064.0, 2940.0] | [18.0, 17.0] | [1015, 39] |
p02801 | u352642051 | 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())\ncnt = 0\nwa = 0\nac = 0\nsumi = []\nb = {}\nfor x in range(m):\n a = input().split()\n if a[1] == 'WA':\n try:\n b[a[0]] += 1\n except KeyError:\n b[a[0]] = 1\n if a[1] == 'AC' and not a[0] in sumi:\n sumi.append(a[0])\n ac += 1\n try:\n wa += b[a[0]]\n except KeyError:\n continue\nprint(ac, wa)", "import sys\nn, m = map(int, input().split())\nwa, ac = 0, 0\nmemo = []\nhi = n\nif n < m:\n hi = m\nb = [0] * hi\ntable = [sys.stdin.readline().split() for x in range(m)]\nfor x in range(m):\n if table[x][1] == 'AC' and not table[x][0] in memo:\n memo.append(table[x][0])\n ac += 1\n wa += b[int(table[x][0])]\n elif table[x][1] == 'WA':\n b[int(table[x][0])] += 1\nprint(ac, wa)\n", "n, m = map(int, input().split())\ncnt = 0\nwa = 0\nac = 0\nsumi = []\nb = {}\nfor x in range(m):\n a = input().split()\n if a[1] == 'WA' and not a[0] in sumi:\n try:\n b[a[0]] += 1\n except KeyError:\n b[a[0]] = 1\n elif a[1] == 'AC' and not a[0] in sumi:\n\n sumi.append(a[0])\n ac += 1\n try:\n wa += b[a[0]]\n except KeyError:\n continue\nprint(ac, wa)\n", 'a = input()\n\n\nprint(chr(ord(a) + 1))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s124213664', 's485916149', 's602036655', 's498061125'] | [3064.0, 3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [405, 401, 430, 36] |
p02801 | u353919145 | 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\n\ndef main():\n\tl = stdin.readline().strip()\n\tprint(l)\n\tprint(l + " is followed by " +chr(ord(l)+1)+".")\nmain()\n', 'from sys import stdin\n\ndef main():\n\tl = stdin.readline().strip()\n\tprint(chr(ord(l)+1))\n\tprint(l + " is followed by " +chr(ord(l)+1)+".")\nmain()\n', 'C=input()\nCN=ord(C)\nprint(chr((CN)+1))\nprint(C+" is followed by "+chr((CN)+1)+".")', 'métele_algonomas=input()\ncaja_china = ord(métele_algonomas)\ndedos = caja_china + 1\nprint(chr(dedos))\n\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s328890545', 's622498740', 's685894576', 's994061575'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [132, 144, 82, 104] |
p02801 | u354623416 | 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('')\nchr(ord(C) + 1)\n\n", "C = input('')\nprint (chr(ord(C) + 1))\n"] | ['Wrong Answer', 'Accepted'] | ['s520427070', 's493824619'] | [2940.0, 2940.0] | [17.0, 17.0] | [31, 38] |
p02801 | u355154595 | 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()\nprint('chr(ord(a)+1)')\n", "a=input()\nprint=('chr(ord(a)+1)')\n", 'a=input()\nprint=(chr(ord(a)+1))\n', 'a=input()\nprint(chr(ord(a)+1))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s002660000', 's007462409', 's064317720', 's169531835'] | [2940.0, 2940.0, 2940.0, 9020.0] | [17.0, 16.0, 17.0, 28.0] | [33, 34, 32, 30] |
p02801 | u357230322 | 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()\na=[chr(i) for i in range(97, 97+26)]\nprint(a[a.index(c)+1])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s092833985', 's384031327', 's224899014'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [33, 31, 69] |
p02801 | u357751375 | 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()\nc = c + 1\nprint(c)', 'c = input()\nc = ord(c + 1)\nprint(c)', 'N,K,M = map(int,input().split())\nA = list(map(int,input().split()))\n\nL = N * M\nS = sum(A)\n\nif L - S > K or S >= L:\n print(-1)\nelse:\n print(L - S)', 'c = input()\nc = ord(c) + 1\nprint(chr(c))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s167093995', 's313473544', 's688587617', 's437228270'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [30, 35, 151, 40] |
p02801 | u358957649 | 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)', '\nx = ord(input())\nx += 1\nprint(chr(x))'] | ['Runtime Error', 'Accepted'] | ['s441233984', 's917513518'] | [2940.0, 2940.0] | [17.0, 17.0] | [32, 38] |
p02801 | u361826811 | 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\nimport sys\n\n# import itertools\n# import math\n\n# import numpy as np\n\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nH = readline().decode('utf8')\nprint(chr(ord(H) + 1))\n", "\n\nimport sys\n\n# import itertools\n# import math\n\n# import numpy as np\n\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nH = readline().decode('utf8').strip()\nprint(chr(ord(H) + 1))\n"] | ['Runtime Error', 'Accepted'] | ['s126986197', 's978266585'] | [2940.0, 2940.0] | [17.0, 17.0] | [275, 283] |
p02801 | u367130284 | 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'] | ['s153204955', 's700170402'] | [2940.0, 2940.0] | [18.0, 17.0] | [26, 26] |
p02801 | u370217787 | 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\n\nx = list(map(int, input().split()))\n\nN, M = x[0], x[1]\n\nac, wa = np.array([0 for i in range(N)]), np.array([0 for i in range(N)])\n\nfor i in range(M):\n num, result = input().split()\n num = int(num) - 1\n\n if ac[num] == 1:\n pass\n else:\n if result == "AC":\n ac[num] = 1\n else:\n wa[num] += 1\n\nprint(np.sum(ac), np.sum(wa))\n', 'input_line = input()\n\nprint(chr(ord(input_line)+1)) '] | ['Runtime Error', 'Accepted'] | ['s854922217', 's976368090'] | [12400.0, 2940.0] | [151.0, 18.0] | [393, 52] |
p02801 | u371132735 | 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"\ni = input()\nfor a in ramge(al):\n if al[a] == i:\n print(al[a+1])\n\nal = "abcdefghijklmnopqrstuvwxyz"\ni = input()\nfor a in range(len(al)):\n if al[a] == i:\n print(al[a+1])\n\n', 'al = "abcdefghijklmnopqrstuvwxyz"\ni = input()\nfor a in range(len(al)):\n if al[a] == i:\n print(al[a+1])\n\n'] | ['Runtime Error', 'Accepted'] | ['s832633997', 's264426276'] | [3060.0, 2940.0] | [19.0, 17.0] | [211, 108] |
p02801 | u375616706 | 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())\ngrid = [[c for c in input()] for _ in range(N)]\nmat = [[float(\'inf\')]*(M*N) for _ in range(N*M)]\n\nDX = [0, 0, 1, -1]\nDY = [-1, 1, 0, 0]\nfor row in range(N):\n for col in range(M):\n if grid[row][col] == "#":\n continue\n for dx, dy in zip(DX, DY):\n if 0 <= row+dx < N and 0 <= col+dy < M:\n if grid[row+dx][col+dy] == "#":\n continue\n mat[(row+dx)*M+col+dy][row*M+col] = 1\n mat[row*M+col][(row+dx)*M+col+dy] = 1\nfor k in range(N*M):\n for i in range(N*M):\n for j in range(N*M):\n mat[i][j] = min(mat[i][j], mat[i][k] + mat[k][j])\nans = 0\nfor srow in range(N):\n for scol in range(M):\n if grid[srow][scol] == "#":\n continue\n for erow in range(N):\n for ecol in range(M):\n if grid[erow][ecol] == "#":\n continue\n else:\n ans = max(mat[srow*M+scol][erow*M+ecol], ans)\nprint(ans)\n', 'C=input()\nprint(str(ord(C)+1))\n', 'C=input()\nprint(chr(ord(C)+1))\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s049787335', 's980490058', 's933580194'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [1028, 31, 31] |
p02801 | u383450070 | 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(str(input())+1)))', 'print(chr(ord(str(input()))+1))'] | ['Runtime Error', 'Accepted'] | ['s802000089', 's281551854'] | [2940.0, 2940.0] | [17.0, 17.0] | [31, 31] |
p02801 | u386131832 | 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 queue\nimport copy\n \ndef ngoin(bo,now):\n return 0 <= now[0] and now[0] < len(bo) and 0 <= now[1] and now[1] < len(bo[0])\n \ndef minido(bo,si,sj):\n tb = [[False for i in range(len(bo[0]))] for j in range(len(bo))]\n q = queue.Queue()\n q.put([si,sj,0])\n tb[si][sj] = True\n ret = 0\n while not q.empty():\n now = q.get()\n ret = now[2]\n if ngoin(bo,[now[0]-1,now[1]]):\n if bo[now[0]-1][now[1]] and not tb[now[0]-1][now[1]]:\n q.put([now[0]-1,now[1],now[2]+1])\n tb[now[0]-1][now[1]] = True\n \n if ngoin(bo,[now[0],now[1]+1]):\n if bo[now[0]][now[1]+1] and not tb[now[0]][now[1]+1]:\n q.put([now[0],now[1]+1,now[2]+1])\n tb[now[0]][now[1]+1] = True\n \n if ngoin(bo,[now[0]+1,now[1]]):\n if bo[now[0]+1][now[1]] and not tb[now[0]+1][now[1]]:\n q.put([now[0]+1,now[1],now[2]+1])\n tb[now[0]+1][now[1]] = True\n \n if ngoin(bo,[now[0],now[1]-1]):\n if bo[now[0]][now[1]-1] and not tb[now[0]][now[1]-1]:\n q.put([now[0],now[1]-1,now[2]+1])\n tb[now[0]][now[1]-1] = True\n return ret\n \n \nh,w = map(int,input().split())\nbo = [[True if x == '.' else False for x in input()] for i in range(h)]\ngrap = [[float('inf') for i in range(h*w)] for j in range(h*w)]\nans = 0\nfor i in range(h*w):\n grap[i][i] = 0\nfor si in range(h):\n for sj in range(w):\n if not bo[si][sj]:\n continue\n ans = max(ans,minido(bo,si,sj))\n \nprint(ans)\n", 'a = input()\nprint(chr(ord(a)+1))'] | ['Runtime Error', 'Accepted'] | ['s071122888', 's672087896'] | [4080.0, 2940.0] | [28.0, 17.0] | [1625, 32] |
p02801 | u389257507 | 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. | ["alpha = 'c'\na_code = ord('a')\nz_code = ord('z')\nalpha_code = ord(alpha)\nif alpha_code >= a_code and alpha_code < z_code:\n\tnext_alpha_code = alpha_code + 1\n\tnext_alpha = chr(next_alpha_code)\n\tprint(alpha + 'の次は' + next_alpha + 'です。')", "alpha = input()\nalpha_code = ord(alpha)\nnext_alpha_code = alpha_code + 1\nnext_alpha = chr(next_alpha_code)\nprint(alpha + 'の次は' + next_alpha + 'です。')", "alpha = input()\na_code = ord('a')\nz_code = ord('z')\nalpha_code = ord(alpha)\nif alpha_code >= a_code and alpha_code < z_code:\n\tnext_alpha_code = alpha_code + 1\n\tnext_alpha = chr(next_alpha_code)\n\tprint(alpha + 'の次は' + next_alpha + 'です。')", "alpha = input()\na_code = ord('a')\nz_code = ord('z')\nalpha_code = ord(alpha)\nif alpha_code >= a_code and alpha_code < z_code:\n\tnext_alpha_code = alpha_code + 1\n\tnext_alpha = chr(next_alpha_code)\n\tprint(alpha + 'の次は' + next_alpha + 'です。')\nelse:print('a ~ yを入力してください')", 'alpha = input()\n\nalpha_code = ord(alpha)\nnext_alpha_code = alpha_code + 1\nnext_alpha = chr(next_alpha_code)\nprint(next_alpha)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s215984519', 's599995651', 's775686351', 's848655817', 's925249979'] | [2940.0, 2940.0, 3064.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 16.0] | [244, 160, 248, 295, 125] |
p02801 | u391589398 | 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 bfs(maze, h, w, si, sj):\n q = deque([[si, sj]])\n score = [[0] * w for i in range(h)]\n\n pattern = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n while len(q) > 0:\n i, j = q.popleft()\n for move in pattern:\n ni, nj= i + move[0], j + move[1]\n if ni < 0 or h <= ni or nj < 0 or w <= nj:\n continue\n p = maze[ni][nj]\n if p == \'#\':\n continue\n if p == \'.\' and not score[ni][nj]:\n score[ni][nj] = score[i][j] + 1\n q.append([ni, nj])\n return max(sum(score, []))\n \nh, w = map(int, input().split())\nmaze = [input() for i in range(h)]\nscores = []\nfor si in range(h):\n for sj in range(w):\n memo.append((si, sj))\n if maze[si][sj] == "#":\n continue\n scores.append(bfs(maze, h, w, si, sj))\nprint(max(scores))', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s294042336', 's219528882'] | [3316.0, 2940.0] | [21.0, 17.0] | [895, 26] |
p02801 | u406984840 | 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. | ['t = 1', "C = input()\nalpha = 'abcdefghijklmnopqrstuvwxyz'\nindex = alpha.index(C)\nprint(alpha[index + 1])"] | ['Wrong Answer', 'Accepted'] | ['s522626249', 's758762911'] | [2940.0, 2940.0] | [17.0, 17.0] | [5, 95] |
p02801 | u419963262 | 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())\nkeep=[]\nlis=[]\nac=[0]*N\nwa=[0]*N\nWA=0\nfor i in range(M):\n ps=input().split()\n keep.append(ps)\n \nfor j in range(M):\n if keep[j][1]=="AC":\n ac[int(keep[j][0])-1]=1\n elif ac[int(keep[j][0])-1]==0:\n wa[int(keep[j][0])-1]+=1\nAC=sum(ac)\nfor k in range(N):\n WA+=ac[k]*wa[k]\n \nprint(AC,WA)\n', 'N,M=map(int,input().split())\nkeep=[]\nlis=[]\nac=[0]*N\nwa=[0]*N\nWA=0\nfor i in range(M):\n ps=input().split()\n keep.append(ps)\n \nfor j in range(M):\n if keep[j][1]=="AC":\n ac[int(keep[j][0])-1]=1\n elif ac[int(keep[j][0])-1]==0:\n wa[int(keep[j][0])-1]+=1\nAC=sum(ac)\nfor j in range(M):\n WA+=ac[j]*wa[j]\n \nprint(AC,WA)\n', 'S=input()\nnum=ord(S)\nprint(chr(num+1))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s212081967', 's212530016', 's041144584'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [346, 346, 38] |
p02801 | u424035469 | 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()\nalpha = ["a", "b", "c", "d", "e", "f", "g",\n "h", "i", "j", "k", "l", "m", "n",\n "o", "p", "q", "r", "s", "t", "u",\n "v", "w", "x", "y", "z"]\n\nfor i in range(len(alpha)):\n alphabet = alpha[i]\n if a == alphabet:\n print(alphabet)\n break', 'a = input()\nalpha = ["a", "b", "c", "d", "e", "f", "g",\n "h", "i", "j", "k", "l", "m", "n",\n "o", "p", "q", "r", "s", "t", "u",\n "v", "w", "x", "y", "z"]\n\nfor i in alpha:\n if a == alpha:\n print(alpha[i+1])\n break', 'a = input()\nalpha = ["a", "b", "c", "d", "e", "f", "g",\n "h", "i", "j", "k", "l", "m", "n",\n "o", "p", "q", "r", "s", "t", "u",\n "v", "w", "x", "y", "z"]\n\n\nfor i in range(len(alpha)):\n \n alphabet = alpha[i]\n if a == alphabet:\n s = i + 1 \n alphabet = alpha[s]\n print(alphabet)\n break\n '] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s010598074', 's104537211', 's525298567'] | [3060.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [290, 253, 370] |
p02801 | u424241608 | 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. | ['x = input()\nprint(chr(ord(x)+1)', 'x = input()\ny = chr(ord(x) + 1)\nprint(y)\n'] | ['Runtime Error', 'Accepted'] | ['s614534195', 's212185749'] | [2940.0, 2940.0] | [17.0, 17.0] | [31, 41] |
p02801 | u425184437 | 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())\nAn=list(map(int,input().split()))\nrest=M*N-sum(An)\nif rest<=K:\n print(max(rest,0))\nelse:\n print(-1)', 'print(chr(ord(input())+1))'] | ['Runtime Error', 'Accepted'] | ['s890804840', 's378942637'] | [3060.0, 2940.0] | [17.0, 17.0] | [144, 26] |
p02801 | u430679199 | 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 = print(chr(ord(input("input:")) + 1))', 'print(chr(ord(input("input:")) + 1))', 'C = print(chr(ord(input()) + 1))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067910506', 's747551872', 's039330924'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [40, 36, 32] |
p02801 | u437550947 | 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. | ['ch = input()\nout = char(ord(ch)+1)\nprint(out)', 'ch = input()\nout = char(ord(ch)+1)\nprint(out)', 'ch = input()\nout = chr(ord(ch)+1)\nprint(out)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s136646630', 's793442405', 's571138503'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [45, 45, 44] |
p02801 | u437727817 | 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\nN,M = map(int,input().split())\nif M == 0:\n\tprint('0 0')\n\tsys.exit()\n\n\np = [0]*M\ns = [0]*M\n\nfor i in range(M):\n\tp[i],s[i] = input().split()\n\ncor_count = 0\npen_count = 0\nAC_list = []\n\nfor i in range(M):\n\tif not p[i] in AC_list:\n\t\tif s[i] == 'AC':\n\t\t\tAC_list.append(p[i])\n\t\telse:\n\t\t\tpen_count += 1\n\n#print(AC_list)\ncor_count = len(set(AC_list))\nif M != 0:\n\tprint(cor_count,pen_count)\n\n\n", '\nC = input()\n\n\n\nprint(chr(ord(C)+1))\n'] | ['Runtime Error', 'Accepted'] | ['s692452124', 's119833012'] | [3064.0, 3064.0] | [18.0, 17.0] | [423, 37] |
p02801 | u440161695 | 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. | ['alfa=[\'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()\nprint("\'"+c+"\'"+"の次は\'"+alfa[alfa.index(c)+1]+"\'です。")', '\nfrom collections import deque\nfrom copy import deepcopy\n\ndef bfs(pos,map):\n while pos:\n x,y,depth=pos.popleft()\n if map[x][y]=="#":\n continue\n map[x][y]="#"\n if map[x-1][y]!="#":\n pos.append([x-1,y,depth+1])\n if map[x+1][y]!="#":\n pos.append([x+1,y,depth+1])\n if map[x][y+1]!="#":\n pos.append([x,y+1,depth+1])\n if map[x][y-1]!="#":\n pos.append([x,y-1,depth+1])\n return depth\nH,W=map(int,input().split())\nans=0\nfence=["#"]*(W+2)\nfield=[fence]\nfor _ in range(H):\n L=list(input())\n field.append(["#"]+L+["#"])\nfield.append(fence)\nfor i in range(1,H+1):\n for j in range(1,W+1):\n if field[i][j]==".": \n pos=deque([[i,j,0]])\n depth=bfs(pos,deepcopy(field))\n if ans<depth:\n ans=depth\nprint(ans)', "alfa=['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()\nprint(alfa[alfa.index(c)+1])"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s637584954', 's973679895', 's966856045'] | [2940.0, 3572.0, 2940.0] | [18.0, 25.0, 17.0] | [185, 822, 149] |
p02801 | u442877951 | 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 = [chr(i) for i in range(ord('a'), ord('z'))]\nprint(C.sort(C))", 'C = str(input())\nalf = "abcdefghijklmnopqrstuvwxyz"\nfor i in range(len(alf)):\n if C == alf[i]:\n print(alf[i+1])\n break'] | ['Runtime Error', 'Accepted'] | ['s072379660', 's477280811'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 125] |
p02801 | u456107000 | 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=list(map(int,input().split()))\nlistA=list(map(int,input().split()))\nS=sum(listA)\nif S>=M*N-K and S<N*M:\n print(M*N-S)\nelif S>=M*N:\n print(0)\nelse:\n print(-1)', 'C=input()\nprint (chr(ord(C)+1))'] | ['Runtime Error', 'Accepted'] | ['s676241360', 's340447029'] | [3060.0, 2940.0] | [17.0, 17.0] | [170, 31] |
p02801 | u460375306 | 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 queue\nfrom itertools import product\n\nH, W = map(int, input().split())\nroad_grid = [row for row in input()]\n\n# for each start point, find the furthest travellable point\n# then return largest path length of all these\n# ps y is down, x is right\nfurthest_so_far = -1\nfor y_init, x_init in product(range(H), range(W)):\n if road_grid[y_init][x_init] == "#": continue\n boundary = queue.Queue()\n boundary.put((y_init, x_init))\n steps_taken = [[-1]*W for _ in range(H)]\n steps_taken[y_init][x_init] = 0\n while not boundary.empty():\n y, x = boundary.get()\n neighbours = [(y+1, x), (y, x+1), (y-1, x), (y, x-1)]\n for (new_y, new_x) in neighbours:\n if (0 <= new_y < H and 0 <= new_x < W\n and steps_taken[new_y][new_x] == -1 and road_grid[new_y][new_x] == "."):\n steps_taken[new_y][new_x] = steps_taken[y][x] + 1\n boundary.put((new_y, new_x))\n furthest_so_far = max(furthest_so_far, max(max(steps_taken)))\nprint(furthest_so_far)\n', 'x = input()\nprint(chr(ord(x)+1))'] | ['Runtime Error', 'Accepted'] | ['s254460117', 's534424968'] | [3952.0, 2940.0] | [31.0, 17.0] | [1021, 32] |
p02801 | u466746480 | 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()\nN = int(N)\nK = int(K)\nM = int(M)\nA = input().split()\nA = [int(s) for s in A]\nAN = M * N - sum(A)\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelse:\n\tprint (-1)', 'N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(M)\n\nA = input().split()\nA = [int(s) for s in A]\n\nAN = M * N - sum(A)\n\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelif AN < 0:\n\tprint (0)\nelse:\n\tprint (-1)', 'N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(M)\nA = input().split()\nA = [int(s) for s in A]\nAN = M * N - sum(A)\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelif AN < 0:\n\tprint (0)\nelse:\n\tprint (-1)', 'N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(N)\nA = input().split()\nA = [int(s) for s in A]\nAN = M * N - sum(A)\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelif AN < 0:\n\tprint (0)\nelse:\n\tprint (-1)', "N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(M)\nA = input().split()\nA = [int(s) for s in A]\nAN = M * N - sum(A)\nif AN <= K:\n\tprint (AN)\nelse:\n\tprint ('-1')\n", "N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(N)\nprint(N)\nA = input().split()\nprint(A)\nA = [int(s) for s in A]\nprint(A)\nAN = M * N - sum(A)\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelif AN < 0:\n\tprint (0)\nelse:\n\tprint ('-1')", "N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(N)\n# print(N)\nA = input().split()\n# print(A)\nA = [int(s) for s in A]\n# print(A)\nAN = M * N - sum(A)\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelse:\n\tprint ('-1')", 'N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(M)\nprint(N)\nA = input().split()\nprint(A)\nA = [int(s) for s in A]\nprint(A)\nAN = M * N - sum(A)\nprint (AN)\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelif AN < 0:\n\tprint (0)\nelse:\n\tprint (-1)', "N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(N)\nA = input().split()\nA = [int(s) for s in A]\nAN = M * N - sum(A)\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelse:\n\tprint ('-1')", "N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(M)\nA = input().split()\nA = [int(s) for s in A]\nAN = M * N - sum(A)\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelse:\n\tprint ('-1')", 'N,K,M = input().split()\nN = int(N)\nK = int(K)\nM = int(M)\n\nA = input().split()\nA = [int(s) for s in A]\n\nAN = M * N - sum(A)\n\nif (AN <= K) and (AN >= 0):\n\tprint (AN)\nelse:\n\tprint (-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()\nif (C != 'z') and (C in a):\n\ti = a.index(C)\n\tprint (a[i+1])"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s106418308', 's157256898', 's195571336', 's230614651', 's393909954', 's438387760', 's616765885', 's794811726', 's874397398', 's911030547', 's940369112', 's038824445'] | [3060.0, 3064.0, 3064.0, 3064.0, 3060.0, 3064.0, 3060.0, 3064.0, 3060.0, 3060.0, 3060.0, 3064.0] | [17.0, 17.0, 19.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [178, 205, 202, 202, 165, 231, 213, 240, 180, 180, 181, 206] |
p02801 | u470618774 | 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. | ['i1 = list(map(int,input().split()))\ni2 = list(map(int,input().split()))\n\nx = sum(i2)\n\nfor i in range(i1[1]):\n if (x+i)/(i1[0]) >= i1[2]:\n print(i)\n break\n else if i == i1[1]-1:\n print(-1)', 'z = input()\na = ["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 b in range(26):\n if a[b]==z:\n c=b+1\nprint(a[c])'] | ['Runtime Error', 'Accepted'] | ['s395360953', 's710895777'] | [2940.0, 3060.0] | [18.0, 18.0] | [214, 183] |
p02801 | u471503862 | 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()\nord_s = ord(c)\nchr_s = chr(ord_s)\nprint(chr_s) ', 'c = input()\nord_s = ord(c)\nchr_s = chr(ord_s+1)\nprint(chr_s) '] | ['Wrong Answer', 'Accepted'] | ['s170866172', 's192768652'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 61] |
p02801 | u471593927 | 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', 'print(chr(ord(input()+1)))\n', 'print(chr(ord(input())+1))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s550987373', 's851598108', 's626576493'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [33, 27, 27] |
p02801 | u477319617 | 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().split(" ")\nr = ["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(r[r.index(c)+1])', 'c=input()\nr = ["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(r[r.index(c)+1])'] | ['Runtime Error', 'Accepted'] | ['s531946982', 's046248334'] | [2940.0, 2940.0] | [17.0, 17.0] | [153, 142] |
p02801 | u478132434 | 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())\nQ_n = [0] * N\nC = [0] * N\n\nAns = 0\nPen = 0\nfor i in range(M):\n p, S = input().split()\n p = int(p)-1\n if (S == 'AC') and (Q_n[p] == 0):\n Q_n[p] = 1\n Ans += 1\n Pen += C[p]\n elif (S == 'WA'):\n C[p] += 1\n \nprint(Ans, Pen)\n \n", 'C = input()\nprint(chr(ord(C)+1))'] | ['Runtime Error', 'Accepted'] | ['s530828435', 's974326101'] | [3064.0, 2940.0] | [17.0, 17.0] | [301, 32] |
p02801 | u479475321 | 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()\ndata = [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(0,len(data)-1):\n if data[i] == n:\n print(data[i+1])\n ', "n = input()\ndata = ['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(0,len(data)-1):\n if data[i] == n:\n print(data[i+1])"] | ['Runtime Error', 'Accepted'] | ['s428576480', 's521228297'] | [2940.0, 3060.0] | [17.0, 17.0] | [149, 196] |
p02801 | u481060762 | 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 = input()\n\n# ald = [1:a,2:b,3:c,4:d,5:e,6:f,8:g,9:h,10:i,11:j,12:k,13:l,14:m,15:n,16:o,16:p,17:q,18:r,19:s,20:t,21:u,22:v,23:w,24:x,25:y,26:z]\n\nald = {'a':'b','b':'c','c':'d','d':'e','e':'f','f':'g','g':'h','h':'i','i':'j','j':'k','k':'l','l':'m','m','n','n':'o','o':'p','p':'q','q':'r','r':'s','s':'t','t':'u','u':'v','v':'w','w':'x','x':'y','y':'z'}\n\nif al in ald:\n print(ald[al])", 'al = input()\n\n# ald = [1:a,2:b,3:c,4:d,5:e,6:f,8:g,9:h,10:i,11:j,12:k,13:l,14:m,15:n,16:o,16:p,17:q,18:r,19:s,20:t,21:u,22:v,23:w,24:x,25:y,26:z]\n\nald = [a:b,b:c,c:d,d:e,e:f,f:g,g:h,h:i,i:j,j:k,k:l,l:m,m,n,n:o,o:p,p:q,q:r,r:s,s:t,t:u,u:v,v:w,w:x,x:y,y:z]\n\nif al in ald:\n print(ald[al])', 'alpha = input()\n\n# ald = [1:a,2:b,3:c,4:d,5:e,6:f,8:g,9:h,10:i,11:j,12:k,13:l,14:m,15:n,16:o,16:p,17:q,18:r,19:s,20:t,21:u,22:v,23:w,24:x,25:y,26:z]\n\nald = {\'a\':\'b\',\'b\':\'c\',\'c\':\'d\',\'d\':\'e\',\'e\':\'f\',\'f\':\'g\',\'g\':\'h\',\'h\':\'i\',\'i\':\'j\',\'j\':\'k\',\'k\':\'l\',\'l\':\'m\',\'m\':\'n\',\'n\':\'o\',\'o\':\'p\',\'p\':\'q\',\'q\':\'r\',\'r\':\'s\',\'s\':\'t\',\'t\':\'u\',\'u\':\'v\',\'v\':\'w\',"w":\'x\',\'x\':\'y\',\'y\':\'z\'}\n\n\nif alpha in ald:\n print(ald[alpha])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s781465740', 's988863167', 's776522205'] | [2940.0, 2940.0, 3064.0] | [18.0, 17.0, 17.0] | [388, 288, 398] |
p02801 | u486209657 | 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 = [a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,\\\n t,u,v,w,x,y,z]\nC=input()\nidx=alphabet.index(C)\nprint(alphabet[idx+1])', 'C=input()\nal=[]\nfor idx in range(97,123):\n al.append(chr(idx))\nidx = al.index(C)\nprint(al[idx+1])'] | ['Runtime Error', 'Accepted'] | ['s016380900', 's939286900'] | [8956.0, 8980.0] | [20.0, 28.0] | [133, 98] |
p02801 | u487288850 | 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. | ['x=input()\narr="abcdefghijklmnopqrstuvwxyz"\narr[arr.index(x)+1]', 'x=input()\narr="abcdefghijklmnopqrstuvwxyz"\nprint(arr[arr.index(x)+1])'] | ['Wrong Answer', 'Accepted'] | ['s426304754', 's608097134'] | [8828.0, 9000.0] | [25.0, 28.0] | [62, 69] |
p02801 | u487594898 | 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 = [input().split() for i in range(M)]\ns1=list()\ns2=list()\np=0\nw=0\nfor i in range(M):\n if A[i][0] not in s2 and A[i][1]=="WA":\n s1 +=A[i][0]\n if A[i][0] not in s2 and A[i][1]=="AC":\n p+=1 \n s2 +=A[i][0]\n w += int(s1.count(A[i][0])) \nprint(p,w)', 'N = input()\nA =[chr(i) for i in range(97, 97+26)]\nfor k in range(len(A)):\n if N==A[k]:\n print(A[k+1])'] | ['Runtime Error', 'Accepted'] | ['s580434961', 's749840636'] | [3064.0, 2940.0] | [17.0, 17.0] | [316, 111] |
p02801 | u488499243 | 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. | ['x = input()\nz = [a,b,c,d,e,f,g,h,i,j,k,l,n,m,o,p,q,r,s,t,u,v,w,x,y,z]\nxi = z.index(x)\nprint(z[xi+a1])', 'x = input()\nz = ord(x)\nxi = chr(z+1)\nprint(xi)'] | ['Runtime Error', 'Accepted'] | ['s481421009', 's208439991'] | [2940.0, 2940.0] | [17.0, 20.0] | [101, 46] |
p02801 | u490553751 | 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() \nprint(chr(ord(s) + 1)', 's = input() \nprint(chr(ord(s) + 1))'] | ['Runtime Error', 'Accepted'] | ['s124547672', 's319126202'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 64] |
p02801 | u492074881 | 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 math\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\nN,K = map(int, input().split())\nA = list(map(int, input().split()))\nA.sort()\nmax=0\nmin=0\nfor i in range(K-1,N):\n max+=A[i]*comb(i,K-1)\n\nfor i in range(N-K+1):\n min+=A[i]*comb(N-1-i,K-1)\nans=(max-min)%(10**9 +7)\nprint(ans)\n', 'C = input()\nH = [chr(i) for i in range(97,97+26)]\nl = len(H)\nfor i in range(l):\n if (C==H[i]):\n ans=H[i+1]\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s171440602', 's383907383'] | [3064.0, 2940.0] | [17.0, 17.0] | [332, 128] |
p02801 | u494295478 | 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()\nchr(ord(C) + 1)', 'C=input()\nprint(chr(ord(C) + 1))'] | ['Wrong Answer', 'Accepted'] | ['s075758355', 's152366719'] | [2940.0, 2940.0] | [17.0, 17.0] | [25, 32] |
p02801 | u496762077 | 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 print(chr(ord(s)+1))', 's = input()\nprint(chr(ord(s)+1))'] | ['Runtime Error', 'Accepted'] | ['s406893848', 's304769353'] | [2940.0, 2940.0] | [17.0, 17.0] | [34, 32] |
p02801 | u498975813 | 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))\n'] | ['Runtime Error', 'Accepted'] | ['s495713238', 's461628768'] | [2940.0, 2940.0] | [17.0, 17.0] | [26, 27] |
p02801 | u500006160 | 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'] | ['s540394505', 's059611891'] | [2940.0, 2940.0] | [16.0, 17.0] | [26, 26] |
p02801 | u506858457 | 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[0])+1))', 'print(chr(ord(input()+1)))', 'print(chr(ord(input())+1))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s569300990', 's727865586', 's341641110'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [33, 26, 27] |
p02801 | u507113442 | 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,k,m=map(int,input().split())\na=list((map(int,input(),split()))\nans=max(0,n*m-sum(a))\nprint(ans if n*m-s<=k else -1)\n', 'c=input()\nprint(chr(ord(c)+1))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s575077880', 's668044166', 's366887243'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [29, 118, 31] |
p02801 | u509392332 | 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\nimport numpy as np\n\nS = []\nfor e in sys.stdin:\n S.append(e.rstrip())\n\nH, M = map(int, S[0].split())\n\nmeiro = []\nfor i in range(H):\n meiro.append([])\n for k in S[i + 1]:\n if k == '.':\n meiro[i].append(1)\n else:\n meiro[i].append(0)\nmeiro_array = np.array(meiro)\nsusumikata = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n\n\ndef BFS(y, x):\n global max_distance\n if meiro_array[x, y] == 1:\n max_distance = 0\n reached = {(x, y): 0}\n for i in range(H * M):\n zahyous = [k for k, v in reached.items() if v == i]\n for zahyou in zahyous:\n for susumi in susumikata:\n new_zahyou = tuple([zahyou[0] + susumi[0], zahyou[1] + susumi[1]])\n if not(0 <= new_zahyou[0] < H and 0 <= new_zahyou[1] < M):\n a = 0\n elif new_zahyou not in reached.keys() and meiro_array[new_zahyou] == 1:\n reached[new_zahyou] = i + 1\n max_distance = i + 1\n\n return max_distance\n\n\nkeiro_max = []\nfor x in range(H):\n for y in range(M):\n keiro_max.append(BFS(x, y))\n\nprint(max(keiro_max))\n", "C = input()\n\nAlphabet = 'abcdefghijklmnopqrstuvwxyz'\nAlphabet_list = [i for i in Alphabet]\nprint(Alphabet_list[Alphabet_list.index(C)+1])"] | ['Runtime Error', 'Accepted'] | ['s077413892', 's028970900'] | [12428.0, 2940.0] | [149.0, 17.0] | [1191, 137] |
p02801 | u514118270 | 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 = list(map(int,input().split()))\nA = ['a']*N\nB = [0]*N\nans1 = 0\nans2 = 0\nfor i in range(M):\n C,D = input().split()\n C = int(C)-1\n if A[C] == D == 'WA':\n ans1 += 1\n B[C] += 1\n if A[C] == 'a' and D == 'WA':\n ans1 += 1\n B[C] += 1\n if A[C] == 'WA' and D == 'AC':\n ans2 += 1\n A[C] = 'AC'\n if A[C] == 'a' and D == 'AC':\n ans2 += 1\n A[C] = 'AC'\nfor i in range(N):\n if A[i] == 'a':\n ans1 -= B[i]\nprint('{0} {1}'.format(ans2,ans1))\n", 'listA = [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(24):\n if C == listA[i]:\n print(listA[i+1])', "listA = ['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(25):\n if C == listA[i]:\n print(listA[i+1])"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s022060940', 's393714627', 's682193043'] | [3064.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0] | [461, 135, 187] |
p02801 | u514687406 | 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. | ['"""\nauthor : dokueki\n"""\ns = input()\nt = "abcdefghijklmnopqrstuvwxyza"\nfor i in range(len(t)):\n if t[i] == a:\n print(t[i+1])\n break\n ', '"""\nauthor : dokueki\n"""\ns = input()\nt = "abcdefghijklmnopqrstuvwxyz"\nfor i in range(len(t)):\n if t[i] == s:\n print(t[i+1])\n break\n'] | ['Runtime Error', 'Accepted'] | ['s580039588', 's322285132'] | [2940.0, 2940.0] | [17.0, 17.0] | [157, 148] |
p02801 | u517930510 | 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_list = 'abcdefghijklmnopqrstuvwxyz'\nif C == alpha_list[i]:\n print(alpha_list[i+1])\n", 'C = input()\nalpha_list = [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 = alpha_list.index(C)\nprint(alpha_list[i+1])', "C = input()\nalpha_list = 'abcdefghijklmnopqrstuvwxyz'\nfor i in range(len(alpha_list)-1):\n if C == alpha_list[i]:\n print(alpha_list[i+1])\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s131903175', 's576074245', 's537241312'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [102, 125, 141] |
p02801 | u518064858 | 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. | ['#min\nminsum=0\nfor i in range(n):\n if n-(i+1)>=k-1:\n minsum+=(a[i] * comb(n-i-1,k-1))%M\n minsum%=M\nb=sorted(a,reverse=True)\n#max\nmaxsum=0\nfor i in range(n):\n if n-(i+1)>=k-1:\n maxsum+=(b[i] * comb(n-i-1,k-1))%M\n maxsum%=M\nprint((maxsum-minsum)%M)', 'aaaa', 'a', 'a\n\na', 'aaaaaaaaaa\n', 'a a\n', 'aa', 'c=input()\nprint(chr(ord(c)+1))\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s185468278', 's773444927', 's822589636', 's841634933', 's891292316', 's928549651', 's973393257', 's297428353'] | [3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0] | [279, 4, 1, 4, 11, 11, 2, 31] |
p02801 | u519717885 | 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()\nx = chr(ord(ch) + 1)\nprint(x)', 's=input()\nprint(chr(ord(s)+1))'] | ['Runtime Error', 'Accepted'] | ['s623920850', 's541847172'] | [2940.0, 2940.0] | [17.0, 17.0] | [39, 30] |
p02801 | u528793636 | 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()\nabc = 'abcdefghijklmnopqrstuvwxyz'\n\nfor i in range(len(str(abc))):\n if abc[i] = c:\n print(abc[i+1])", "C = input()\nabc = 'abcdefghijklmnopqrstuvwxyz'\n\nfor i in range(len(str(abc))):\n if abc[i] == C:\n print(abc[i+1])"] | ['Runtime Error', 'Accepted'] | ['s696842667', 's023848616'] | [2940.0, 2940.0] | [17.0, 17.0] | [121, 122] |
p02801 | u529106146 | 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. | ["K,X = map(int, input().split())\nif K*500 >= X:\n print('Yes')\nelse:\n print('No')\n", "K,X = map(int, input().split())\nif K*500 >= X:\n print('Yes')\nelse:\n print('No')", "l = ['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()\nprint(l[l.index(C)+1])"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s025966786', 's597369888', 's654825941'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [86, 85, 170] |
p02801 | u531427291 | 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. | ['def prepare(n, MOD):\n \n f = 1\n factorials = [1] \n for m in range(1, n + 1):\n f *= m\n f %= MOD\n factorials.append(f)\n \n inv = pow(f, MOD - 2, MOD)\n \n invs = [1] * (n + 1)\n invs[n] = inv\n for m in range(n, 1, -1):\n inv *= m\n inv %= MOD\n invs[m - 1] = inv\n \n return factorials, invs\n\ndef combinations_count(n, r, factorials, invs):\n return (factorials[n] * invs[n-r] * invs[r]) % (10 ** 9 + 7)\n \nf = open("151_E_max01", "r")\nn, k = map(int, f.readline().split())\na = sorted(list(map(int, f.readline().split())))\n\nfactorials, invs = prepare(n, 10 ** 9 + 7)\n\nans = 0\nfor i in range(n):\n if i <= n - k:\n ans -= a[i] * combinations_count(n-i-1, k-1, factorials, invs)\n \n if i >= k - 1:\n ans += a[i] * combinations_count(i, k-1, factorials, invs)\n \n ans = ans % (10 ** 9 + 7)\n \nprint(ans)', 'import string\n\nkey = input()\nalphabet = string.ascii_lowercase\nprint(alphabet[alphabet.index(key) + 1])'] | ['Runtime Error', 'Accepted'] | ['s351330147', 's743494196'] | [3064.0, 3956.0] | [17.0, 28.0] | [963, 103] |
p02801 | u531599639 | 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()\nst = 'abcdefghijklmnopqrstuvwxyz'\nprint(st[index(s)+1])", "s = input()\nst = 'abcdefghijklmnopqrstuvwxyz'\nprint(st[st.index(s)+1])\n"] | ['Runtime Error', 'Accepted'] | ['s940188498', 's832260799'] | [8972.0, 9080.0] | [23.0, 27.0] | [67, 71] |
p02801 | u544212192 | 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]\n", "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'] | ['s706037323', 's362895548'] | [2940.0, 2940.0] | [17.0, 17.0] | [140, 141] |
p02801 | u545368057 | 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. | ['x = ord(input())\nind = (x - ord("A")+1)%26\nprint(chr(ind+ord("A")))', 'x = ord(input())\nind = (x - ord("a")+1)%26\nprint(chr(ind+ord("a")))'] | ['Wrong Answer', 'Accepted'] | ['s000204086', 's644863353'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 67] |
p02801 | u547167033 | 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'] | ['s160228437', 's007004529'] | [2940.0, 2940.0] | [17.0, 17.0] | [26, 26] |
p02801 | u552201227 | 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(C+1)', 's = input()\nprint(chr(ord(s)+1))'] | ['Runtime Error', 'Accepted'] | ['s379535499', 's211533955'] | [2940.0, 2940.0] | [17.0, 17.0] | [22, 32] |
p02801 | u557565572 | 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# import heapq\n# from copy import deepcopy\n# from collections import deque\n# from collections import Counter\n# from itertools import accumulate\n# from itertools import permutations\n# import numpy as np\n# import math\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n# n = int(input())\nmod = 10 ** 9 + 7\na.sort(reverse = True)\n# print(a)\nans = 0\n\ndef C(n, k, mod):\n if n == 0 and k == 0:\n return 1\n if n < k or k < 0:\n return 0\n x,y = 1,1\n while k > 0:\n x *= n\n y *= k\n n, k = n-1, k-1\n \n return x * pow(y, mod-2, mod) % mod\n\n\nfor i in range(0,n-k+1):\n ans += a[i] * C(n-i-1, k-1, mod)\n ans %= mod\n\na.reverse()\nfor i in range(0, n - k + 1):\n ans -= a[i] * C(n - i - 1, k - 1, mod)\n ans %= mod\n\n\n\nprint(ans)\n', '# import math\n\n# import heapq\n# from collections import deque\n# import numpy as np\n\n# a,b = map(int, input().split())\n# n = int(input())\n# p = list(map(int,input().split()))\nc=input()\n\n\nprint(chr(ord(c) + 1))'] | ['Runtime Error', 'Accepted'] | ['s307936894', 's338814910'] | [3064.0, 2940.0] | [17.0, 17.0] | [811, 223] |
p02801 | u566297428 | 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())\nt = chr(ord('s') + 1)\nprint(t)\n\n", 's = input()\nt = chr(ord(s) + 1)\nprint(t)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s092707767', 's649677852'] | [2940.0, 2940.0] | [17.0, 17.0] | [49, 42] |
p02801 | u566574814 | 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. | ['#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\n\nint main() {\n char c;\n cin >> c;\n cout << char(c+1) << endl;\n return 0;\n}', "c = input()\nalpha_list = 'abcdefghijkfmnopqrstuvrxyz'\n\nfor i in range(len(alpha_list)):\n if c == alpha_list[i]:\n print(alpha_list[i+1])\n break"] | ['Runtime Error', 'Accepted'] | ['s362396815', 's221667024'] | [2940.0, 2940.0] | [17.0, 17.0] | [193, 149] |
p02801 | u573754721 | 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"\nfor i in range(26):\n if c==S[i]:\n print(S[i+1])', "c=input()\nS='abcdefghijklmnopqrstuvwxyz'\nfor i in range(26):\n if c==S[i]:\n print(S[i+1])"] | ['Runtime Error', 'Accepted'] | ['s335715618', 's714889154'] | [2940.0, 2940.0] | [18.0, 17.0] | [92, 92] |
p02801 | u581403769 | 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\nl = [chi(i) for i in range(65, 91)]\nprint(l[l.index(c) + 1])', 'c = input()\n\nl = [chr(i) for i in range(97, 123)]\nprint(l[l.index(c) + 1])\n'] | ['Runtime Error', 'Accepted'] | ['s761542032', 's662554410'] | [8980.0, 8904.0] | [23.0, 28.0] | [73, 75] |
p02801 | u586639900 | 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 = map(int, input().split())\nS = [list(input()) for _ in range(H)]\n\ndir = [(-1, 0), (1, 0), (0, -1), (0, 1)]\n\ndist = [[-1] * W for _ in range(H)]\n\ndef BFS(y, x):\n \n que = deque()\n que.append((y, x))\n dist[y][x] = 0\n max_dist = 0\n while que:\n sy, sx = que.popleft() # popleft?\n for dy, dx in dir:\n ny = sy + dy\n nx = sx + dx\n if 0 <= ny < H and 0 <= nx < W and S[ny][nx] != "#" and dist[ny][nx] == -1:\n que.append((ny, nx))\n dist[ny][nx] = dist[sy][sx] + 1\n max_dist = max(max_dist, dist[ny][nx])\n \n return max_dist\n\nmax_dist = 0\nfor sy in range(H):\n for sx in range(W):\n if S[sy][sx] != "#":\n dist = [[-1] * W for _ in range(H)]\n max_dist = max(max_dist, BFS(sy, sx))\n \nprint(max_dist)', 'C = input()\nD = chr(ord(C)+1)\n\nprint(D)'] | ['Runtime Error', 'Accepted'] | ['s113257448', 's692186683'] | [9412.0, 8912.0] | [25.0, 26.0] | [865, 39] |
p02801 | u588749694 | 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(C++)', 'C = input()\n\nprint(chr(ord(C) + 1))'] | ['Runtime Error', 'Accepted'] | ['s070173257', 's215176031'] | [2940.0, 2940.0] | [17.0, 17.0] | [23, 35] |
p02801 | u591143370 | 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 = str(input())\nchr(ord(N)+1)', 'N = str(input())\nprint(chr(ord(N)+1))'] | ['Wrong Answer', 'Accepted'] | ['s403313919', 's196941217'] | [9072.0, 8956.0] | [29.0, 24.0] | [30, 37] |
p02801 | u593934357 | 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\nimport numpy as np\nimport math\n\nh, w = list(map(int, input().split()))\nSHWs = [input() for i in range(h)]\n\ndef bfs(sy, sx):\n visited = [[-1]*w for i in range(h)]\n visited[sy][sx] = 0\n que = deque([[sy, sx]])\n while que:\n \n y,x = que.popleft()\n for i, j in [(1,0),(0,1),(-1,0),(0,-1)]:\n next_y, next_x = y+i, x+j\n # print(visited)\n if next_y < 0 or next_x < 0 or next_y > h-1 or next_x > w-1:\n continue\n if SHWs[next_y][next_x] == '.' and (visited[next_y][next_x] == -1 or visited[next_y][next_x] > visited[y][x]+1):\n visited[next_y][next_x] = visited[y][x] + 1\n que.append([next_y, next_x])\n \n return np.amax(np.array(visited))\n\n \nans = 0\nfor sy in range(h):\n for sx in range(w):\n if SHWs[sy][sx] == '#':\n continue\n count = bfs(sy=sy, sx=sx)\n\n if count > ans:\n ans = count\n\n\nprint(ans)\n\n", "c = input()\nordc = ord(c)\n\nif ordc != 122:\n print(chr(int(ordc)+1))\nelse:\n print('a')\n\n\n\n\n\n"] | ['Runtime Error', 'Accepted'] | ['s675419792', 's799302925'] | [12248.0, 2940.0] | [152.0, 17.0] | [1002, 97] |
p02801 | u595952233 | 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()\nprint(chr(ord(s)+1)))', 'c = input()\na = ord(c)\nprint(chr(a+1))'] | ['Runtime Error', 'Accepted'] | ['s350555564', 's657078996'] | [2940.0, 2940.0] | [17.0, 17.0] | [33, 39] |
p02801 | u599114793 | 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 =[chr(ord(\'a\') + i) for i in range(26)]\na.append("a")\nc = input()\nprint(a[a.index(c)])\n\n', "a =[chr(ord('a') + i) for i in range(26)]\nc = input()\nprint(a[a.index(c)+1])\n\n"] | ['Wrong Answer', 'Accepted'] | ['s747962238', 's093047164'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 78] |
p02801 | u602677143 | 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())\nls = []\nfor i in range(M):\n p,m = map(str,input().split())\n ls.append([p,m])\n \nac = 0\nwa = 0\nnow = ""\np = 0\nc = 0\nfor i in range(M):\n if now == ls[i][0]:\n continue\n if ls[i][0] != ls[i-1][0] and c == 0:\n wa -= p\n p = 0\n if ls[i][1] == "AC":\n now = ls[i][0]\n ac += 1\n c = 1\n elif ls[i][1] == "WA":\n wa += 1\n c = 0\n p += 1\n \nprint(ac,wa)', 'c = input()\nprint(chr(ord(c) + 1))'] | ['Runtime Error', 'Accepted'] | ['s546769676', 's096364035'] | [3064.0, 2940.0] | [17.0, 18.0] | [457, 34] |
p02801 | u607558942 | 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 = map(int, input().split())\n\nif m * n - sum(a) <= 0:\n print(0)\n\nelif 0 < m * n - sum(a) <= k:\n print(m * n - sum(a))\n \nelse:\n print('-1')", "n, k, m = map(int, input().split())\na = list(map(int, input().split()))\n\nif n * m - sum(a) <= 0:\n print(0)\n\nelif n * m - sum(a) > k:\n print('-1')\n \nelse:\n print(n * m - sum(a))", 'alp = input()\nasc = ord(alp)\nprint(chr(asc + 1))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s742419786', 's792968975', 's442792814'] | [2940.0, 3060.0, 2940.0] | [16.0, 17.0, 17.0] | [187, 188, 48] |
p02801 | u609061751 | 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. | ['def cmb(n, k, mod, fac, ifac):\n \n k = min(k, n-k)\n return fac[n] * ifac[k] * ifac[n-k] % mod\n\n\ndef make_tables(mod, n):\n \n fac = [1, 1] \n ifac = [1, 1] \n inverse = [0, 1] \n\n for i in range(2, n+1):\n fac.append((fac[-1] * i) % mod)\n inverse.append((-inverse[mod % i] * (mod//i)) % mod)\n ifac.append((ifac[-1] * inverse[-1]) % mod)\n return fac, ifac\n \nn,k=map(int,input().split())\na=sorted(list(map(int, input().split())))\nMOD=10**9+7\n\nfac, ifac=make_tables(MOD,n)\n\ns=0\nfor i in range(k-1,n):\n\ts+=(a[i]-a[n-i-1])*cmb(i,k-1,MOD,fac,ifac)\n\ts%=10**9+7\nprint(s)\n\n', 'print(chr(ord(input().rstrip())))', 'print(chr(ord(input().rstrip()) + 1))\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s122695612', 's295683585', 's443698688'] | [3064.0, 2940.0, 2940.0] | [20.0, 16.0, 17.0] | [824, 33, 38] |
p02801 | u611239490 | 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(c+1)', 's=input()\nprint(chr(ord(s)+1))'] | ['Runtime Error', 'Accepted'] | ['s705814704', 's389768058'] | [8972.0, 9056.0] | [27.0, 23.0] | [20, 30] |
p02801 | u619646836 | 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\nstr = sys.stdin.readlines()[0]\nalp = "abcdefghijklmnopqrstuvwxyz"\nprint(alp[ord(str)-96])', 'import sys\n\nstr = sys.stdin.readline()\nalp = "abcdefghijklmnopqrstuvwxyz"\nprint(alp[ord(str)-96])', 'str = input()\nalp = "abcdefghijklmnopqrstuvwxyz"\nprint(alp[ord(str)-96])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s054968375', 's469585699', 's110154140'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [101, 97, 72] |
p02801 | u620846115 | 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))', 'n = input()\na = ord(n)\nprint(chr(a+1))'] | ['Runtime Error', 'Accepted'] | ['s640450874', 's922400087'] | [8920.0, 9092.0] | [20.0, 27.0] | [27, 38] |
p02801 | u621998662 | 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\nlines = stdin.readlines()\n \nC = str(lines[0])\n \nprint(chr(ord(C) + 1))', 'from sys import stdin\nlines = stdin.readlines()\n \nC = lines[0]\n\nprint(chr(ord(C) + 1))', 'from sys import stdin\nlines = stdin.readlines()\n \nC = str(lines[0])\n \nprint(chr(ord(C) + 1))', '\nC = str(input())\n\nprint(chr(ord(C) + 1))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s069129068', 's386184584', 's432008154', 's420931961'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [92, 86, 92, 41] |
p02801 | u628341073 | 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. | ['total_subjects, max_points, target_points = map(int, input().split())\nsubject_points = list(map(int, input().split()))\n\ncalc_result = (total_subjects * target_points) - sum(subject_points)\n\nif calc_result > max_points:\n print(-1)\nelif calc_result < 0:\n print(0)\nelse:\n print(calc_result)\n', 'total_subjects, max_points, target_points = map(int, input().split())\nsubject_points = input().split()\ntotal_points = 0\n\nfor subject_point in subject_points:\n total_points += int(subject_point)\n\ncalc_result = total_subjects * target_points - total_points\n\nif calc_result > max_points:\n print(-1)\nelif calc_result < 0:\n print(0)\nelse:\n print(calc_result)', 'total_subjects, max_points, target_points = map(int, input().split())\nsubject_points = list(map(int, input().split()))\n\ncalc_result = total_subjects * target_points - sum(subject_points)\n\nif calc_result > max_points:\n print(-1)\nelif calc_result < 0:\n print(0)\nelse:\n print(calc_result)', "small_alpha = str(input())\nalpha_list = [chr(ord('a') + i) for i in range(26)]\nfor num, alpha in enumerate(alpha_list):\n if alpha == small_alpha:\n print(alpha_list[num + 1])"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s329990389', 's422540390', 's720142912', 's281990894'] | [2940.0, 3060.0, 3060.0, 2940.0] | [17.0, 18.0, 18.0, 17.0] | [297, 365, 294, 183] |
p02801 | u628976407 | 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))', 'a = input()\n\nprint(chr(ord(a) + 1))'] | ['Runtime Error', 'Accepted'] | ['s060455524', 's682369294'] | [2940.0, 2940.0] | [17.0, 17.0] | [29, 35] |
p02801 | u629350026 | 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(ord(input())+1)', 'print(chr(ord(input())+1))'] | ['Wrong Answer', 'Accepted'] | ['s167476682', 's258821864'] | [2940.0, 2940.0] | [17.0, 17.0] | [21, 26] |
p02801 | u629607744 | 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()\nb=a.next(a)\nprint(b)\n', "alp='abcdefghijklmnopqrstuvwxyz'\ns=str(input())\nflag=False\nfor c in alp:\n if flag:\n print(c)\n break\n if c==s:\n flag=True"] | ['Runtime Error', 'Accepted'] | ['s612615794', 's751569115'] | [2940.0, 2940.0] | [17.0, 17.0] | [31, 131] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.