Problem:


Score : 100 points

Problem Statement

Given is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.

Constraints

C is a lowercase English letter that is not z.

Input

Input is given from Standard Input in the following format:

C

Output

Print the letter that follows C in alphabetical order.

Sample Input 1

a

Sample Output 1

b

a is followed by b.

Sample Input 2

y

Sample Output 2

z

y is followed by z.



Sample input:
a


Sample output:
b

Submission status: Runtime Error

Solution code:
import queue
h,w=map(int,input().split())
maze=[]
def func(n):
    if n=="#":
        return -1
    else:
        return 0


for i in range(h):
    row=input()
    maze.append(row)
#print(maze)
root=[[-1 for i in range(h*w)] for i in range(h*w)]
for i in range(h):
    for j in range(w):
       # print(maze[i][j])
        if maze[i][j]==".":
            now=w*i+j
            hidari=w*i+j-1
            migi=w*i+j+1
            ue=w*(i-1)+j
            sita=w*(i+1)+j
            if j>0:
                if maze[i][j-1]!="#":
                    root[now][hidari]=0
            if i+1<h:
                if maze[i+1][j]!="#":
                    root[now][sita]=0
            if j+1<w:
                if maze[i][j+1]!="#":
                    root[now][migi]=0
            if 0<i:
                if maze[i-1][j]!="#":
                    root[now][ue]=0
        else:
            now=w*i+j
            now=w*i+j
            hidari=w*i+j-1
            migi=w*i+j+1
            ue=w*(i-1)+j
            sita=w*(i+1)+j
            if j>0:
                root[now][hidari]=-1
            if i+1<h:
                root[now][sita]=-1
            if j+1<w:
                root[now][migi]=-1
            if 0<i:
                root[now][ue]=-1
#print(root)
max=0
for start in range(h*w):
    dist=[-1]*(h*w)
    now=start
    dist[start]=0
    visted=[0]*(h*w)
    toVis=queue.Queue()
    visted[now]=1
    for i in range(h*w):
        if root[now][i]!=-1:
            toVis.put(i)
            dist[i]=dist[now]+1
    while toVis.empty()!=True:
        now=toVis.get()
        visted[now]=1
        for i in range(h*w):
            if root[now][i]!=-1 and visted[i]!=1:
                toVis.put(i)
                dist[i]=dist[now]+1
    #print("s:",start,"g:",goal,"len",dist[goal])
    farest=dist[now]
    if max<farest:
        max=farest
print(max)

Submission status: Runtime Error

Solution code:
print(chr(ord(input())+1)

Submission status: Runtime Error

Solution code:
import sys
stdin=sys.stdin

ns = lambda:stdin.readline().rstrip()
ni = lambda:int(stdin.readline().rstrip())
nm = lambda:map(int,stdin.readline().split())
nl = lambda:list(map(int,stdin.readline().split()))

S=input()
A=['a','b','c','b','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if(S=='z'):
    print('a')
else:
    inds=A.index(S)
    print(A[inds+1])

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
A = {}
ac = []
total=0
count = 0
for i in range(M):
    p, s = map(str, input().split())
    if int(p) not in ac:
        if int(p) not in A.keys(): 
            if int(p) >0 and int(p) <=N :
                if s == "WA":
                    A[int(p)] =1
                elif s =="AC":
                    A[int(p)] =0
                    ac.append(int(p))
        elif int(p) in A.keys():
            if s == "WA":
                    A[int(p)] +=1
            elif s =="AC":
                    A[int(p)] +=0
                    ac.append(int(p))
                    count += 1
                    total += A[int(p)]

print(count,total)

Submission status: Runtime Error

Solution code:
print(chr(ord(str(input())+1)))

Submission status: Runtime Error

Solution code:
c = input()

l = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','y','u','v','w','y','z']
num = int(l.index(c))+1
print(l[num])

Submission status: Runtime Error

Solution code:
A = "abcdefghijklmnopqrstu"
c = input()

print(A[A.index(c)+1])

Submission status: Runtime Error

Solution code:
from collections import deque

H, W = list(map(int, input().split()))
S = []
for _ in range(H):
    S.append(input())

ret = 0
for i in range(H):
    for j in range(W):
        s = S[i][j]
        queue = deque([(i,j,0)])
        footprint = [(i,j)]
        if s == '#':
            continue
        while True:
            x, y, d = queue.popleft()
            for p in [(x-1, y), (x, y-1), (x, y+1), (x+1, y)]:
                if p[0] >= 0 and p[0] < H and p[1] >=0 and p[1] < W and p not in footprint and S[p[0]][p[1]] != '#':
                        queue.append((p[0], p[1], d+1))
                        footprint.append(p)

            if len(queue) == 0:
                break
        if d > ret:
            ret = d

print(ret)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline

print(chr(ord(input()) + 1))

Submission status: Runtime Error

Solution code:
a=input()

b=chr(a)
c=chr(b)
d=chr(c)

print(chr(ord(d)+1))

Submission status: Runtime Error

Solution code:
N,K,M=map(int,input().split())
a=list(map(int,input().split()))

min = N*M - sum(a)

ans = -1

if 0 <= min <= K:
  ans = min
elif min < 0:
  ans = 0
  
print(ans)

Submission status: Runtime Error

Solution code:
C = input()

abc ='abcdefghijklmnopqrstuvwxyz'

print(abc[abc.index(C+1))]

Submission status: Runtime Error

Solution code:
C = str(input())
print chr(ord(C) + 1)

Submission status: Runtime Error

Solution code:
x=input()
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]

for i in range(26):
  if list[i] = x:
    print(list[i+i])

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())

