Datasets:
TnT
/
Multi_CodeNet4Repair

Dataset card Data Studio Files
xet
Community
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
u040016087
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 = input().split(" ")\nN = int(l[0])\nM = int(l[1])\n\nanswered = set()\n\nac_count = 0\nwa_count = 0\n\nfor n in range(M):\n result = [i for i in input().split(" ")]\n p = result[0]\n if p in answered:\n continue\n s = result[1]\n if s == "WA":\n wa_count += 1\n else:\n ac_count += 1\n answered.add(p)\n if len(answered) == N:\n break\n\nprint(ac_count, wa_count)', 'ord_s = ord(input())\n\nchr_s = chr(ord_s+1)\nprint(chr_s)']
['Runtime Error', 'Accepted']
['s293556774', 's183397753']
[3064.0, 2940.0]
[17.0, 17.0]
[407, 55]
p02801
u040480263
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.
['lis = "abcdefghijklmnopqrstuvwxyz"\n\nz = input()\n\nfor a in range(len(lis)-1):\n if z = lis[a]:\n print(lis[a+1])\n exit()', 'lis = "abcdefghijklmnopqrstuvwxyz"\ndic = {}\n\nz = imput()\n\nfor a in range(len(lis)-1):\n if z = lis[a]:\n print(lis[a+1])\n exit()\n', 'lis = "abcdefghijklmnopqrstuvwxyz"\n \nz = input()\n \nfor a in range(len(lis)-1):\n if z == lis[a]:\n print(lis[a+1])\n exit()']
['Runtime Error', 'Runtime Error', 'Accepted']
['s224203541', 's679086272', 's079113541']
[2940.0, 2940.0, 2940.0]
[17.0, 18.0, 17.0]
[124, 134, 127]
p02801
u043844098
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\nfrom typing import List\n\n\ndef main():\n h, w = map(int, input().split())\n g = [input() for _ in range(h)]\n print(mm(h, w, g))\n\n\ndef mm(h: int, w: int, g: List[List[str]]) -> int:\n ret = 0\n for i in range(h):\n for j in range(w):\n if (g[i][j] == '#'):\n continue\n cnt = 0\n q = deque([(i, j, cnt)])\n v = set()\n while q:\n ii, jj, cnt = q.popleft()\n v.add((ii, jj))\n ret = max(ret, cnt)\n \n if ii < h - 1 and g[ii + 1][jj] == '.' and (ii + 1, jj) not in v:\n q.append((ii + 1, jj, cnt + 1))\n \n if jj < w - 1 and g[ii][jj + 1] == '.' and (ii, jj + 1) not in v:\n q.append((ii, jj + 1, cnt + 1))\n \n if ii > 0 and g[ii - 1][jj] == '.' and (ii - 1, jj) not in v:\n q.append((ii - 1, jj, cnt + 1))\n \n if jj > 0 and g[ii][jj - 1] == '.' and (ii, jj - 1) not in v:\n q.append((ii, jj - 1, cnt + 1))\n return ret\n\n\nif __name__ == '__main__':\n main()\n", 'c = input()\nprint(chr(ord(c) + 1))']
['Runtime Error', 'Accepted']
['s611158475', 's358907775']
[10256.0, 2940.0]
[37.0, 17.0]
[1218, 34]
p02801
u051331793
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())\n\nans = ['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']\nans2 = int(ans.index(C)) + 1\nprint(ans[ans2])", "C = input()\n\nans = ['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']\nans2 = int(ans.index(C)) + 1\nprint(ans[ans2])"]
['Runtime Error', 'Accepted']
['s605526865', 's624617434']
[3060.0, 3060.0]
[17.0, 18.0]
[200, 195]
p02801
u051928503
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\nfrom collections import deque\n\nh, w = map(int, input().split())\ns = [list(input()) for _ in range(h)]\n#s = np.array(s)\n#s = (s == ".") * 1\ndef neext(a):\n l, m = a[0], a[1]\n return [(l, m+1), (l, m-1), (l+1, m), (l-1, m)]\ndef solve(i, j):\n if s[i][j] == \'#\':\n return 0\n else:\n pre = 0\n p = np.full((h, w), -1)\n check = deque([((i, j), 0)])#(from,now, dist)\n while check:\n now, d = check.popleft()\n p[now[0]][now[1]] = d\n pre = max(pre, d)\n for b, c in neext((now[0], now[1])):\n if b < 0 or c < 0 or b >= h or c >= w:\n continue \n if p[b][c] != -1 or s[b][c] == \'#\':\n continue\n else:\n check.append(((b, c), d + 1))\n return pre\nans = 0\nfor H in range(len(s)):\n for W in range(len(s[0])):\n ans = max(ans, solve(H, W))\nprint(ans)', 'N, M=map(int,input().split())\nif M==0:\n\tprint("0 0")\nelse:\n\tA=[]\n\tfor i in range(M):\n\t\ta=list(map(str,input().split()))\n\t\tA.append(a)\n\tch=[]\n\tac=0\n\tpe=0\n\tfor i in range(M):\n\t\tif A[i][0] in ch:\n\t\t\tcontinue\n\t\telif A[i][1]=="AC":\n\t\t\tch.append(A[i][0])\n\t\t\tac+=1\n\t\telse:\n\t\t\tpe+=1\n\tprint(ac,pe)', 'C=input()\nprint(chr(ord(C)+1))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s001269852', 's903149927', 's262695330']
[27052.0, 3064.0, 2940.0]
[113.0, 17.0, 18.0]
[952, 288, 30]
p02801
u053909865
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())\n\nprint(chr(ord('s')+1))", 'C = str(input())\n\nprint(chr(ord(C)+1))']
['Runtime Error', 'Accepted']
['s007764932', 's468153833']
[2940.0, 2940.0]
[17.0, 17.0]
[40, 38]
p02801
u054662964
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 = str(input())\ns = ['z','x','c','v','b','n','m','a','s','d','f','g','h','j','k','l','q','w','e','r','t','y','u','i','o','p']\ne = append(a)\nw = sorted(e)\nprint(w[a+1])\n\n", "a = str(input())\ns = ['z','x','c','v','b','n','m','a','s','d','f','g','h','j','k','l','q','w','e','r','t','y','u','i','o','p']\ns.append(a)\ns.sort()\nQ = s.index(a)\ne = Q + 2\nprint(s[int(e)])\n\n"]
['Runtime Error', 'Accepted']
['s785844676', 's879666206']
[2940.0, 3060.0]
[17.0, 17.0]
[170, 191]
p02801
u055244973
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(1)', 's=input()\norder=list("abcdefghijklmnopqrstuvwxyz")\ni=order.index(s)\nprint(order[i+1])']
['Wrong Answer', 'Accepted']
['s580070053', 's888948173']
[2940.0, 2940.0]
[17.0, 17.0]
[8, 85]
p02801
u056061577
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(char(ord(c)+1)', 'c=input()\nprint(chr(ord(c)+1))']
['Runtime Error', 'Accepted']
['s774847004', 's563586077']
[2940.0, 2940.0]
[17.0, 17.0]
[30, 30]
p02801
u057362336
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()\nprint(chr(ord(c)+1))']
['Runtime Error', 'Accepted']
['s439283725', 's616471673']
[2940.0, 2940.0]
[17.0, 17.0]
[24, 30]
p02801
u057668615
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\nalph = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u\n\nfor i, j in enumerate(alph):\n if C == j:\n print(alph[i+1])\n", "C = str(input())\n\nalph = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u\n\nfor i, j in enumerate(alph):\n if C == j:\n print(alph[i+1])\n", "C = str(input())\n\nalph = ['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 i, j in enumerate(alph):\n if C == j:\n print(alph[i+1])"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s167398366', 's371771470', 's432244651']
[2940.0, 2940.0, 3060.0]
[18.0, 17.0, 17.0]
[173, 173, 194]
p02801
u066455063
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\nwa = [0] * N\n\nac = 0\nwa = 0\n\nfor i in range(M):\n p, S = input().split()\n p = int(p)\n\n if S == "AC":\n if ac[p-1] == 0:\n ac += 1\n \n else:\n if ac[N-1] == 0:\n wa += 1\n\nprint(ac, wa)\n', 'C = input()\nalphabet = "abcdefghijklmnopqrltuvwxyz"\n\nfor i in range(len(alphabet)):\n if alphabet[i] == C:\n print(alphabet[i+1])\n exit()']
['Runtime Error', 'Accepted']
['s393255144', 's051860811']
[3060.0, 2940.0]
[17.0, 17.0]
[283, 152]
p02801
u068862866
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(char(ord(C)+1))', 'C = input()\n \nprint(chr(ord(C)+1))']
['Runtime Error', 'Accepted']
['s237184026', 's096634345']
[9032.0, 9016.0]
[25.0, 28.0]
[34, 34]
p02801
u072717685
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()\nr = chr(ord(C))\n\nprint(r)', 'C = input()\nr = chr(ord(C)+1)\nprint(r)']
['Wrong Answer', 'Accepted']
['s756703334', 's153686367']
[2940.0, 2940.0]
[17.0, 17.0]
[37, 38]
p02801
u072719787
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()\nnext = (chr(ord(a)+1))\n\nprint("\'"+a+"\'"+"の次は"+"\'"+next+"\'"+"です。")', 'a = input()\nnext = (chr(ord(a)+1))\n\nprint("\'"+a+"\'"+"の次は"+"\'"+next+"\'"+"です")', 'a = input()\nnext = (chr(ord(a)+1))\n\nprint("\'"+a+"\'"+"の次は"+"\'"+next+"\'"+"です")', 'a = input()\nprint(chr(ord(a)+1))']
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
['s219195800', 's911725371', 's914921040', 's832075767']
[2940.0, 3064.0, 2940.0, 2940.0]
[17.0, 18.0, 18.0, 17.0]
[89, 86, 86, 32]
p02801
u077291787
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.
['\ndef main():\n C = input().rstrip()\n ans = chr(ord(C) + 1)\n print(C)\n\n\nif __name__ == "__main__":\n main()\n', '\ndef main():\n C = input().rstrip()\n ans = chr(ord(C) + 1)\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n']
['Wrong Answer', 'Accepted']
['s317842377', 's930767288']
[2940.0, 2940.0]
[17.0, 24.0]
[136, 138]
p02801
u079022116
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']
['s662617942', 's092789769']
[2940.0, 2940.0]
[17.0, 17.0]
[27, 26]
p02801
u079427319
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 = chr(ord(a))\nprint(b)', 'a = input()\nb = chr(ord(a) + 1)\nprint(b)']
['Wrong Answer', 'Accepted']
['s740508658', 's898702181']
[2940.0, 2940.0]
[17.0, 17.0]
[36, 40]
p02801
u084320347
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 = ord(input())+1\nprint(a)\n', 'print(chr(ord(input()+1))', 'N,K,M = map(int,input().split())\n\nA = list(map(int,input().split()))\n\nif N * M - sum(A) > K:\n\tprint(-1)\nelse:\n \tprint(max(N*M -sum(A) , 0))\n', 'a = chr(ord(input())+1)\nprint(a)\n']
['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']
['s016822351', 's149028628', 's851723576', 's561698676']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[28, 25, 141, 33]
p02801
u086503932
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(chr(ord(input())+1))\n']
['Runtime Error', 'Accepted']
['s341976758', 's572081145']
[2940.0, 2940.0]
[17.0, 17.0]
[27, 27]
p02801
u088078693
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']
['s884458682', 's788203355']
[2940.0, 2940.0]
[17.0, 16.0]
[26, 26]
p02801
u088488125
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"\nfor i in range(25):\n if c==alp[i]:\n print(alh[i+1])\n break\n ', 'c=input()\nalp="abcdefghijklmnopqrstuvwxyz"\nfor i in range(25):\n if c==alp[i]:\n print(alp[i+1])\n break\n \n']
['Runtime Error', 'Accepted']
['s146458385', 's300579392']
[9072.0, 8960.0]
[21.0, 25.0]
[123, 124]
p02801
u089230684
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=int(input())\ndiez=10*n+10\nif(1<=n<=10000):\n if(n!=10):\n print(diez-n)\n else:\n print(n+99)\n', 'a=input()\n\nb=chr(a)\nc=chr(b)\nd=chr(c)\n\nprint(chr(ord(d)+1))', 'a=input()\n\nb=a\nc=b\nd=c\ne=d\nf=e\n\nprint(chr(ord(f)+1))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s530612528', 's676778399', 's306492746']
[2940.0, 2940.0, 2940.0]
[17.0, 18.0, 17.0]
[112, 59, 52]
p02801
u095094246
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.
['inp = input().split()\nn,k = int(inp[0]),int(inp[1])\na = [int(x) for x in input().split()]\na.sort()\nans =0\nfor ini in range(0,n-k+1):\n for end in range(ini+k-1,n):\n m = end-ini-1\n r = k-2\n combi = math.factorial(m) // (math.factorial(m - r) * math.factorial(r))\n ans += (a[end]-a[ini])*combi\n\nans = ans % (10**9+7)\nprint(ans)', 'import math\ninp = input().split()\nn,k = int(inp[0]),int(inp[1])\na = [int(x) for x in input().split()]\na.sort()\nans =0\nfor ini in range(0,n-k+1):\n for end in range(ini+k-1,n):\n m = end-ini-1\n r = k-2\n combi = math.factorial(m) // (math.factorial(m - r) * math.factorial(r))\n ans += (a[end]-a[ini])*combi\n\nans = ans % (10**9+7)\nprint(ans)', "abc='abcdefghijklmnopqrstuvwxyz'\nx=input()\nprint(abc[abc.index(x)+1])"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s359867814', 's750179230', 's695571846']
[3064.0, 3064.0, 2940.0]
[17.0, 17.0, 17.0]
[337, 349, 69]
p02801
u096022836
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 string\ninput = sys.stdin.readline\n\nC = input()\nif C == 'z': print('a')\nelse: print(string.ascii_lowercase[string.ascii_lowercase.index(C)+1])", "alpha = 'abcdefghijklmnopqrstuvwxyz'\nC = input().split()\nprint(alpha[alpha.index(C)+1])", 'import sys\nimport string\ninput = sys.stdin.readline\n\nC = input()\nprint(string.ascii_lowercase[string.ascii_lowercase.index(C)+1])\n', "alpha = 'abcdefghijklmnopqrstuvwxyz'\nC = input()\nprint(alpha[alpha.index(C)+1])"]
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s376663423', 's759972799', 's876335946', 's458056823']
[3768.0, 2940.0, 3768.0, 2940.0]
[25.0, 17.0, 24.0, 17.0]
[159, 87, 130, 79]
p02801
u100572972
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())\nZ='abcdefghijklmnopqrtuvwxyz'\nalpha = list(Z)\nl_in = [alpha[i+1] for i in range(len(alpha)-1) if C in alpha[i]]\nprint(l_in)", 'N,K,M=map(int,input().split())\npoint = list(map(int,input().split()))\nfull = N*K\ntar = M*N\nall_p = sum(point)\n\nif full- all_p >full-K:\n print(-1)\nelse:\n print(full-K-sum(point))', "C = str(input())\nZ='abcdefghijklmnopqrtuvwxyz'\nalpha = list(Z)\nl_in = [alpha[i+1] for i in range(len(alpha)-1) if C in alpha[i]]\nprint(l_in[0])"]
['Wrong Answer', 'Runtime Error', 'Accepted']
['s205714864', 's691723615', 's438822657']
[2940.0, 2940.0, 3064.0]
[17.0, 17.0, 17.0]
[140, 183, 143]
p02801
u106297876
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(str(c+1))', 'c = input()\nprint(char(c + 1))', 'c = input()\nprint(chr(ord(c) + 1))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s152237283', 's586257555', 's149373172']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 16.0]
[27, 30, 34]
p02801
u106985169
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\nresult = N*M - sum(A) \nif result > K:\n print("-1")\nelif result <=0:\n print("0")\nelse:\n print(result)', 'C = input()\nprint(chr(ord(C) + 1))']
['Runtime Error', 'Accepted']
['s004184207', 's352490514']
[3060.0, 2940.0]
[17.0, 17.0]
[180, 34]
p02801
u109133010
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()\ns="abcdefghijklmnopqrstuvwxyz"\nfor i in range(len(s)-1)\n if s[i]==a:\n\tprint(s[i+1])', 'a=input()\ns="abcdefghijklmnopqrstuvwxyz"\nfor i in range(len(s)-1):\n\tif s[i]==a:\n\t\tprint(s[i+1])\n']
['Runtime Error', 'Accepted']
['s037741439', 's624751794']
[2940.0, 2940.0]
[17.0, 18.0]
[94, 96]
p02801
u112317104
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\n\ndef solve():\n N = input()\n d = defaultdict(str)\n d['a'] = 'b'\n d['b'] = 'c'\n d['c'] = 'd'\n d['d'] = 'e'\n d['e'] = 'f'\n d['f'] = 'g'\n d['g'] = 'h'\n d['h'] = 'i'\n d['i'] = 'j'\n d['j'] = 'k'\n d['k'] = 'l'\n d['l'] = 'm'\n d['m'] = 'n'\n d['n'] = 'o'\n d['o'] = 'p'\n d['p'] = 'q'\n d['q'] = 'r'\n d['r'] = 's'\n d['s'] = 't'\n d['t'] = 'u'\n d['u'] = 'v'\n d['v'] = 'w'\n d['w'] = 'x'\n d['x'] = 'y'\n d['y'] = 'z'\n return d[N]", 'def solve():\n N = input()\n return chr(ord(N)+1)\n\nprint(solve())']
['Wrong Answer', 'Accepted']
['s083447435', 's414635178']
[3316.0, 2940.0]
[20.0, 17.0]
[531, 69]
p02801
u113310313
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\nP = list()\nfor m in range(M):\n n, rst = input().split()\n n = int(n)\n P.append( (n, rst) )\n\n\nck = [False for _ in range(N+1)]\n\nret_cor, ret_pen = 0, 0\n\nfor n, rst in P:\n if rst == 'AC':\n if not ck[n]:\n ck[n] = True\n ret_cor += 1\n\n else: # rst == 'WA'\n if not ck[n]:\n ret_pen += 1\n\nprint(ret_cor, ret_pen)\n", 'l = input()\n\nprint(chr(ord(l)+1))\n']
['Runtime Error', 'Accepted']
['s200440790', 's918456645']
[3064.0, 2940.0]
[18.0, 17.0]
[400, 34]
p02801
u114920558
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\nH, W = map(int, input().split())\nX = [input() for _ in range(H)]\nmaxloc = -10\n\ndef bfs(sx, sy, gx, gy):\n if(X[sx-1][sy-1] == \'#\' or X[gx-1][gy-1] == \'#\'):\n return -1\n else:\n dist = [[-1]*W for _ in range(H)]\n dist[sx-1][sy-1] = 0\n q = deque([(sx-1, sy-1)])\n while q:\n u, v = q.popleft()\n for i, j in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\n if not(0 <= u+i < H and 0 <= v+j < W):\n continue\n \n if(dist[u+i][v+j] >= 0 or X[u+i][v+j] == "#"):\n continue\n\n dist[u+i][v+j] = dist[u][v]+1\n q.append((u+i, v+j))\n\n return dist[gx-1][gy-1]\n\nfor i in range(H):\n for j in range(W):\n sx = i\n sy = j\n for k in range(i+1, H):\n for l in range(j+1, W):\n gx = k\n gy = l\n if(bfs(i+1, j+1, k+1, l+1) > maxloc):\n maxloc = bfs(i+1, j+1, k+1, l+1)\n \nprint(maxloc)\n', 's = "abcdefghijklmnopqrstuvwxyz"\nC = input()\nfor i in range(len(s)):\n if(s[i] == C):\n print(s[i+1])']
['Runtime Error', 'Accepted']
['s558298306', 's744153542']
[3316.0, 3064.0]
[21.0, 17.0]
[900, 103]
p02801
u115877451
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()\nn=[chr(i) for i in range(97, 97+26)]\n\nprint(n[1+n.count(a)]\n', 'a=input()\nn=[chr(i) for i in range(97, 97+26)]\n\nprint(n[1+n.index(a)])\n']
['Runtime Error', 'Accepted']
['s135954000', 's473972882']
[2940.0, 2940.0]
[17.0, 18.0]
[117, 118]
p02801
u124617040
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\nif x == "a":\n print("b")\nelif x == "b":\n print("c")\nelif x == "c":\n print("d")\nelif x == "d":\n print("e")\nelif x == "e":\n print("f")\nelif x == "f":\n print("g")\nelif x == "g":\n print("h")\nelif x == "h":\n print("i")\nelif x == "i":\n print("j")\nelif x == "j":\n print("k")\nelif x == "k":\n print("l")\nelif x == "l":\n print("m")\nelif x == "m":\n print("n")\nelif x == "n":\n print("o")\nelif x == "o":\n print("p")\nelif x == "p":\n print("q")\nelif x == "q":\n print("r")\nelif x == "r":\n print("s")\nelif x == "s":\n print("t")\nelif x == "t":\n print("u")\nelif x == "u":\n print("v")\nelif x == "v":\n print("w")\nelif x == "w":\n print("x")\nelif x == "x":\n print("y")\nelif x == "y":\n print("z")\nelse:\n print("era-")', 'C = input()\n \nif C == "a":\n print("b")\nelif C == "b":\n print("c")\nelif C == "c":\n print("d")\nelif C == "d":\n print("e")\nelif C == "e":\n print("f")\nelif C == "f":\n print("g")\nelif C == "g":\n print("h")\nelif C == "h":\n print("i")\nelif C == "i":\n print("j")\nelif C == "j":\n print("k")\nelif C == "k":\n print("l")\nelif C == "l":\n print("m")\nelif C == "m":\n print("n")\nelif C == "n":\n print("o")\nelif C == "o":\n print("p")\nelif C == "p":\n print("q")\nelif C == "q":\n print("r")\nelif C == "r":\n print("s")\nelif C == "s":\n print("t")\nelif C == "t":\n print("u")\nelif C == "u":\n print("v")\nelif C == "v":\n print("w")\nelif C == "w":\n print("x")\nelif C == "x":\n print("y")\nelif C == "y":\n print("z")\nelse:\n print("era-")']
['Runtime Error', 'Accepted']
['s477472785', 's820107579']
[3064.0, 3064.0]
[17.0, 17.0]
[784, 785]
p02801
u127025777
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.
["imp = imput()\nalp = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p',\n 'q','r','s','t','u','v','w','x','y','z']\nprint(alp[alp.index(str(imp)) + 2])", "imp = imput()\nalp = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p',\n 'q','r','s','t','u','v','w','x','y','z']\nprint(alp[alp.index(imp) + 2])", "imp = input()\nalp = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p',\n 'q','r','s','t','u','v','w','x','y','z']\nprint(alp[alp.index(imp) + 1])"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s141200283', 's157109026', 's744477906']
[2940.0, 2940.0, 2940.0]
[18.0, 17.0, 18.0]
[169, 164, 164]
p02801
u129961029
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())\n\ns+=1\nprint(s)', 's=str(input())\n\ns+=1\nprint(s)', 'alp=input()\nask=ord(alp)\nprint(chr(ask+1))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s402908919', 's634771072', 's759621450']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[29, 29, 42]
p02801
u131666536
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(str(ord(c)+1))', 'c = input()\nprint(chr(ord(c)+1))']
['Wrong Answer', 'Accepted']
['s046768919', 's678765158']
[2940.0, 2940.0]
[17.0, 17.0]
[32, 32]
p02801
u133936772
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()))\n\nA = n*m - sum(l)\n\nprint(max(0, A) if A <= k else -1)', "n, m = map(int, input().split())\n\nlac = [0] * n\nlwa = [0] * n\n\nfor i in range(m):\n p, s = input().split()\n p = int(p) - 1\n if lac[p] == 0:\n if s == 'WA':\n lwa[p] += 1\n if s == 'AC':\n lac[p] = 1\n\nprint(sum(lac), sum(x * y for x, y in zip(lac, lwa)))", 'print(chr(ord(input())+1))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s305475348', 's757087400', 's522693242']
[2940.0, 3064.0, 2940.0]
[17.0, 17.0, 17.0]
[125, 293, 26]
p02801
u137316733
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\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']\n\nfor i in len(a):\n if a[i] == C:\n print(a[i+1])", "C = str(input())\n\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']\n\nfor i in range(len(a)):\n if a[i] == C:\n print(a[i+1])"]
['Runtime Error', 'Accepted']
['s811031897', 's997318531']
[3060.0, 3060.0]
[17.0, 17.0]
[185, 192]
p02801
u147665268
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(' ')]\nwa = [0] * n\nac = [0] * n\nfor _ in range(m):\n problem, status = input().split(' ')\n problem = int(problem) - 1\n if status == 'WA':\n if ac[problem] == 0:\n wa[problem] += 1\n continue\n ac[problem] = 1", 'print(chr(ord(input() + 1)))', "n, m = [int(i) for i in input().split(' ')]\nwa = [0] * n\nac = [0] * n\nfor _ in range(m):\n problem, status = input().split(' ')\n problem = int(problem) - 1\n if status == 'WA':\n if ac[problem] == 0:\n wa[problem] += 1\n continue\n ac[problem] = 1\n\nno_ac = sum(ac)\nno_wa = sum(wa)\n\nprint(str(no_ac) + ' ' + str(no_wa))", 'print(chr(ord(input()) + 1))']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s361470940', 's531969102', 's785728559', 's945589896']
[3060.0, 2940.0, 3064.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[278, 28, 349, 28]
p02801
u152391261
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())\nans = [input().split() for _ in range(m)]\nac = []\nwn = []\nacn,wan = 0,0\nfor i in ans:\n for j in range(len(ac)):\n if i[0] != ac[j]:\n if i[1] == 'AC' :\n wan += wn.count(i[0])\n ac += [i[0]]\n acn += 1\n else :\n wn += [i[0]]\nprint(acn,wan)", 'print(chr(ord(input())+1))']
['Runtime Error', 'Accepted']
['s223243842', 's403890809']
[3064.0, 2940.0]
[17.0, 17.0]
[306, 26]
p02801
u152402277
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()\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]\n\nfor i in range(26):\n if list[i] = x:\n print(list[i+i])', "x = 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']\n\nfor i in range(26):\n if list[i] == x:\n print(list[i + 1])"]
['Runtime Error', 'Accepted']
['s560350962', 's314031102']
[2940.0, 3060.0]
[17.0, 18.0]
[128, 193]
p02801
u153259685
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.
['letter=input()\nalphabet="abcdefghijklmnopqrstuvwxyz"\nfor i in range(len(alphabet)):\n if alphabet[i]=letter:\n print(alphabet[i+1])', 'letter=input()\nalphabet="abcdefghijklmnopqrstuvwxyz"\nalphabet[i]=letter\nprint(alphabet[i+1])', 'letter=input()\nalphabet="abcdefghijklmnopqrstuvwxyz"\nfor i in range(len(alphabet)):\n if alphabet[i]=＝letter:\n print(alphabet[i+1])', 'letter=input()\nalphabet="abcdefghijklmnopqrstuvwxyz"\nfor i in range(len(alphabet)):\n if alphabet[i]==letter:\n print(alphabet[i+1])']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s077159412', 's269972985', 's653938616', 's455273755']
[2940.0, 2940.0, 2940.0, 3060.0]
[17.0, 17.0, 17.0, 19.0]
[133, 92, 136, 134]
p02801
u153427406
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())\n\nWA=[0]*n\nAC=[0]*n\n\nfor i in range(m):\n problem,status=input().split()\n problem=int(problem)\n\n if status=='WA' and AC[problem-1]==0:\n WA[problem-1]+=1\n elif status=='AC':\n AC[problem-1]=1\nprint(sum(WA),sum(AC))\n", "n,m=map(int,input().split())\n \nWA=[0]*n\nAC=[0]*n\n \nfor i in range(m):\n problem,status=input().split()\n problem=int(problem)\n \n if status=='WA':\n if AC[problem-1]==1:\n continue\n else:\n WA[problem-1]+=1\n elif status=='AC':\n AC[problem-1]=1\n\nfor i in range(n):\n if AC[i]==0:\n WA[i]=0\nprint(sum(AC),sum(WA))\n", 'character=input()\n\n\nprint(chr(ord(character)+1))\n']
['Runtime Error', 'Runtime Error', 'Accepted']
['s089126784', 's110126290', 's900587310']
[3060.0, 3064.0, 2940.0]
[17.0, 18.0, 17.0]
[267, 369, 49]
p02801
u156383602
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=map(int,input().split())\nd=0\ne=[int(x) for x in input().split()]\ng=0\nfor i in range(a-1):\n d+=int(e[i])\nfor i in range(b):\n if (d+i)/a>=c:\n print(i)\n g=1\n break\nif g==0:\n print(-1)', 'print(chr(ord(input())+1))']
['Runtime Error', 'Accepted']
['s777631394', 's621685512']
[3060.0, 2940.0]
[17.0, 17.0]
[216, 26]
p02801
u161419476
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\na = str(input())\n\n\n\nprint chr(ord(a) + 1)', '# -*- coding: utf-8 -*-\n\na = str(input())\n\n \n\nprint(chr(ord(a) + 1))']
['Runtime Error', 'Accepted']
['s729530226', 's737978515']
[2940.0, 2940.0]
[17.0, 17.0]
[111, 113]
p02801
u163531166
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()\ntmp = ord(s)\nans = tmp += 1\nprint(chr(ans))', 's = input()\ntmp = ord(s)\nans = tmp + 1\nprint(chr(ans))']
['Runtime Error', 'Accepted']
['s020168180', 's187951886']
[2940.0, 2940.0]
[18.0, 17.0]
[55, 54]
p02801
u167205647
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\ns = input()\nx = string.ascii_letters\nfor i in range(len(x)):\n if x[i] == s:\n print(x[i;1])\n break', 'import string\ns = input()\nx = string.ascii_letters\nfor i in range(len(x)):\n if x[i] == s:\n print(x[i+1])\n break']
['Runtime Error', 'Accepted']
['s401523463', 's831467612']
[2940.0, 3768.0]
[17.0, 24.0]
[128, 128]
p02801
u169696482
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()\nA = [chr(ord(\'a\') + i) for i in range(26)]\nz = A.index("c")\nprint(A[z+1])', "c = input()\nA = [chr(ord('a') + i) for i in range(26)]\nz = A.index(c)\nprint(A[z+1])"]
['Wrong Answer', 'Accepted']
['s374918820', 's678864375']
[2940.0, 2940.0]
[17.0, 17.0]
[85, 83]
p02801
u174181999
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())\nprint chr(ord(C) + 1)', 'C = str(input())\nprint(chr(ord(C) + 1))']
['Runtime Error', 'Accepted']
['s277589348', 's521583589']
[2940.0, 2940.0]
[18.0, 17.0]
[38, 39]
p02801
u175590965
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 = ord(input())\nprint(chr(c))', 'c = ord(input())\nprint(chr(c+1))']
['Wrong Answer', 'Accepted']
['s597717676', 's449930409']
[2940.0, 2940.0]
[17.0, 17.0]
[30, 32]
p02801
u179539980
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())))', 'print(chr(ord(input())+1))']
['Wrong Answer', 'Accepted']
['s568456831', 's040969736']
[2940.0, 2940.0]
[17.0, 17.0]
[24, 26]
p02801
u183200783
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))', 'print(chr(ord(input())+1))']
['Runtime Error', 'Accepted']
['s385823335', 's886223322']
[2940.0, 2940.0]
[17.0, 17.0]
[32, 26]
p02801
u194637581
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))', 's = "abcdefghijklmnopqrstuvwxyz"\nC = str(input())\nprint(s[(s.index(C)+1)%26])']
['Wrong Answer', 'Accepted']
['s817142567', 's164414111']
[2940.0, 2940.0]
[18.0, 17.0]
[26, 77]
p02801
u196675341
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\nalph = "abcdefghijklmnopqrstuvwxyz"\n\nalphabet_list = list(alph)\n\nprint(alphabet[alphabet_list.index(C)+1])', 'C =str(input())\n\nalph = "abcdefghijklmnopqrstuvwxyz"\n\nalphabet_list = list(alph)\nprint(alphabet_list)\n\nprint(alphabet[alphabet_list.index(C)+1])', 'C = input()\n\nalphabet = "abcdefghijklmnopqrstuvwxyz"\n\nalphabet_list = list[alphabet]\n\nprint(alphabet_list[alphabet_list.index[C]+1])', 'C =str(input())\n\nalph = "abcdefghijklmnopqrstuvwxyz"\n\nalphabet_list = list(alph)\n\nprint(alphabet_list[alphabet_list.index(C)+1])']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s242244813', 's749548213', 's852281350', 's933835657']
[2940.0, 2940.0, 2940.0, 2940.0]
[18.0, 18.0, 17.0, 17.0]
[123, 144, 132, 128]
p02801
u197300773
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\nimport sys\n\ndef func(a,b,c,d,e,f):\n try:\n aa=(c-e)**2+(d-f)**2\n bb=(a-e)**2+(b-f)**2\n cc=(a-c)**2+(b-d)**2\n o,p,q=bb+cc-aa,cc+aa-bb,aa+bb-cc\n m=aa*o+bb*p+cc*q\n\n px=(aa*o*a+bb*p*c+cc*q*e)/m\n py=(aa*o*b+bb*p*d+cc*q*f)/m\n\n r = math.hypot(px-a, py-b)\n return px,py,r\n\n except ZeroDivisionError:\n return 0,0,10**6\n\nn=int(input())\n\nx,y=[],[]\nfor i in range(n):\n a,b=map(int,input().split())\n x.append(a)\n y.append(b)\n\n\nif n==2:\n print(math.hypot(x[0]-x[1],y[0]-y[1])/2)\n sys.exit()\nelif n==3:\n px,py,r=func(x[0],y[0],x[1],y[1],x[2],y[2])\n print(r)\n sys.exit()\n \n\nminr=10**6\nfor i in range(n-2):\n for j in range(i+1,n-1):\n for k in range(j+1,n):\n px,py,r=func(x[i],y[i],x[j],y[j],x[k],y[k])\n\n sgn=1\n for p in range(n):\n if math.hypot(x[p]-px,y[p]-py)>r:\n sgn=0\n if sgn==1: minr=min(minr,r)\n\nprint(minr)', 'import math\nimport sys\n\ndef func(a,b,c,d,e,f):\n try:\n aa = a * a\n bb = b * b\n cc = c * c\n dd = d * d\n ee = e * e\n ff = f * f\n\n py = ((e - a) * (aa + bb - cc - dd) - (c - a) * (aa + bb - ee- ff)) / (2 * (e - a)*(b - d) - 2 * (c - a) * (b - f))\n\n px = (2 * (b - f) * py - aa - bb + ee + ff) / (2 * (e - a)) \\\n if (c == a) else (2 * (b - d) * py - aa - bb + cc + dd) / (2 * (c - a))\n\n r = math.hypot(px - a, py - b)\n return px,py,r\n\n except ZeroDivisionError:\n return 0,0,10**6\n\nn=int(input())\n\nx,y=[],[]\nfor i in range(n):\n a,b=map(int,input().split())\n x.append(a)\n y.append(b)\n\n\nif n==2:\n print(math.hypot(x[0]-x[1],y[0]-y[1])/2)\n sys.exit()\nelif n==3:\n px,py,r=func(x[0],y[0],x[1],y[1],x[2],y[2])\n print(r)\n sys.exit()\n \n\nminr=10**6\nfor i in range(n-2):\n for j in range(i+1,n-1):\n for k in range(j+1,n):\n px,py,r=func(x[i],y[i],x[j],y[j],x[k],y[k])\n\n sgn=1\n for p in range(n):\n if math.hypot(x[p]-px,y[p]-py)>r+10**(-5):\n sgn=0\n if sgn==1: minr=min(minr,r)\n\nprint(minr)', 'import math\nimport sys\n\ndef func(a,b,c,d,e,f):\n try:\n aa = a * a\n bb = b * b\n cc = c * c\n dd = d * d\n ee = e * e\n ff = f * f\n\n py = ((e - a) * (aa + bb - cc - dd) - (c - a) * (aa + bb - ee- ff)) / (2 * (e - a)*(b - d) - 2 * (c - a) * (b - f))\n\n px = (2 * (b - f) * py - aa - bb + ee + ff) / (2 * (e - a)) \\\n if (c == a) else (2 * (b - d) * py - aa - bb + cc + dd) / (2 * (c - a))\n\n r = math.hypot(px - a, py - b)\n return px,py,r\n\n except ZeroDivisionError:\n return 0,0,10**6\n\nn=int(input())\n\nx,y=[],[]\nfor i in range(n):\n a,b=map(int,input().split())\n x.append(a)\n y.append(b)\n\n\nif n==2:\n print(math.hypot(x[0]-x[1],y[0]-y[1])/2)\n sys.exit()\nelif n==3:\n px,py,r=func(x[0],y[0],x[1],y[1],x[2],y[2])\n print(r)\n sys.exit()\n \n\nminr=10**6\nfor i in range(n-2):\n for j in range(i+1,n-1):\n for k in range(j+1,n):\n px,py,r=func(x[i],y[i],x[j],y[j],x[k],y[k])\n\n sgn=1\n for p in range(n):\n if math.hypot(x[p]-px,y[p]-py)>r:\n sgn=0\n if sgn==1: minr=min(minr,r)\n\nprint(minr)', 'n=input()\nans=chr(ord(n)+1)\n\nprint(ans)']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s132338894', 's160488739', 's652678853', 's528840396']
[3188.0, 3192.0, 3192.0, 2940.0]
[17.0, 18.0, 18.0, 17.0]
[998, 1179, 1170, 39]
p02801
u197833153
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\nnext = ord('C') + 1\nprint(chr(next))", 'C = input()\n\nnext = ord(C) + 1 \nprint(chr(next))']
['Wrong Answer', 'Accepted']
['s947317460', 's620451355']
[8904.0, 9012.0]
[29.0, 25.0]
[49, 102]
p02801
u201082459
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(shr(ord(c)+1))', 'c = input()\nprint(chr(ord(c)+1))']
['Runtime Error', 'Accepted']
['s708735313', 's150685289']
[2940.0, 2940.0]
[16.0, 17.0]
[32, 32]
p02801
u201928947
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())\nACcount = 0\nWAcount = 0\nWA = []\nAC = []\nfor i in range(n):\n WA.append(0)\n AC.append(1)\nfor i in range(m):\n p,s = input().split()\n p = int(p)\n if s == "WA":\n if WA[p-1] >= 0:\n WA[p-1] += 1\n if s == "AC":\n ACcount += AC[p-1]\n AC[p-1] = 0\n if WA[p-1] >= 0:\n WAcount += WA[p-1]\n WA[p-1] = -1\nprint(ACcount,WAcount)', '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]\ns = input()\nfor i in range(25):\n if s == l[i]:\n print(l[i+1])', '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]\ns = input()\nfor i in range(25):\n if s = l[i]:\n print(l[i+1])', '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"]\ns = input()\nfor i in range(25):\n if s == l[i]:\n print(l[i+1])']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s058392714', 's132321877', 's560758360', 's287535659']
[3064.0, 3060.0, 2940.0, 3060.0]
[17.0, 17.0, 17.0, 17.0]
[376, 123, 122, 175]
p02801
u207576418
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())\na = 500*k\nif a >= x:\n print('Yes')\nelse:\n print('No')\n", 'c = input()\nans = chr(ord(c)+1)\nprint(ans)\n']
['Runtime Error', 'Accepted']
['s964231105', 's043571698']
[2940.0, 2940.0]
[18.0, 17.0]
[91, 43]
p02801
u208464243
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\nans = M*N-sum(A)\n\nif ans > K:\n print(-1)\nelif ans < 0:\n print(0)\nelse:\n print(ans)\n\n', 'a = input()\nb = chr(ord(a)+1)\nprint(b)']
['Runtime Error', 'Accepted']
['s472787289', 's490716997']
[2940.0, 2940.0]
[17.0, 17.0]
[163, 38]
p02801
u209367350
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 = "abcdefghijklmnopqrstuvwyz"\n\ns = input()\nprint(a.index[a.index(s)+1])', 'a = "abcdefghijklmnopqrstuvwyz"\n\ns = input()\nprint(a[a.index(s)+1])']
['Runtime Error', 'Accepted']
['s937023312', 's583626894']
[2940.0, 2940.0]
[17.0, 17.0]
[73, 67]
p02801
u212053970
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))", 's = input()\nprint chr(ord(s) + 1)', 's = input()\nprint(chr(ord(s) + 1))']
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
['s011658594', 's143763372', 's546808511', 's083130043']
[2940.0, 2940.0, 2940.0, 2940.0]
[18.0, 18.0, 17.0, 17.0]
[36, 36, 33, 34]
p02801
u213257529
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 itertools\n\nN,K = map(int,input().split())\nA = sorted(list(map(int,input().split())))\n\ndef fun(a):\n return max(a)-min(a)\ndef fun1(a):\n return sum(a) % (1000000007)\n_1 = [fun(i) for i in itertools.combinations([int(i) for i in A], K)] \nprint(fun1(_1))\n\nmod = 10**9 + 7\n \ndef nCr(n,r):\n if n < r:\n return 0\n if n < 0 or r < 0:\n return 0\n return (fac[n] * facinv[r] * facinv[n - r]) % mod', "asc = 'abcdefghijklmnopqrstuvwxyz'\nt=input()\nfor i in range(25):\n if t == asc[i]:\n print(asc[i+1])\n"]
['Runtime Error', 'Accepted']
['s046288283', 's651844416']
[3064.0, 2940.0]
[17.0, 17.0]
[409, 109]
p02801
u218071226
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)', 'import time\n\n# success\n\n# https://blogarithms.github.io/articles/2019-01/fermats-theorem\n\n\nMOD = 1000000007\nMOD2 = 1000000005\nMAX = 100001\n\n# facs = [1 for _ in range(MAX)]\n\n\n\n\n\n\ndef get_facs(n, k):\n\tif k<n-k:\n\t\tk = n-k\n\tr = 1\n\tfor i in range(k+1, n+1):\n\t\tr *= i\n\tfor i in range(2, n-k+1):\n\t\tr /= i\n\treturn r\n\ndef choose(n, k):\n\n\tif k==0 or n==k:\n\t\treturn 1\n\tif n==0:\n\t\treturn 0\n\tif k>n:\n\t\treturn 0\n\treturn get_facs(n, k)\n\n\n\ndef main():\n\tN, K = map(int, input().split())\n\tnumbers = sorted(map(int, input().split()))\n\tif K==1:\n\t\treturn 0\n\tif K==N:\n\t\treturn abs(numbers[0] - numbers[-1])\n\n\tscore = 0\n\tfor i, x in enumerate(numbers):\n\t\tscore += ((choose(i, K-1) - choose(N-1-i, K-1)) * x)\n\n\treturn int(score%MOD)\n\t\n\t\nprint(main())\n', 'print(chr(1+ord(input())))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s667781833', 's753665937', 's919381253']
[2940.0, 3064.0, 2940.0]
[17.0, 18.0, 17.0]
[25, 842, 26]
p02801
u221842690
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()\nascii_a = ord(a)\n\nnext_ascii_a = ascii_a +1\nchr(next_ascii_a)', 'a = input()\nascii_a = ord(a)\n\nnext_ascii_a = ascii_a +1\nprint(chr(next_ascii_a))\n']
['Wrong Answer', 'Accepted']
['s338786416', 's518011832']
[2940.0, 2940.0]
[17.0, 17.0]
[89, 97]
p02801
u223574877
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"\nb="c"\nc="d"\nd="e"\ne="f"\nf="g"\ng="h"\nh="i"\ni="j"\nj="k"\nk="l"\nl="m"\nm="n"\nn="o"\no="p"\np="q"\nq="r"\nr="s"\ns="t"\nt="u"\nu="v"\nv="w"\nw="x"\nx="y"\ny="z"\nz="a"\n', '\nAA=input()\n\nif AA == "a":\n\tprint("b")\nelif AA == "b":\n\tprint("c")\nelif AA == "c":\n\tprint("d")\nelif AA == "d":\n\tprint("e")\nelif AA == "e":\n\tprint("f")\nelif AA == "f":\n\tprint("g")\nelif AA == "g":\n\tprint("h")\nelif AA == "h":\n\tprint("i")\nelif AA == "i":\n\tprint("j")\nelif AA == "j":\n\tprint("k")\nelif AA == "k":\n\tprint("l")\nelif AA == "l":\n\tprint("m")\nelif AA == "m":\n\tprint("n")\nelif AA == "n":\n\tprint("o")\nelif AA == "o":\n\tprint("p")\nelif AA == "p":\n\tprint("q")\nelif AA == "q":\n\tprint("r")\nelif AA == "r":\n\tprint("s")\nelif AA == "s":\n\tprint("t")\nelif AA == "t":\n\tprint("u")\nelif AA == "u":\n\tprint("v")\nelif AA == "v":\n\tprint("w")\nelif AA == "w":\n\tprint("x")\nelif AA == "x":\n\tprint("y")\nelif AA == "y":\n\tprint("z")\nelse:\n\tprint("a")\n']
['Wrong Answer', 'Accepted']
['s894505596', 's369612935']
[3060.0, 3064.0]
[17.0, 17.0]
[156, 729]
p02801
u223904637
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,w=map(int,input().split())\nl=[]\nfor i in range(h):\n l.append(list(input()))\nfor i in range(h):\n for j in range(w):\n if l[i][j]=='.':\n s=[i,j]\nv=[[0 for i in range(w)] for j in range(h)] \nv[s[0]][s[1]]=1\nmc=0\nms=s\nq=[[s,0]]\nwhile q:\n p=q.pop(0)\n x=p[0][0]\n y=p[0][1]\n c=p[1]\n k=[[0,1],[0,-1],[1,0],[-1,0]]\n for j in k:\n nx=x+j[0]\n ny=y+j[1]\n if 0<=nx<h and 0<=ny<w and l[nx][ny]=='.' and v[nx][ny]==0:\n v[nx][ny]=1\n q.append([[nx,ny],c+1])\n if mc<c+1:\n mc=c+1\n ms=[nx,ny]\nv=[[0 for i in range(w)] for j in range(h)] \nv[ms[0]][ms[1]]=1\nans=0\nq=[[ms,0]]\nwhile q:\n p=q.pop(0)\n x=p[0][0]\n y=p[0][1]\n c=p[1]\n k=[[0,1],[0,-1],[1,0],[-1,0]]\n for j in k:\n nx=x+j[0]\n ny=y+j[1]\n if 0<=nx<h and 0<=ny<w and l[nx][ny]=='.' and v[nx][ny]==0:\n v[nx][ny]=1\n q.append([[nx,ny],c+1])\n ans=max(ans,c+1)\n #ms=[nx,ny]\nprint(ans)", "al=list('abcdefghijklmnopqrstuvwxyz')\na=input()\nprint(al[al.index(a)+1])"]
['Runtime Error', 'Accepted']
['s053082891', 's538883836']
[3192.0, 2940.0]
[18.0, 17.0]
[1035, 72]
p02801
u224993839
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()\nt=chr(ord(a)+1)\nprint(t', 'try:\n n=input()\n c=chr(ord(n)+1)\n print(c)\nexcept:\n pass']
['Runtime Error', 'Accepted']
['s307876278', 's208765210']
[3064.0, 2940.0]
[17.0, 17.0]
[33, 60]
p02801
u227082700
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(chr(ord(input())+1))']
['Wrong Answer', 'Accepted']
['s256281279', 's134680775']
[2940.0, 2940.0]
[17.0, 18.0]
[26, 26]
p02801
u227085629
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)', 'a = input()\nb = chr(ord(a) + 1)\nprint(b)']
['Runtime Error', 'Accepted']
['s940835623', 's698537896']
[2940.0, 2940.0]
[17.0, 17.0]
[33, 40]
p02801
u228232845
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()\na = 'abcdefghijklmnopqrstuvwxyz'\nans = 0\nfor i in range(len(a)):\n if a[i]=='s':\n ans=i\n break\nprint(a[ans])", "s = input()\na = 'abcdefghijklmnopqrstuvwxyz'\nans = 0\nfor i in range(len(a)):\n if a[i]=='s':\n ans=i+1\n break\nprint(a[ans])", "s = input()\na = 'abcdefghijklmnopqrstuvwxyz'\nans = 0\nfor i in range(len(a)-1):\n if a[i]==s:\n ans=i+1\n break\nprint(a[ans])"]
['Wrong Answer', 'Wrong Answer', 'Accepted']
['s473578071', 's748740958', 's433174494']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[126, 128, 128]
p02801
u229452810
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)', 'a = input()\nprint(chr(ord(a)+1))']
['Runtime Error', 'Accepted']
['s620218619', 's798955615']
[2940.0, 2940.0]
[17.0, 17.0]
[31, 32]
p02801
u234140613
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.
["list_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()\nprint(l[l.index(c)+1])", "list_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()\nprint(list_a[list_a.index(c)+1])"]
['Runtime Error', 'Accepted']
['s021415245', 's740806771']
[2940.0, 2940.0]
[17.0, 17.0]
[145, 155]
p02801
u237601489
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'\nfor i in range(26) :\n if abc[i] == c\n print(abc[i+1])\n break", 'c=int(input())\nif c == a :\n print("b")\nelif c == b :\n print("c")\nelif c == c :\n print("d")\nelif c == d :\n print("e")\nelif c == e :\n print ("f")\nelif c == f :\n print("g")\nelif c == g :\n print("h")\nelif c == h :\n print("i")\nelif c == i :\n print("j")\nelif c == j :\n print("k")\nelif c == k :\n print("l")\nelif c == l :\n print("m")\nelif c == m :\n print("n")\nelif c == n :\n print("o")\nelif c == o :\n print("p")\nelif c == p :\n print("q")\nelif c == q :\n print("r")\nelif c== r :\n print("s")\nelif c == s :\n print("t")\nelif c == t :\n print("u")\nelif c == u :\n print("v")\nelif c == v :\n print("w")\nelif c == w :\n print("x")\nelif c == x :\n print("y")\nelif c == y :\n print("z")', 'c=input()\nif c == a :\n print("b")\nelif c == b :\n print("c")\nelif c == c :\n print("d")\nelif c == d :\n print("e")\nelif c == e :\n print ("f")\nelif c == f :\n print("g")\nelif c == g :\n print("h")\nelif c == h :\n print("i")\nelif c == i :\n print("j")\nelif c == j :\n print("k")\nelif c == k :\n print("l")\nelif c == l :\n print("m")\nelif c == m :\n print("n")\nelif c == n :\n print("o")\nelif c == o :\n print("p")\nelif c == p :\n print("q")\nelif c == q :\n print("r")\nelif c== r :\n print("s")\nelif c == s :\n print("t")\nelif c == t :\n print("u")\nelif c == u :\n print("v")\nelif c == v :\n print("w")\nelif c == w :\n print("x")\nelif c == x :\n print("y")\nelif c == y :\n print("z")', 'c=input()\nprint(c+1)', 'c=str(input())\nprint(c+1)', 'c=str()\nprint(c+1)', 'c=int(input())\nprint(c+1)', 'c=int(input())\nif c == a :\n print("b")\nelif c == b :\n print("c")\nelif c == c :\n print("d")\nelif c == d :\n print("e")\nelif c == e :\n print ("f")\nelif c == f :\n print("g")\nelif c == g :\n print("h")\nelif c == h :\n print("i")\nelif c == i :\n print("j")\nelif c == j :\n print("k")\nelif c == k :\n print("l")\nelif c == l :\n print("m")\nelif c == m :\n print("n")\nelif c == n :\n print("o")\nelif c == o :\n print("p")\nelif c == p :\n print("q")\nelif c == q :\n print("r")\nelif c== r :\n print("s")\nelif c == s :\n print("t")\nelif c == t :\n print("u")\nelif c == u :\n print("v")\nelif c == v :\n print("w")\nelif c == w :\n print("x")\nelif c == x :\n print("y")\nelif c == y :\n print("z")\n', "c = input()\nabc = 'abcdefghijklmnopqrstuvwxyz'\nfor i in range(26) :\n if abc[i] == c :\n print(abc[i+1])\n break"]
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
['s053524852', 's054364970', 's322349029', 's437432895', 's517853078', 's691190920', 's769267938', 's983937759', 's947380372']
[2940.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 2940.0]
[17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0]
[124, 737, 732, 20, 25, 18, 25, 738, 126]
p02801
u238940874
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()))\nx = 0\nfor i in range(n-1):\n x+=a[i]\nif n*m - x <= k:\n print(n*m-x)\nelse:\n print(-1)', 'c = input()\nprint(chr(ord(c) + 1))']
['Runtime Error', 'Accepted']
['s946593218', 's437398226']
[2940.0, 2940.0]
[18.0, 17.0]
[160, 34]
p02801
u241190800
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(chir(ord(input())+1))', 'print(chr(ord(input()) + 1))']
['Runtime Error', 'Accepted']
['s953104796', 's925733739']
[2940.0, 2940.0]
[17.0, 17.0]
[27, 28]
p02801
u243438890
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()\nif C == "z":\n pass\nelse:\n print(C)', 'C = input()\nprint(chr(ord(C)+1))']
['Wrong Answer', 'Accepted']
['s733980456', 's348995432']
[2940.0, 2940.0]
[17.0, 17.0]
[48, 32]
p02801
u244836567
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(a+1)', 'a=input()\nif a=="a":\n print("b")\nif a=="b":\n print("c")\nif a=="c":\n print("d")\nif a=="d":\n print("e")\nif a=="e":\n print("f")\nif a=="f":\n print("g")\nif a=="g":\n print("h")\nif a=="h":\n print("i")\nif a=="i":\n print("j")\nif a=="j":\n print("k")\nif a=="k":\n print("l")\nif a=="l":\n print("m")\nif a=="m":\n print("n")\nif a=="n":\n print("o")\nif a=="o":\n print("p")\nif a=="p":\n print("q")\nif a=="q":\n print("r")\nif a=="r":\n print("s")\nif a=="s":\n print("t")\nif a=="t":\n print("u")\nif a=="u":\n print("v")\nif a=="v":\n print("w")\nif a=="w":\n print("x")\nif a=="x":\n print("y")\nif a=="y":\n print("z")']
['Runtime Error', 'Accepted']
['s326929268', 's963041674']
[9040.0, 9184.0]
[24.0, 29.0]
[20, 609]
p02801
u246401133
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.
['letter = ord(input())\nprint(chr(c+1))', 'letter = ord(input())\nprint(chr(letter+1))']
['Runtime Error', 'Accepted']
['s399261574', 's941930094']
[8848.0, 9012.0]
[27.0, 26.0]
[37, 42]
p02801
u254050469
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=(int(x) for x in input().split())\na=[int(x) for x in input().split()]\n\nsum = 0\nfor ai in a:\n sum+= ai\n\nt = m * n - sum\nif t <= 0:\n print(0)\nelif t<= k:\n print(t)\nelse:\n print(-1)\n\n\n\n', "b = bytearray(input().encode())[0] + 0x01\nprint(b.to_bytes(1, 'big' ).decode())"]
['Runtime Error', 'Accepted']
['s644247449', 's679426636']
[3064.0, 2940.0]
[17.0, 17.0]
[201, 79]
p02801
u260216890
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\nN,K=map(int,input().split())\nA=list(map(int,input().split()))\nA.sort()\nA=np.array(A)\nMOD=10**9+7\n\ndef cmb(n, k, mod, fac, ifac): #calc nCk under mod\n k = min(k, n-k)\n return fac[n] * ifac[k] * ifac[n-k] % mod\n\ndef make_tables(mod, n): #Make factorial and inverse tables under mod \n fac = [1, 1] # factorial table\n ifac = [1, 1] #factorial of inverse table\n inverse = [0, 1] #inverse\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\nMOD=10**9+7\nNmax=10**5\nfac,ifac = make_tables(MOD,Nmax)\n\ncombs=[0]*N\nfor i in range(0,N-K+1):\n combs[i]=cmb(N-i-1, K-1, MOD, fac, ifac)\n#print(combs)\nneg=combs\npos=sorted(combs)\npos=np.array(pos)\nneg=np.array(neg)\nX=(A*pos-A*neg)\nprint(X.sum()%MOD)', "alpha='abcdefghijklmnopqrstuvwxyza'\ns=input()\nfor i in range(len(alpha)):\n if s==alpha[i]:\n print(alpha[i+1])\n break"]
['Runtime Error', 'Accepted']
['s226045812', 's224227822']
[12504.0, 2940.0]
[149.0, 17.0]
[870, 123]
p02801
u261103969
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\nfrom fractions import gcd\nfrom itertools import permutations, combinations, accumulate\nfrom collections import deque\nfrom heapq import heappush, heappop, heapify\nimport math\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**6)\nMOD = 10**9 + 7\n\ndef main():\n c = ord(input())\n c += 1\n if c == 123:\n c = 97\n print(chr(c))\n\nif __name__ == '__main__':\n main()", "import sys\nfrom fractions import gcd\nfrom itertools import permutations, combinations, accumulate\nfrom collections import deque\nfrom heapq import heappush, heappop, heapify\nimport math\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**6)\nMOD = 10**9 + 7\n\ndef main():\n c = ord(input())\n c += 1\n if c == 123:\n c = 97\n print(chr(c))\n\nif __name__ == '__main__':\n main()", "def main():\n c = ord(input())\n c += 1\n if c == 123:\n c = 97\n print(chr(c))\n\nif __name__ == '__main__':\n main()"]
['Runtime Error', 'Runtime Error', 'Accepted']
['s513802466', 's717092821', 's518352284']
[5052.0, 5052.0, 2940.0]
[36.0, 35.0, 17.0]
[390, 390, 132]
p02801
u261700262
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())\npoint = input().split()\nthr = 0\ngood = 0\nbad = 0\n\nif M == 0:\n print("0 0")\nelse:\n for i in range(M - 1):\n if point[0] == str(thr):\n point = input().split()\n continue\n elif point[1] == "AC":\n good += 1\n thr = point[0]\n point = input().split()\n continue\n elif point[1] == "WA":\n bad += 1\n point = input().split()\n continue\n print(str(good), str(bad))\n', 'tmp = ord(input())\ntmp += 1\nprint(chr(tmp))\n']
['Runtime Error', 'Accepted']
['s654062811', 's964649334']
[3064.0, 2940.0]
[17.0, 18.0]
[511, 44]
p02801
u263277850
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/env python3\n# -*- coding: utf-8 -*-\n"""\nCreated on Sun Jan 12 22:19:09 2020\n\n@author: nanasakiwataru\n"""\n\ndef alphabet(C):\n ans = chr(ord(C) + 1)\n st = C + \'の次は\'+ n + \'です。\'\n return st\n\nn = alphabet(\'a\')\nprint(n)\n\n', '#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n"""\nCreated on Sun Jan 12 22:19:09 2020\n\n@author: nanasakiwataru\n"""\n\ndef alphabet(C):\n ans = chr(ord(C) + 1)\n st =C + \'の次は\' + ans + \'です。\'\n return st\n', '#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n"""\nCreated on Sun Jan 12 22:19:09 2020\n\n@author: nanasakiwataru\n"""\n\ndef alphabet(C):\n ans = chr(ord(C) + 1)\n st = C + \'の次は\'+ ans + \'です。\'\n return st\n\nn = alphabet(\'a\')\nprint(n)\n\n', '#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n"""\nCreated on Sun Jan 12 22:19:09 2020\n\n@author: nanasakiwataru\n"""\n\n\nans = chr(ord(C) + 1)\nst = C + \'の次は\' + ans + \'です。\'\nprint(st)\n', '#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n"""\nCreated on Sun Jan 12 22:19:09 2020\n\n@author: nanasakiwataru\n"""\n\nC = input()\nans = chr(ord(C) + 1)\nst = C + \'の次は\' + ans + \'です。\'\nprint(st)\n', '#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n"""\nCreated on Sun Jan 12 22:19:09 2020\n\n@author: nanasakiwataru\n"""\n\nC = input()\nans = chr(ord(C) + 1)\nprint(ans)']
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s151616377', 's166569140', 's266102226', 's757994167', 's872192465', 's792718087']
[2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0, 17.0, 17.0]
[246, 219, 248, 191, 202, 161]
p02801
u264681142
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 = lambda c: chr(c+64)\ns = str(input())\n\nfor i in range(1,26):\n\tif s == num(i).lower:\n print(num(i+1))\n\n', 's = str(input())\n\nprint(chr(ord(s) + 1))']
['Runtime Error', 'Accepted']
['s399911447', 's081390606']
[2940.0, 3064.0]
[16.0, 17.0]
[112, 40]
p02801
u264694632
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(chr(ord(input()) + 1))']
['Runtime Error', 'Accepted']
['s858167067', 's019824231']
[2940.0, 2940.0]
[17.0, 17.0]
[29, 28]
p02801
u265118937
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.
['alph = input()\nprint(ord(alph+1))', 'alph = input()\nprint(ord(alph)+1)', 'alph = input()\nprint(chr(ord(alph)+1))']
['Runtime Error', 'Wrong Answer', 'Accepted']
['s489792558', 's910169338', 's014018069']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 18.0]
[33, 33, 38]
p02801
u268554510
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,W = map(int,input().split())\nS = [list(input()) for _ in range(H)]\nfrom collections import deque\nans = 0\nfor i in range(H):\n for j in range(W):\n if S[i][j]=='#':\n continue\n inf = 10**5\n A = [[inf]*W for _ in range(H)]\n A[i][j]=0\n judge = [[False]*W for _ in range(H)]\n judge[i][j]=True\n q = deque([[i,j]])\n while q:\n a = q.popleft()\n x=a[0]\n y=a[1]\n b = A[x][y]\n for m in [[x-1,y],[x+1,y],[x,y-1],[x,y+1]]:\n h = m[0]\n w = m[1]\n if (h<0)or(h>H-1)or(w<0)or(w>W-1):\n continue\n if S[h][w]=='#':\n continue\n c = b+1\n if judge[h][w]:\n continue\n A[h][w]=c\n judge[h][w]=True\n q.append([h,w])\n \n A = [a for b in A for a in b if a!=inf]\n ans = max(ans,max(A))\n \nprint(ans)", 'C = input()\nprint(chr(ord(C)+1))']
['Runtime Error', 'Accepted']
['s138118591', 's865584505']
[3064.0, 2940.0]
[17.0, 17.0]
[824, 32]
p02801
u269235541
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+1)\nwa = 0\nfor i in range(M):\n p,s = input().split()\n p = int(p)\n if s == 'AC':\n if ac[p] != -1:\n ac[p] = -1\n else:\n if ac[p] != -1:\n wa +=1\nprint(ac.count(-1),wa)", 'alp = "abcdefghijklmnopqrstuvwxyz"\nC = input()\nn = 0\nwhile alp[n] != C:\n n += 1\nprint(alp[n+1]) ']
['Runtime Error', 'Accepted']
['s608147001', 's592978738']
[3060.0, 2940.0]
[17.0, 17.0]
[254, 99]
p02801
u269724549
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()\nd=ord(c)+1\ne=chr(d)\nprint(e)']
['Runtime Error', 'Accepted']
['s701898964', 's408697201']
[2940.0, 2940.0]
[17.0, 17.0]
[29, 38]
p02801
u269778596
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)', 'a = input()\nprint(chr(ord(a)+1))']
['Runtime Error', 'Accepted']
['s629304534', 's240732207']
[2940.0, 2940.0]
[17.0, 17.0]
[31, 32]
p02801
u270178188
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\n\n\nN = int(input())\nx = [0] * N\ny = [0] * N\nxy = []\nfor i in range(N):\n xy.append(list(map(int, input().split())))\n\n\ndef signed_area(p1, p2, p3):\n area = (p2[0] - p1[0]) * (p3[1] - p1[1])\\\n - (p3[0] - p1[0]) * (p2[1] - p1[1])\n return area/2\n\n\ndef convex_hull(p_list):\n p_sort = []\n for i in p_list:\n p_sort.append(i[0])\n\n \n min_index = p_sort.index(min(p_sort))\n min_p = p_list.pop(min_index)\n p_list.insert(0, min_p)\n\n \n p_length = len(p_list)\n count = 0\n index = 0\n while True:\n count += 1\n index += 1\n\n area_sign = signed_area(p_list[0], p_list[index], p_list[index + 1])\n\n \n if area_sign < 0:\n p_list[index], p_list[index + 1] = p_list[index + 1], p_list[index]\n count = 0\n\n if count == p_length - 1:\n break\n\n if index == p_length - 2:\n index = 0\n\n \n index = -1\n count = 0\n while True:\n index += 1\n count += 1\n\n area_sign = signed_area(p_list[index],\n p_list[index + 1],\n p_list[index + 2])\n if area_sign < 0:\n del p_list[index + 1]\n count = 0\n\n if count == len(p_list):\n break\n\n if index >= len(p_list) - 3:\n index = -1\n return p_list\n\n\ndef euc(p1, p2):\n return (p1[0]-p2[0])**2 + (p1[1]-p2[1])**2\n\n\ndef find_max_euc(xy):\n ans = []\n max_dis = 0\n n = len(xy)\n for i in range(n):\n for j in range(n):\n dis = math.sqrt(euc(xy[j], xy[i]))\n if dis >= max_dis+1e-05:\n max_dis = dis\n ans = [xy[j], xy[i]]\n return ans\n\n\nif len(xy) == 2:\n dis = math.sqrt(euc(xy[0], xy[1]))\n print(dis/2)\nelse:\n xy = convex_hull(xy)\n xy = find_max_euc(xy)\n dis = math.sqrt(euc(xy[0], xy[1]))\n print(dis/2)\n', 'C = input()\nprint(chr(ord(C)+1))\n']
['Runtime Error', 'Accepted']
['s257374081', 's200336935']
[3192.0, 2940.0]
[18.0, 17.0]
[2168, 33]
p02801
u271230052
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.upper()\nc=chr(ord(c+1))\nprint(c)', 'c=input()\nchr(ord(c+1))\nprint(c)\n', 'c=input()\nc=chr(ord(c+1))\nprint(c)', 'x =input()\nx=x.upper()\nx=chr(ord(x) + 1)\nprint(x)', 'c=input()\nprint(chr(ord(c)+1))']
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s229527463', 's236377132', 's249477608', 's716490289', 's282405375']
[2940.0, 2940.0, 2940.0, 3064.0, 2940.0]
[17.0, 18.0, 17.0, 17.0, 17.0]
[46, 33, 34, 49, 30]
p02801
u272682534
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(' '))\nAi =input().split(' ')\nAis = [int(s) for s in Ai]\n\ngoal = M*N\nif __name__=='__main__':\n rest=goal-sum(Ais)\n print( max(0,rest) if rest<=K else -1 )\n\n", "N,K,M=map(int, input().split(' '))\nAi =input().split(' ')\nAis = [int(s) for s in Ai]\n\ngoal = M*N\ncurrent = sum(Ais)\n\nif __name__=='__main__':\n rest=goal-sum(Ais)\n print( max(0,rest) if rest<=K else -1 )\n", "alpha = 'abcdefghijklmnopqrstuvwxyz'\nif __name__=='__main__':\n print(alpha[alpha.index(input())])", "alpha = 'abcdefghijklmnopqrstuvwxyz'\nif __name__=='__main__':\n print(alpha[1+alpha.index(input())])\n"]
['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
['s253143467', 's347361350', 's758943737', 's378277678']
[2940.0, 2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0, 17.0]
[186, 205, 100, 103]
p02801
u273010357
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\n\nli = []\n\nfor i in range(m):\n p,q = map(str, input().split())\n li.append((int(p),q))\n\nwa = 0\n\nse = {i for i in li if i[1]=='AC'}\nac = len(se)\n\nflag = True\nfor i in range(m-1):\n if li[i][0]!=li[i+1][0]:\n flag = True\n elif li[i][0]==li[i+1][0] and li[i][1]=='AC':\n flag = False\n elif li[i][0]==li[i+1][0] and li[i][1]=='WA' and flag:\n wa += 1\n\nprint(ac, wa)", 'import string\nc = input()\n\nupper = string.ascii_lowercase\nind = upper.index(c)\nprint(upper[ind+1])']
['Runtime Error', 'Accepted']
['s334215187', 's393300290']
[3064.0, 3768.0]
[17.0, 24.0]
[425, 98]
p02801
u274262034
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# row = sys.stdin.readline\nrow = open('input.txt', 'r').readline\ndef read_string(row):\n return row().rstrip()\n \ninp = read_string(row)\nprint(chr(ord(inp) + 1))", "import sys\n\nrow = sys.stdin.readline\n# row = open('input.txt', 'r').readline\ndef read_string(row):\n return row().rstrip()\n \ninp = read_string(row)\nprint(chr(ord(inp) + 1))"]
['Runtime Error', 'Accepted']
['s375258799', 's534259516']
[2940.0, 2940.0]
[17.0, 17.0]
[174, 175]
p02801
u274635633
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()\nprint(chr(ord(c) + 1))']
['Runtime Error', 'Accepted']
['s013736204', 's706942049']
[2940.0, 2940.0]
[17.0, 17.0]
[27, 34]
p02801
u276377665
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\nfor alpha in sys.stdin:\n\tsys.stdout.write(chr(ord(alpha)+1))', "import sys\n\nalphas = [chr(i) for i in range(ord('a'), ord('z') +1)]\nfor alpha in sys.stdin:\n\tprint(alphas[alphas.index(alpha)+1])", 'alpha = input()\nprint(chr(ord(alpha)+1))']
['Runtime Error', 'Runtime Error', 'Accepted']
['s591961334', 's917184133', 's749285660']
[2940.0, 2940.0, 2940.0]
[17.0, 17.0, 17.0]
[72, 129, 40]
p02801
u282752124
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(C) + 1))', 'print(chr(ord(input()) + 1))']
['Runtime Error', 'Accepted']
['s393054907', 's629257709']
[2940.0, 2940.0]
[17.0, 17.0]
[22, 28]