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
# Your code here!
C=input()
print(chr(ord(C)+ 1))

Submission status: Accepted

Solution code:
C = input()

alpha = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

Solution code:
xx=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']
for i in range(len(al)-1):
  if xx==al[i]:
    print(al[i+1])

Submission status: Accepted

Solution code:
alp='abcdefghijklmnopqrstuvwxyz'
s=str(input())
flag=False
for c in alp:
  if flag:
    print(c)
    break
  if c==s:
    flag=True

Submission status: Accepted

Solution code:
alp = 'abcdefghijklmnopqrstuvwxyz'

s = str(input())

flag = False
for c in alp:
    if flag:
        print(c)
        break
    if c == s:
        flag = True

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

print(chr(ord(n)+1))

Submission status: Accepted

Solution code:
class Solution:
    def solve(self, C: str) -> str:
        return chr(ord(C)+1)


if __name__ == '__main__':

    # standard input
    C = input()

    # solve
    solution = Solution()
    print(solution.solve(C))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from string import *
C = input()
idx = ascii_lowercase.find(C)
print(ascii_lowercase[idx+1])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc151/tasks/abc151_a

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

for i in range(1, 27):
    if C == chr(i + 96):
        ans = chr(i + 97)
        print(ans)
        exit()

Submission status: Accepted

Solution code:
def main(input_alphabet):
    al_list = [chr(ord('a') + i ) for i in range(26)]
    for j,alphabet in enumerate(al_list):
        if alphabet == input_alphabet:
            return al_list[j+1]
    
if __name__ == "__main__":
    input_alphabet = input()
    print(main(input_alphabet))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
letter = input()
if letter != 'z':
    print(chr(ord(letter) + 1))
else:
    print('a')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A
C = input()

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

Submission status: Accepted

