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:
c=input()
if c == a :
    print("b")
elif c == b :
    print("c")
elif c == c :
    print("d")
elif c == d :
    print("e")
elif c == e :
    print ("f")
elif c == f :
    print("g")
elif c == g :
    print("h")
elif c == h :
    print("i")
elif c == i :
    print("j")
elif c == j :
    print("k")
elif c == k :
    print("l")
elif c == l :
    print("m")
elif c == m :
    print("n")
elif c == n :
    print("o")
elif c == o :
    print("p")
elif c == p :
    print("q")
elif c == q :
    print("r")
elif c== r :
    print("s")
elif c == s :
    print("t")
elif c == t :
    print("u")
elif c == u :
    print("v")
elif c == v :
    print("w")
elif c == w :
    print("x")
elif c == x :
    print("y")
elif c == y :
    print("z")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
li = []
for m in range(M):
  li.append(input().split())

ac = 0
wa = 0

for n in range(N + 1):
  if n == 0:
    continue

  for index, i in enumerate(li):
    if int(i[0]) == n and i[1] == 'AC':
      ac += 1
      for indexs, x in enumerate(li):
        if indexs >= index:
          break
        if int(x[0]) == n and x[1] == 'WA':
          wa += 1
      break

print('{0} {1}'.format(ac, wa))

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
p_list = []
S = []
for _ in range(M):
    n, s = input().split()
    p_list.append(int(n))
    S.append(s)

wa = 0
ac = 0
ac_list = []
for i, p in enumerate(p_list):
    if p not in ac_list:
        if S[i] == "WA":
                wa += 1
        else:
                ac += 1
                ac_list.append(p)

print(ac, wa)

Submission status: Runtime Error

Solution code:
if __name__=="__main__":
    n, m = map(int, input().split())
    p, s=[], []
    for i in range(m):
        pin, sin = map(str, input().split())
        p.append(int(pin))
        s.append(sin)

    cnt_wa = 0
    cnt_ac = 0
    pfin = 0
    for i in range(m):
        if pfin < p[i]:
            if s[i]=="WA":  
                cnt_wa += 1
            else:
                cnt_ac += 1
                pfin = p[i]
                if pfin==n:
                    break
        
    print("{} {}".format(cnt_ac, cnt_wa))

Submission status: Runtime Error

Solution code:
s = 'abcdefghijklmnopqrstuvwxy'
C = input(str())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
alpha = ["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","a"]
C = input()
for i in range(len(alpha)):
    if C == alpha[i]:
        print(alpha[i+1])

Submission status: Runtime Error

Solution code:
N,K,M=map(int, input().split(' '))
Ai =input().split(' ')
Ais = [int(s) for s in Ai]

goal = M*N
if __name__=='__main__':
  rest=goal-sum(Ais)
  print( max(0,rest) if rest<=K else -1 )

Submission status: Runtime Error

Solution code:
n,m=[int(x) for x in input().split()]
a=[0 for _ in range(n)]
b=[0 for _ in range(n)]
for _ in range(m):
  p,q=input().split()
  #print(p,q)
  if q=="AC": 
    #print("fir")
    rg=a[int(p)-1]
    if rg==0: a[int(p)-1]=1+b[int(p)-1]
  else : 
    #print("sec")
    b[int(p)-1]+=1
xg=0
for x in a:
  if x>0: xg+=1
print(xg,sum(a))

Submission status: Runtime Error

Solution code:
s = 'abcdefghijklmnopqrstuvwxy'
C = input(str())

for i in range(len(s)):
    if s[i] == C:
        print(s[i+1])
        break
else:
    print('')

Submission status: Runtime Error

Solution code:
N,K,M=map(int, input().split(' '))
Ai =input().split(' ')
Ais = [int(s) for s in Ai]

goal = M*N
current = sum(Ais)

if __name__=='__main__':
  rest=goal-sum(Ais)
  print( max(0,rest) if rest<=K else -1 )

Submission status: Runtime Error

Solution code:
n, k, m = map(int, input().split())
a = list(map(int, input().split()))
count = 0
total_score = 0
while count <= n - 2:
  total_score += a[count]
  count += 1 
last_score = n * m - total_score
if last_score < 0:
  print(0) 
else:
  print(last_score)

Submission status: Runtime Error

Solution code:
al = input()

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

