Problem:


Score : 100 points

Problem Statement

Given is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.

Constraints

C is a lowercase English letter that is not z.

Input

Input is given from Standard Input in the following format:

C

Output

Print the letter that follows C in alphabetical order.

Sample Input 1

a

Sample Output 1

b

a is followed by b.

Sample Input 2

y

Sample Output 2

z

y is followed by z.



Sample input:
a


Sample output:
b

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
C = str(input())

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

Submission status: Accepted

Solution code:



c = input()

string = "abcdefghijklmnopqrstuvwxyz"

i = string.find(c)

print(string[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
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()))
MOD = 10**9 + 7

chars = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
while True:
    if s == chars[i]:
        break
    i+=1
print(chars[i+1])

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',
]
i = alf.index(C)

print(alf[i + 1])

Submission status: Accepted

Solution code:
c = input()

k = set('abcdefghijklmnopqrstuvwxyz')

l = list(k)

l.sort()

p = l.index(c)

print(l[p+1])

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']
print(l[l.index(c)+1] if c!='z' else 'a')

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:
import sys

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
p = input()
dic = {}
s = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(s)-1):
    dic[s[i]] = s[i+1]
    
print(dic[p])

Submission status: Accepted

Solution code:
alphabet = {chr(i):chr(i+1) for i in range(97, 123)}
a = input()
print(alphabet[a])

Submission status: Accepted

Solution code:
input_line = input()

