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.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

 #include <bits/stdc++.h>
 #define ll long long
 #define int long long
 #define MOD  1000000007
 #define MAX 500005
 #include<iomanip>
 #define Need_for_speed(activated) ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
 #define satisfy ll t; cin>> t; while(t--)
 #define inp(n) int n;cin >> n
 #define mp make_pair
 #define pb push_back
 #define fore(i,a,b) for(ll i=a;i<b;i++)
 #define x first
 #define y second
using namespace std;
 int power(int x, unsigned int y, int p)
 {
     int res = 1;      // Initialize result
   
     x = x % p;  // Update x if it is more than or
                 // equal to p
   
     while (y > 0)
     {
         // If y is odd, multiply x with result
         if (y & 1)
             res = (res*x) % p;
   
         // y must be even now
         y = y>>1; // y = y/2
         x = (x*x) % p;
     }
     return res;
 }
int gcd(int a, int b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
      
}
ll arr[1000004];
void spf(ll num)
{
    fore(i,0,num+1)arr[i]=i;
    for(ll i=2;i<=num;i+=2)
    {
        arr[i]=2;
    }
    for(ll i=3;i<=num;i+=2)
    {
        if(arr[i]==i)
        for(ll j=i;j<=num;j+=i)
        {
           if(arr[j]==j) arr[j]=i;
        }
    }
}
void PrintSPF(ll num)
{
    while(num!=1)
    {
        cout<<arr[num]<<" ";
        num/=arr[num];
    }
}
int modInverse(int a, int m)
{
    int g = gcd(a, m);
    
        
    
    {
        return power(a, m-2, m);
    }
}
 int32_t main()
{
    Need_for_speed(activated);
//    satisfy
//    {}
   
    char a;
    cin>>a;
    cout<<char(a+1);
    return 0;
    }