Martian Addition(20进制加法)

版权声明：转载请注明出处:https://blog.csdn.net/qq1013459920 https://blog.csdn.net/qq1013459920/article/details/83042715

                                      Martian Addition

其实说白了就是高精度算法，思路与高精度加法一模一样

蒟蒻于是自己敲一遍代码，再次熟悉一遍高精度加法

Code:

#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<ctype.h>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<list>
#define mod 998244353
#define Max 0x3f3f3f3f
#define Min 0xc0c0c0c0
#define mst(a) memset(a,0,sizeof(a))
#define f(i,a,b) for(int i=a;i<b;i++)
using namespace std;
typedef long long ll;
const int maxn=105;
char s1[maxn], s2[maxn];
int num1[maxn], num2[maxn], num[maxn];
int main(){
    ios::sync_with_stdio(false);
    while(~scanf("%s%s",s1,s2)){
        mst(num1);
        mst(num2);
        mst(num);
        int len1 = strlen(s1), len2 = strlen(s2);
        int len = max(len1, len2);
        for(int i = 0; i < len1; i++){
            if(s1[i] >= '0' && s1[i] <= '9'){
                num1[len1 - i] = s1[i] - '0';
            }
            else {          //这里貌似直接用isalpha()函数会WA
                num1[len1 - i] = s1[i] - 'a' + 10;
            }
        }
        for(int i = 0; i < len2; i++){
            if(s2[i] >= '0' && s2[i] <= '9'){
                num2[len2 - i] = s2[i] - '0';
            }
            else {
                num2[len2 - i] = s2[i] - 'a' + 10;
            }
        }
        for(int i = 1; i <= len+1; i++){
            num[i] = num[i - 1]/20 + num1[i] + num2[i];
            num[i - 1] = num[i - 1] % 20;
        }
        len++;
        while(!num[len] && len > 1){
            len--;
        }
        for(int i = len; i > 0; i--){
            if(num[i] > 9){
                printf("%c", num[i] - 10 + 'a');
            }
            else {
                printf("%d", num[i]);
            }
        }
        printf("\n");
    }
    return 0;
}