华为2018年9月笔试第一题

#include <map>  
#include <cmath>  
#include <queue>  
#include <cstdio>  
#include <string>  
#include <cstring>  
#include <iostream>  
#include <algorithm> 
#include <sstream> 
#include <time.h> 
#include <vector>
#include <list>
using namespace std;

int main()
{
	int i, j, N;
	string x, y;
	cin >> x >> y; 

	int num = x.size(), Sum_x = 0, Sum_y = 0;
	for (i = 0; i < num; i++)
	{
		Sum_x += (x[i] - 'a')*pow(26,num - i -1);
	}
	num = y.size();
	for (i = 0; i < num; i++)
	{
		Sum_y += (y[i] - 'a')*pow(26, num - i - 1);
	}
	int Sum = Sum_x + Sum_y;
	//cout << Sum_x << ' ' << Sum_y << ' ' << Sum << endl;
	vector<int>Data;
	int k = Sum % 26;
	Data.push_back(k);
	Sum = Sum / 26;
	while (Sum)
	{
		//cout << k << endl;
		k = Sum % 26;
		Sum = Sum / 26;
		Data.push_back(k);
	}
	N = Data.size();
	for (i = 0; i < N; i++)
	{
		cout << (char)(Data[N - i -1]+'a');
	}
	cout << endl;

	//cin >> N;
	return 0;
}