HackerEarth Addition ain’t simple problem solution

YASH PAL,
In this HackerEarth Addition ain’t simple problem solution Jack is awesome. his friends call him little Einstein. To test him, his friends gave him a string. They told him to add the string with its reverse string and follow these rules:
  1. Every ith character of the string will be added to every ith character of the reverse string.
  2. Both strings will contain only lower case alphabets(a-z).
  3. Eg:- a+a=b,a+c=d,z+a=a (Refer to sample test cases for more details)
HackerEarth Addition ain't simple problem solution

HackerEarth Addition ain’t simple problem solution.

#include <iostream>
using namespace std;

int main()
{
    int n; cin>>n; 
    while(n--){
        string s; cin>>s; int sum=0;
        for(int i=0;i<s.length();i++){
            sum=s[i]+s[s.length()-i-1]-192;
            if(sum>26) sum-=26;
            printf("%c",sum+96);
        }
        cout<<"n";
    }
    return 0;
}
coding problems solutions