高精板子

就是纯板子啦...嗯...

1.高精加

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#define maxn 5000
using namespace std;

char s1[maxn],s2[maxn];
int len1,len2,len3,maxlen,tmp;
int a[maxn],b[maxn],c[maxn];

int main()
{
	scanf("%s%s",s1+1,s2+1);
	len1=strlen(s1+1),len2=strlen(s2+1);
	maxlen=max(len1,len2);
	for(int i=1;i<=len1;++i) a[len1-i+1]=s1[i]-'0';
	for(int i=1;i<=len2;++i) b[len2-i+1]=s2[i]-'0';
	for(int i=1;i<=maxlen;++i)
	{
		c[i]=a[i]+b[i]+tmp;
		tmp=c[i]/10;
		c[i]%=10;
	}
	len3=maxlen+1;c[len3]=tmp;
	while(c[len3]==0&&len3>1) len3--;
	for(int i=len3;i>=1;--i) printf("%d",c[i]);
	return 0;
} 

 

2.高精减

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#define maxn 20000
using namespace std;

char s1[maxn],s2[maxn];
int len1,len2,len3,a[maxn],b[maxn],c[maxn];

bool check()
{
	if(len1<len2) return true;
	if(len1>len2) return false;
	for(int i=1;i<=len1;++i)
		if(s1[i]<s2[i]) return true;
	return false;
}

int main()
{
	scanf("%s%s",s1+1,s2+1);
	len1=strlen(s1+1),len2=strlen(s2+1);
	if(check()) swap(s1,s2),swap(len1,len2),putchar('-');
	for(int i=1;i<=len1;++i) a[len1-i+1]=s1[i]-'0';
	for(int i=1;i<=len2;++i) b[len2-i+1]=s2[i]-'0';
	for(int i=i;i<=len1;++i)
	{
		if(a[i]<b[i]) 
			a[i]+=10,a[i+1]--;
		c[i]=a[i]-b[i];
	}
	len3=len1;
	while(c[len3]==0&&len3>1) len3--;
	for(int i=len3;i>=1;--i) printf("%d",c[i]);
	return 0;
} 

 

3.高精乘

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#define maxn 5000
using namespace std;

char s1[maxn],s2[maxn];
int len1,len2,len3,a[maxn],b[maxn],c[maxn];

int main()
{
	scanf("%s%s",s1+1,s2+1);
	len1=strlen(s1+1),len2=strlen(s2+1);
	for(int i=1;i<=len1;++i) a[len1-i+1]=s1[i]-'0';
	for(int i=1;i<=len2;++i) b[len2-i+1]=s2[i]-'0';
	for(int i=1;i<=len1;++i)
	{
		int tmp=0;
		for(int j=1;j<=len2;++j)
		{
			c[i+j-1]+=a[i]*b[j]+tmp;
			tmp=c[i+j-1]/10;
			c[i+j-1]%=10;
		}
		c[i+len2]=tmp;
	}
	len3=len1+len2;
	while(c[len3]==0&&len3>1) len3--;
	for(int i=len3;i>=1;--i) printf("%d",c[i]);
	return 0;
}

 

4.高精除低精

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#define maxn 5000
using namespace std;

char s[maxn];
int len1,len2,b,tmp,a[maxn],c[maxn];

int main()
{
	scanf("%s%d",s+1,&b);
	len1=strlen(s+1);len2=1;
	for(int i=1;i<=len1;++i) a[i]=s[i]-'0';
	for(int i=1;i<=len1;++i)
	{
		c[i]=(tmp*10+a[i])/b;
		tmp=(tmp*10+a[i])%b;
	}
	while(c[len2]==0&&len2<len1) len2++;
	for(int i=len2;i<=len1;++i) printf("%d",c[i]);
	return 0;
}