ald = [a:b,b:c,c:d,d:e,e:f,f:g,g:h,h:i,i:j,j:k,k:l,l:m,m,n,n:o,o:p,p:q,q:r,r:s,s:t,t:u,u:v,v:w,w:x,x:y,y:z]

if al in ald:
    print(ald[al])

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
cnt = 0
wa = 0
ac = 0
sumi = []
b = {}
for x in range(m):
    a = input().split()
    if a[1] == 'WA':
        try:
            b[a[0]] += 1
        except KeyError:
            b[a[0]] = 1
    if a[1] == 'AC' and not a[0] in sumi:
        sumi.append(a[0])
        ac += 1
        try:
            wa += b[a[0]]
        except KeyError:
            continue
print(ac, wa)

Submission status: Runtime Error

Solution code:
from collections import defaultdict
N, M = map(int, input().split())
P = []
S = []
for i in range(M):
  p, s = input().split()
  P.append(int(p))
  S.append(s)
d = defaultdict(int)
d1 = defaultdict(int)
for i in range(M):
  if S[i] == "WA":
    if d[P[i]] != 1:
      d1[P[i]] += 1
  elif S[i] == "AC":
    d[P[i]] = 1
for i in range(M):
  if d[P[i]] == 0 and d1[P[i]] > 0:
    d1[P[i]] = 0
print(sum(d.values()), sum(d1.values()))

Submission status: Runtime Error

Solution code:
n,k,m=map(int, input().split())
for i in range(n-1):
  a[i]=int(input()) 
  Sum+=a[i]
if (Sum+k)/n<m:
  print(-1)
  break
else:
  print(n＊m-Sum)

Submission status: Runtime Error

Solution code:
n,M = map(int,input().split())
ls = []
for i in range(M):
    p,m = map(str,input().split())
    ls.append([p,m])
    
ac = 0
wa = 0
now = ""
p = 0
c = 0
for i in range(M):
    if now == ls[i][0]:
        continue
    if ls[i][0] != ls[i-1][0] and c == 0:
        wa -= p
        p = 0
    if ls[i][1] == "AC":
        now = ls[i][0]
        ac += 1
        c = 1
    elif ls[i][1] == "WA":
        wa += 1
        c = 0
        p += 1
        
print(ac,wa)

Submission status: Runtime Error

Solution code:
cin=input().split()
N=int(cin[0])
M=int(cin[1])


result={}
ac=0
wa=0
for i in range(M):
    cin=input().split()
    p=int(cin[0])
    S=str(cin[1])

    log=result.get(p,None)
    if S == "AC" and log != "AC":
        ac+=1
        result[p]="AC"

    if S == "WA" and log != "AC":
        wa+=1

print(f"{ac} {wa}")

Submission status: Runtime Error

Solution code:
a=input()
b=a.next(a)
print(b)

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
li = []
seitou = 0
penalty = 0

if m == 0:
    print(0, 0)

else:
    for x in range(m):
        i, j = map(str, input().split())
        if i in li:
            pass
        else:
            if j == "WA":
                penalty += 1
            if j == "AC":
                li.append(i)
                seitou += 1

    print(seitou, penalty)

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
cnt = 0
wa = 0
ac = 0
sumi = []
b = {}
for x in range(m):
    a = input().split()
    if a[1] == 'WA' and not a[0] in sumi:
        try:
            b[a[0]] += 1
        except KeyError:
            b[a[0]] = 1
    elif a[1] == 'AC' and not a[0] in sumi:

        sumi.append(a[0])
        ac += 1
        try:
            wa += b[a[0]]
        except KeyError:
            continue
print(ac, wa)

Submission status: Runtime Error

Solution code:
k,x = map(int,input().split())
a = 500*k
if a >= x:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
N,K,M=map(int,input().split())
point = list(map(int,input().split()))
full = N*K
tar = M*N
all_p = sum(point)

if full- all_p >full-K:
    print(-1)
else:
    print(full-K-sum(point))

Submission status: Runtime Error

Solution code:
N,K,M = input().split()
i = input().split() 
i2 = [int(s) for s in i]
score = sum(i2)
aim = int(N) * int(M)
d = aim - score
K = int(K)
if d > K:
    d = -1
elif 0 >=  d:
    d = 0
print(d)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
d=0
e=[int(x) for x in input().split()]
g=0
for i in range(a-1):
    d+=int(e[i])
for i in range(b):
    if (d+i)/a>=c:
        print(i)
        g=1
        break