lps = list()

for i in range(M):
    p, s = input().split()
    lps.append([int(p), s])
#print(lps)

lcor = [0] * N
cornum = 0
wrgnum = 0
for i in range(M):
    if lps[i][1] == "AC":
        if lcor[lps[i][0]-1] == 0:
            lcor[lps[i][0]-1] += 1
            cornum += 1
    elif lps[i][1] == "WA":
        if lcor[lps[i][0]-1] == 0:
            wrgnum += 1

print(cornum, wrgnum)

Submission status: Runtime Error

Solution code:
n=int(input())
diez=10*n+10
if(1<=n<=10000):
    if(n!=10):
        print(diez-n)
    else:
        print(n+99)

Submission status: Runtime Error

Solution code:
n = str(input())
a = string.ascii_lowercase.index(n) 
letters = ['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']
print (n,'is followed by',letters[a+1])

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
PS = [list(input().split()) for i in range(m)]
AC = []
WA = 0

for i in range(m):
    if PS[i][1] == "AC":
        p = PS[i][0]
        if p not in AC:
            WA += PS[:i+1].count([p,"WA"])
            AC.append(p)

print(len(AC),WA)

Submission status: Runtime Error

Solution code:
a=input()
n=[chr(i) for i in range(97, 97+26)]
# [chr(i) for i in range(ord('a'), ord('z')+1)]
print(n[1+n.count(a)]

Submission status: Runtime Error

Solution code:
al = list("abcdefghijklmn")
C = input()
print(al[al.index(C)+1])

Submission status: Runtime Error

Solution code:
C = input()
print(C+1)

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
a=[]
for i in range(m):
	p,s=input().split()
	if p in a:
		continue
	if s=="AC":
		a.append(p)
print(len(a))

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
keep=[]
lis=[]
ac=[0]*N
wa=[0]*N
WA=0
for i in range(M):
    ps=input().split()
    keep.append(ps)
    
for j in range(M):
    if keep[j][1]=="AC":
        ac[int(keep[j][0])-1]=1
    elif ac[int(keep[j][0])-1]==0:
        wa[int(keep[j][0])-1]+=1
AC=sum(ac)
for k in range(N):
    WA+=ac[k]*wa[k]
    
print(AC,WA)

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
keep=[]
lis=[]
ac=[0]*N
wa=[0]*N
WA=0
for i in range(M):
    ps=input().split()
    keep.append(ps)
    
for j in range(M):
    if keep[j][1]=="AC":
        ac[int(keep[j][0])-1]=1
    elif ac[int(keep[j][0])-1]==0:
        wa[int(keep[j][0])-1]+=1
AC=sum(ac)
for j in range(M):
    WA+=ac[j]*wa[j]
    
print(AC,WA)

Submission status: Runtime Error

Solution code:
s = input()
print(chr(ord(s)+1)))

Submission status: Runtime Error

Solution code:
N,K, M = map(int,input().split())
A = list(map(int,input().split()))

