#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string sa, sb, st;
vector<int> v;
int i;
int a, b, sum;
int flag;
while (cin>>sa>>sb)
{
flag = 0;
v.clear();
sum = 0;
reverse(sa.begin(),sa.end());
reverse(sb.begin(),sb.end());
if (sa.size() < sb.size())
{
st = sa;
sa = sb;
sb = st;
}
for (i = 0; i < sa.size(); i++)
{
if(sa[i] == '0')
a = 0;
else if (sa[i] == '1')
a = 1;
else if(sa[i] == '2')
a = 2;
else if(sa[i] == '3')
a = 3;
else if(sa[i] == '4')
a = 4;
else if(sa[i] == '5')
a = 5;
else if(sa[i] == '6')
a = 6;
else if(sa[i] == '7')
a = 7;
else if(sa[i] == '8')
a = 8;
else if(sa[i] == '9')
a = 9;
else if(sa[i] == 'a')
a = 10;
else if(sa[i] == 'b')
a = 11;
else if(sa[i] == 'c')
a = 12;
else if(sa[i] == 'd')
a = 13;
else if(sa[i] == 'e')
a = 14;
else if(sa[i] == 'f')
a = 15;
else if(sa[i] == 'g')
a = 16;
else if(sa[i] == 'h')
a = 17;
else if(sa[i] == 'i')
a = 18;
else if(sa[i] == 'j')
a = 19;
if(i >= sb.size())
b = 0;
else
{
if(sb[i] == '0')
b = 0;
else if (sb[i] == '1')
b = 1;
else if(sb[i] == '2')
b = 2;
else if(sb[i] == '3')
b = 3;
else if(sb[i] == '4')
b = 4;
else if(sb[i] == '5')
b = 5;
else if(sb[i] == '6')
b = 6;
else if(sb[i] == '7')
b = 7;
else if(sb[i] == '8')
b = 8;
else if(sb[i] == '9')
b = 9;
else if(sb[i] == 'b')
b = 10;
else if(sb[i] == 'b')
b = 11;
else if(sb[i] == 'c')
b = 12;
else if(sb[i] == 'd')
b = 13;
else if(sb[i] == 'e')
b = 14;
else if(sb[i] == 'f')
b = 15;
else if(sb[i] == 'g')
b = 16;
else if(sb[i] == 'h')
b = 17;
else if(sb[i] == 'i')
b = 18;
else if(sb[i] == 'j')
b = 19;
}
sum = a + b + flag;
if (sum >= 20)
{
flag = 1;
sum = sum - 20;
}
else
flag = 0;
v.push_back(sum);
}
if (flag == 1)
v.push_back(1);
for (i = v.size()-1; i >= 0; i--)
{
if(v[i] < 10)
cout<<v[i];
else if(v[i] == 10)
cout<<"a";
else if(v[i] == 11)
cout<<"b";
else if(v[i] == 12)
cout<<"c";
else if(v[i] == 13)
cout<<"d";
else if(v[i] == 14)
cout<<"e";
else if(v[i] == 15)
cout<<"f";
else if(v[i] == 16)
cout<<"g";
else if(v[i] == 17)
cout<<"h";
else if(v[i] == 18)
cout<<"i";
else if(v[i] == 19)
cout<<"j";
}
printf("\n");
}
return 0;
}
ACM.rar （67个子文件） 
浙大ACM 2850 
2.cpp 847B 2830 2830.cpp 164B 2104 2104.cpp 586B 1315（借口，借口！） 1315.ncb 41KB 1315.plg 1KB 1315.opt 49KB 1315.dsw 533B Debug 1315.obj 324KB 1315.ilk 789KB 1315.pch 2.76MB vc60.idb 81KB 1315.pdb 1.09MB vc60.pdb 132KB
1315.exe 552KB 1315.cpp 2KB 1315.dsp 4KB 2772 2772.cpp 427B 2176 2176.cpp 357B 1949 3.cpp 858B 2727 4.cpp 1KB 2727.lnk 405B 1698 1698.cpp 928B test test.ncb 41KB test.cpp 881B test.opt 48KB test.plg 242B test.dsw 533B test.dsp 3KB Debug test.obj 146KB test.ilk 758KB test.exe 524KB vc60.idb 193KB vc60.pdb 148KB test.pch 2.21MB test.pdb 1.05MB 2835 2835.cpp 1KB 2417 2417.cpp 259B 2724 2724.cpp 693B 1 1.cpp 531B 2476 2476.cpp 0B 1109 1109.cpp 518B 2136(求最长上升子序列) 2136.dsw 533B 2136.opt 48KB 2136.ncb 41KB 2136.cpp 987B 2136.plg 1KB Debug 2136.pch 2.15MB 2136.pdb 569KB vc60.idb 81KB vc60.pdb 116KB 2136.obj 32KB 2136.ilk 362KB 2136.exe 252KB 2136.dsp 4KB 2722 2722.cpp 262B 2201easy 2201.cpp 252B 2388 2388.cpp 513B 2060 2060.cpp 605B 2876 2876.cpp 591B 2679 2679.cpp 627B 1760 1760.cpp 496B 2095 2095 2095.cpp 556B 2829 2829.cpp 469B 2723 2723.cpp 670B 2744 2744.cpp 899B 2840 2840.cpp 1KB 1205 1205.cpp 3KB资源评论
