patB1048 数字加密

#include <iostream>
#include <cstring> 
#include <algorithm>
using namespace std;
char map[13]={'0','1','2','3','4','5','6','7','8','9','J','Q','K'};
int main(int argc, char** argv) {
string a,b;
cin>>a>>b;
reverse(a.begin(),a.begin()+a.length());
reverse(b.begin(),b.begin()+b.size());
int lena=a.size();
int lenb=b.length();
char ans[102];


if(lenb>lena){
for(int i=0;i<lena && i<lenb;i=i+2){        //odds
ans[i]=map[((a[i]-'0')+(b[i]-'0'))%13];
}
for(int i=1;i<lena && i<lenb;i=i+2){        
if((b[i]-'0')-(a[i]-'0')<0) {
ans[i]=(b[i]-'0')-(a[i]-'0')+10+'0';
}else{
ans[i]=(b[i]-'0')-(a[i]-'0')+'0';
}
}
for(int i=lena;i<lena+lenb-lena;i++){
ans[i]=b[i];
}
}else{
string ss;
for(int i=lenb;i<lenb+lena-lenb;i++){
ss+='0';
}
b+=ss;
for(int i=0;i<lena;i=i+2){        //odds
ans[i]=map[((a[i]-'0')+(b[i]-'0'))%13];
}
for(int i=1;i<lena;i=i+2){        
if((b[i]-'0')-(a[i]-'0')<0) {
ans[i]=(b[i]-'0')-(a[i]-'0')+10+'0';
}else{
ans[i]=(b[i]-'0')-(a[i]-'0')+'0';
}
}
}
if(lenb>lena){
reverse(ans,ans+lenb);
ans[lenb]='\0';
}else{
reverse(ans,ans+lena);
ans[lena]='\0';
}

cout<<ans;
return 0;

}