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:
#!/usr/bin/env python3

def main():
    S = input()
    R = chr(ord(S) + 1)
    print(R)


main()

Submission status: Accepted

Solution code:
al = input()

print(chr(ord(al) + 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=input()
al='abcdefghijklmnopqrstuvwxyz'
for x in range(26):
    if c==al[x]:
        print(al[x+1])

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

Solution code:
import math

c = input()

al = list("abcdefghijklmnopqrstuvwxyz")

idx = al.index(c)

print(al[idx + 1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=input()
al='abcdefghijklmnopqrstuvwxyz'
for x in range(26):
    if c==al[x]:
        print(al[x+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC151A - Next Alphabet

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

Submission status: Accepted

Solution code:
c= input()
alf="abcdefghijklmnopqrstuvwyz"

for i in range(len(alf)+1):
	if c==alf[i] and c!="z":
		print(alf[i+1])
		break
	elif c== "z":
		print("a")
		break

Submission status: Accepted

Solution code:
C = input()

print(chr(ord(C[0]) + 1))

Submission status: Accepted

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])
        break
    elif c == "z":
        print("a")
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string

s = input()

abc = string.ascii_lowercase

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
c = input()

tmp = ord(c)+1

print(chr(tmp))

Submission status: Accepted

Solution code:
c = input()
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 range(len(alphabet)):
    x = str(alphabet[i])
    if c == x:
        print(alphabet[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

aa = input()
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 nn in alphabet:
  if sorted([aa,nn])[0] == aa and aa != nn:
    print(nn)
    exit()

Submission status: Accepted

Solution code:
S = input().strip('\n')
str='abcdefghijklmnopqrstuvwxyz'
for i in range(26):
    if str[i]==S:print(str[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
     c = input()
     next_c = chr(ord(c) + 1)
     
     print(next_c)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
c=str(input())
l="abcdefghijklmnopqrstuvwxyz"
u=l.find(c)
print(l[u+1])

Submission status: Accepted

Solution code:
a = [chr(i) for i in range(97, 97+26)]
b = input()

print(a[a.index(b) + 1])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np


def solve(C: str):
    print(chr(ord(C)+1))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    C = next(tokens)  # type: str
    solve(C)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
al=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','m','p','q','r','s','t','u','u','w','x','y','z']
s=input()
print(al[al.index(s)+1])

Submission status: Accepted

Solution code:
import string

C = input()
a = string.ascii_lowercase
ind = a.find(C)
print(a[ind+1])

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()
sam = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
C=input()
abclist="abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
C = input()

S = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
import sys
import collections


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    d = collections.defaultdict(str)
    for i in range(97, 97 + 25):
        d[chr(i)] += chr(i+1)
    print(d[str(readline().rstrip().decode('utf-8'))])


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
x = input()
y = 'abcdefghijklmnopqrstuvwxyz'
from collections import deque
li = deque([])
for i in range(len(y)):
    li.append(y[i:i+1])
b = True
while(b):
    p = li.pop()
    if p == x:
        print(q)
        b = False
    q = p

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
c = input()

alphabet = 'abcdefghijklmnopqrstuvwxyz'

index = alphabet.index(c)
print(alphabet[index+1])

Submission status: Accepted

Solution code:
c=str(input())

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

Submission status: Accepted

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

Solution code:

c=str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

Solution code:
C=input()
print(bytes(c+1 for c in C.encode()).decode())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

Q=[chr(ord('a') + i) for i in range(26)]
print(Q[Q.index(S)+1])

Submission status: Accepted

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

a_str = input()
idx = a.index(a_str)

print(a[idx+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#--Next Alphabet
alphabet = ["dummy", "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 = len(alphabet)

character = input()

i = 0
for i in range(num):
  i = i + 1
  if(alphabet[i] == character):
    break
  else:
    pass

print(alphabet[i+1])

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    from string import ascii_lowercase
    c = input()
    idx = ascii_lowercase.index(c)
    ans = ascii_lowercase[idx + 1]
    print(ans)


if __name__ == '__main__':
    main()

# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())

Submission status: Accepted

Solution code:
alpha = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    print(chr(ord(input())+1))
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

Solution code:
C = input()

a = "abcdefghijklmnopqrstuvwxyz"
d = dict()
for i, x in enumerate(a):
    d[x] = i+1
print(a[d[C]])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = a = [chr((ord("a") + i)) for i in range(26)]
print(l[l.index(input())-25])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
char_list = [ chr(ord('a')+num) for num in range( 26 ) ]

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

Submission status: Accepted

Solution code:
MI=lambda:map(int,input().split())
LI=lambda:list(MI())

s=input()
ans=chr(ord(s)+1)
print(ans)

Submission status: Accepted

Solution code:
def main():
    S = input()
    from string import ascii_lowercase
    dic = {a: i for i, a in enumerate(ascii_lowercase)}
    rdic = {i: a for i, a in enumerate(ascii_lowercase)}
    print(rdic[dic[S] + 1])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin,setrecursionlimit
import string
setrecursionlimit(10 ** 7)
s = stdin.readline().rstrip()
a = string.ascii_lowercase
print(a[a.index(s)+1])

Submission status: Accepted

Solution code:
from itertools import permutations
import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    c=SI()
    print(chr(ord(c)+1))

main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
c = input()

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

s = readline().rstrip().decode('utf-8')
print(chr(ord(s)+1))

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s= input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
C = input()

al = string.ascii_lowercase
for i in range(len(al)):
  if al[i] == C:
    print(al[i+1])
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

print(chr (int(ord(a) + 1)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a="abcdefghijklmnopqrstuvwxyz"
alpha=list(a)

moji=input()
index=alpha.index(moji)

print(alpha[index+1])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os

def main():
	string = input()
	lists = ["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"]
	ans = ""
	count = 0
	for i in lists:
		if string == i:
			ans = lists[count+1]
			break
		count += 1
	print(ans)

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
C = input()

def next_to(alphabet):
    alphabets = 'abcdefghijkllmopqrstuvwxyz'
    index_of_alphabet = alphabets.find(alphabet)
    next_to= alphabets[index_of_alphabet + 1]

    return next_to

answer = next_to(C)

print(answer)

Submission status: Accepted

Solution code:
C=input()

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

Submission status: Accepted

Solution code:
s = input();

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

Submission status: Accepted

Solution code:
L = [chr(i) for i in range(97, 97+26)]

C = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=str(input())

tmp=ord(s)
tmp+=1

tmp=chr(tmp)

print(tmp)

Submission status: Accepted

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

alpha_index = alphabet.index(C)
print(alphabet[alpha_index + 1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word=input()
print(chr(ord(word)+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(26):
    if A[i]==C:
        print(A[i+1])
        break

Submission status: Accepted

Solution code:
C=input()
alfa="abcdefghijklmnopqrstuvwxyz"

alfa_index=alfa.index(C)

print(alfa[alfa_index+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

C = sr()
answer = chr(ord(C) + 1)
print(answer)
# 26

Submission status: Accepted

Solution code:
a=str(input())
A={"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(A[a])

Submission status: Accepted

Solution code:
c = str(input())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
print(chr(ord(input()) + 1))

Submission status: Accepted

Solution code:
from sys import stdin

C = input()
c = ord(C)

print(chr(c + 1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = str(input())

print (chr(ord(N) + 1))

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:
a = "abcdefghijklmnopqrstuvwxyz"
a = list(a)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 151: A – Next Alphabet
print(chr(ord(input()) + 1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = raw_input()

print chr(ord(C)+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=input()

print(chr(ord(A)+1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  c = input()
  print(chr(ord(c)+1))
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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']
t = 0
for i in range(26):
    if c == al[i]:
        t = i
print(al[t+1])

Submission status: Accepted

Solution code:
c = input()
alpha_list =list( 'abcdefghijklamnopqrstuvwxyz')
for i in range(27):
    if alpha_list[i] == c:
        print(alpha_list[i+1])
        break

Submission status: Accepted

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

alphabets = 'abcdefghijklmnopqrstuvwxyz'


def solve(C: str):
    print(alphabets[alphabets.index(C)+1])
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    C = next(tokens)  # type: str
    solve(C)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
AL = string.ascii_lowercase

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

Submission status: Accepted

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

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']
print(A[A.index(C)+1])

Submission status: Accepted

Solution code:
c = input()
a = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#アスキーコードから文字 chr()
#文字からアスキーコード ord()
print(chr(ord(input())+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 初期入力
c= input()
a_z = [chr(ord('a') + i) for i in range(26)] #アルファベットを配列で用意

c_indx = a_z.index(c) 
print(a_z[c_indx + 1])
#print(c)

Submission status: Accepted

Solution code:
c = str(input())

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

Submission status: Accepted

Solution code:
#Next Alphabet
ab = [chr(ord('a') + i) for i in range(26)]
C = input()
for i in range(25):
    if C == ab[i]:
        print(ab[i+1])

Submission status: Accepted

Solution code:
C = input()
alp = [chr(i) for i in range(97,97+26)]
if C!='z':
    print(alp[alp.index(C)+1])
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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)):
    if C==A[i]:
        print(A[i+1])
    else:
        continue

Submission status: Accepted

Solution code:
def main():
    C = input()
    AL = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","x","y","z"]
    i = AL.index(C)
    print(AL[i+1])

main()

Submission status: Accepted

Solution code:
import sys

c = sys.stdin.readline().rstrip()

def main():
    nex = chr(ord(c) + 1)
    print(nex)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import string

AL = string.ascii_lowercase

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():

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

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

Submission status: Accepted

Solution code:
s=input()
alphabets=["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(alphabets)):
    if alphabets[i]==s:
        print(alphabets[i+1])

Submission status: Accepted

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

print(a_list[a_list.index(a)+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)):
    if c == a[i]:
        print (a[i+1])

Submission status: Accepted

Solution code:
from sys import stdin

c = stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
from string import ascii_lowercase as lower
print(lower[lower.find(input())+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#S,T = map(int,input().split())
S = input()
print(chr(ord(S) + 1))

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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


def resolve():
    c = input()

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
c = input()

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