递归程序C语言源代码.docx

1、递归程序C语言源代码#include stdafx.h#include #include using namespace std;#define MAXL 250class big_numpublic: int numMAXL; int length; bool mark; void init() int i; for(i=0;iMAXL;i+) numi=0; mark=false; length=1; void turn() int i; int a,b,c; for (i=0;i0) numi+1=numi/10000; numi=numi%10000; void leng() int

2、i; length=1; for (i=250;i0;i-) if (numi-1!=0) length=i;break; bool operator (big_num n) int i; if (lengthn.length) return false; for (i=length-1;i=0;i-) if (numin.numi) return false; if (numin.numi) return true; return false; bool operator =(big_num n) int i; if (lengthn.length) return false; for (i

3、=length-1;i=0;i-) if (numin.numi) return false; if (numin.numi) return true; return true; big_num operator *(big_num obj) big_num other; big_num a; int i,j; int c=0; int k; bool mak; mak=false; if (*thisobj) a=*this;*this=obj;obj=a;mak=true; for(i=0;iobj.length;i+) for (j=0;jlength;j+) c=other.numi+

4、j; other.numi+j=(c+numj*obj.numi)%10000; other.numi+j+1+=(c+numj*obj.numi)/10000; other.leng(); if (mak) a=*this;*this=obj;obj=a; if (mark=obj.mark) other.mark=false; else other.mark=true; return other; big_num operator +(big_num obj) big_num other; int i; int c=0; int k; bool m1,m2; if (mark=obj.ma

5、rk) for(i=0;iMAXL;i+) k=(numi+obj.numi+c)%10000; c=(numi+obj.numi+c)/10000; other.numi=k; other.leng(); other.mark=mark; return other; else m1=mark;m2=obj.mark; mark=false;obj.mark=false; other=*this-obj; mark=m1;obj.mark=m2; if (*thisobj) other.mark=obj.mark; else if (other.length=1 & other.num0=0)

6、 other.mark=false; else other.mark=mark; return other; big_num operator - (big_num obj) big_num other,a; int i; int c=0; int k; bool mak; mak=false; if (mark=obj.mark) if (*thisobj) a=*this;*this=obj;obj=a;mak=true; for (i=0;ilength & iobj.length & numi=0 & obj.numi=0) break; other.numi=numi-obj.num

7、i; other.leng(); for (i=0;iother.length;i+) if(other.numi0) if(i+1)other.length) other.numi+=10000; other.numi+1-; if (mak) a=*this;*this=obj;obj=a; if (*thisobj) other.mark=!mark; else other.mark=mark; if (other.numother.length-1mark*4) mark+; n.length=mark; for(i=0;ilen-(i+1)*4-1 & j=0+n.mark;j-)

8、sum+=(strj-0)*tem; tem*=10; n.numi=sum; return n; */;big_num tobignum (string str) big_num n; int len,i,mark,tem,k,j,sum; len=str.length(); if (str0=-) n.mark=true; else n.mark=false; mark=len/4; if (lenmark*4) mark+; n.length=mark; for(i=0;ilen-(i+1)*4-1 & j=0+n.mark;j-) sum+=(strj-0)*tem; tem*=10;

9、 n.numi=sum; n.leng(); return n;string tstring(big_num n) string st,str=; int i; int m,tem; bool mark; char a1,a2,a3,a4,a5; /*if (n.length=1 & n.num0=0) return0;*/ m=n.numn.length-1; tem=10; for(i=0;i=0;i-) a1=n.numi/1000+0; a2=(n.numi/100)%10+0; a3=(n.numi/10)%10+0; a5=n.numi%10+0; str=str+a1; str+

10、=a2;str+=a3;str+=a5; mark=false; for(i=0;istr.length();i+) if (stri!=0& !mark) mark=true; if (mark) st=st+stri; return st;big_num div (big_num thiss,big_num obj) big_num other,n1,n2; string st1,st2,sm,st3=; sm=; char s; bool m1,m2,mak; int sum,i; m1=thiss.mark;m2=obj.mark; if (thissst1.length() brea

11、k; /*if (st3=0) st3=; sm+=0; st3+=st1i; i+; if (ist1.length() break; if (st3!=) */ n1=tobignum(st3); /*else n1=tobignum(0);*/ if (n2=n1) sum=0; while(n2st1.length() break; else sm+=0; st3=st3+st1i; i+; if (ist1.length() break; other=tobignum(sm); if (m1=m2) other.mark=false; else other.mark=true; ot

12、her.leng(); return other;void output(big_num n) int i; int m; if(n.mark) cout-; cout=0;i-) if (n.numi=0) cout0000;continue; if (n.numi/10=0) cout000n.numi;continue; if (n.numi/100=0) cout00n.numi;continue; if (n.numi/1000=0) cout0n.numi;continue; else coutstr; len=str.length(); if (str0=-) n.mark=tr

13、ue; else n.mark=false; mark=len/4; if (lenmark*4) mark+; n.length=mark; for(i=0;ilen-(i+1)*4-1 & j=0+n.mark;j-) sum+=(strj-0)*tem; tem*=10; n.numi=sum; return n;int _tmain(int argc, _TCHAR* argv) big_num n,a,c; string str; while(1) n=input(); a=input(); c=n+a; output(c); coutendl; c=n-a; output(c); coutendl; c=n*a; output(c); coutendl; c=div(n,a); output(c); coutendl; return 0;