if g==0:
    print(-1)

Submission status: Runtime Error

Solution code:
l = input().split(" ")
N = int(l[0])
M = int(l[1])

answered = set()

ac_count = 0
wa_count = 0

for n in range(M):
    result = [i for i in input().split(" ")]
    p = result[0]
    if p in answered:
        continue
    s = result[1]
    if s == "WA":
        wa_count += 1
    else:
        ac_count += 1
        answered.add(p)
        if len(answered) == N:
            break

print(ac_count, wa_count)

Submission status: Runtime Error

Solution code:
C = int(input())

ans = ['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']
ans2 = int(ans.index(C)) + 1
print(ans[ans2])

Submission status: Runtime Error

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

total = sum(tests)

for i in range(K):
    if (total + i) / N >= M:
        print(i)
        exit(0)
print(-1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
c = input()
S = 'abcdefghijklmnopqrstuvwxy'
f = S.find(c)
print (S[f+1])

Submission status: Runtime Error

Solution code:
alphabet = list('abcdefghijklmnopqrstuvwxyz')

s=input()

ss = alphabet.index(s)

print(alphabet[ss])

Submission status: Runtime Error

Solution code:
c = input()
S = 'abcdefghijklmnopqrstuwxy'
f = S.find(c)
print (S[f+1])

Submission status: Runtime Error

Solution code:


C = input()
C_asc ord(C)
ret = chr(C_asc + 1)
print(ret)

Submission status: Runtime Error

Solution code:
C = str(input())

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']

for i in len(a):
    if a[i] == C:
        print(a[i+1])

Submission status: Runtime Error

Solution code:
N, K, M = map(int, input().split())
A = list(map(int, input().split()))
 
if  N*M - sum(A) >= K:
    print('-1')
else:
  print(N*M - sum(A))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
alpha = 'abcdefghijklmnopqrstuvwxy'
if __name__=='__main__':
    s=input()
    i = alpha.index(s)
    print(alpha[i+1])

Submission status: Runtime Error

Solution code:
n, k, m = map(int, input().split())
li = list(map(int, input().split()))
genzai = sum(li)
mokuhyou = n*m
theta = mokuhyou-genzai
if theta > k:
    print(-1)
elif k >= theta:
    print(theta)
elif theta < 0:
    print(0)

Submission status: Runtime Error

Solution code:
C = input()
k = [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(len(k)):
  if C == k[i]:
    print(k[i+1])

Submission status: Runtime Error

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

for i in list:
	if i==ans:
		print(list[list.index(i)+1])

Submission status: Runtime Error

Solution code:
C = input()
alpha = iter("abcdefghijklmnopqrstuvwxyz")
if C in alpha :
    A = alpha.next()
print(A)

Submission status: Runtime Error

Solution code:
n, m = map(int, raw_input().split())
l = []
ac = set()
wa = {}
for i in range(m):
	a, b = raw_input().split()
	a = int(a)
	
	if a not in ac:
		if b == 'WA':
			if a in wa:
				wa[a] += 1
			else:
				wa[a] = 1
		else:
			ac.add(a)
ans = 0
for i in list(ac):
	if i in wa:
		ans += wa[i]
print len(ac), ans

Submission status: Runtime Error

Solution code:
lt=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
c=input()
for i in range(26):
  if c=lt[i]:
    break
print(lt[i+1])

Submission status: Runtime Error

Solution code:
a=gets.chomp
puts a.succ

Submission status: Runtime Error

Solution code:
ch = input()
out = char(ord(ch)+1)
print(out)

Submission status: Runtime Error

Solution code:
C = str(input())

alph = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u

for i, j in enumerate(alph):
  if C == j:
    print(alph[i+1])

Submission status: Runtime Error

Solution code:
mojiretu="abcdefghijklmnopqrstuvwxy"
C=input()
for i in range(25):
    if mojiretu[i]==C:
        print(mojiretu[i+1])

Submission status: Runtime Error

Solution code:
C=str(input())
abc=['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(abc[abc.index(C)+1)])

Submission status: Runtime Error

Solution code:
with open("practice.txt") as f:
    a = f.read()

alist = list(a).sort()
print("".join(alist))

Submission status: Runtime Error

Solution code:
all, perfect, mokuhyou = list(map(int, input().split()))
point = list(map(int, input().split()))
now = sum(point)
f = False
a = -1
for i in range(101):
    if f:
        break
    avg = (now + i) / all
    if avg >= mokuhyou:
        a = i
        f = True
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

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",
]

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

Submission status: Runtime Error

Solution code:

import java.io.*;
import java.util.*;
class Main {
	public static void main (String[] args) {
		Scanner in=new Scanner(System.in);
		char p=(in.nextLine()).charAt(0);
		int k=((int)p)+1;
		char u=(char)k;
		System.out.print(u);
		
	}
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
i = ['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']
a = input()
b = i.index(a)
print(i[b+1])

Submission status: Runtime Error

Solution code:
c = str(input())

List = ['a','b','c','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']

c_index = List.index(c)
ans = List[c_index+1]
print(ans)

Submission status: Runtime Error

Solution code:
import sys

str = sys.stdin.readlines()[0]
alp = "abcdefghijklmnopqrstuvwxyz"
print(alp[ord(str)-96])

Submission status: Runtime Error

Solution code:
strlist = ["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"]
print(strlist[strlist.index(input()) + 1])

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

from collections import OrderedDict

n = int(input())
dic = OrderedDict()

for i in range(n):
    l,d = list(map(str,input().split()))
    dic[l] = d

a = str(input())

flag = False
time = 0

for key,value in dic.items():
    if flag == False:
        if key == a:
            flag = True
    else:
        time += int(value)

print(time)

Submission status: Runtime Error

Solution code:
a=input()
abcStr = "abcdefghijklmnopqrstuvwxyz"
print(abcStr[index(a)+1])

Submission status: Runtime Error

Solution code:
n = input()
data = [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(0,len(data)-1):
  if data[i]  == n:
    print(data[i+1])

Submission status: Runtime Error

Solution code:
S = 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"]

s_index = list.index(S)

print(list[s_index+1])

Submission status: Runtime Error

Solution code:
C = input()
k = [a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,g]
for i in range(len(k)):
  if C == k[i]:
    print(k[i+1])

Submission status: Runtime Error

Solution code:
al = "abcdefghijklmnopqrstuvwxyz"
i = input()
for a in ramge(al):
  if al[a] == i:
    print(al[a+1])

al = "abcdefghijklmnopqrstuvwxyz"
i = input()
for a in range(len(al)):
  if al[a] == i:
    print(al[a+1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
tmp = Input()
ans = chr(ord(tmp) + 1)
print(ans)

Submission status: Runtime Error

Solution code:
str = input()

print chr(ord(str) + 1)

Submission status: Runtime Error

Solution code:
list_alpha = [chr(ord('a') + i) for i in range(26)]
c = input()
index = list_alpha.find(c)
print(list_alphs[index + 1])

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define ote(x) cout<<(x)<<endl
#define all(x) (x).begin(),(x).end()
#define rp(i,s,e) for(int i=(s);i<(e);++i)

int main(){
	char c;
	cin>>c;
	printf("%c\n",(char)c+1);
}

Submission status: Runtime Error

Solution code:
from sys import stdin
lines = stdin.readlines()
 
C = lines[0]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import stdin
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def lsi():
	x=list(stdin.readline())
	x.pop()
	return x
def si(): return stdin.readline()
def sieve(x):
	a=[True]*(x+1)
	sq=floor(sqrt(x))
	for i in range(3, sq+1, 2):
		if a[i]:
			for j in range(i*i, x+1, i):
				a[j]=False
	if x>1:
		p=[2]
	else:
		p=[]
	for i in range(3, x+1, 2):
		if a[i]:
			p.append(i)
	return p
#vowel={'a', 'e', 'i', 'o', 'u', 'y', 'A', 'E', 'I', 'O', 'U', 'Y'}
#pow=[1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648, 4294967296, 8589934592, 17179869184, 34359738368, 68719476736, 137438953472, 274877906944, 549755813888, 1099511627776, 2199023255552, 4398046511104, 8796093022208, 17592186044416, 35184372088832, 70368744177664, 140737488355328, 281474976710656, 562949953421312, 1125899906842624, 2251799813685248, 4503599627370496, 9007199254740992, 18014398509481984, 36028797018963968, 72057594037927936, 144115188075855872, 288230376151711744, 576460752303423488, 1152921504606846976, 2305843009213693952, 4611686018427387904, 9223372036854775808]
############# CODE STARTS HERE #############
print(chr(ord(input())+1))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input()

print(chr(ord(S)+1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;

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

Submission status: Runtime Error

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