High-Precision algorithm code and high-precision Algorithm

High-Precision algorithm code and high-precision Algorithm

Reproduced from SinGuLaRiTy2001, original link: http://www.cnblogs.com/SinGuLaRiTy2001/p/6591222.html

[SinGuLaRiTy-1001]Copyrights (c) SinGuLaRiTy 2017. All Rights Reserved.

Addition:

#include<stdio.h>#include<string.h>char a[1000],b[1000];char c[1000];int i;void swap(char a[]){    char tmp;    for(int i=0;i<strlen(a)/2;i++)    {        tmp=a[i];        a[i]=a[strlen(a)-1-i];        a[strlen(a)-1-i]=tmp;    }}void add(char a[],char b[]){    for(i=0;i<strlen(a)&&i<strlen(b);i++)    {        c[i]+=a[i]+b[i]-'0';            if(c[i]-'0'>=10)            {                c[i]=c[i]-10;                c[i+1]=1;            }    }    if(strlen(a)==strlen(b))        if(c[i]==1)            c[i]='1';    if(strlen(a)>strlen(b))    {        if(c[i]==1)        {            for(;i<strlen(a);i++)            {                c[i]+=a[i];                if(c[i]-'0'>=10)                {                    c[i]=c[i]-10;                    c[i+1]=1;                }            }            if(c[i-1]=='0')                c[i]='1';        }        else            for(;i<strlen(a);i++)                c[i]=a[i];    }    if(strlen(b)>strlen(a))    {        if(c[i]==1)        {            for(;i<strlen(b);i++)            {                c[i]+=b[i];                if(c[i]-'0'>=10)                {                    c[i]=c[i]-10;                    c[i+1]=1;                }            }            if(c[i]==1)                c[i]='1';        }    else        for(;i<strlen(b);i++)            c[i]=b[i];    }}int main(){    scanf("%s",a);    scanf("%s",b);    swap(a);    swap(b);    add(a,b);    swap(c);    printf("%s",c);    return 0;}

Subtraction:

#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<algorithm>using namespace std;char a[1001],b[1001];int a1[1001],b1[1001];int c[1001];int i,j,al,bl,l;int main(){        scanf("%s",a);        scanf("%s",b);        al=strlen(a);        bl=strlen(b);        l=al>bl?al:bl;        for(i=0;i<al;i++)            a1[al-i-1]=a[i];        for(i=0;i<bl;i++)            b1[bl-i-1]=b[i];        for(i=l-1;i>=0;i--)        {            if(al>bl || a1[i]>b1[i])            {                    for(j=0;j<l;j++){                        c[j]=a1[j]-b1[j]+'0';                        if(b1[j]==0)                            c[j]-='0';                    }                    for(j=0;j<l-1;j++)                        if(c[j]<'0')                        {                            c[j]+=10;                            c[j+1]--;                        }                    while(c[l-1]=='0'&&l!=0)                        l--;                    for(j=l-1;j>=0;j--)                        printf("%c",c[j]);                    break;            }            if(al<bl||a1[i]<b1[i])            {                for(j=0;j<l;j++)                {                    c[j]=b1[j]-a1[j]+'0';                    if(a1[j]==0)                        c[j]-='0';                }                for(j=0;j<l-1;j++)                    if(c[j]<'0')                    {                        c[j]+=10;                        c[j+1]--;                        if(c[j+1]=='0'&&j+1==l-1)                            l--;                    }                while(c[l-1]=='0'&&l!=0)                    l--;                printf("-");                for(j=l-1;j>=0;j--)                    printf("%c",c[j]);                break;            }        }    return 0;}

Multiplication:

