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: Accepted

Solution code:
# coding: utf-8
c = input()
print(chr(ord(c) + 1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alphabet = 'abcdefghijklmnopqrstuvwxyz'
print(alphabet[alphabet.find(input()) + 1])

Submission status: Accepted

Solution code:
# A - Next Alphabet https://atcoder.jp/contests/abc151/tasks/abc151_a
number=ord(input())
moji=chr(number+1)
print(moji)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

ans = chr(ord(c) + 1)
print(ans)

Submission status: Accepted

Solution code:
# A - Next Alphabet
# https://atcoder.jp/contests/abc151/tasks/abc151_a

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

Submission status: Accepted

Solution code:
S = input()
al = list('abcdefghijklmnopqrstuvwxyz')
print(al[al.index(S) + 1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


c = input()



ls = [chr(ord('a') + i) for i in range(26)]

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

Submission status: Accepted

Solution code:
C = input()
A = list("abcdefghijklmnopqrstuvwxyz")
A1 = A.index(C)
print(A[A1+1])

Submission status: Accepted

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
c = input()

ans = chr(ord(c) + 1)
print(ans)

Submission status: Accepted

Solution code:
c = input()
alpha = [chr(i) for i in range(97, 97+26)]
number = alpha.index(c)
print(alpha[number + 1])

Submission status: Accepted

Solution code:
c = input()
alp = "abcdefghijklmnopqrstuvwxyz"
print(alp[alp.index(c)+1])

Submission status: Accepted

Solution code:
letters = list("abcdefghijklmnopqrstuvwxyz")

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

Submission status: Accepted

Solution code:
C = input()
cs = "abcdefghijklmnopqrstuvwxyz"
i = cs.find(C)
r = cs[i+1]
print(r)

Submission status: Accepted

Solution code:
a = input()
print(chr(((ord(a)-ord("a")+1)%26)+ord("a")))

Submission status: Accepted

Solution code:
C = input()
moji = "abcdefghijklmnopqrstuvwxyz"
print(moji[moji.index(C)+1])

Submission status: Accepted

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


def main():
    C = input().strip()
    print(chr(ord(C)+1))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
C=input()

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

Submission status: Accepted

Solution code:
import string
C = input()
alphabet = string.ascii_lowercase
print(alphabet[alphabet.index(C) + 1])

Submission status: Accepted

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


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    c = input()
    alphabet = "abcdefghijklmnopqrstuvwxyz"

    return alphabet[alphabet.index(c) + 1]


if __name__ == "__main__":
    print(main())

Submission status: Accepted

Solution code:
import string
C = input()
alphabet = string.ascii_lowercase
print(alphabet[alphabet.index(C) + 1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = 'abcdefghijklmnopqrstuvwxyz'
c = input()
for i in range(len(alpha)):
    if (alpha[i]==c):
        print(alpha[i+1])
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=input()
r=['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=0
for i in r:
    if c==i:
        print(r[n+1])
    n+=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=str(input())
a=ord(c)+1
print(str.lower(chr(a)))

Submission status: Accepted

Solution code:
c = input()
s = "abcdefghijklmnopqrstuvwxyz"
i = 0
while(1):
    if c==s[i]:
        print(s[i+1])
        break
    i+=1

Submission status: Accepted

Solution code:
st = input()

print(chr(ord(st)+1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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','d','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: Accepted

Solution code:
c=input()
print(chr(ord("a")+(ord(c)-ord("a")+1)%26))

Submission status: Accepted

Solution code:
# ABC151A

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S=input()
print(chr(ord(S) + 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# input

C = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

c = input()

print(chr(ord(c) + 1))

Submission status: Accepted

Solution code:
c = 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','y','z']
num = int(l.index(c))+1
print(l[num])

Submission status: Accepted

Solution code:
c=input()

alplist=["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(alplist[alplist.index(c)+1])

Submission status: Accepted

Solution code:
ref = 'abcdefghijklmnopqrstuvwxyz'
C = input()
for i in range(len(ref)):
  if ref[i] == C:
    print(ref[i+1])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline

    C = list(input().rsplit()[0])[0]

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import string
C = input()
L = list(string.ascii_lowercase)
count = 0
for i in L:
    count += 1
    if C == i:
        print(L[count])
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()
Alphabet = [chr(i) for i in range(97,97+26)]
print(Alphabet[Alphabet.index(C) + 1])

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import string
A=string.ascii_lowercase
C=input()
for i,value in enumerate(A):
    if value==C:
        print(A[i+1])

Submission status: Accepted

Solution code:
il = input()

print(chr(ord(il)+1))

Submission status: Accepted

Solution code:
C = input()
al = "abcdefghijklmnopqrstuvwxyz"
ans = al.find(C)
print(al[ans+1])

Submission status: Accepted

Solution code:
c = input()
data = list("abcdefghijklmnopqrstuvwxyz")
print(data[ data.index(c) + 1 ])

Submission status: Accepted

Solution code:
import fileinput

c = input()

print(chr(ord(c) + 1))

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_151_A()

Submission status: Accepted

Solution code:
def ascii_alter(c,x):
    return chr(ord(c)+x)
def main():
    S=lambda:input()
    I=lambda:int(input())
    L=lambda:list(map(int,input().split()))
    LS=lambda:list(map(str,input().split()))
    
    c=S()
    print(ascii_alter(c,1))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
al=[chr(ord('a') + i) for i in range(26)]
c = str(input())
for i in range(26):
    if (c == al[i]):
        print(al[i+1])
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
métele_algonomas=input()
caja_china = ord(métele_algonomas)
dedos = caja_china + 1
print(chr(dedos))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    c = stdin.readline()[:-1]
    print(chr(ord(c) + 1))


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  9 01:47:04 2020

@author: shinba
"""

C = input()

S = "abcdefghijklmnopqrstuvwxyz"

ans = S.find(C)

print(S[ans+1])

Submission status: Accepted

Solution code:
a = input()

x = "abcdefghijklmnopqrstuvwxyz"

y = x.find(a)

print(x[y+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()
i = ord(C)

print(chr(i + 1))

Submission status: Accepted

Solution code:
alph='abcdefghijklmnopqrstuvwxyz'
s=input()
print(alph[alph.find(s)+1])

Submission status: Accepted

Solution code:
#wakaran
s = input()
alphabet = "abcdefghijklmnopqrstuvwxyz"
p = alphabet.find(s)
print(alphabet[p+1])

Submission status: Accepted

Solution code:
c = input()

al = [chr(i) for i in range(97,97+26)]

for i in range(int(len(al))):
    if al[i] == c:
        print(al[i+1])
        exit()

Submission status: Accepted

Solution code:
C = input()
d = {"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"}

print(d[C])

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    s = input()
    print(chr(ord(s) + 1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

L = [chr(i) for i in range(97,97+26)]
C = input()

for j in range(len(L)):
    if C == L[j]:
        print(L[j+1])
        sys.exit()

Submission status: Accepted

Solution code:
input1 = input()

a = ord(input1)

print(chr(a + 1))

Submission status: Accepted

Solution code:
# A- Next Alphabet
C= input ()
print (chr (ord (C)+1))

Submission status: Accepted

Solution code:
a=input()

b=a
c=b
d=c
e=d
f=e

print(chr(ord(f)+1))

Submission status: Accepted

Solution code:
c = input()
alpbet = ['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(25):
    if c == alpbet[i]:
        print(alpbet[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(list('abcdefghijklmnopqrstuvwxyz')[list('abcdefghijklmnopqrstuvwxyz').index(input())+1])

Submission status: Accepted

Solution code:

C = input()
alpha = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
C = input()
S = list('abcdefghijklmnopqrstuvwxyz')
for i in range(len(S)):
    if C == S[i]:
        print(S[i+1])
        break

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

s = S()
print(chr(ord(s)+1))

Submission status: Accepted

Solution code:
C = input()

abc ='abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

Solution code:
# A - Next Alphabet

C = str(input())
print(chr(ord(C) + 1))

Submission status: Accepted

Solution code:
c = input()
l = 'abcdefghijklmnopqrstuvwxyz'
for i in range(25):
    if l[i] == c:
        print(l[i+1])

Submission status: Accepted

Solution code:
s='abcdefghijklmnopqrstuvwxyz'
print(s[s.find(input())+1])

Submission status: Accepted

Solution code:
import string
C = input()
alpha = [s for s in string.ascii_lowercase]
for i in range(len(alpha)):
    if alpha[i] == C:
        print(alpha[i+1])
        break

Submission status: Accepted

Solution code:
C= input()
alpa=[chr(ord('a') + i) for i in range(26)]
ans = 1

for c in alpa:
    if c == C:
        break
    ans+=1
print(alpa[ans])

Submission status: Accepted

Solution code:
C = input()
A = list('abcdefghijklmnopqrstuvwxyz')
for i in range(len(A)-1):
  if C == A[i]:
    print(A[i+1])

Submission status: Accepted

Solution code:
c = input()

az = ['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(az)) :
    if az[i] == c :
        print(az[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = 'abcdefghijklmnopqrstuvwxyz'

c = input()
ind = S.find(c)
print(S[ind+1])

Submission status: Accepted

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 + 1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
letra = input()
import string
letras = list(string.ascii_lowercase)

index = letras.index(letra)
print(letras[index+1])

Submission status: Accepted

Solution code:
n = (input())
x="No me deja ponr menos de 50 palabras cr!!!!"
print (chr (ord (n)+1 ) )

Submission status: Accepted

Solution code:
C = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import string
c = input()
a = string.ascii_lowercase
print(a[a.index(c)+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    ch = input()
    return chr(ord(ch)+ 1)

print(solve())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C=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 range(len(A)-1):
    if C==A[i]:
        print(A[i+1])
        exit(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
c = input()
str = string.ascii_lowercase
for i in range(0, len(str)):
    if str[i]==c:
        print(str[i+1])

Submission status: Accepted

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.index(a)])

Submission status: Accepted

Solution code:
import sys
c = str(input())
ls = list("abcdefghijklmnopqrstuvwxyz")
for i in range(26):
    if ls[i] == c:
        print(ls[i+1])
        sys.exit()

Submission status: Accepted

Solution code:
alphabet = "abcdefghijklmnopqrstuvwxyz"
s = input()
for idx, letter in enumerate(alphabet):
  if letter == s:
    print(alphabet[idx+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:

c=input()
al=[chr(ord('a') + i) for i in range(26)]
num=[chr(ord('a') + i) for i in range(26)].index(c)
print(al[num+1])

Submission status: Accepted

Solution code:
c= input()

alphabet = 'abcdefghijklmnopqrstuvwxyz'

index = alphabet.find(c)

print(alphabet[index+1])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

c = str(input())

print(chr(ord(c)+1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = 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']
def alphabet():
    for i in range(len(abc)):
        if c == abc[i]:
            return abc[i+1]

print(alphabet())

Submission status: Accepted

Solution code:
C = input()
Alphabet = 'abcdefghijklmnopqrstuvwxyz'

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

print(D)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()
alph = list('abcdefghijklmnopqrstuvwxyz')
for i in range(26):
    if alph[i] == c:
        print(alph[i+1])
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = input()
L = [chr(ord('a') + i) for i in range(26)]
print(L[L.index(t) + 1])

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
C=input()
S ='abcdefghijklmnopqrstuvwxyz' 
for i in range (len(S)):
    if  S[i]== C:
        print(S[i+1])

Submission status: Accepted

Solution code:
C = input()
A='abcdefghijklmnopqrstuvwxyz'
for i in range(len(A)):
    if A[i] == C:
        print(A[i+1])
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = str(input())
string = 'abcdefghijklmnopqrstuvwxyz'

idx = string.index(C)

print(string[idx+1])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    c = input()
    print(chr(ord(c)+1))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
C = input()

code = ord(C) + 1

print(chr(code))

Submission status: Accepted

Solution code:
C = input()

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

num = alphabet_list.index(C)

print(alphabet_list[num+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
#N, K = map(int, input().split())
# 文字列の入力
s = input()
print(chr(ord(s)+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
eng="abcdefghijklmnopqrstuvwxyz"
c=input()

for i in range(25):
    if c==eng[i]:
        ans=eng[i+1]
        break

print(ans)

Submission status: Accepted

Solution code:
alp=[x for x in "abcdefghijklmnopqrstuvwxyz"]
C=input()
print(alp[alp.index(C)+1])

Submission status: Accepted

Solution code:
alpha = 'abcdefghijklmnopqrstuvwxyz'
c = str(input())

for i in range(25):
    if c==alpha[i]:
        ans = alpha[i+1]
        break

print(ans)

Submission status: Accepted

Solution code:
def main():
    C = input()
    alpha = "abcdefghijklmnopqrstuvwxyz"
    idx = alpha.index(C) + 1
    if idx > 25: idx -= 26
    print(alpha[idx])
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

C = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
s1=ord(s)+1

print(chr(s1))

Submission status: Accepted

Solution code:
c=str(input())

if len(c)==1 and c!="z":
	print(chr(ord(c)+1))
else:
	print('a')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, string
c = sys.stdin.readline().rstrip()
a = string.ascii_lowercase
i = a.index(c) + 1
print(a[i])

Submission status: Accepted

Solution code:
c=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 range(len(a)):

    if c==a[i]:

        print(a[i+1])

Submission status: Accepted

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','z']
alphabet=input()
print(list[list.index(alphabet)+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
s = input()
lis = string.ascii_lowercase
for i in range(len(lis)):
    if lis[i] == s:
        print(lis[i+1])

Submission status: Accepted

Solution code:
input_data = input()
x = [chr(ord('a') + i) for i in range(26)]

for i in range(len(x)):
  if input_data == x[i]:
    print(x[i+1])

Submission status: Accepted

Solution code:
dic = {'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'}
c = input()
print(dic[c])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = input()
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']
for i in range(len(alp)):
    if a == alp[i]:
        print(alp[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#copy

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()
alphabet = "abcdefghijklmnopqrstuvwxyz"
print(alphabet[alphabet.index(C)+1])

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
rs = lambda: input (). strip ()
ri = lambda: int (input ())
rl = lambda: list (map (int, input (). split ()))
mod = 10 ** 9 + 7

C = rs ()

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

C = rs()

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

Submission status: Accepted

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

str = input()

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

Submission status: Accepted

Solution code:
s=input()

letters = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
c = input()
ord_c = ord(c) #アスキーコード取得
chr_c = chr(ord(c)+1)
print(chr_c)

Submission status: Accepted

Solution code:
a = input()
al = "abcdefjhijklmopqrstuvwxyz"
for i in range(24):
    if a == al[i]:
        print(al[i+1])

Submission status: Accepted

Solution code:
import string
s = string.ascii_lowercase
print(s[s.index(str(input()))+1])

Submission status: Accepted

Solution code:
c = input()
judge = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    C = input(str)
    print(chr(ord(C) + 1))


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

Solution code:
c = input();

al = "abcdefghijklmnopqrstuvwxyz";
num = al.find(c);

print(al[num+1]);

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alp='abcdefghijklmnopqrstuvwxyz'
print(alp[alp.index(input())+1])

Submission status: Accepted

Solution code:
#A

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

Submission status: Accepted

Solution code:
x=input()
a=list('abcdefghijklmnopqrstuvwxyz')
n=a.index(x)
print(a[n+1])

Submission status: Accepted

Solution code:
C=input()
str='abcdefghijklmnopqrstuvwxyz'
print(str[str.index(C)+1])

Submission status: Accepted

Solution code:
import string
alpha = string.ascii_lowercase

c = input()
print(alpha[alpha.index(c) + 1])

Submission status: Accepted

Solution code:
s=input()

print(chr(ord(s)+1))

Submission status: Accepted

Solution code:
C = input()

alp = 'abcdefghijklmnopqrstuvwxyz'

print(alp[alp.find(C)+1])