Problem Link: http://www.codechef.com/problems/BYTES6
Strategy: Adhoc Problem, Number Systems
The solution to the problem is adding numbers in base 26. Add the alphabets like sum=num1[i]-‘0’+num2[i]-‘0’+carry. Then carry for next iteration is sum/26 and sum=sum%26. If a carry is generated at end of some iteration, print carry in base 26 format.