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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(next)

Submission status: Accepted

Solution code:
al="abcdefghijklmnopqrstuvwxyz"

C=input()
print(al[al.index(C)+1])

Submission status: Accepted

Solution code:
# coding: utf-8

C = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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



    return 0
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=input()

tmp=ord(c)
tmp+=1

print(chr(tmp))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input = raw_input
chars = "abcdefghijklmnopqrstuvwxyz"

c = input()
i = chars.index(c)
out = chars[i+1]
print(out)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

s = input()
#N = int(input())
#X = list(map(int, input().split()))
MOD = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
c = str(input())

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

ind = Alpha.index(c)
ans = Alpha[ind+1]
print(ans)

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
c=input()
print(chr(ord(c)+1))

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

idx = temp.index(c)
print(temp[idx+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


def MI(): return map(int, input().split())


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    C = input()
    ans = 0

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

    print(-1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print({c1: c2 for c1, c2 in zip("abcdefghijklmnopqrstuvwxyz", "bcdefghijklmnopqrstuvwxyza")}[input()])

Submission status: Accepted

Solution code:
c = input()


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

Submission status: Accepted

Solution code:
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
c = input().strip()
w = 'abcdefghijklmnopqrstuvwxyz'
print(w[w.index(c)+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    C = input()

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


main()

Submission status: Accepted

Solution code:
from sys import stdin
s = stdin.readline().rstrip()

ｔ = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

Solution code:
C = input()

alphabet = list('abcdefghijklmnopqrstuvwxyz')

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
C = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

import string

s = list(string.ascii_lowercase)

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

Submission status: Accepted

Solution code:
s = raw_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()


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()
print(chr(ord(c)+1))

Submission status: Accepted

Solution code:
import sys

alp = "abcdefghijklmnopqrstuvwxyz"

C = input()

for i in range(30):

    if alp[i] == C:
        print (alp[i+1])
        sys.exit()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
c = input()

l = list("abcdefghijklmnopqrstuvwxyz")

n = l.index(c)

print(l[n+1])

Submission status: Accepted

Solution code:



C = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    a=input()
    N=1
    print(chr(ord(a)+N) if ord(a)+N<=122 else chr(ord(a)+N-26))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

a = chr(ord(c)+1)

print(a)

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    ls = [chr(i) for i in range(97, 97 + 26)]
    c = str(readline().rstrip().decode('utf-8'))
    for i in range(1, len(ls)):
        if ls[i-1] == c:
            print(ls[i])
            exit()


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s=input()

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

Submission status: Accepted

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

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, a in enumerate(al):
    if a == c: print(al[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C=input()

ABC="abcdefghijklmnopqrstuvwxyz"

idx=ABC.index(C)

print(ABC[idx+1])

Submission status: Accepted

Solution code:
def main():
    c = input()
    abc = "abcdefghijklmnopqrstuvwxyz"
    idx = abc.index(c)
    print(abc[idx+1])

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a = input()
az = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string

al = string.ascii_lowercase
print(al[al.index(input())+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    c = S()
    print(chr(ord(c) + 1))

main()

Submission status: Accepted

Solution code:
from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

def main():
    s = input()
    ss = "abcdefghijklmnopqrstuvwxyz"
    for i in range(25):
        if s == ss[i]:
            print(ss[i+1])
            exit()

    
main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=list("abcdefghijklmnopqrstuvwxyz")
s=input()
n=a.index(s)
if n==25:
    print("a")
else:
    print(a[n+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    c = str(inputs[0])
    c_i = ord(c)
    c_i += 1
    return chr(c_i)


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Accepted

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

print(chr(ans))

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

c = input()

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

Submission status: Accepted

Solution code:
# s = input()
# n = int(input())
# a, b = map(int, input().split())
# l = list(map(int, input().split()))
c = input()
asc = ord(c)
asc += 1
print(chr(asc))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
alpha = list('abcdefghijklmnopqrstuvwxyz')

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

print(alpha[idx+1])

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
c=input().rstrip()
x=ord(c)
ans=chr(x+1)
print(ans)

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def solve():
    return chr(ord(input())+1)

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

Submission status: Accepted

Solution code:
C=input()
if C=="z":
    print("a")
else:
    print(chr(ord(C)+1))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
# input = sys.stdin.readline
ii = lambda: int(input())
mis = lambda: map(int,input().split())
lmis = lambda: list(mis())
INF = float('inf')

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


# N, M = map(int, input().split())
# nums = list(map(int, input().split()))
# nums_2d = [list(map(int, input().split())) for _ in range(N)]


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

    idx = alphabets.index(c)
    print(alphabets[idx + 1])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

C = input()

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

Submission status: Accepted

Solution code:
Z = list("abcdefghijklmnopqrstuvwxyz")

C = input()

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
C = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**5)
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys

sys.setrecursionlimit(10**9)
mod = 998244353
inf = 10**20

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = str(input())

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

Submission status: Accepted

Solution code:
def main():
    from string import ascii_lowercase

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


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:
c=input()

ans=chr(ord(c)+1)

print(ans)

Submission status: Accepted

Solution code:
# A happy new year, AtCoder !
C = input()

ans = chr(ord(C) + 1)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()
#n = int(input())
#a, b = map(int, input().split())
#x = list(map(int, input().split()))


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s=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', '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', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9']
    print(lst[lst.index(s)+1])
    
main()

Submission status: Accepted

Solution code:
#%%
c = input()

alpha2num = lambda c: ord(c) - ord('a') + 1
num2alpha = lambda c: chr(c+96)

a = alpha2num(c) + 1
ans = num2alpha(a)

print(ans)

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict
from collections import deque
import numpy as np
import heapq
from heapq import heappush, heappop


#read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

Solution code:
C = input()

i = ord(C)

print(chr(i+1))

Submission status: Accepted

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

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

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))


alpha = 'abcdefghijklmnopqrstuvwxyz'
s = input()
print(alpha[alpha.index(s)+1])

Submission status: Accepted

Solution code:
import string

S = string.ascii_lowercase
C = input().strip()
i = S.find(C)
print(S[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    C = SI()
    ans = chr(ord(C)+1)
    print(ans)
    return

def examB():
    N = I()
    ans = 0
    print(ans)
    return

def examC():
    return

def examE():
    return

def examF():
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

Submission status: Accepted

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

C = ord(readline().strip())
print(chr(C+1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
c = input()[: -1]
print(chr(ord(c) + 1))

Submission status: Accepted

Solution code:
words = lambda t : list(map(t, input().split()))
c = input()
print(chr(ord(c)+1))

Submission status: Accepted

Solution code:
l = input()

print(chr(ord(l)+1))

Submission status: Accepted

Solution code:
# coding: utf-8
alp = 'abcdefghijklmnopqrstuvwxyz'
a = input()
idx = alp.index(a)
print(alp[idx+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC151 A
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
c=si()
t=ord(c)
print(chr(t+1))

Submission status: Accepted

Solution code:
alph = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
from collections import deque
import re
import math
import functools
import itertools
import fractions

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


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


def isRaw():
    return list(map(int, ssRaw()))


INF = 1 << 29


def mk1d(n, val=INF):
    return [val for i in range(n)]

def mk2d(h, w, val=INF):
    return [[val for i in range(w)]for i in range(h)]

DIV = 998244353


def convolve(a, b):
    p, g = 1107296257, 5
    n0, n1 = len(a), len(b)
    n = 1 << (max(n0, n1) - 1).bit_length() + 1
    a = a + [0] * (n-n0)
    b = b + [0] * (n-n1)
    w = pow(g, (p - 1) // n, p)
    invw = pow(w, p-2, p)

    def fft(f):
        d = n // 2
        v = w
        while d >= 1:
            u = 1
            for i in range(d):
                for j in range(i, n, 2*d):
                    f[j], f[j+d] = (f[j] + f[j+d]) % p, u * (f[j] - f[j+d]) % p
                u = u * v % p
            v = v * v % p
            d //= 2

    def ifft(f):
        d = 1
        while d < n:
            v = pow(invw, n // (2 * d), p)
            u = 1
            for i in range(d):
                for j in range(i, n, 2*d):
                    f[j+d] *= u
                    f[j], f[j+d] = (f[j] + f[j+d]) % p, (f[j] - f[j+d]) % p
                u = u * v % p
            d *= 2

    fft(a), fft(b)
    for i in range(n):
        a[i] = a[i] * b[i] % p
    ifft(a)
    invn = pow(n, p - 2, p)
    return [a[i] * invn % p for i in range(n0 + n1 - 1)]


def gcd(a, b):
    if(b == 0):
        return a
    return gcd(b, a % b)

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)


def lcm(*numbers):
    return functools.reduce(lcm_base, numbers, 1)


def lcm_list(numbers):
    return functools.reduce(lcm_base, numbers, 1)

def main():
    C = sRaw()
    
    return chr(ord(C)+1)

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
#from itertools import permutations

def gcd(a: int, b: int):
    """ https://cocodrips.hateblo.jp/entry/2014/03/05/143623
    """
    while b: a, b = b, a%b
    return a

def lcm(a: int, b: int):
    return a * b // gcd(a, b)


def main():
    #N = int(input())
    #N,M = map(int, input().split())
    #vP = tuple(map(int, input().split()))
    #vA = set(map(int, input().split()))
    #vA = list(range(1,N+1))

    #print(l, file=sys.stderr)
    #l //= 2
    S = input().rstrip()
    #print(S)
    print(chr(ord(S)+1))
    #print(lcm(N, M))
    #print("Yes" if N<=500*M else "No")
    #print(S.count("ABC"))


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def num():
    return int(input())
def nums():
    return list(map(int,input().split()))

import itertools as iter
import math
import fractions
from functools import reduce

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)


from string import ascii_lowercase
print(ascii_lowercase[ascii_lowercase.index(input())+1])

Submission status: Accepted

Solution code:
C = input()

c = ord(C)

print(chr(c+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 平文
PLAIN = input()

# 秘密鍵
KEY = 1

# 以下に、記述してください。
enc = ""

for char in list(PLAIN):
    ASCII = ord(char)
    num = ASCII - 97
    num = (num + KEY) % 26
    ASCII = num + 97
    enc += chr(ASCII)

print(enc)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
C = ord(input())

print(chr(C + 1))

Submission status: Accepted

Solution code:
C = input()
# A = list(map(int, input().split()))
c = ['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 = c.index(C)
print(c[n+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

#ライブラリインポート
from collections import defaultdict

#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	s = input()
	ans = chr(ord(s) + 1)
	print(ans)
	


if __name__ == '__main__':
	main()

Submission status: Accepted

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