高精度整数加法、减法与乘法

---

更新：2018/8/26
内容：采用int数组模拟高进制位的加法与乘法。

1 高精度加法与乘法

（手懒，直接上代码哈……）

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

#define MAX_V 100

const int hexa = 10000;
#define HEXA_L "04"

typedef struct{
    int v[MAX_V];//倒序装入
    int len;//长度
}int_x;

void itox(int n, int_x *x){
    if(!x){
        printf("x is NULL!\n");
        exit(0);
    }
    x->len = 0;
    x->v[x->len] = 0;//初始化为0
    while(n > 0){
        x->v[x->len ++] = n % hexa;
        n /= hexa;
    }
}

void print_x(int_x *x){
    int i;
    if(!x){
        printf("x is NULL!\n");
        exit(0);
    }
    i = x->len - 1;
    printf("%d", x->v[i --]);
    while(i >= 0){
        printf("%"HEXA_L"d", x->v[i --]);
    }
    printf("\n");
}

void add(int_x *a, int_x *b, int_x *c){//c = a + b
    int flag = 0, i, temp;
    if(!a || !b || !c){
        printf("a/b/c is NULL!\n");
        exit(0);
    }
    for(i = 0; i < a->len || i < b->len || flag; i ++){
        temp = 0;
        if(i < a->len){
            temp += a->v[i];
        }
        if(i < b->len){
            temp += b->v[i];
        }
        c->v[i] = temp % hexa + flag;
        flag = temp / hexa;
    }
    c->len = i;
}

void multi(int_x *a, int_x *b, int_x *c){//c = a * b
    int flag = 0, i, j, temp;
    if(!a || !b || !c){
        printf("a/b/c is NULL!\n");
        exit(0);
    }
    int_x x = {{0x0}, 0x0}, y = {{0x0}, 0x0};;
    for(i = 0; i < a->len; i ++){
        flag = temp = 0;
        memset(&y, 0x0, sizeof(int_x));
        y.len = i;
        for(j = 0; j < b->len || flag; j ++){
            if(j < b->len){
                temp = a->v[i] * b->v[j];
            }else{
                temp = 0;
            }
            y.v[y.len ++] = temp % hexa + flag;
            flag = temp / hexa;
        }
        add(&x, &y, &x);
        //print_x(&x);
    }
    c->len = x.len;
    for(i = 0; i < x.len; i ++){
        c->v[i] = x.v[i];
    }
}

int int_x_compare(int_x *a, int_x *b){//0 equal, 1 bigger, -1 smaller
    if(!a || !b){
        printf("a/b is NULL!\n");
        exit(0);
    }
    if(a->len > b->len){
        return 1;
    }
    if(a->len < b->len){
        return -1;
    }
    int i;
    for(i = a->len - 1; i >= 0; i --){
        if(a->v[i] > b->v[i]){
            return 1;
        }else if(a->v[i] < b->v[i]){
            return -1;
        }
    }
    return 0;
}

int main(int argc, char *argv[]){
    int a = 11;
    int_x a_x;
    int_x b_x = {{0x0}, 0x0};
    itox(a, &a_x);
    print_x(&a_x);
    int i;
    for(i = 0; i < a; i ++){
        add(&a_x, &b_x, &b_x);
    }
    print_x(&b_x);

    a_x.len = 0;
    itox(a, &a_x);
    for(i = 0; i < 4; i ++){
        multi(&a_x, &a_x, &a_x);
    }
    print_x(&a_x);

    printf("%d\n", int_x_compare(&a_x, &a_x));
    return 0;
}

---

1 大数加法

#include<stdio.h>
#include<string.h>

int judge(char *num){
    char *p = num;
    int c = 0;
    while(*(p + c)){
        if(*(p + c) < '0' || *(p + c) > '9'){
            return -1;
        }
        c ++;
    }
    return c;
}

void reverse(char *p){
    int i;
    int l1 = strlen(p);
    for(i = 0; i < l1 / 2; i ++){
        char c = p[i];
        p[i] = p[l1 - 1 - i];
        p[l1 - 1 - i] = c;
    }
}

void add(char *num1, char *num2, char *sum)
{
    int i;
    reverse(num1);
    reverse(num2);
    char *p1 = num1;
    char *p2 = num2;
    int later = 0;
    char *p3 = sum;
    while(*p1 || *p2){
        int t = later;
        if(*p1){
            t += (*p1 - '0');
            p1 ++;
        }
        if(*p2){
            t += (*p2 - '0');
            p2 ++;
        }
        later = t / 10;
        *p3 = (t % 10) + '0';
        p3 ++;
    }
    if(later > 0){
        *p3 = (later + '0');
        p3 ++;
    }
    *p3 = '\0';
    reverse(sum);
}
int main(int argc, char *argv[]){
    char num1[10000];
    char num2[10000];
    scanf("%s", num1);
    scanf("%s", num2);
    printf("%s + %s = ?\n", num1, num2);
    int num1_len = judge(num1);
    if(num1_len < 0){
        printf("num1 error!\n");
        return -1;
    }
    int num2_len = judge(num2);
    if(num2_len < 0){
        printf("num2 error!\n");
        return -1;
    }
    char sum[10000];
    add(num1, num2, sum);
    printf("%s\n", sum);
    return 0;
}

