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:
c = input()
abc = list('abcdefghijklmnopqrstuvwxyz')
i = abc.index(c)
print(abc[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=["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(25):
    if(c==x[i]):
        k=x[i+1]
        break
    else:
        pass
print(k)

Submission status: Accepted

Solution code:
nyu=input()
alph=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","i","s","t","u","v","w","x","y","z"]
for i in range(25):
    if nyu==alph[i]:
        print(alph[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = 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".split()

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

Submission status: Accepted

Solution code:
C = input()
# print(C+1)
numc = lambda c: ord(c) - ord('a') + 1
num2alpha = lambda c: chr(c)
# print(numc(C))
# print(num2alpha(numc(C)+1))
print(chr(ord(C)+1))

Submission status: Accepted

Solution code:
def func(c,n):
    return chr(ord(c)+n)

C = input()

print(func(C,1))

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

a = str(input())

alpha = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    C = str(input())
    ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
    list_ascii_lowercase = list(ascii_lowercase)
    for c in list_ascii_lowercase:
        if C == c:
            i = list_ascii_lowercase.index(c)
            print(list_ascii_lowercase[i + 1])



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
C = str(input())
Z='abcdefghijklmnopqrtuvwxyz'
alpha = list(Z)
l_in = [alpha[i+1] for i in range(len(alpha)-1) if C in alpha[i]]
print(l_in[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C=input()
qqq=list("abcdefghijklmnopqrstuvwxyza")
for i in range(len(qqq)):
    if qqq[i]==C:
        print(qqq[i+1])
        break

Submission status: Accepted

Solution code:
s = input('')
a = [chr(i) for i in range(97,97+26)]
for i in range(len(a)):
    if a[i] == s:
        print(a[i+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']
for i in range(len(al)-1):
    if c == al[i]:
        print(al[i+1])
        break

Submission status: Accepted

Solution code:
a="abcdefghijklmnopqrstuvwxyz"
b=input()
c=0
while True:
    if b==a[c]:
        print(a[c+1])
        break
    c+=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:

C = input()



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

Submission status: Accepted

Solution code:
alp = 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"]
point_alp = list.index(alp)
print(list[point_alp+1])

Submission status: Accepted

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

Submission status: Accepted

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

n=input()
ind=x.index(n)
print(x[ind+1])

Submission status: Accepted

Solution code:
C = input()

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

a = alpha2num(C)
if a == 26:
    a = 0
b = num2alpha(a + 1)

print(b)

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"]
moji = input()
for i in range(26):
    if moji == alphabet[i]:
        print(alphabet[i+1])
        exit()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()
alphabets = 'abcdefghijklmnopqrstuvwxyz'

for i, alphabet in enumerate(alphabets):
    if s == alphabet:
        print(alphabets[i+1])

Submission status: Accepted

Solution code:
#A - Next Alphabet
C = input()
alpha_dict = {}
alpha_dict_rev = {}
for i,c in enumerate(range(ord('a'),ord('z')+1)):
    alpha_dict[chr(c)] = i
    alpha_dict_rev[i] = chr(c)
n = int(alpha_dict[C]%25 + 1)
print(alpha_dict_rev[n])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

# 数値(1〜26)→アルファベット(A〜Z)
num2alpha = lambda c: chr(c+64)

# アルファベット(A〜Z)→数値(1〜26)
alpha2num = lambda c: ord(c) -ord('A') + 1

i = alpha2num(C.upper()) + 1
ans = num2alpha(i)
print(ans.lower())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def rot_n(c):
    # return chr((ord(c) - ord('a') + int(n)) % 26 + ord('a'))
    return chr((ord(c) - ord('a') + 1) % 26 + ord('a'))

c = input()

print(rot_n(c))

Submission status: Accepted

Solution code:

tmp=input()

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

Submission status: Accepted

Solution code:
C = input()

import string
alpa = string.ascii_lowercase

for i in range(0,len(alpa)):
    if alpa[i]==C:
        print(alpa[i+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".split()
c = input()
print(l[l.index(c) + 1])

Submission status: Accepted

Solution code:
C = input()
letters = "abcdefghijklmnopqrstuvwxyz"
list_letters = list(letters)
print(list_letters[letters.find(C)+1])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = str(input())
b = ["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 = {"a":1,"b":2,"c":3,"d":4,"e":5,"f":6,"g":7,"h":8,"i":9,"j":10,"k":11,"l":12,"m":13,"n":14,"o":15,"p":16,"q":17,"r":18,"s":19,"t":20,"u":21,"v":22,"w":23,"x":24,"y":25,"z":26}
print(b[c[a]])

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
encryptionStr = input()
excludeStr = "{}_"
result = ""
SHIFT_COUNT = 1
for c in encryptionStr :
    if excludeStr.find(c) != -1 :
        result = result + c
        continue
    if ord('a') <= ord(c) <= ord('z') :
        result = result + chr(abs(((ord(c) + SHIFT_COUNT - ord('a')) % 26)) + ord('a'))
    else :
        result = result + chr(abs(((ord(c) + SHIFT_COUNT - ord('A')) % 26)) + ord('A'))
print (result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

res = chr(ord(c) + 1)

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

if C.lower() == 'z':
    print("No next character")
else:
    print(chr(ord(C.lower()) + 1))

Submission status: Accepted

Solution code:
C = input()

n = ord(C)

n = n + 1

print(chr(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = str(input())
dic = {"a":1, "b":2, "c":3, "d":4, "e":5, "f":6, "g":7, "h":8, "i":9, "j":10, "k":11, "l":12, "m":13, "n":14, "o":15, "p":16, "q":17, "r":18, "s":19, "t":20, "u":21, "v":22, "w":23, "x":24, "y":25, "z":26}
ans = dic[n] + 1
key = [k for k, v in dic.items() if v == ans][0]
print(key)

Submission status: Accepted

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

C = ord(input())

print(chr(C + 1))

Submission status: Accepted

Solution code:
c = str(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"]
ind = int(alpha.index(c))
ind1 = ind + 1
res = alpha[ind1]
print(res)

Submission status: Accepted

Solution code:
N = input()
if N != 'z':
    print(chr(ord(N) + 1))

Submission status: Accepted

Solution code:
try:
  n=input()
  c=chr(ord(n)+1)
  print(c)
except:
  pass

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 12 20:56:20 2020

@author: masat
"""

import string
str_list = [string.ascii_lowercase[i] for i in range(26)]

C = input()

index = str_list.index(C)

print(str_list[index+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    dict_str = ["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()
    res_idx = dict_str.index(C)
    print(dict_str[res_idx+1])


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = str(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']

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

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

C = ord(input())

c = chr(C + 1)

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
Input = str(input())

dic_list={
    "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(dic_list[Input])

Submission status: Accepted

Solution code:
input1=str(input())
ord_num=(ord(input1))
if ord_num==122:
  print ('a')
else:
  print (chr(ord_num+1))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
c=str(input())
ansnum=ord(c)+1
if ansnum==123:
  print(chr(97))
else:
  print(chr(ansnum))

Submission status: Accepted

Solution code:
l=input()
alist=["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"]
i=0
while alist[i]<=l:
    i+=1
print(alist[i])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = str(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:
import sys
d = input()

def rot_n(c):
    if 'a' <= c and c <= 'z':
        return chr((ord(c) - ord('a') + 1) % 26 + ord('a'))
    
    if 'A' <= c and c <= 'Z':
        return chr((ord(c) - ord('A') + 1) % 26 + ord('A'))
    
    return c
ans = rot_n(d)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
word = input()
words = ["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(words[words.index(word) + 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"]
C = input()
def solve():
    for i in range(len(list)):
        if list[i] == C:
            return list[i + 1]
print(solve())

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"]
print(alphabet[alphabet.index(C)+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"]

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

print(ans)

Submission status: Accepted

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


def inputIntList():
  return [int(s) for s in input().split()]


def inputInt():
  return int(input())


def main():
  res = input()
  letters = string.ascii_letters.lower()
  ans = letters[letters.index(res)+1 % 27]

  return ans


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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 12 21:03:03 2020

@author: over-
"""

C=input()

alp=[chr(i) for i in range(97,123)]
ind=alp.index(C)
print(alp[ind+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = input()
def moji_list(*args):
    moji = []
    for i in range(len(args)):
        moji.extend([chr(j) for j in range(args[i][0], args[i][1])])
    return moji

I=moji_list((97, 123))
T = I.index(N) + 1
print(I[T])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
asc = list(string.ascii_lowercase)
c= input()
num = asc.index(c)

print(asc[num + 1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C=input()
A = ord(C)
if(A>=122):
  A=97
else:
  A+=1

print(chr(A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

abc = "abcdefghijklmnopqrstuvwxyz"

ans = abc.find(c) + 1

print(abc[ans])

Submission status: Accepted

Solution code:
import string
s=input()

for i in range(25):
    if s==string.ascii_lowercase[i]:
        print(string.ascii_lowercase[i+1])
        exit()

Submission status: Accepted

Solution code:
String = "abcdefghijklmnopqrstuvwxyz"

inp = input()

print(String[String.find(inp)+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(s, c):
    for i, char in enumerate(s):
        if char == c:
            return s[i+1]

c = input().strip()
print(solve('abcdefghijklmnopqrstuvwxyz', c))

Submission status: Accepted

Solution code:
alp = 'abcdefghijklmnopqrstuvwxyz'
s = input()
for i, a in enumerate(alp):
  if a == s:
    print(alp[i+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

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

Submission status: Accepted

Solution code:
C = input()
alphbt = "abcdefghijklmnopqrstuvwxyz"
for z in alphbt:
	if z == C:
		i = alphbt.find(z)
		print(alphbt[i + 1])
		break
	else:
		continue

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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"]
for i  in range(26):
    if c == s[i]:
        if i == 25:
            print(s[0])
        else:
            print(s[i+1])
        break

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
char_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']
def print_ans(S):
    """Test Case
    >>> print_ans("a")
    b
    """
    a = S.upper()
    for i, b in enumerate(char_list):
        if b == a:
            print(char_list[i+1].lower())
        


if __name__ == '__main__':
    S = input().rstrip()
    print_ans(S)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C=str(input())
for i in range(97,97+26):
  if chr(i)==C:
    print(chr(i+1))
    exit()

Submission status: Accepted

Solution code:
C = input()

A = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

for i in range(26):
  if C == A[i]:
    print(A[i+1])
  elif C == "z":
    print("a")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()
string = "abcdefghijklmnopqrstuvwxyz"
string = list(string)
for i in range(len(string)):
    if string[i] == c:
        idx = i
print(string[idx+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()
A = ord(C)
if A >= 122:
    A = 97
else:
    A += 1
print (chr(A))

Submission status: Accepted

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

c = input().split()[0]
ans = (ord(c)+1)%ord('a') + ord('a')
ans = chr(ans)
if c == 'z':
    print('a')
else:
    print(ans)

Submission status: Accepted

Solution code:
C = input()

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

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

Submission status: Accepted

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

num=alpha2num(inputbox)
num=num+1

print(num2alpha(num))

Submission status: Accepted

Solution code:
c = str(input())
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"]

count = 0
for i in list_a:
    if i == c:
        count += 1
        break
    count += 1

print(list_a[count])

Submission status: Accepted

Solution code:
S = 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"]
 
s_index = list.index(S)
 
print(list[s_index+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
scan = sys.stdin.readline
t = str(scan().strip('\n'))
alphabet = [chr(i) for i in range(97, 97 + 26)]
print(alphabet[alphabet.index(t) + 1])

Submission status: Accepted

Solution code:
C = input() # 文字列を変数に格納
print(chr(ord(C) + 1))

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from heapq import heapify, heappop, heappush
from sys import stdin

def main():
    a = str(input())
    b = chr(ord(a) + 1)
    print(b)

input = lambda: stdin.readline().rstrip()
main()

Submission status: Accepted

Solution code:
memo = "abcdefghijklmnopqrstuvwxyz"
c = input()
f = 0
for ci in memo:
    if f:
        print(ci)
        break
    if c == ci:
        f = 1

Submission status: Accepted

Solution code:
z="ABCDEFGHIJKLMNOPQRSTUVWXYZ".lower()
c=input()
print(z[z.find(c)+1])

Submission status: Accepted

Solution code:
import sys

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

main()

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

Solution code:
C = input()

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

num2alpha = lambda c: chr(c+65)


tmp = alpha2num(C)
s = num2alpha(tmp)


print(s.lower())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = str(input())

al = list('abcdefghijklmnopqrstuvwxyz')

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

Submission status: Accepted

Solution code:
C = input()
s = [chr(i) for i in range(97,97+26)]
s = "".join(s)
print(s[s.find(C) + 1])

Submission status: Accepted

Solution code:
n=str(input())
m=["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=m.index(n)
print(m[int(num)+1])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC 151 a
import string
alpha = list(string.ascii_lowercase)

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

Submission status: Accepted

Solution code:
tmp = "abcdefghijklnmopqrstuvwxyz"

c = input()

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

Submission status: Accepted

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

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"]
ind = alp.index(C)
print(alp[ind+1])

Submission status: Accepted

Solution code:
s = input()

for i in range(97, 97+26):
    alpha = chr(i)
    if alpha == s:
        print(chr(i+1))
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

al = "abcdefghijklmnopqrstuvwxyz"
d = {}
for i in range(len(al)):
    d[al[i]] = i

i = d[c]
print(al[i+1])

Submission status: Accepted

Solution code:

inputA = input()

alfabet = ["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"]

index = alfabet.index(inputA)

if index >= 25 :
    print("a")
else:
    print(alfabet[index+ 1])

Submission status: Accepted

Solution code:
word=(input())

print(chr(ord(word)+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
alpha = lambda c: ord(c) - ord('A') + 2
num = lambda c: chr(c+64)
k = alpha(input())
print (num(k))

Submission status: Accepted

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

Submission status: Accepted

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