题目描述:
代码:
#include<bits/stdc++.h>
using namespace std;
char s1[105],s2[105];
//void swap(char s[],char t[])
//{
//
//}
int main()
{
int n1,n2,n;
while(scanf("%s %s",s1,s2)!=EOF)
{
char s[105];
int i=max(strlen(s1),strlen(s2));
if(strlen(s1)<strlen(s2)) swap(s1,s2);
int num=abs(strlen(s1)-strlen(s2));
for(i;i-num>=0;--i)
{
if(s1[i]>='A'&&s1[i]<='F')
{
n1=s1[i]-'A'+10;
}
else if(s1[i]>='0'&&s1[i]<='9')
{
n1=s1[i]-'0';
}
else if(s1[i]>='a'&&s1[i]<='f')
{
n1=s1[i]-'a'+10;
}
if(s2[i-num]>='A'&&s2[i-num]<='F')
{
n2=s2[i-num]-'A'+10;
}
else if(s2[i-num]>='0'&&s2[i-num]<='9')
{
n2=s2[i-num]-'0';
}
else if(s2[i-num]>='a'&&s2[i-num]<='f')
{
n2=s2[i-num]-'a'+10;
}
n=(n1+n2)%16;//末位对齐相加
if(n>=10) s[i]=n+'A'-10;
else s[i]=n+'0';
}
while(i>=0)
{
s[i]=s1[i];
i--;
}
int len=max(strlen(s1),strlen(s2));
for(int j=0;j<len;++j)
{
if(s[j]>='a'&&s[j]<='f') cout<<s[j]-'a'+'A';
else cout<<s[j];
}
cout<<endl;
}
return 0;
}