ans = M*N-sum(A)

if ans > K:
    print(-1)
elif ans < 0:
    print(0)
else:
    print(ans)

Submission status: Runtime Error

Solution code:
c=input()
z='abcdefghijklmnopqrstuvwxy'
print(z[z.index(c)+1])

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
n, k, m = map(int, input().split())
a = list(map(int, input().split()))
an = m*n-sum(a)
if (0 <= an <= k):
    print(an)
if 0 > an:
    print(0)
if k < an:
    print(-1)

Submission status: Runtime Error

Solution code:
a = input()
print chr(ord(a) + 1)

Submission status: Runtime Error

Solution code:
al = [ord(i) for i in range(ord("a"), ord("a")+26)]

str = input()

print(al[al.index(str)+1])

Submission status: Runtime Error

Solution code:
import math
MAX=510000
fac=[0]*MAX
finv=[0]*MAX
inv=[0]*MAX
MOD=10**9+7
#テーブルを作る前処理
def COMinit():
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,MAX):
      fac[i] = fac[i-1] * i % MOD
      inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
      finv[i] = finv[i - 1] * inv[i] % MOD

#二項係数計算
def comb(n,k):
  if (n < k):
    return 0
  if (n < 0 or k < 0):
    return 0
  else:
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD

COMinit()
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
#print(A)
sum=0
for i in range(N-K+1):
  sum+=(A[N-1-i]-A[i])*(comb(N-i-1,K-1))%(10**9+7)
print(sum%(10**9+7))

Submission status: Runtime Error

Solution code:
from collections import deque
h, w = map(int, input().split())
s = [list(input()) for _ in range(h)]


def bfs(i, j):  # 引数はスタートの位置(i, j)
    q = deque()
    q.append((i, j))
    log = [[-1] * w for _ in range(h)]
    log[i][j] = 0
    distance = 0
    d = [(1, 0), (0, 1), (-1, 0), (0, -1)]  # 右、上、左、下
    while q:
        p = q.popleft()
        for item in d:
            nx = p[0] + item[0]
            ny = p[1] + item[1]
            if not(0 <= nx < h and 0 <= ny < w):  # 迷路の外にはでれない
                continue
            elif s[nx][ny] == "#":  # 壁には進めない
                continue
            elif log[nx][ny] >= 0:  # 探索済みは探索しない
                continue
            else:
                log[nx][ny] = log[p[0]][p[1]] + 1
                q.append((nx, ny))
                if distance < log[nx][ny]:
                    distance = log[nx][ny]
    return distance


distance = 0
for i in range(h):
    for j in range(w):
        if s[i][j] == "#":  # start地点は壁でない
            continue
        else:
            temp = bfs(i, j)
            if temp >= distance:
                distance = temp
print(distance)

Submission status: Runtime Error

Solution code:
C = input()

