题目:一波高精度
题解:高精度板子压位4
代码:
#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
char st[100005],st1[100005];
struct bignum{int l,a[25005];void cl(){memset(a,0,sizeof(a));}}a,b,c;
void init(int la,bignum &a,char st[])
{
int i,j;
for(i=1;i<=a.l;i++)
{
for (j=max(la-3,1);j<=la;j++)
a.a[i]=a.a[i]*10+st[j-1]-'0';
la-=4;
}
}
bool xiaoyu(bignum a,bignum b)
{
int i;
if (a.l<b.l) return 1;
else if (a.l>b.l) return 0;
for (i=a.l;i>=1;i--)
if (a.a[i]>b.a[i]) return 0;
else if (a.a[i]<b.a[i]) return 1;
return 0;
}
void gjjian(bignum &a,bignum &b)
{
if (xiaoyu(a,b)) {printf("-"); swap(a,b);}
for (int i=a.l;i>=1;i--)
{
while (a.a[i]<b.a[i]) a.a[i]+=10000,a.a[i+1]--;
a.a[i]-=b.a[i];
}
while (a.a[a.l]==0 && a.l>1) a.l--;
}
void gjjia(bignum &a,bignum b)
{
int x=0;
a.l+=b.l;
for (int i=1;i<=a.l;i++)
{
a.a[i]=a.a[i]+b.a[i]+x;
x=a.a[i]/10000;
a.a[i]%=10000;
}
while (!a.a[a.l] && a.l>1) a.l--;
}
void gjcheng(bignum &a,bignum b)
{
int x=0;
c.l=a.l+b.l;
for (int j=1;j<=b.l;j++)
for (int i=1;i<=a.l;i++)
{
c.a[i+j-1]+=a.a[i]*b.a[j];
c.a[i+j]+=c.a[i+j-1]/10000;
c.a[i+j-1]%=10000;
}
while (!c.a[c.l] && c.l>1) c.l--;
a=c;
}
void print(){
int i;
printf("%d",a.a[a.l]);
for (i=a.l-1;i>=1;i--)
{
printf("%d",a.a[i]/1000);
printf("%d",a.a[i]/100%10);
printf("%d",a.a[i]/10%10);
printf("%d",a.a[i]%10);
}
}
int main()
{
int la,lb;
scanf("%s%s",&st,&st1);
la=strlen(st);
a.l=la/4;
if (la%4!=0) a.l++;
lb=strlen(st1);
b.l=lb/4;
if (lb%4!=0) b.l++;
init(la,a,st);
init(lb,b,st1);
gjcheng(a,b);
print();
}