2 大数减法

#include<stdio.h>
#include<string.h>

int judge(char *num){
    char *p = num;
    int c = 0;
    while(*(p + c)){
        if(*(p + c) < '0' || *(p + c) > '9'){
            return -1;
        }
        c ++;
    }
    return c;
}

void reverse(char *p){
    int i;
    int l1 = strlen(p);
    for(i = 0; i < l1 / 2; i ++){
        char c = p[i];
        p[i] = p[l1 - 1 - i];
        p[l1 - 1 - i] = c;
    }
}

void minus(char *num1, char *num2, char *res)
{
    int i;
    reverse(num1);
    reverse(num2);
    int num1_len = strlen(num1);
    int num2_len = strlen(num2);
    if(num1_len < num2_len){
        for(i = num1_len; i < num2_len; i ++){
            num1[i] = '0';
        }
    }else{
        for(i = num2_len; i < num1_len; i ++){
            num2[i] = '0';
        }
    }
    char *big = num1;
    char *small = num2;
    for(i = (num1_len > num2_len ? num1_len : num2_len) - 1; i >= 0; i ++){
        if(num1[i] < num2[i]){
            big = num2;
            small = num1;
            break;
        }else if(num1[i] > num2[i]){
            big = num1;
            small = num2;
            break;
        }
    }
    int token = 0;
    int a, b;
    for(i = 0; i < (num1_len > num2_len ? num1_len : num2_len); i ++){
        a = big[i] - '0' - token;
        token = 0;
        b = small[i] - '0';
        if(a < b){
            token = 1;
            a += 10;
        }
        res[i] = a - b + '0';
    }
    reverse(res);
}
int main(int argc, char *argv[]){
    char num1[10000];
    char num2[10000];
    memset(num1, 0x0, sizeof(num1));
    memset(num2, 0x0, sizeof(num2));
    scanf("%s", num1);
    scanf("%s", num2);
    printf("|%s - %s| = ?\n", num1, num2);
    int num1_len = judge(num1);
    if(num1_len < 0){
        printf("num1 error!\n");
        return -1;
    }
    int num2_len = judge(num2);
    if(num2_len < 0){
        printf("num2 error!\n");
        return -1;
    }
    char res[10000];
    minus(num1, num2, res);
    char *p = res;
    while(*p == '0'){
        p ++;
    }
    if(!*p){
        printf("0\n");
    }else{
        printf("%s\n", p);
    }
    return 0;
}

3 大数乘法

#include<stdio.h>
#include<string.h>

#define MAX_LEN 1000000

int judge(char *num){
    char *p = num;
    int c = 0;
    while(*(p + c)){
        if(*(p + c) < '0' || *(p + c) > '9'){
            return -1;
        }
        c ++;
    }
    return c;
}

void reverse(char *p){
    int i;
    int l1 = strlen(p);
    for(i = 0; i < l1 / 2; i ++){
        char c = p[i];
        p[i] = p[l1 - 1 - i];
        p[l1 - 1 - i] = c;
    }
}

void multi(char *num, char c, int I, char *res){
    int a;
    int i, ii;
    int later = 0;
    for(ii = 0; ii < I; ii ++){
        res[ii] = '0';
    }
    for(i = 0; i < strlen(num); i ++){
        a = (c - '0') * (num[i] - '0') + later;
        res[ii ++] = a % 10 + '0';
        later = a / 10;
    }
    while(later){
        res[ii ++] = later % 10 + '0';
        later /= 10;
    }
    res[ii] = '\0';
}

void add(char *num1, char *sum){
    char *p1 = num1;
    int later = 0;
    char *p3 = sum;
    while(*p1 || *p3){
        int t = later;
        if(*p1){
            t += (*p1 - '0');
            p1 ++;
        }
        if(*p3){
            t += (*p3 - '0');
        }
        later = t / 10;
        *p3 = (t % 10) + '0';
        p3 ++;
    }
    if(later > 0){
        *p3 = (later + '0');
        p3 ++;
    }
    *p3 = '\0';
}

char t[MAX_LEN];
void compute(char *num1, char *num2, char *sum)
{
    int i;
    reverse(num1);
    reverse(num2);
    for(i = 0; i < strlen(num2); i ++){
        memset(t, 0x0, sizeof(t));
        multi(num1, num2[i], i, t);
        add(t, sum);
    }
    reverse(sum);
}

char num1[MAX_LEN / 2 - 1];
char num2[MAX_LEN / 2 - 1];
char res[MAX_LEN];
int main(int argc, char *argv[]){
    int i;
    scanf("%s", num1);
    scanf("%s", num2);
    printf("%s * %s = ?\n", num1, num2);
    int num1_len = judge(num1);
    if(num1_len < 0){
        printf("num1 error!\n");
        return -1;
    }
    int num2_len = judge(num2);
    if(num2_len < 0){
        printf("num2 error!\n");
        return -1;
    }
    memset(res, 0x0, sizeof(res));
    compute(num1, num2, res);
    int is = 1;
    for(i = 0; i < strlen(res); i ++){
        if(res[i] != '0' && is){
            is = 0;
        }
        if(!is){
            printf("%c", res[i]);
        }
    }
    if(is){
        printf("0");
    }
    printf("\n");
    return 0;
}

备注：写出来做个备份。