dic = {'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8,'i':9,'j':10,'k':11,'l':12,'m':13,'n':14,'o':15,'p':16,'q':17,'r':18,'s':19,'t':20,'u':21,'v':22,'w':23,'x':24,'y':25,'z':26}

keys = list(dic.keys())

for i in range(26):
    if keys[i]==C:
        print(keys[i+1])
        break

Submission status: Runtime Error

Solution code:
C = input()

dic = {'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8,'i':9,'j':10,'k':11,'l':12,'m':13,'n':14,'o':15,'p':16,'q':17,'r':18,'s':19,'t':20,'u':21,'v':22,'w':23,'x':24,'y':25,'z':26}

keys = list(dic.keys())

for i in range(26):
    if keys[i]==C:
        print(keys[i+1])

Submission status: Runtime Error

Solution code:
letter=input()
alphabet="abcdefghijklmnopqrstuvwxyz"
for i in range(len(alphabet)):
  if alphabet[i]=＝letter:
    print(alphabet[i+1])

Submission status: Runtime Error

Solution code:
letter=input()
alphabet="abcdefghijklmnopqrstuvwxyz"
for i in range(len(alphabet)):
  if alphabet[i]=letter:
    print(alphabet[i+1])

Submission status: Runtime Error

Solution code:
letter=input()
alphabet="abcdefghijklmnopqrstuvwxyz"
alphabet[i]=letter
print(alphabet[i+1])

Submission status: Runtime Error

Solution code:
al = 'abcdefghijklmnopqrstuvwxy'
c = input()
print(al[al.index(c)+1])

Submission status: Runtime Error

Solution code:
c = str(input())

alp = abcdefghijklmnopqrstuvwxyz

k=0
while k<25:
  if c == alp[k]:
    print(alp[k+1])
  else:
    k+=1

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
solve_problem = []
d = {i: 0 for i in range(1, N+1)}
ans = 0
penalty = 0
for i in range(M):
    p, S = input().split()
    if S == 'AC' and p not in solve_problem:
        solve_problem.append(p)
        ans += 1
        penalty += d[int(p)]
    if S == 'WA':
        d[int(p)] += 1

print('{} {}'.format(ans, penalty))

Submission status: Runtime Error

Solution code:
a

a

Submission status: Runtime Error

Solution code:
aaaa

Submission status: Runtime Error

Solution code:
aa

Submission status: Runtime Error

Solution code:
a

Submission status: Runtime Error

Solution code:
a        a

Submission status: Runtime Error

Solution code:
aaaaaaaaaa

Submission status: Runtime Error

Solution code:
#min
minsum=0
for i in range(n):
    if n-(i+1)>=k-1:
        minsum+=(a[i] * comb(n-i-1,k-1))%M
        minsum%=M
b=sorted(a,reverse=True)
#max
maxsum=0
for i in range(n):
    if n-(i+1)>=k-1:
        maxsum+=(b[i] * comb(n-i-1,k-1))%M
        maxsum%=M
print((maxsum-minsum)%M)

Submission status: Runtime Error

Solution code:
c = input()
s = "abcdefghijklmnopqrstuvwxyz"
flg = True
for i in range(len(s) + 1):
    if c == s[i] and c != "z":
        print(s[i + 1])
        flg = False
    elif c == "z":
        print("a")
        flg = False

Submission status: Runtime Error

Solution code:
c = input()
s = 'abcdefghijklmnopqrstuvwxyz'
flg = True
while flg:
    if c == s[i] and c != 'z':
        print(s[i + 1])
        flg = False
    elif c == 'z':
        print('a')
        flg = False

Submission status: Runtime Error

Solution code:
K ,X = map(int, input().split())

if 500*K >= X:
    print("Yes")

else:
    print("No")

Submission status: Runtime Error

Solution code:
a = input()
print:a+1

Submission status: Runtime Error

Solution code:
c=input()
l="qwertyuioplkjhgfdsazxcvbnm"
l.sort()
print(l[l.index(c)+1])

Submission status: Runtime Error

Solution code:
from intertools import chain
from collections import deque
H, W = map(int,input().split())
S = [list(map(str,input().split())) for _ in range(H)]
dhw = [[0,1],[0,-1],[1,0],[-1,0]]

ans = 0
for h in range(H):
  for w in range(W):
    d = deque([h,w])
    maze = [[-1] * W for _ in range(H)]
    if S[h][w] == '#':
      continue
    maze[h][w] = 0
    while d:
      ht , hw = d.popleft()
      for dh, dw in dhw:
        nh = ht + dh
        nw = wt + dw
        if 0 <= nh < H and 0 <= nw < W:
          if maze[nh][nw] == -1 and S[nh][nw] == '.':
            d.append([nh,nw])
            maze[nh][nw] = maze[ht][wt] + 1
    ans = max(ans,max(chain(*maze))
print(ans)

Submission status: Runtime Error

Solution code:
i=list(a,b,c,d,e,f,g,h,i,h,i,j,k,l,m,n,o,p,q,r,s,t,u,w,w,x,y,z)

A=input()
k=0
for k in range(22):
  if i[k]==A:
    print(i[k+1])
  k=k+1

Submission status: Runtime Error

Solution code:
A = str(input(''))
if A = 'a':
  print('b')
elif A = 'b':
  print('c')
elif A = 'c':
  print('d')
elif A = 'd':
  print('e')
elif A = 'e':
  print('f')
elif A = 'f':
  print('g')
elif A = 'g':
  print('h')
elif A = 'h':
  print('i')
elif A = 'i':
  print('j')
elif A = 'j':
  print('k')
elif A = 'k':
  print('l')
elif A = 'l':
  print('m')
elif A = 'm':
  print('n')
elif A = 'n':
  print('o')
elif A = 'o':
  print('p')
elif A = 'p':
  print('q')
elif A = 'q':
  print('r')
elif A = 'r':
  print('s')
elif A = 's':
  print('t')
elif A = 't':
  print('u')
elif A = 'u':
  print('v')
elif A = 'v':
  print('w')
elif A = 'w':
  print('x')
elif A = 'x':
  print('y')
else:
  print('z')

Submission status: Runtime Error

Solution code:
A = input()
if A = 'a':
  print('b')
elif A = 'b':
  print('c')
elif A = 'c':
  print('d')
elif A = 'd':
  print('e')
elif A = 'e':
  print('f')
elif A = 'f':
  print('g')
elif A = 'g':
  print('h')
elif A = 'h':
  print('i')
elif A = 'i':
  print('j')
elif A = 'j':
  print('k')
elif A = 'k':
  print('l')
elif A = 'l':
  print('m')
elif A = 'm':
  print('n')
elif A = 'n':
  print('o')
elif A = 'o':
  print('p')
elif A = 'p':
  print('q')
elif A = 'q':
  print('r')
elif A = 'r':
  print('s')
elif A = 's':
  print('t')
elif A = 't':
  print('u')
elif A = 'u':
  print('v')
elif A = 'v':
  print('w')
elif A = 'w':
  print('x')
elif A = 'x':
  print('y')
else:
  print('z')

Submission status: Runtime Error

Solution code:
s = input()
print(chr(ord(s + 1)))

Submission status: Runtime Error

Solution code:
s = int(input())
print(str(ord(s)+1))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
random_device rnd;
mt19937 mt(rnd());
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
const int IINF = 1 << 30;
const ll INF = 1ll << 60;
const ll MOD = 1000000007;

int main()
{
    char c;
    cin >> c;
    cout << (char)(c + 1) << endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
s = input() #alphabet hitotsu sakino moji
print(chr(ord(s) + 1)

Submission status: Runtime Error

Solution code:
h,a=map(int,input().split())
print(-(-h//a))

Submission status: Runtime Error

Solution code:
C = input()
print(chr(ord(C+1)))

Submission status: Runtime Error

Solution code:
print(chr(ord(input()+1)))

Submission status: Runtime Error

Solution code:
from sys import stdin

C = input()

print(chr(ord(C + 1)))

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
lst = [[0, 0] for _ in range(n)]
for _ in range(m):
    p, s = input().split()
    p = int(p)
    if s == 'AC':
        lst[p-1][0] = 1
    elif lst[p-1][0] == 0:
        lst[p-1][1] += 1

correct = 0
wrong = 0
for i in range(n):
    correct += lst[i][0]
    if lst[i][0] == 1:
        wrong += lst[i][1]
print(correct, wrong)

Submission status: Runtime Error

Solution code:
s=[chr(i) for i in range(97,122)]
c=raw_input()
ans= s.index(c)
print s[ans+1]

Submission status: Runtime Error

Solution code:
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']
c=raw_input()
ans= s.index(c)
print s[ans+1]

Submission status: Runtime Error

Solution code:
c=input()
print (chr(ord(c) + 1)

Submission status: Runtime Error

Solution code:
c=input()
print chr(ord(c) + 1)

Submission status: Runtime Error

Solution code:
# simply use double ifs
s = input()
print(chr(ord(s))+1)

Submission status: Runtime Error

Solution code:
from collections import deque
H, W = map(int, input().split())
X = [input() for _ in range(H)]
maxloc = -10

def bfs(sx, sy, gx, gy):
  if(X[sx-1][sy-1] == '#' or X[gx-1][gy-1] == '#'):
    return -1
  else:
    dist = [[-1]*W for _ in range(H)]
    dist[sx-1][sy-1] = 0
    q = deque([(sx-1, sy-1)])
    while q:
      u, v = q.popleft()
      for i, j in [(-1, 0), (1, 0), (0, -1), (0, 1)]:
        if not(0 <= u+i < H and 0 <= v+j < W):
          continue
    
        if(dist[u+i][v+j] >= 0 or X[u+i][v+j] == "#"):
          continue

        dist[u+i][v+j] = dist[u][v]+1
        q.append((u+i, v+j))

    return dist[gx-1][gy-1]

for i in range(H):
  for j in range(W):
    sx = i
    sy = j
    for k in range(i+1, H):
      for l in range(j+1, W):
        gx = k
        gy = l
        if(bfs(i+1, j+1, k+1, l+1) > maxloc):
          maxloc = bfs(i+1, j+1, k+1, l+1)
          
print(maxloc)

Submission status: Runtime Error

Solution code:
alph = input()
print(ord(alph+1))

Submission status: Runtime Error

Solution code:
c = input()
al = ['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']
i = al.find('c')
print(al[i+1])

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define int long long
#define ld long double
#define endl '\n'
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vpii vector<pii>
#define gr vector<vpii>
#define fi first
#define se second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define GAME_OVER return 0
using namespace std;
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    char c;
    cin >> c;
    cout << char(c + 1) << endl;
    GAME_OVER;
}

Submission status: Runtime Error

Solution code:
C=int(input())
li=[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]
print(li[C+1])

Submission status: Runtime Error

Solution code:
n,m = map(int, input().split())

arS = [0] * 100000

score = 0
penalty = 0
for i in range(m):
	id, res = input().split()
	id = int(id)
	if res == "AT" and arS[id]==0:
		arS[id] = 1
		score = score+1
	if res =="WA": 
		penalty = penalty + 1
print(score, penalty)

Submission status: Runtime Error

Solution code:
n,m = map(int, input().split())

arS = [0] * 100000
#arP = [0] * 100000

score = 0
penalty = 0
for i in range(m):
	id, res = input().split()
	id = int(id)
	if res == "AT" and arS[id]==0:
		arS[id] = 1
		score = score+1
	if res =="WA": 
#		arP[id] = arP[id] + 1
		penalty = penalty + 1
print(score, penalty)

Submission status: Runtime Error

Solution code:
import string

AL = string.lowercase

C = input()
idx = AL.find(C)
idy = (idx + 1) % 26
print(AL[idy])

Submission status: Runtime Error

Solution code:
def main():
    def pre(n,mod):
        an=[1]*(n+1)
        a=1
        for i in range(1,n+1):
            a=(a*i)%mod
            an[i]=a
        b=pow(a,mod-2,mod)
        bs=[1]*(n+1)
        bs[n]=b
        for i in range(n,1,-1):
            b=b*i%mod
            bs[i-1]=b
        return an,bs

    n,k=map(int,input().split())
    a=sorted(list(map(int,input().split())))
    mod=10**9+7
    an,bs=pre(n,mod)
    ans=0
    for i in range(k,n+1):
        for j in range(0,n-i+1):
            s=a[i+j-1]-a[j]
            s=(s*an[i-2]*bs[k-2]*bs[i-k])%mod
            ans=(ans+s)%mod
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def resolve():
    n, m = map(int, input().split())

    if n == m:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    resolve()

Submission status: Runtime Error

Solution code:
N,M = list(map(int,input().split()))
A = ['a']*N
B = [0]*N
ans1 = 0
ans2 = 0
for i in range(M):
  C,D = input().split()
  C = int(C)-1
  if A[C] == D == 'WA':
    ans1 += 1
    B[C] += 1
  if A[C] == 'a' and D == 'WA':
    ans1 += 1
    B[C] += 1
  if A[C] == 'WA' and D == 'AC':
    ans2 += 1
    A[C] = 'AC'
  if A[C] == 'a' and D == 'AC':
    ans2 += 1
    A[C] = 'AC'
for i in range(N):
  if A[i] == 'a':
    ans1 -= B[i]
print('{0} {1}'.format(ans2,ans1))

Submission status: Runtime Error

Solution code:
N, K, M = list(map(int, input().split()))
A = list(map(int, input().split()))

a_sum = sum(A)
x = N * M - a_sum

if K < x:
    x = -1
elif x < 0:
    x = 0
print(x)

Submission status: Runtime Error

Solution code:
c = input()

txt = 'abcdefghijklmnopqrstuvwxyz'

for i in range(27):
    if txt[i] == c:
        print(txt[i + 1])

Submission status: Runtime Error

Solution code:
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']
C = input()
for i in range(len(A)):
  elif C == A[i]:
  break
print(A[i+1])

Submission status: Runtime Error

Solution code:
nm = input().split()
n = int(nm[0])
m = int(nm[1])

p = []
r = []

for i in range(m):
	pr = input().split()
	p.append(int(pr[0]))
	r.append(pr[1])

ac = 0
wa = 0
cnt = 1

if m != 0:
	   for l in range(m):
	    if cnt < p[l]: 
	    	cnt += 1
	    elif cnt > p[l]:
	    	continue
	    else :
		    if r[l] == 'AC':
		        ac += 1
		        cnt += 1 
		    else: wa += 1

            
print(ac)
print(wa)

Submission status: Runtime Error

Solution code:
s = input()

print(chr(ord(s) + 1)

Submission status: Runtime Error

Solution code:
s = input()

print(char(ord(s) + 1)

Submission status: Runtime Error

Solution code:
s = input()

print(char(ord(s) + 1))

Submission status: Runtime Error

Solution code:
a = input()
ans = char(ord(a) + 1)

print(ans)

Submission status: Runtime Error

Solution code:
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]
C = input()
for i in range(24):
  if C == listA[i]:
    print(listA[i+1])

Submission status: Runtime Error

Solution code:
l = ['abcdefghijklmnopqrstuvwxyz']

print(l[l.index(input()) + 1])

Submission status: Runtime Error

Solution code:
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
# import numpy as np
# import math

n, k = map(int, input().split())
a = list(map(int, input().split()))
# n = int(input())
mod = 10 ** 9 + 7
a.sort(reverse = True)
# print(a)
ans = 0

def C(n, k, mod):
    if n == 0 and k == 0:
        return 1
    if n < k or k < 0:
        return 0
    x,y = 1,1
    while k > 0:
        x *= n
        y *= k
        n, k = n-1, k-1
        
    return x * pow(y, mod-2, mod) % mod


for i in range(0,n-k+1):
    ans += a[i] * C(n-i-1, k-1, mod)
    ans %= mod

a.reverse()
for i in range(0, n - k + 1):
    ans -= a[i] * C(n - i - 1, k - 1, mod)
    ans %= mod



print(ans)

Submission status: Runtime Error

Solution code:
n,k,m = map(int,input().split())
list = list(map(int,input().split()))

k = n*m-sum(list)
if 0<= k <=100:
    print(k)
elif k<0:
    print(0)
else:
    print(-1)

Submission status: Runtime Error

Solution code:
n,k,m = map(int,input().split())
a = list(map(int,input().split()))

b =sum(a)
b += k
m *= n
if b < m:
    print(-1)
else:
    b -= k
    m -= b
    if m <= 0:
        print(0)
    else:
        print(m)

Submission status: Runtime Error

Solution code:

from collections import deque
from copy import deepcopy

def bfs(pos,map):
      while pos:
        x,y,depth=pos.popleft()
        if map[x][y]=="#":
            continue
        map[x][y]="#"
        if map[x-1][y]!="#":
          pos.append([x-1,y,depth+1])
        if map[x+1][y]!="#":
          pos.append([x+1,y,depth+1])
        if map[x][y+1]!="#":
          pos.append([x,y+1,depth+1])
        if map[x][y-1]!="#":
          pos.append([x,y-1,depth+1])
      return depth
H,W=map(int,input().split())
ans=0
fence=["#"]*(W+2)
field=[fence]
for _ in range(H):
  L=list(input())
  field.append(["#"]+L+["#"])
field.append(fence)
for i in range(1,H+1):
  for j in range(1,W+1):
    if field[i][j]==".": 
      pos=deque([[i,j,0]])
      depth=bfs(pos,deepcopy(field))
      if ans<depth:
        ans=depth
print(ans)

Submission status: Runtime Error

Solution code:
imp = imput()
alp = ['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']
print(alp[alp.index(str(imp)) + 2])

Submission status: Runtime Error

Solution code:
imp = imput()
alp = ['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']
print(alp[alp.index(imp) + 2])

Submission status: Runtime Error

Solution code:
import numpy as np
print(char(ord(input()[0])+1))

Submission status: Runtime Error

Solution code:
N = int(input())

alp = 'abcdefghijklmnopqrstuvwxyz'
ans = alp[(alp.index(N) + 1)]
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())

alp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ans = alp[(alp.index(N) + 1)]
print(ans)

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
 
WA=[0]*n
AC=[0]*n
 
for i in range(m):
    problem,status=input().split()
    problem=int(problem)
 
    if status=='WA':
        if AC[problem-1]==1:
            continue
        else:
            WA[problem-1]+=1
    elif status=='AC':
        AC[problem-1]=1

for i in range(n):
    if AC[i]==0:
        WA[i]=0
print(sum(AC),sum(WA))

Submission status: Runtime Error

Solution code:

n,m=map(int,input().split())

WA=[0]*n
AC=[0]*n

for i in range(m):
    problem,status=input().split()
    problem=int(problem)

    if status=='WA' and AC[problem-1]==0:
        WA[problem-1]+=1
    elif status=='AC':
        AC[problem-1]=1
print(sum(WA),sum(AC))

Submission status: Runtime Error

Solution code:
import string
s = input()
x = string.ascii_letters
for i in range(len(x)):
    if x[i] == s:
        print(x[i;1])
        break

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
 
def main():
    N, M = map(int, input().split())
 
    ac_check = [False] * N
    p_counts = [0] * N
 
    for i in range(M):
        p, s = input().strip().split()
        p = int(p) - 1
        if s == "AC":
            if not ac_check[p]:
                ac_check[p] = True
        else:
            if not ac_check[p]:# まだ正解していないならペナルティ追加
                p_counts[p] += 1
 
    ac_count = 0
    p_count = 0
    for i in range(N):
        if ac_check[i]:# 正解している問題のみ考慮
            ac_count += 1
            p_count += p_counts[i]
    print(ac_count, p_count)
 
 
if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
num = lambda c: chr(c+64)
s = str(input())

for i in range(1,26):
	if s == num(i).lower:
      print(num(i+1))

Submission status: Runtime Error

Solution code:
C = input()
print chr(ord(C) + 1)

Submission status: Runtime Error

Solution code:
n=int(input())
x=[0]*n
y=[0]*n
for i in range(n):
  x[i],y[i]=map(int,input().split())
if n==2:
  print(((x[0]-x[1])**2+(y[0]-y[1])**2)**(1/2)/2)
else:
  ans=10**5
  A=[0]*3
  B=[0]*3
  for i in range(n-2):
    for j in range(i+1,n-1):
      A[0]=x[j]-x[i]
      A[1]=y[j]-y[i]
      A[2]=A[0]*(x[i]+x[j])/2+A[1]*(y[i]+y[j])/2
      for k in range(j+1,n):
        B[0]=x[k]-x[i]
        B[1]=y[k]-y[i]
        B[2]=B[0]*(x[i]+x[k])/2+B[1]*(y[i]+y[k])/2
        if A[0]*B[1]==A[1]*B[0] and A[0]*B[1]!=0:#三点が同一直線状に存在1
          r=((max(x[i],x[j],x[k])-min(x[i],x[j],x[k]))**2+(max(y[i],y[j],y[k])-min(y[i],y[j],y[k]))**2)**(1/2)/2
          xc=(max(x[i],x[j],x[k])+min(x[i],x[j],x[k]))/2
          yc=(max(y[i],y[j],y[k])+min(y[i],y[j],y[k]))/2
        elif A[0]==B[0]==0:#2
          r=(max(y[i],y[j],y[k])-min(y[i],y[j],y[k]))/2
          xc=x[i]
          yc=(max(y[i],y[j],y[k])+min(y[i],y[j],y[k]))/2
        elif A[1]==B[1]==0:#3
          r=(max(x[i],x[j],x[k])-min(x[i],x[j],x[k]))/2
          yc=y[i]
          xc=(max(x[i],x[j],x[k])+min(x[i],x[j],x[k]))/2
        else:
          xc=(A[2]*B[1]-A[1]*B[2])/(A[0]*B[1]-A[1]*B[0])
          yc=(A[0]*B[2]-A[2]*B[0])/(A[0]*B[1]-A[1]*B[0])
          r=((x[i]-xc)**2+(y[i]-yc)**2)**(1/2)
        aa=0
        r=min(r*1.000000999,r+0.000000999)
        for l in range(n):
          if ((x[l]-xc)**2+(y[l]-yc)**2)**(1/2)>r:
            aa=1
        if aa==0:
          if r<ans:
            ans=r
  print(ans)

Submission status: Runtime Error

Solution code:
al = list("abcdefghijklmnopqistuvwxyz")

c = input()

print(al[al.index(c)]