两无穷大数各自位逆转（高地位颠倒）后相加，求和的逆转值

#include <iostream> #include <stdlib.h> #include <string.h> using namespace std; #define N 128 int main() { char plus1[N],plus2[N],plus[N+2]; memset(plus1,48,N); memset(plus2,48,N); memset(plus,48,N+2); int len1=0,len2=0,maxlen=0; int i=0; cin>>plus1>>plus2; len1=strlen(plus1); len2=strlen(plus2); if(len1>len2) { maxlen=len1; for(i=len2;i<len1;i++) plus2[i]='0'; plus2[i]='/0'; } else { maxlen=len2; for(i=len1;i<len2;i++) plus1[i]='0'; plus1[i]='/0'; } cout<<"plus1="<<plus1<<endl; cout<<"plus2="<<plus2<<endl; for(i=0;i<maxlen;i++) { if(plus[i]+plus1[i]+plus2[i]-144 > 9) { plus[i]=plus[i]+plus1[i]+plus2[i]-106; plus[i+1]=49; if(i==maxlen-1) plus[i+2]='/0'; } else { plus[i]=plus[i]+plus1[i]+plus2[i]-96; if(i==maxlen-1) plus[i+1]='/0'; } } cout<<"plus= "<<plus<<endl; }