print(chr(ord(input_line)+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
abc = [chr(i) for i in range(97, 97+26)]
for i in range(len(abc)):
    if s == abc[i]:
        print(abc[i+1])
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt
from fractions import gcd

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

def intinput():
    return int(input())

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

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas



# N = intinput()
S = input()
# A, B, C, D, E, F = mulinputs()
# datas = list(mulinputs())
# datas = lineinputs(input)
print(chr(ord(S)+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

C_ord = ord(C)

ans_ord = C_ord + 1
ans = chr(ans_ord)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def main():
    n = str(input()).replace(" ", "")
    print(chr(ord(n[0]) + 1))


if __name__ == '__main__':
    input = sys.stdin.readline
    main()

Submission status: Accepted

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    c = args[0]
    return chr(ord(c)+1)


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = str(input())

A='abcdefghijklmnopqrstuvwyz'
count = 0
for z in A:
    if N == z:
        print(A[count+1])
    count += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
C =input()

t = list(string.ascii_letters)
for i in range(len(t)):
    if t[i] == C:
        print(t[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
z=ord(s)
print (chr(z+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()
a = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p"
     ,"q","r","s","t","u","v","w","x","y","z","a"]
print(a[a.index(c) + 1])

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 151: A (2020/01/12)
S = 'abcdefghijklmnopqrstuvwxyz'
C = str(input())
print(S[S.index(C)+1])

Submission status: Accepted

Solution code:
C = ord(input())

print(chr(C + 1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()
alp = list("abcdefghijklmnopqrstuvwxyz")

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

Submission status: Accepted

Solution code:
from sys import stdin
N = (stdin.readline().rstrip())
alpha="abcdefghijklmnopqrstuvwxyz"
print(alpha[alpha.index(N)+1])

Submission status: Accepted

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

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

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

s = input()
l = [chr(i) for i in range(97, 97+26)]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

if c == 'z':
    print('a')
else:
    print(chr(ord(c)+1))

Submission status: Accepted

Solution code:
a = [chr((ord("a") + i)) for i in range(26)]
b = input()
for i in range(len(a)):
  if b == a[i]:
    print(a[i+1])

Submission status: Accepted

Solution code:
word=[chr(i) for i in range(97,97+26)]
n=input()
for i in range(26):
    if word[i]==n:
        print(word[i+1])
        exit()

Submission status: Accepted

Solution code:
# n = int(input())
c = input()

al=[chr(ord('a') + i) for i in range(26)]
# print(al)

for i in range(26):
    if al[i]==c:
        print(al[i+1])
    else:
        pass

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# abc151/abc151_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
C = input()

C = ord(C) + 1

print(chr(C))

Submission status: Accepted

Solution code:
import string

c = input()
a = string.ascii_lowercase

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

print(res)

Submission status: Accepted

Solution code:
c = input()

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

num2alpha = lambda c: chr(c+64)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
C = input().rstrip()
al = [chr(i) for i in range(97, 97+26)]
alpha2num = lambda c: ord(c) - ord("a")
print(al[alpha2num(C) + 1])

Submission status: Accepted

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


DEBUG = True
dprint = print if DEBUG else lambda x : x

s = input().strip()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    c = [x for x in sys.stdin.readline().split()][0]  # 整数一つ
    # N, D = [int(x) for x in sys.stdin.readline().split()] # 整数 複数

    logger.debug('{}'.format([c]))

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


if __name__ == "__main__":
    resolve()

# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """a"""
        output = """b"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """y"""
        output = """z"""
        self.assertIO(input, output)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

hoge="abcdefghijklmnopqrstuvwxyz"

sl=hoge.index(s)
print(hoge[sl+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
moji = input()
num = ord(moji)

num += 1
ans = chr(num)

print(ans)

Submission status: Accepted

Solution code:
c=input()

str='abcdefghijklmnopqrstuvwxyz'

ind=str.find(c)
print(str[ind+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a='abcdefghijklmnopqrstuvwxyz'
al=[l for l in a]
s=input()
print(al[a.index(s)+1])

Submission status: Accepted

Solution code:
import string


list_a_z = list(string.ascii_lowercase)

C = input()

for i, c in enumerate(list_a_z):
    if c == C:
        break

print(list_a_z[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from string import ascii_lowercase

c = input()

i = 0
while i<100:
    if ascii_lowercase[i]==c:
        print(ascii_lowercase[i+1])
        exit()
    i += 1

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

s = 'abcdefghijklmnopqrstuvwxyz'

i = s.find(x)

print(s[i+1])

Submission status: Accepted

Solution code:
C = input()

c = chr(ord(C) + 1)

print(c)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = input()

s = 'abcdefghijklmnopqrstuvwxyz'

if a in s:
    n = s.index(a)
print(s[n+1])

Submission status: Accepted

Solution code:
c = input()

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

Submission status: Accepted

Solution code:
import queue
import copy
import math


# そのまま入力文字列の入力
s = input()

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

found = False
for a in alphas:
    if s == a:
        found = True
        continue
    if found:
        print(a)
        exit(0)

Submission status: Accepted

Solution code:
abc = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def resolve():
    input = sys.stdin.readline
    C=input().rstrip()
    s="abcdefghijklmnopqrstuvwxyz"

    for i in range(len(s)):
        if s[i]==C:
            print(s[i+1])
import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """a"""
        output = """b"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """y"""
        output = """z"""
        self.assertIO(input, output)

if __name__ == "__main__":
    #unittest.main()
    resolve()

Submission status: Accepted

Solution code:
c=input()

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

Submission status: Accepted

Solution code:
C = input()
alpha = list('abcdefghijklmnopqrstuvwxyz')
for i in range(26):
    if alpha[i] == C:
        ans = alpha[i+1]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C= input()

CC = ord(C)
CC = CC +1
out = chr(CC)
print(out)
#chr関数で逆のことができる。

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

S=one_str()

aaa = list('abcdefghijklmnopqrstuvwxyz')

print(aaa[aaa.index(S)+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A - Next Alphabet
A = str(input())

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

Submission status: Accepted

Solution code:
alphs = "abcdefghijklmnopqrstuvwxyz"
alph_map = dict(zip(alphs, range(len(alphs))))

alph = input()
ind = alph_map[alph]
print(alphs[ind+1])

Submission status: Accepted

Solution code:
#n = int(input())
#a_L = map(int,input().split())
s  = input()
L = [chr(ord('a') + i) for i in range(26)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
X = input()

print(chr(ord(X)+1))

Submission status: Accepted

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

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


print(s[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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