# Include <iostream> # include <cstdio> # include <cstring> using namespace std; int jw, sum, ac, bc, k; int a, B, ans [10000]; string A; string B; int main () {cin> A> B; ac =. size ()-1; bc = B. size ()-1; for (int I = 0; I <= ac; I ++) {a = A [ac-I]-'0 '; for (int j = 0; j <= bc; j ++) {k = I + j; B = B [bc-j]-'0 '; ans [k] + = a * B; if (ans [k]> = 10) {ans [k + 1] + = ans [k]/10; ans [k] % = 10 ;}}if (ans [k + 1]> 0) k ++; for (int I = k; I> = 0; I --) cout <ans [I]; return 0;} Square [open party]: # include <cstdio> # include <cstring> # include <cstdlib> # include <cmath> # include <algorithm> # include <iostream> int l; int work (int o, char * O, int I) {char c, * D = O; if (o> 0) {for (l = 0; D [l]; D [l ++]-= 10) {D [l ++]-= 120; D [l]-= 110; while (! Work (0, O, l) D [l] + = 20; putchar (D [l] + 1032)/20);} putchar (10 );} else {c = o + (D [I] + 82) % 10-(I> l/2) * (D [I-l + I] + 72) /10-9; D [I] + = I <0? 0 :! (O = work (c/10, O, I-1) * (c + 999) % 10-(D [I] + 92) % 10 );} return o ;}int main () {char s [1200]; s [0] = '0'; scanf ("% s", s + 1 ); if (strlen (s) % 2 = 1) work (2, s + 1, 0); else work (2, s, 0); return 0 ;}

Integer Division:

#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<algorithm>#include<iostream>using namespace std;char s1[600],s2[600];int a1[600],a2[600],a3[600],a4[600],len1,len2,len3,i,j;int bi(int a3[],int a4[]){    if(a3[0]<a4[0])        return 0;    if(a3[0]>a4[0])        return 1;    for(int i=a3[0];i>0;i--)    {        if(a3[i]<a4[i])            return 0;        if(a3[i]>a4[i])            return 1;    }    return 1;}int jian(int a3[],int a4[]){    for(int i=1;i<=a3[0];i++)    {        if(a3[i]<a4[i])        {            a3[i]+=10;            a3[i+1]--;        }        a3[i]-=a4[i];    }    for(;a3[a3[0]]==0&&a3[0]>1;a3[0]--);}int main(){    scanf("%s",s1);    scanf("%s",s2);    len1=strlen(s1);    len2=strlen(s2);    for(i=0;i<len1;i++)        a1[len1-i]=s1[i]-'0';    for(i=0;i<len2;i++)        a2[len2-i]=s2[i]-'0';    a1[0]=len1;    a2[0]=len2;    a4[0]=a1[0]-a2[0]+1;    for(i=a4[0];i>0;i--)    {        memset(a3,0,sizeof(a3));        for(j=1;j<=a2[0];j++)            a3[j+i-1]=a2[j];        a3[0]=a2[0]+i-1;        for(;bi(a1,a3);)        {            a4[i]++;            jian(a1,a3);        }    }    for(;a4[a4[0]]==0&&a4[0]>1;a4[0]--);    for(i=a4[0];i>0;i--)        printf("%d",a4[i]);    return 0;}

High Precision Non-divisible division for remainder:

#include<iostream>#include<cstring>using namespace std;int a[101],b[101],c[101];int d,i;void init(int a[]){    string s;    cin>>s;    a[0]=s.length();    for(i=1;i<=a[0];i++)    {        a[i]=s[a[0]-i]-'0';    }}void print(int a[]){    int i;    if(a[0]==0)    {        cout<<0<<endl;        return;    }    for(i=a[0];i>0;i--)    {        cout<<a[i];    }    cout<<endl;    return;}int compare(int a[],int b[]){    int i;    if(a[0]>b[0])        return 1;    if(a[0]<b[0])        return -1;    for(i=a[0];i>0;i--)    {        if(a[i]>b[i])            return 1;        if(a[i]<b[i])            return -1;    }    return 0;}void subtraction(int a[],int b[]){    int flag,i;    flag=compare(a,b);    if(flag==0)    {        a[0]=0;        return;    }    if(flag==1)    {        for(i=1;i<=a[0];i++)        {            if(a[i]<b[i])            {                a[i+1]--;                a[i]+=10;            }            a[i]-=b[i];        }        while(a[0]>0&&a[a[0]]==0)            a[0]--;        return;    }}void numcpy(int p[],int q[],int det){    for(int i=1;i<=p[0];i++)    {        q[i+det-1]=p[i];    }    q[0]=p[0]+det-1;}void Division(int a[],int b[],int c[]){    int i,tmp[101];    c[0]=a[0]-b[0]+1;    for(i=c[0];i>0;i--)    {        memset(tmp,0,sizeof(tmp));        numcpy(b,tmp,i);        while(compare(a,tmp)>=0)        {            c[i]++;            subtraction(a,tmp);        }    }    while(c[0]>0&&c[c[0]]==0)        c[0]--;    return;}int main(){    memset(a,0,sizeof(a));    memset(b,0,sizeof(a));    memset(c,0,sizeof(a));    init(a);    init(b);    Division(a,b,c);    print(c);    print(a);    return 0;}