Solution code:
a=str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x =input()
print(chr(ord(x) + 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']

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

ascii_code = ord(C)
next_character = chr(ascii_code + 1)

print(next_character)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

Alphabet = 'abcdefghijklmnopqrstuvwxyz'
Alphabet_list = [i for i in Alphabet]
print(Alphabet_list[Alphabet_list.index(C)+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

Solution code:
alph = input("")
if alph == "z":
    print("a")
else:

    ascnum = ord(alph) + 1
    nextalph = chr(ascnum)
    print(nextalph)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string

c = input()

a = list(string.ascii_lowercase)

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

Submission status: Accepted

Solution code:
c = str(input())

alpha = 'abcdefghijklmnopqrstuvwxyz'

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
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']

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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()
i=al.index(C)
print(al[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ArCoder 152 A Next Alphabet
def main():
	alp = input()
	print(chr(ord(alp)+1))
main()

Submission status: Accepted

Solution code:
moji = "abcdefghijklmnopqrstuvwxyz"
moji = list(moji)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():

    C = input()

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

Submission status: Accepted

Solution code:
import string
C = str(input())
A = list(string.ascii_lowercase)
for i in range(len(A)):
	if C == A[i]:
		break
print(A[i+1%26])

Submission status: Accepted

Solution code:
def resolve():
    a = input()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()
abc = 'abcdefghijklmnopqrstuvwxyz'
print(abc[abc.index(C) + 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']
z=input()
for i in range(26):
  if z==alphabet[i]:
    print(alphabet[i+1])

Submission status: Accepted

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

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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','z']
C=input()
for i in range(26):
  if C==S[i]:
    print(S[i+1])

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys

# import itertools
# import math

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

H = readline().decode('utf8').strip()
print(chr(ord(H) + 1))

Submission status: Accepted

Solution code:
from sys import stdin
a = stdin.readline().strip()
print(chr(ord(a)+1))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
C = input()

alp = list(chr(ord('a')+i) for i in range(26))

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

Submission status: Accepted

Solution code:

alpha = "abcdefghijklmnopqrstuvwxyz"
C = input()
print(alpha[alpha.index(C)+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    s = stdin.readline().strip()
    print(chr(ord(s)+1))

main()

Submission status: Accepted

Solution code:
from sys import stdin

def main():
	l = stdin.readline().strip()
	print(chr(ord(l)+1))
	
main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
a_to_z = [chr(i) for i in range(97, 97+26)]
for index, item in enumerate(a_to_z):
    if item == N:
        print(a_to_z[index+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import subprocess
args=['bf','Main.py'] 
#,+
subprocess.check_call(args)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

ans = chr(ord(C) + 1)

print(ans)

Submission status: Accepted

Solution code:
s = input().rstrip()

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

Submission status: Accepted

Solution code:
c = input()
print(chr(ord(c)+1)if not c=='z' else 'a')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    d = ['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']
    S = input()
    print(d[d.index(S) + 1])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
alpha2num = lambda c: ord(c) - ord('A') + 1
c = input()
ans = alpha2num(c)+1
num2alpha = lambda c: chr(c+64)
print(num2alpha(ans))

Submission status: Accepted

Solution code:
C = input()

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

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main_0():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


def main():
    C = read_str()
    res = chr(ord(C) + 1)
    print(res)

main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = alp[alp.find(c)+1]
print(ans)

Submission status: Accepted

Solution code:
import string

alphabet = string.ascii_lowercase
S = input()
ind = alphabet.index(S)
print(alphabet[ind+1])

Submission status: Accepted

Solution code:
import numpy as np

def main():
    C = input()
    print('{}'.format(chr(ord(C) + 1)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def ans2(c):
    _c = ord(c)
    print(chr(_c+1))

C = input()

ans2(C)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

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 a[i] == C:
    print(a[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Next Alphabet

c = input()

# アスキーコード変換
c_ascii = ord(c)
c_ascii = c_ascii + 1

# アスキーコードから文字に変換
ans = chr(c_ascii)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string

s = input()

l = list(string.ascii_lowercase)
for i in range(0,26):
    if s == l[i]:
        print(l[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = str(input())
s = ['z','x','c','v','b','n','m','a','s','d','f','g','h','j','k','l','q','w','e','r','t','y','u','i','o','p']
s.append(a)
s.sort()
Q = s.index(a)
e = Q + 2
print(s[int(e)])

Submission status: Accepted

Solution code:
a = str(input())
s = ['z','x','c','v','b','n','m','a','s','d','f','g','h','j','k','l','q','w','e','r','t','y','u','i','o','p']
s.append(a)
s.sort()
Q = s.index(a)
e = int(Q) + 2
print(s[int(e)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
txt ='abcdefghijklmnopqqrstuvwxyz'
c=input()
print(txt[txt.find(c)+1])

Submission status: Accepted

Solution code:
C = input()
abc ="abcdefghijklmnopqrstuvwxyz"
a = ""

for i in range(26):
    if C == abc[i]:
        a = abc[i+1]

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
C=input()
alp=list("abcdefghijklmnopqrstuvwzyz")
x=alp.index(C)
print(alp[x+1])

Submission status: Accepted

Solution code:
str = input()

print(chr(ord(str)+1))

Submission status: Accepted

Solution code:
c = input()
i = ord(c[0])
print(chr(i + 1))

Submission status: Accepted

Solution code:
import string
C = input()
word = list(string.ascii_lowercase)

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

Submission status: Accepted

Solution code:
alphabet=[chr(i) for i in range(97, 97+26)]
C=input()
num=ord(C)-97
print(alphabet[num+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

C = input()

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

Submission status: Accepted

Solution code:
import sys

c = sys.stdin.readline().rstrip()
print(chr(ord(c) + 1))

Submission status: Accepted

Solution code:
import string

c = str(input())
l = string.ascii_lowercase
for i in range(len(l)):
  if l[i] == c:
    print(l[i+1])
    break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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:
print(chr(ord(input()[0])+1))

Submission status: Accepted

Solution code:
p=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']
q=[i for i, x in enumerate(alp) if x==p]
print(alp[q[0]+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

letters="abcdefghijklmnopqrstuvwxyza"

index = letters.find(a)

print(letters[index + 1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = str(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']
alphabet = list('abcdefghijklmnopqrstuvwxyz')

id = alphabet.index(C)

print(alphabet[id+1])

Submission status: Accepted

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

Submission status: Accepted

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

print(s)

Submission status: Accepted

Solution code:
# python3


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


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
c = str(input())

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

Submission status: Accepted

Solution code:
import sys

row = sys.stdin.readline
# row = open('input.txt', 'r').readline
def read_string(row):
    return row().rstrip()
  
inp = read_string(row)
print(chr(ord(inp) + 1))

Submission status: Accepted

Solution code:
C = input()

alp = "abcdefghijklmnopqrstuvwxyz"
alp = list(alp)

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

Submission status: Accepted

Solution code:
a = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

import sys


def solve(inp):
    C = inp.readline().strip()

    if C[0] != 'z':
        next = chr(ord(C[0]) + 1)
    else:
        next = 'a'
    return next


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
alp = input()
allalp = 'abcdefghijklmnopqrstuvwxyz'
num = allalp.find(alp)
ans = allalp[num + 1]
print(ans)

Submission status: Accepted

Solution code:
c=input()
a='abcdefghijklmnopqrstuvwxyz'
for i in range(0,26):
    if c==a[i]:
        print(a[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()    
alp = [chr(ord('a')+i) for i in range(26)]    
cnt = 0        
    
for i in alp:    
    cnt += 1     
    if i == s:    
        print(alp[cnt])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

print(chr(ord(sys.stdin.readline().rstrip('\n')) + 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = input()
    dic = ['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(dic[(dic.index(S) + 1) % 26])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input()

import string
alphabets = list(string.ascii_lowercase)

print(alphabets[alphabets.index(inp) + 1])

Submission status: Accepted

Solution code:
def next():
    literka = input()
    wartosc = ord(literka)
    wartosc += 1 
    print(chr(wartosc))
    
next()

Submission status: Accepted

Solution code:
C = input()
alphabets = 'abcdefghijklmnopqrstuvwsyz'
out = alphabets.find(C)
print(alphabets[out + 1])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

C = str(input())

print(list[(list.index(C)+1)%len(list)])

Submission status: Accepted

Solution code:
C = input()

nb = lambda xx: chr(ord(xx) + 1) 
print(nb(C))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def get_next_char(s):
    """
    >>> get_next_char("a")
    'b'
    >>> get_next_char("y")
    'z'
    """
    next_ord = ord(s)+1
    next_chr = chr(next_ord)
    return next_chr
    
def main():
    s = input().rstrip("\n")
    print( get_next_char(s))

if __name__ == '__main__':
    main()
if __name__ == '__jupyter__':
    import doctest
    print(doctest.testmod())

Submission status: Accepted

Solution code:
import os

def main():
    char = input()
    list_ = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","w","x","y","z"]
    for i,v in enumerate(list_):
        if char == v:
            print(list_[i+1])

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def next_alphabet(a):

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

    num = list.index(a)

    return list[num + 1]


def main():
    insert = input()
    print(next_alphabet(insert))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
ans = chr(ord(s[0])+1)
print(ans)

Submission status: Accepted

Solution code:
ch = input()

print(chr(ord(ch)+1))

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
s = "abcdefghijklmnopqrstuvwxyz"
a = input()

i = 0
while(1):
    if(s[i] == a):
        break
    i += 1

print(s[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
val = input("")
i=ord(val)
i = i+1
chr(i)

print("", chr(i))

Submission status: Accepted

Solution code:
import sys

def solve(C: str):
    C_asc = ord(C)
    C_next_asc = C_asc + 1
    C_next = chr(C_next_asc)

    print(C_next)
    return
 
if __name__ == "__main__":
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    
    tokens = iterate_tokens()
    C = next(tokens)
    solve(C)

Submission status: Accepted

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

a = s.index(C)
print(s[a+1])

Submission status: Accepted

Solution code:
from collections import deque
from itertools import chain, combinations
import json




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

    # N = int(input())
    # A = [int(a) for a in input().split()]
    # B = [
    #     [int(a) for a in input().split()]
    #     for _ in range(N)
    # ]
    print()


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
c = input()

print(chr(c.encode()[0]+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C=input()
alph=["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(alph)):
    if C in alph[i]:
        ans=alph[i+1]
print(ans)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

c = ord(input()[0])
print(chr(c+1))

Submission status: Accepted

Solution code:
C = input()

#アルファベットの小文字のリストを生成
def SmallLetters():
    return [chr(i) for i in range(97,97+26)]

SL = SmallLetters()

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

Submission status: Accepted

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