474A - Keyboard

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<set>

#include<map>

#include<stack>

#include<queue>

#include<algorithm>

/* ==================================================

  |                                                  |

  |    Author: *** S. M. Sabiul Hajjaj Sabit ***     |

  |       Last Edit:  May,14,2019                    |

   ================================================== */

///***global declaration***///

#define all(arr) arr.begin(),arr.end()

#define pb push_back

#define sz(x) x.size()

#define min3(a,b,c)  min(min(a,b),c)

#define max3(a,b,c)  max(max(a,b),c)

using namespace std;

int i,n,sum=0,ans=0;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

    {

        pow *= a;

    }

    return pow;

}

///*********Write Code From Here*********///

int main()

{

    char c;

    string s;

    char arr[] = {'q','w','e','r','t','y','u','i','o','p',

                  'a','s','d','f','g','h','j','k','l',';',

                  'z','x','c','v','b','n','m',',','.','/'

                 };

    cin>>c;

    cin>>s;

    if(c=='R')

    {

        for(i=0; i<sz(s); i++)

        {

            for(int j=0; j<30; j++)

            {

                if(arr[j]==s[i])cout<<arr[j-1];

            }

        }

    }

    else

    {

        for(i=0; i<sz(s); i++)

        {

            for(int j=0; j<30; j++)

            {

                if(arr[j]==s[i])cout<<arr[j+1];

            }

        }

    }

}