高精度库

其实可以优化读入函数的，但考虑到现在的数据多么坑是吧，就酱吧……万一不给你最后那个字符不就T了……

#include<iostream>  
#include<cstdio>  
#include<cstdlib>  
#include<cstring>  
#include<string>   
#include<algorithm>  
using namespace std;
const int MAXN=10010;
struct bign{
    int len,s[MAXN];  
    bign(){memset(s,0,sizeof(s));len=1;}
    bign(int num){*this=num;}
    bign(const char *num){*this=num;}
    bign operator = (const int num){
        char s[MAXN];  sprintf(s,"%d",num);  
        *this = s;return *this;
    }
    bign operator = (const char *num){
        for(int i=0;num[i]=='0';num++);
        len=strlen(num);  
        for(int i=0;i<len;i++) s[i]=num[len-i-1]-'0';  
        return *this;
    }
    bign operator + (const bign &b) const{
        bign c;c.len=0;
        for(int i=0,g=0;g||i<max(len,b.len);i++)  {
            int x=g;
            if(i<len) x+=s[i];  
            if(i<b.len) x+=b.s[i];
            c.s[c.len++]=x%10;  
            g=x/10;
        } return c;  
    }
    void clean(){while(len > 1 && !s[len-1]) len--;return;}
    bign operator * (const bign &b){
        bign c;
        c.len=len+b.len;  
        for(int i=0;i<len;i++) for(int j=0;j<b.len;j++) c.s[i+j]+=s[i]*b.s[j];  
        for(int i=0;i<c.len;i++){
            c.s[i+1]+=c.s[i]/10;  
            c.s[i]%=10;
        } c.clean();return c;  
    }
    bign operator - (const bign &b){
        bign c;c.len=0;
        for(int i=0,g=0;i<len;i++){
            int x=s[i]-g;if(i<b.len) x-=b.s[i];  
            if(x>=0) g=0;  
            else g=1,x+=10;
            c.s[c.len++]=x;
        } c.clean();return c;  
    }
    bign operator / (const bign &b)  {
        bign c,f=0;
        for(int i=len-1;i>=0;i--){
            f=f*10;f.s[0]=s[i];
            while(!(f<b)) f=f-b,c.s[i]++;
        } c.len=len;c.clean();return c;  
    }
    bign operator % (const bign &b)  {
        bign r = *this / b;
        r = *this - r*b;
        return r;
    }
    bool operator < (const bign &b)  {
        if(len!=b.len) return len<b.len;  
        for(int i=len-1;i>=0;i--){
            if(s[i]!=b.s[i]) return s[i]<b.s[i];  
        } return false;
    }
    bool operator > (const bign &b){
        if(len!=b.len) return len>b.len;  
        for(int i=len-1;i>=0;i--){
            if(s[i]!=b.s[i]) return s[i]>b.s[i];  
        } return false;  
    }
    bool operator == (const bign &b){
        return !(*this>b)&&!(*this<b);  
    }
    void print(){
        for(int i=len-1;i>=0;i--) putchar(s[i]+'0');return;
    }
};
char s[MAXN];
int main(){
    bign a,b,c;
    scanf("%s",s);a=s;
    scanf("%s",s);b=s;
    c=a/b;c.print();putchar('
');
    c=a%b;c.print();
    return 0;
}