/* Celebrating my 50th Code in Sololearn. (Yay!). A program to Primitively declare a type that can handle large numbers (I really mean large), with some ease. Uses an array to store a number. Can easily store 10000!. (Calculates in 12s). Can even perform basic calculation on such numbers. Eg - 4623153475976677456845656904568048708080483 475746745760845684586563554674575797 divided by 57495873497564567 = 804084396799799349829999448145352763912697 41602137151659153456, calculated in 0.152s All suggestions for improvement or addition of new features are welcome. Created by - Kinshuk Vasisht */ /// /////////////////////////////////////// /// BigInt Numbers in C++ /// /////////////////////////////////////// /// /// Made By - Kinshuk Vasisht /// Version - v1.5 /// Status - 0xFFFFF0 /// Log - v1.0 - 04/06/17 - Created\ /// the Class,>>,<<,Ctors and\ /// I/O Functions. /// - v1.1 - 08/06/17 - +,<,>,=\ /// <=,>=,-,*. /// - v1.2 - 20/06/17 - Imprvd \ /// Ctor, string support. /// - v1.3 - 15/07/17 - Added \ /// extra support functions \ /// and improved overloads. \ /// Added Helper functions. /// - v1.4 - 25/09/17 - /,%,^ \ /// /=,%=,^=,Sign system. /// - v1.5 - 02/10/17 - / for \ /// Pure BigInts, friend fns \ /// and operators. /// Features - BigInt Operations. /// Overloads - Multiple Declarations... /// Functions - BigInt Class Methods, \ /// NumCheck(), ValueIn(), \ /// ValueOut() and len() /// Main Type - long long ( as lint ) /// Templates - None. /// Macros - elif (else if) /// Classes - BigInt /// -> Features - Generate Random Nos.,\ /// Operate on Bigints, \ /// Exec I/O in streams, \ /// Initialize BigInts \ /// w strings or integers\ /// , Compare BigInts. /// -> Oprtrs - +,-,*,/,%,^,+=,-=,/=,\ /// %=,^=,>,<,>=,<=,=,==,\ /// <<,>>,++,--,!=,*= . /// Constants - None. /// Lines - 1030 (No Extras) /// Headers - ,,\ /// ,,, \ /// ,, \ /// , /// Contribs - Special Thanks to Ace Sir\ /// for his Contribution of \ /// The Division Algorithm \ /// for two BigInts. /// /// /////////////////////////////////////// #include #include #include #include #include #include #include #include #include #include #define elif else if using namespace std; typedef long long lint; ///__Utility Functions__\\\ bool NumCheck(string a) { for(int i=0;i>n; return n; } string ValueOut(lint n) { ostringstream oss; oss<Assign(a); } else { getline(is,a); csize=ValueIn(a); int i;bool mark = 0; for(i=csize-1;i>=0;i--) { char k=is.get(); if(i==csize-1&&\ k=='-'&&mark==false) {sign = true;i++;mark=1;} else if(isdigit(k)) this->number[i]=k-48; else break; } if(i>=0) csize -= i; } } void Print(ostream& os = cout) /// Prints Data to a Specified Stream { if(typeid(os)==typeid(cout)) { cout<<"Your Number - "\ <=0;i--) cout<=0;i--) os<Scan(file); file.close(); } void Write(string path) /// Writes Data to a NUM File { fstream file; file.open((path+".num").\ c_str(),ios::out); this->Print(file); file.close(); } void Assign(string val) /// Assigns Value to BigInt as String { string b; b = val; b.erase(b.begin()); if(NumCheck(b)&&val[0]=='-') { csize = b.length(); for(int i=0;i=0;i--) { a+=char(number[i]+48); } return a; } void Random(lint Range) /// Randomly Generates BigInt { srand(time(nullptr)); csize=1+(rand()%(Range-1)); for(int i=0;i0) { csize+=no; for(int i=csize-no;i>=0;i--) { number[i+no]=number[i]; } for(int i=0;i=1;i--) { if(number[i]!=0) {csize=i+1;return;} } csize = 1; } /// - Operator Overloads BigInt& operator=(const BigInt& val) /// Pure Assignment Operator - Object { if(this==&val) return *this; else { csize = val.csize; sign = val.sign; for(int i=csize-1;i>=0;i--) number[i]=val.number[i]; return *this; } } void operator=(string a) /// Str to Number Assignment Operator { string b; b = a; b.erase(b.begin()); if(NumCheck(b)&&a[0]=='-') { csize = b.length(); for(int i=0;i(BigInt n2) /// Checks if a BigInt is > than Other { if(sign==false&&n2.sign==true) return true; else if(sign==true&&n2.sign==false) return false; else if(csizen2.csize&&sign==false) return true; else if(csizen2.csize&&sign==true) return false; else { if(sign == false) { for(int i=csize-1;i>=0;i--) { if(number[i]>n2.number[i]) return true; if(number[i]==n2.number[i]) continue; if(number[i]=0;i--) { if(number[i]>n2.number[i]) return false; if(number[i]==n2.number[i]) continue; if(number[i](string n2) /// Checks if a BigInt is > than Const { BigInt temp; temp.Assign(n2); return (*this)>temp; } bool operator>(long long n2) /// Checks if a BigInt is > than Const { return (*this)>BigInt(n2); } bool operator<(BigInt n2) /// Checks if a BigInt is < than Other { if(sign==true&&n2.sign==false) return true; else if(sign==false&&n2.sign==true) return false; else if(csize>n2.csize&&sign==false) return false; else if(csizen2.csize&&sign==true) return true; else if(csize=0;i--) { if(number[i]n2.number[i]) return false; } return false; } else { for(int i=csize-1;i>=0;i--) { if(number[i]n2.number[i]) return true; } return false; } } } bool operator<(string n2) /// Checks if a BigInt is < than Const { BigInt temp; temp.Assign(n2); return (*this)=(BigInt n2) /// Checks if a BigInt is >= than Other { if(*this==n2) return true; else return (*this)>n2; } bool operator>=(string n2) /// Checks if a BigInt is >= than Const { BigInt temp; temp.Assign(n2); return (*this)>=n2; } bool operator>=(long long n2) /// Checks if a BigInt is >= than Const { return (*this)>=BigInt(n2); } bool operator<=(BigInt n2) /// Checks if a BigInt is <= than Other { if(*this==n2) return true; else return (*this)0&&this->sign==0&&len(n2)<=csize) { res.csize=this->csize; lint carry = 0; for(lint i=0;icsize;i++) { lint sum = \ this->number[i]+(n2%10)+carry; res.number[i] = sum%10; carry=sum/10; n2/=10; } while(carry) { res.number[res.csize]=carry%10; res.csize++; carry/=10; } } elif(n2>0&&this->sign==0&&len(n2)>csize) { res.csize=len(n2); BigInt n2v(n2); res = n2v+(*this); } elif(n2<0&&this->sign==0&&len(n2)<=csize) { BigInt n1 = *this; lint dif = 0; n2 = abs(n2); res.csize=this->csize; if(csize == 1) { res.number[0] = \ abs(n1.number[0]-(n2%10)); if(n2>n1.number[0]) res.sign=1; else res.sign = false; return res; } for(lint i=0;icsize;i++) { if((n1.number[i]-(n2%10))>=0) dif = n1.number[i]-(n2%10); else if(n2%10 == 0&&isign==0&&len(n2)>csize) { res.csize = len(n2); BigInt n2v(n2); res = (*this)+n2v; } elif(n2>0&&this->sign==1&&len(n2)<=csize) { BigInt n1 = *this; res.csize = this->csize; lint dif = 0; res.csize=this->csize; if(csize == 1) { res.number[0] = \ abs(n1.number[0]-(n2%10)); if(n2>n1.number[0]) res.sign=0; else res.sign = true; return res; } for(lint i=0;icsize;i++) { if((n1.number[i]-(n2%10))>=0) dif = n1.number[i]-(n2%10); else if(n2%10 == 0&&i0&&this->sign==1&&len(n2)>csize) { res.csize = len(n2); BigInt n2v(n2); res = n2v + (*this); } elif(n2<0&&this->sign==1&&len(n2)<=csize) { n2 = abs(n2); res.csize=this->csize; lint carry = 0; for(lint i=0;icsize;i++) { lint sum = \ this->number[i]+(n2%10)+carry; res.number[i] = sum%10; carry=sum/10; n2/=10; } while(carry) { res.number[res.csize]=carry%10; res.csize++; carry/=10; } res.sign = true; } elif(n2<0&&this->sign==1&&len(n2)>csize) { n2 = abs(n2); BigInt temp = *this; temp.sign = false; res.csize=len(n2); BigInt n2v(n2); res = n2v+(temp); res.sign = true; } return res; } BigInt operator+(BigInt n2) /// Adds two BigInt Numbers { BigInt res; if(n2 == 0) return *this; if((*this).sign==n2.sign) { int carry = 0; if(n2.csize>=csize) res.csize=n2.csize,\ csize=n2.csize; else res.csize=csize,\ n2.csize=csize; for(int i=0;i=n2.csize&&n1.sign==0&&n2.sign==1) { res.sign = false; lint dif = 0; n2.Resize(); res.csize=n1.csize; for(lint i=0;i=0) dif = n1.number[i]-n2.number[i]; else if(n2.number[i]==0&& in1.number[0]) res.sign = true; else res.sign = false; return res; } for(lint i=0;i=0) dif = n2.number[i]-n1.number[i]; else if(n1.number[i]==0 && i=n2.csize&&n1.sign==1&&n2.sign==0) { res.sign = true; lint dif = 0; n2.Resize(); res.csize=n1.csize; for(lint i=0;i=0) dif = n1.number[i]-n2.number[i]; else if(n2.number[i]==0 && i=0) dif = n2.number[i]-n1.number[i]; else if(n1.number[i]==0 && icsize; for(lint i=0;icsize;i++) { lint prod = this->number[i]*n3 + carry; res.number[i]=prod%10; carry = prod/10; } while(carry) { res.number[res.csize]=carry%10; carry/=10; res.csize++; } if(sign==1&&n2<0) res.sign = 0; if(sign==0&&n2<0) res.sign = 1; if(sign==1&&n2>0) res.sign = 1; if(sign==0&&n2>0) res.sign = 0; return res; } BigInt operator*(BigInt n2) /// Multiplies two BigInt Numbers { BigInt res,temp; res.csize = csize; for(int i=0;i0) res.sign = 1; if(sign==0&&n2>0) res.sign = 0; res.csize=0; n2 = abs(n2); lint rem=0,divdi=0; int i=0; for(;inumber[csize-i-1]; if(i!=(len(n2)-1)) divdi*=10; } if(divdinumber[csize-i-1];i++;} res.number[res.csize] = divdi/n2; res.csize++; rem = ((divdi%n2)*10)+this->number[csize-i-1]; i++; for(;i<=this->csize;i++) { int quo = rem; res.number[res.csize] = floor(rem/n2); rem = ((rem%n2)*10)+this->number[csize-i-1]; res.csize++; } reverse(res.number,res.number+res.csize); res.Resize(); return res; } BigInt operator/(BigInt n2) /// Divides two BigInt Numbers { BigInt n1 = *this; if((*this)<=n2) return BigInt(0); BigInt res; if(sign==1&&n2<0) res.sign = 0; if(sign==0&&n2<0) res.sign = 1; if(sign==1&&n2>0) res.sign = 1; if(sign==0&&n2>0) res.sign = 0; res.csize=0; BigInt rem,divdi; int i=0; divdi = 0; for(;inumber[csize-i-1]; if(i!=(n2.csize-1)) divdi.PadZeroes(1); } if(divdinumber[csize-i-1];i++;} for(int k=1;k<=10;k++) { //cout<<"k="< divdi) { res.number[res.csize] = k-1; //cout<<"Q"<number[csize-i-1]; rem.Resize(); //cout<<"Remainder - "<csize;i++) { for(int k=1;k<=10;k++) { //cout<<"k="<"< rem)< rem) { res.number[res.csize] = k-1; //cout<<"Q"<number[csize-i-1]; rem.Resize(); //cout<<"Remainder - "<>\ (istream& is,BigInt& Val) /// Read BigInt Number from istream { string temp=""; getline(is,temp); Val.Assign(temp); return is; } friend ostream& operator<<\ (ostream& os,BigInt Num) /// Write BigInt Number to ostream { cout<<(Num.sign?"-":""); for(int i=Num.csize-1;i>=0;i--) os<>n1; cout<<"\nEnter Valid Operator ( +,-,*,/,%,^ ) -- \n\n"; op=cin.get(); cout<<"\nEnter 2nd Number ( Arbitrary Size ) -- \n\n"; cin.ignore(); cin>>n2; cout<<"\n\n"; cout<<"Result -- \n\n"; switch(op) { case '+': res = n1+n2; cout<>n; cout<>n; B.PadZeroes(n); cout<<"\nNew Size = "<>n1; cout<<"\nEnter Valid Operator ( +,-,*,/,%,^ ) -- \n\n"; op=cin.get(); cout<<"\nEnter 2nd Number ( Arbitrary Size ) -- \n\n"; cin.ignore(); cin>>n2; cout<<"\n\n"; cout<<"Result -- \n\n"; switch(op) { case '+': res = n1+n2; cout<

The BigInt Class - Beta