乘法运算时,m位数和n位数相乘只会产生m+n-1或m+n位数:
10*100=1000结果为4位
99*999=98901结果为5位
以上是一个例子。
第i与第j位数相乘的时候会存在i+j-1位上,注意对超过10的数及时进位,否则会产生非常大量的数值运算,有可能导致数据溢出。
以下是代码:
#include <stdio.h>
#include <string.h>
#include <iostream>
#define MAXN 50001
using namespace std;
int main()
{
void init (int x[], char str[], int len);
void multiply (int a[], int b[], int la, int lb);
int la, lb;
int a[MAXN] = {0}, b[MAXN] = {0};
char stra[MAXN] = {0}, strb[MAXN] = {0};
cin >> stra >> strb;
la = strlen (stra);
lb = strlen (strb);
if ((la == 1 && stra[0] == '0') || (lb == 1 && strb[0] == '0'))
printf ("0\n");
else
{
init (a, stra, la);
init (b, strb, lb);
multiply (a, b, la, lb);
}
return 0;
}
void init (int x[], char str[], int len)
{
int i;
for (i = 0; i < len; i++)
{
x[len-1-i] = str[i] - '0';
}
}
void multiply (int a[], int b[], int la, int lb)
{
int c[MAXN] = {0}, len, i, j, k, maxlen;
maxlen = la + lb;
for (i = 0; i <lb; i++)
{
for (j = 0; j <la; j++)
{
c[i+j] += b[i] * a[j];
}
for (k = 0; k < maxlen; k++)
{
if (c[k] >= 10)
{
c[k+1] += c[k]/10;
c[k] %= 10;
}
}
}
for (i = k; c[i] == 0; i--)
;
len = i + 1;
for (i = len - 1; i >= 0; i--)
printf ("%d", c[i]);
printf ("\n");
}
快速幂运算时,基本原理是和普通快速求幂相同,只是连续调用了乘法。
这里是三个数组:a是用来乘方的数组,b是需要相乘存留最后乘积的数组,c是存放数组,因此使用了指针。
直接代码:
#include <stdio.h>
#include <string.h>
#include <iostream>
#define MAXN 50001
using namespace std;
int a[MAXN], b[MAXN], c[MAXN];
int len_a, d, *pa, *pb, *pc, len_b, len;
int main()
{
void init (int x[], char str[], int len);
int mul();
int power();
char s[MAXN];
int i, j;
cin >> s >> d;
len = strlen (s);
init (a, s, len);
len_a = len;
pa = a;
pb = b;
pc = c;
pb[0] = 1;
len_b = 1;
while (d > 0)
{
if (d&1 == 1)
{
mul();
}
power();
d >>= 1;
}
for (i = len_b - 1; i >= 0; i--)
{
printf ("%d", pb[i]);
}
printf ("\n");
return 0;
}
void init (int x[], char str[], int l)
{
int i = 0;
for (i; i < l; i++)
{
x[l-i-1] = str[i] - '0';
}
}
int mul()
{
int i, j;
for (i = 0; i < len_a + len_b; i++)
{
pc[i] = 0;
}
for (i = 0; i < len_a; i++)
{
for (j = 0; j < len_b; j++)
{
pc[i + j] += pa[i] * pb[j];
}
}
for (i = 0; i < len_a + len_b; i++)
{
if (pc[i] > 9)
{
pc[i+1] += pc[i]/10;
pc[i] %= 10;
}
}
if (pc[len_a + len_b - 1] > 0)
{
len_b = len_a + len_b;
}
else
{
len_b = len_a + len_b - 1;
}
int *change;
change = pb;
pb = pc;
pc = change;
}
int power()
{
int i, j, r = 0;
for (i = 0; i < len_a * 2; i++)
{
pc[i] = 0;
}
for (i = 0; i < len_a; i++)
{
for (j = 0; j < len_a; j++)
{
pc[i+j] += (pa[i]) * (pa[j]);
}
}
for (i = 0; i <= len_a*2 - 1 ; i++)
{
if (pc[i] > 9)
{
pc[i+1] += pc[i]/10;
pc[i] %= 10;
}
}
if (pc[len_a*2 -1] > 0)
{
len_a *= 2;
}
else
{
len_a = 2*len_a - 1;
}
int *change;
change = pa;
pa = pc;
pc = change;
}