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:
s = str(input())
n = ord(s)
print(chr(n+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    C = input()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
C = input()

ans = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(C: str):
    a = "abcdefghijklmnopqrstuvwxyz"
    for i in range(len(a)):
        if a[i] == C:
            print(a[i+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()
alphabet = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(alphabet)):
    if alphabet[i] == c:
        print(alphabet[i + 1])
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(num2alpha(alpha2num(alp)+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','w','x','y','z']
for i in range(26):
  if c==list[i]:
    print(list[i+1])

Submission status: Accepted

Solution code:
a = input()

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

c = b.index(a)

print(b[c+1])

Submission status: Accepted

Solution code:
C = input()[0]

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

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

Solution code:
#ABC151 A

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

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"]
s=input()
q=a.index(s)
print(a[q+1])

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#

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




main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

alphabet = 'abcdefghijklmnopqrstuvwxyz'

pos = alphabet.find(C)
pos += 1

print(alphabet[pos])

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

Submission status: Accepted

Solution code:
n = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

list_abc = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()
if C == 'z':
    print('a')
else:
    print(chr(ord(C[0]) + 1))

Submission status: Accepted

Solution code:
C = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

alpha = "abcdefghijklmnopqrstuvwxyz"

for j,i in enumerate(alpha):
    if i == a:
        print(alpha[j+1])
        break

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","x","y","z"]
for i in range(len(l)):
  if l[i] == c:
    print(l[i+1])

Submission status: Accepted

Solution code:
c = input()

num2alpha = lambda x: chr(x+64)
alpha2num = lambda y: ord(y) - ord('A') + 1

print(num2alpha(alpha2num(c) + 1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
def main():
	n = str(input())

	l = "abcdefghijklmnopqrstuvwxyz"
	l_l = list(l)

	print(l_l[l_l.index(n)+1])





 
if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
C = input()

alphabet = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

Solution code:
from collections import defaultdict
def main():
    dic = defaultdict(int)
    ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
    for i,s in enumerate(ascii_lowercase):
        dic[s] = i
    inp = input()
    idx = dic[inp] + 1
    print(ascii_lowercase[idx])
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

CC = chr(ord(C) + 1)

print(CC)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from string import ascii_lowercase

INPUT = lambda: sys.stdin.readline().rstrip()

sys.setrecursionlimit(10 ** 9)


def main():
    C = INPUT()

    flag = False
    for s in ascii_lowercase:
        if flag:
            print(s)
            sys.exit()
        if s == C: flag = True


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
C = input()

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

Submission status: Accepted

Solution code:
import collections
import itertools as it
import math
import numpy as np

# A = input()
# A = int(input())
# A = map(int, input().split())
# A = list(map(int, input().split()))
# A = [int(input()) for i in range(N)]
#
# c = collections.Counter()
C = input()

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

Submission status: Accepted

Solution code:
c = input()
a = 'abcdefghijklmnopqrstuvwxyz'
print(a[a.index(c)+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","w","x","y","z"]
idx = list.index(c)

print(list[idx+1])

Submission status: Accepted

Solution code:
import string

arr = [chr(i) for i in range(97, 97+26)]
print(arr[arr.index(input())+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

a = ord(s)

a += 1

ans = chr(a)

print(ans)

Submission status: Accepted

Solution code:
s=input()

L=[chr(i) for i in range(97, 97+26)]
idx=L.index(s)

print(L[idx+1])

Submission status: Accepted

Solution code:
C = input()
alph = list("abcdefghijklmnopqrstuvwxyz")
n = alph.index(C)
nn = (n + 1)%26
print(alph[nn])

Submission status: Accepted

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

print(a_list[a_index+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
alp=string.ascii_lowercase

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

Submission status: Accepted

Solution code:
C=input()

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

Submission status: Accepted

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

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","x","y","z"]

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

Submission status: Accepted

Solution code:
c = input()

alp = "abcdefghijklmnopqrstuvwxyz"
idx = alp.find(c)
print(alp[idx + 1])

Submission status: Accepted

Solution code:
C = input()

alfa_list = [chr(i) for i in range(97,97+26)]
# print(alfa_list)
# print(alfa_list.index(C))
print(alfa_list[alfa_list.index(C)+1])

Submission status: Accepted

Solution code:
import sys,queue,copy
sys.setrecursionlimit(10**8)
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
INF = float('inf')

a = input()

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

Submission status: Accepted

Solution code:
s = input()

l = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
C = input()
ls = list("abcdefghijklmnopqrstuvwxyz")
num = list(range(0,26))
dic = dict(zip(ls,num))
print(ls[dic[C]+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

C_a = ord(C)

print(chr(C_a+1))

Submission status: Accepted

Solution code:
S = input()

S_num = int(ord(S)) + 1
print(chr(S_num))

Submission status: Accepted

Solution code:
C = str(input())

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

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

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = 'abcdefghijklmnopqrstuvwxyz'
s = input()
idx = w.find(s)
print(w[idx + 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 permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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

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


if __name__=='__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
    s = S()[0]
    for i, t in enumerate(ascii_lowercase):
        # print(t, s)
        if t == s:

            print(ascii_lowercase[i+1])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

all_list = 'abcdefghijklmnopqrstuvwxyz'

for i, content in enumerate(all_list):
    if content == C:
        print(all_list[i+1])
        exit()

Submission status: Accepted

Solution code:
a=ord(str(input())[0])

print(chr(a+1))

Submission status: Accepted

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


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:
X = 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(X)+1])

Submission status: Accepted

Solution code:
c = input()
alphabet = "abcdefghigklmnopqrstuvwxyz"
for i, a in enumerate(alphabet):
  if a == c:
    print(alphabet[i+1])
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = 'abcdefghijklmnopqrstuvwxyz'

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alphabet = 'abcdefghijklmnopqrstuvwxyz'

c = input().strip()

for i in range(len(alphabet)):
    c2 = alphabet[i]
    if c == c2:
        break

print(alphabet[i + 1])

Submission status: Accepted

Solution code:
n = input()

al = "abcdefghijklmnopqrstuvwxyz"

#print(al.index(n))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
alp = list("abcdefghijklmnopqrstuvwxyz")
for i in range(0, len(alp)):
    if s == alp[i]:
        print(alp[i+1])

Submission status: Accepted

Solution code:
C = input()
char = "abcdefghijklmnopqrstuvwxyz"
L = []

for i in range(len(char)):
    L.append(char[i])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read

#n = int(input())
#a = [int(i) for i in readline().split()]

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

Submission status: Accepted

Solution code:
alphabets = "abcdefghijklmnopqrstuvwxyz"

C = input()

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

Submission status: Accepted

Solution code:
from sys import stdin

if __name__ == '__main__':
    c = stdin.readline().rstrip()
    charList = 'abcdefghijklmnopqrstuvwxyz'
    for i in range(len(charList) - 1):
        if charList[i] == c:
            print(charList[i+1])

Submission status: Accepted

Solution code:
c = str(input())

alp = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
ABC_list = list('abcdefghijklmnopqrstuvwxyz')

n = input()

ansnum = ABC_list.index(n)

ans = ABC_list[ansnum + 1]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = str(input())

alphanum = lambda c: ord(c) - ord("A") + 1
numalpha = lambda c: chr(c + 64)
x = alphanum(C) + 1
ans = numalpha(x)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s = sys.stdin.readline().rstrip()
a='abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

Solution code:
c = input()
al_list = [chr(ord('a') + i) for i in range(26)]
for n, al in enumerate(al_list):
    if al == c:
        idx = n
        break

print(al_list[n+1])

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:
moji = list("abcdefghijklmnopqrstuvwxyz")
C = input()
i = moji.index(C)
print(moji[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from string import ascii_lowercase as lower


def main():
    C = input()
    for i in range(28):
        if C == lower[i]:
            print(lower[i+1])
            break


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# import itertools
# import math


def solve(S):
    alp = [chr(i) for i in range(97, 97+26)]
    index = alp.index(S) + 1
    if index == len(alp):
        index = 0
    return alp[index]


# N = int(input())
S = input()
# A, B = map(int, input().split())
# A = list(map(int, input().split()))

print(solve(S))

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:
alphabet = [chr(ord('a') + i) for i in range(26)]
C = input()
for i in range(25):
    if alphabet[i] == C:
        print(alphabet[i+1])

Submission status: Accepted

Solution code:
a=input()
al=[chr(ord('a')+i) for i in range(26)]
for x,i in enumerate(al):
    if i==a:
        print(al[x+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

C = str(input())
ord_C = ord(C)

print(chr(ord_C + 1))

Submission status: Accepted

Solution code:
from bisect import bisect_right, bisect_left
from itertools import groupby, permutations, combinations
from fractions import gcd
import numpy as np
from sys import stdin, stderr


def lcm(x, y):
    return (x * y) // gcd(x, y)


def main():
    str = "abcdefghijklmnopqrstuvwxyz"
    c = input()
    for i in range(len(str)):
        if str[i] == c:
            ret = str[i + 1]
    return ret


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = str(input())
l = [chr(i) for i in range(97,97+26)]

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

Submission status: Accepted

Solution code:
c = input()

alphabet = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
c=str(input())

a=chr(ord(c) + 1)

print(a)

Submission status: Accepted

Solution code:
def joint(i):
    cnt = 0
    for node in line_dict[i]:
        if cnt_list[node] == -1:
            cnt += joint(node)



if __name__ == '__main__':
    import sys
    input = sys.stdin.readline

    c = input()[0]
    import string
    for i, a in enumerate(string.ascii_lowercase):
        if a == c:
            print(string.ascii_lowercase[i+1])

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

Submission status: Accepted

Solution code:
S = input() #ここで標準入力
s = chr(ord(S)+1)
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def main():
    alphabets = 'abcdecghijklmnopqrstuvwxyz'
    char = input()
    next_index = alphabets.find(char) + 1
    print(alphabets[next_index])

if __name__ == "__main__":
    main()

Submission status: Accepted

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

############### TESTCASE ###############
test = ""
#test = \
"""

"""
########################################
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
################# MAIN ################# 

x = input2()
lowers = [chr(i) for i in range(ord("a"), ord("z")+1)]
xi = lowers.index(x)
print(lowers[xi+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']
print(al[al.index(c)+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import re
import math
#import numpy as np


#main
c=input()

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

Submission status: Accepted

Solution code:
before = input()

print(chr(ord(before) + 1))

Submission status: Accepted

Solution code:
a = str(input())

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

Submission status: Accepted

Solution code:
C = input()
english = "abcdefghijklmnopqrstuvwxyz"
for i ,j in enumerate(english):
    if j == C:
        print(english[i+1])

Submission status: Accepted

Solution code:
#import sys
MOD = 10 ** 9 + 7
#input = sys.stdin.readline
import math

import itertools

#import bisect

import copy


def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]
def main():
    a = input()
    b="abcdefghijklmnopqrstuvwxyz"
    b=list(b)
    print(b[b.index(a)+1])



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do(): 
    moji=list('abcdefghijklmnopqrstuvwxyz')
    c=STR()
    ct=moji.index(c)
    print(moji[ct+1])
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
import sys
from string import ascii_lowercase

input = sys.stdin.readline


class Solution:
    def main(self):
        C = input().rstrip()

        for i, _char in enumerate(ascii_lowercase):
            if _char == C:
                print(ascii_lowercase[i + 1])
                exit()


# Run main
if __name__ == '__main__':
    Solution().main()

Submission status: Accepted

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

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(len(alpha)) :
    if C == alpha[i] :
        print(alpha[i+1])
        break