两个大整数相乘程序

设计程序实现两个很大的数相乘,例如123456789*987654321 。

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

void mux(const char *numA, const char *numB, char *result);
char *reverse(const char *src, char *dst);
void mux_ch_str(const char ch, const char *str, char *result);
void add_str(char *dst, const char *src);

int main(void)
{
	char numA[100] = "";
	char numB[100] = "";
	char *result = NULL;

	printf("input numA = ");
	fflush(stdout);
	scanf("%s", numA);

	printf("input numB = ");
	fflush(stdout);
	scanf("%s", numB);

	result = (char *)malloc(strlen(numA) + strlen(numB) + 1);
	mux(numA, numB, result);
	printf("%s x %s = %s \n", numA, numB, result);

	free(result);
	result = NULL;
	return 0;
}

/*字符串相乘, result = numA x numB, numA, numB顺序排列*/
void mux(const char *numA, const char *numB, char *result)
{
	char *A = NULL;  //numA逆序串
	char *B = NULL;  //numB逆序串
	char *t = NULL;  //存储字符与字符串相乘结果
	char *r = NULL;  //存储字符串与字符串相乘结果
	int  i  = 0;

	A = (char *)malloc(strlen(numA)+1);
	B = (char *)malloc(strlen(numB)+1);
	t = (char *)malloc(strlen(numA) + strlen(numB) + 1);
	r = (char *)malloc(strlen(numA) + strlen(numB) + 1);

	memset(A, 0, strlen(numA) + 1);
	memset(B, 0, strlen(numB) + 1);
	memset(t, 0, strlen(numA) + strlen(numB) + 1);
	memset(r, 0, strlen(numA) + strlen(numB) + 1);

	reverse(numA, A); //numA翻转保存为A
	reverse(numB, B); //numB翻转保存为B

	i = 0;
	while (A[i])
	{
		memset(t, 0, strlen(numA) + strlen(numB) + 1);
		mux_ch_str(A[i], B, t);  //从A串取下一个字符与B串相乘,结果保存在t串
		add_str(r+i, t);   //将t串累加至result串
		i++;
	}

	reverse(r, result);

	free(A);
	free(B);
	free(t);
	free(r);
}

/*字符串逆序排列 src -> dst*/
char *reverse(const char *src, char *dst)
{
	int count = 0;
	int i = 0;

	while(src[count])
	count++;
	for (i=0; i<count; i++)
	{
		dst[i] = src[count - 1 - i];
	}
	dst[count] = '\0';
	return dst;
}

/*字符乘字串,result = ch x str, str, result为逆序排列*/
void mux_ch_str(const char ch, const char *str, char *result)
{
	char r = 0; //相乘结果
	char c = 0; //进位数字
	int i = 0;

	while (str[i])
	{
		r = c + (ch - '0')*(str[i] - '0');
		result[i] = r % 10 + '0';
		c = r / 10;
		i++;
	}
	if (c > 0)
	{
		result[i] = c + '0';
		i++;
	}
	result[i] = '\0';
}

/*字符串相加,dst = dst + src, dst, src为逆序排列*/
void add_str(char *dst, const char *src)
{
	char r = 0; //相加结果
	char c = 0; //进位数字
	int i = 0;

	while(dst[i] || src[i])
	{
		r = c; 
		if(dst[i])
			r += dst[i] - '0';
		if(src[i])
			r += src[i] - '0';
		dst[i] = r % 10 + '0';
		c = r / 10;
		i++;
	}
	if (c > 0)
	{
		dst[i] = c + '0';
		i++;
	}
	dst[i] = '\0';
}


 

好的,以下是使用C语言程序实现Karatsuba乘法的示例代码: ``` #include <stdio.h> #include <string.h> #define MAX_LEN 1000 void add(char *a, char *b) { int lena = strlen(a), lenb = strlen(b); int i, j, len = lena > lenb ? lena : lenb; for (i = len - 1, j = 0; i >= 0; i--, j++) { int numa = i >= lena ? 0 : a[i] - '0'; int numb = i >= lenb ? 0 : b[i] - '0'; int sum = numa + numb + j; a[i] = sum % 10 + '0'; j = sum / 10; } } void karatsuba(char *x, char *y, char *z) { int lenx = strlen(x), leny = strlen(y), lenz; char *x1, *x0, *y1, *y0, *p1, *p2, *p3, *t1, *t2; char *z1, *z2, *z3, *tmp1, *tmp2; int n, n2, i; if (lenx < leny) { char *tmp = x; x = y; y = tmp; lenx ^= leny ^= lenx ^= leny; } if (lenx < 10 || leny < 10) { int val = 0; for (i = 0; i < lenx; i++) { val = val * 10 + x[i] - '0'; } for (i = 0; i < leny; i++) { val = val * 10 + y[i] - '0'; } sprintf(z, "%d", val); return; } n = lenx > leny ? lenx : leny; n2 = n / 2; x1 = x + n2; x0 = x; y1 = y + n2; y0 = y; p1 = (char *)malloc(MAX_LEN); p2 = (char *)malloc(MAX_LEN); p3 = (char *)malloc(MAX_LEN); t1 = (char *)malloc(MAX_LEN); t2 = (char *)malloc(MAX_LEN); z1 = (char *)malloc(MAX_LEN); z2 = (char *)malloc(MAX_LEN); z3 = (char *)malloc(MAX_LEN); tmp1 = (char *)malloc(MAX_LEN); tmp2 = (char *)malloc(MAX_LEN); karatsuba(x1, y1, p1); karatsuba(x0, y0, p2); add(x1, x0); add(y1, y0); karatsuba(x1, y1, p3); sprintf(t1, "%0*d", n + n2, 0); sprintf(t2, "%0*d", n2, 0); strncpy(t1, p1, strlen(p1)); strncpy(t2, p3, strlen(p3) - strlen(p1) - strlen(p2)); add(t1, t2); sprintf(z1, "%0*d", n + n2, 0); strncpy(z1, t1, strlen(t1)); strncpy(z2, p2, strlen(p2)); sprintf(tmp1, "%0*d", n, 0); sprintf(tmp2, "%0*d", n2, 0); strncpy(tmp1, z1, strlen(z1)); strncpy(tmp2, z2, strlen(z2)); add(tmp1, tmp2); strncpy(z3, p3 + strlen(p1) + strlen(p2), strlen(p3) - strlen(p1) - strlen(p2)); sprintf(z, "%0*d", n * 2, 0); strncpy(z + n2, tmp1, strlen(tmp1)); strncpy(z, z1, strlen(z1)); strncpy(z + 2 * n2, z2, strlen(z2)); strncpy(z + 3 * n2, z3, strlen(z3)); free(p1); free(p2); free(p3); free(t1); free(t2); free(z1); free(z2); free(z3); free(tmp1); free(tmp2); } int main() { char x[MAX_LEN], y[MAX_LEN], z[MAX_LEN * 2]; scanf("%s%s", x, y); karatsuba(x, y, z); printf("%s\n", z); return 0; } ``` 该程序使用了递归的思想实现Karatsuba乘法,具体实现过程与前面的Python示例代码类似,不同之处在于需要手动实现字符串相加和字符串补0等操作,以及需要使用动态内存分配来存储中间结果和最终结果。
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值