* Four high-precision hybrid operations:

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;#define MAXN 1000struct hp{    int a[MAXN+10];    hp(){        memset(a,0,sizeof a);        a[0]=1;    }    hp(int n){        memset(a,0,sizeof a);        a[0]=0;        while(n){            a[++a[0]]=n%10;            n/=10;        }        if(!a[0])            a[0]=1;    }    hp(char *s){        memset(a,0,sizeof a);        int len=strlen(s);        for(int i=1;i<=len;i++)            a[i]=s[len-i]-'0';        a[0]=len;    }    hp operator*(const hp &b)const{        hp c;        int i,j,len=a[0]+b.a[0];        for(i=1;i<=a[0];i++)            for(j=1;j<=b.a[0];j++)                c.a[i+j-1]+=a[i]*b.a[j];        for(i=1;i<len;i++){            c.a[i+1]+=c.a[i]/10;            c.a[i]%=10;        }        while(len>1&&!c.a[len])            len--;        c.a[0]=len;        return c;    }    hp operator/(int b)const{        hp c;        int d=0,i,len=a[0];        for(i=a[0];i;i--){            d=d*10+a[i];            c.a[i]=d/b;            d%=b;        }        while(len>1&&!c.a[len])            len--;        c.a[0]=len;        return c;    }    hp operator+(const hp &b)const{        hp c;        int len=max(a[0],b.a[0]),i;        for(i=1;i<=len;i++){            c.a[i]+=a[i]+b.a[i];            c.a[i+1]=c.a[i]/10;            c.a[i]%=10;        }        len++;        while(len>1&&!c.a[len])            len--;        c.a[0]=len;        return c;    }    hp operator-(const hp &b)const{        hp c;        int i,len=a[0];        for(i=1;i<=len;i++){            c.a[i]+=a[i]-b.a[i];            if(c.a[i]<0)                c.a[i]+=10,c.a[i+1]--;        }        while(len>1&&!c.a[len])            len--;        c.a[0]=len;        return c;    }    void operator*=(const hp &x){        *this=*this*x;    }    void operator/=(const int &x){        *this=*this/x;    }    void operator+=(const hp &x){        *this=*this+x;    }    void operator-=(const hp &x){        *this=*this-x;    }    void print(){        for(int i=a[0];i;i--)            printf("%d",a[i]);    }    bool operator>(const hp&b)const{        if(a[0]>b.a[0])            return 1;        if(a[0]<b.a[0])            return 0;        for(int i=a[0];i;i--)            if(a[i]>b.a[i])                return 1;            else if(a[i]<b.a[i])                return 0;        return 0;    }    bool operator<(const hp&b)const{        if(a[0]<b.a[0])            return 1;        if(a[0]>b.a[0])            return 0;        for(int i=a[0];i;i--)            if(a[i]<b.a[i])                return 1;            else if(a[i]>b.a[i])                return 0;        return 0;    }    bool operator<=(const hp&b)const{        return !(*this>b);    }    hp operator/(const hp&b)const{        hp l(0),r(*this),mid;        while(l<r){            mid=(l+r+1)/2;            if(mid*b<=*this)                l=mid;            else                r=mid-1;        }        return l;    }    void operator/=(const hp&b){        *this=*this/b;    }}a,b,c;char s[MAXN+10];void read(){    scanf("%s",s);    a=s;    scanf("%s",s);    b=s;}int main(){    read();    c=a/b;    c.print();    puts("");    a-=c*b;    a.print();}

 

Time: 2017-01-28

Thank you for reading this article. If you think it is helpful to read this article, click"Recommendation"Button. You are welcome to repost this article.The author must be connected to the original article on the article page..

Where Everything Starts