高精度--模板

加法

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include 
#include 
#include 
using namespace std;
#define MAXN 1000
int main(void)
{
   char str[MAXN];
   int arr1[MAXN],arr2[MAXN],len,len1,len2,i,j;
    scanf("%s",str);
    len1=strlen(str);
    for(i=0;ilen2)?len1:len2;
    for(i=0;i

减法

#include 
using namespace std;
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")

//std::ios::sync_with_stdio(false);
//std::cin.tie(0);

using namespace std;
int a[210],b[210],c[210],lena,lenb,lenc,i;
char n[210],n1[210],n2[210];
int main()
{
    scanf("%s",n1);
    scanf("%s",n2);
    if(strlen(n1)1))lenc--;
    for(i=lenc;i>=1;i--)cout<

乘法写的好hh

#include 
using namespace std;
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")

//std::ios::sync_with_stdio(false);
//std::cin.tie(0);
int main(){
    string a,b;
    int an[105]={0},bn[105]={0},c[15000]={0};
    cin>>a>>b;
    int lena=a.length();
    int lenb=b.length();
    //倒序存储两个数于整型数组中
    for(int i=0;i1){
        lenc--;
    }
    //将结果倒序输出
    for(int i=lenc-1;i>=0;i--){
        cout<