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:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        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 combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

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

    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = ord((input()))

print(chr(c+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
import numpy as np
import collections


S = str(raw_input())



print chr(ord(S) + 1);

Submission status: Accepted

Solution code:
C = input()


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

Submission status: Accepted

Solution code:
ans = input()

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

Submission status: Accepted

Solution code:
from string import ascii_lowercase

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

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


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(C):
    return chr(ord(C) + 1)


def main():
    C = read_str()
    print(slv(C))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC151 A

C = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()

alf = list("abcdefghijklmnopqrstuvwxyz")

ind = alf.index(C)
print(alf[ind+1])

Submission status: Accepted

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

s_list = string.ascii_lowercase
c = input()

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

Submission status: Accepted

Solution code:
c = str(input())

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

index_num = li.index(c)

print(li[index_num + 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:
#A
C = input()
alphabet = list("abcdefghijklmnopqrstuvwxyz")

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
C = input()

abc = list("abcdefghijklmnopqrstuvwxyz")

for i, s in enumerate(abc):
    if C == s:
        print(abc[i+1])
        break

Submission status: Accepted

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

print(chr(ascii+1))

Submission status: Accepted

Solution code:
chr_list = [chr(ord('a') + i) for i in range(26)]

n = str(input())

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

Submission status: Accepted

Solution code:
def _rot13(c):
    if 'A' <= c and c <= 'Z':
        # 13 文字分ずらす
        return chr((ord(c) - ord('A') + 1) % 26 + ord('A'))

    if 'a' <= c and c <= 'z':
        # 13 文字分ずらす
        return chr((ord(c) - ord('a') + 1) % 26 + ord('a'))

    # その他の文字は対象外
    return c


def rot13(s):
    # ジェネレータ内包表記で文字列に ROT13 を適用する
    g = (_rot13(c) for c in s)
    # 文字列に直す
    return ''.join(g)


a = input()
print(rot13(a))

Submission status: Accepted

Solution code:
# = map(int, input().split())
# = int(input())
c = input()
# = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
c = input()

x = "abcdefghijklmnopqrstuvwxyz"
print(x[x.index(c)+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = str(input())
alf = "abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(26):
  if st == L[i]:
    print(L[i+1])

Submission status: Accepted

Solution code:
c = input()
i = 'abcdefghijklmnopqrstuvwxyz'
I = {i:j for i, j in zip(i[:-1], i[1:])}
print(I[c])

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

c = input()

c_ascii = ord(c)

new_c_ascii = c_ascii + 1

print(chr(new_c_ascii))

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=input()

s="abcdefghijklmnopqrstuvwxyz"
sl=list(s)
ind=sl.index(c)
print(sl[ind+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()

ascii_code = ord(c)
ascii_code += 1

next_c = chr(ascii_code)

print(next_c)

Submission status: Accepted

Solution code:
import sys
import math
import functools
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

c = ns()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
# import numpy as np
# import scipy
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
 
def inp(): # n=1
    return int(input())
def inpm(): # x=1,y=2
    return map(int,input().split())
def inpl(): # a=[1,2,3,4,5,...,n]
    return list(map(int, input().split()))
def inpls(): # a=['1','2','3',...,'n']
    return list(input().split())
def inplm(n): # x=[] 複数行
    return list(int(input()) for _ in range(n))
def inpll(n): # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
    return [list(map(int, input().split())) for _ in range(n)]

def main():
    a = str(input())
    if a == 'z':
        print('a')
        return
    x = ord(a)
    x+=1
    print(chr(x))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
sys.setrecursionlimit(10**9)
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(input()) #整数読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return map(int, input().split()) #整数map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i: divisors.append(n//i)
    return divisors
def is_prime(n):
    if n == 1: return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0: return False 
    return True
def primes(n):
    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i * 2, n + 1, i): is_prime[j] = False
    return [i for i in range(n+1) if is_prime[i]]
def sieve_of_e(n):
    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i * 2, n+1, i): is_prime[j] = False
    return is_prime
def run_length_encode(s):
    count = 1
    code = []
    target = s[0]
    for i in range(1, len(s)):
        if target == s[i]: count += 1
        else:
            code.append((target, count))
            target = s[i]
            count = 1
    code.append((target, count))
    return code

C = input()

al = string.ascii_lowercase

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
        
alpha = [i.lower() for i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ']
c = input()   

idx = alpha.index(c)   

print(alpha[idx + 1])

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline()[:-1]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

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

Submission status: Accepted

Solution code:
#!python3

iim = lambda: map(int, input().rstrip().split())
liim = lambda: list(map(int, input().rstrip().split()))

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
B = input()

alfa = list("abcdefghijklmnopqrstuvwxyz")

aIndex = alfa.index(B)

print(alfa[aIndex+1])

Submission status: Accepted

Solution code:
C = input()

alphabets="abcdefghijklmnopqrstuvwxyz"

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

Submission status: Accepted

Solution code:
def main():
    c = input()
    alp = [chr(i) for i in range(97, 97+26)]
    ind = alp.index(c)
    ans = alp[ind + 1]
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C = input()
alphabet = "abcdefghijklmnopqrltuvwxyz"

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

Submission status: Accepted

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

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:
# coding:utf-8

C = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

s = 'abcdefghijklmnopqrstuvwxyz'

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

Submission status: Accepted

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