C++ BigInteger 大整数类模板(转)
#include <deque>
#include <vector>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std; class DividedByZeroException {}; class BigInteger
{
private:
vector<char> digits;
bool sign; // true for positive, false for negitive
void trim(); // remove zeros in tail, but if the value is 0, keep only one:)
public:
BigInteger(int); // construct with a int integer
BigInteger(string&) ;
BigInteger();
BigInteger (const BigInteger&);
BigInteger operator=(const BigInteger& op2); BigInteger abs() const;
BigInteger pow(int a); //binary operators friend BigInteger operator+=(BigInteger&,const BigInteger&);
friend BigInteger operator-=(BigInteger&,const BigInteger&);
friend BigInteger operator*=(BigInteger&,const BigInteger&);
friend BigInteger operator/=(BigInteger&,const BigInteger&) throw(DividedByZeroException);
friend BigInteger operator%=(BigInteger&,const BigInteger&) throw(DividedByZeroException); friend BigInteger operator+(const BigInteger&,const BigInteger&);
friend BigInteger operator-(const BigInteger&,const BigInteger&);
friend BigInteger operator*(const BigInteger&,const BigInteger&);
friend BigInteger operator/(const BigInteger&,const BigInteger&) throw(DividedByZeroException);
friend BigInteger operator%(const BigInteger&,const BigInteger&) throw(DividedByZeroException); //uniary operators
friend BigInteger operator-(const BigInteger&); //negative friend BigInteger operator++(BigInteger&); //++v
friend BigInteger operator++(BigInteger&,int); //v++
friend BigInteger operator--(BigInteger&); //--v
friend BigInteger operator--(BigInteger&,int); //v-- friend bool operator>(const BigInteger&,const BigInteger&);
friend bool operator<(const BigInteger&,const BigInteger&);
friend bool operator==(const BigInteger&,const BigInteger&);
friend bool operator!=(const BigInteger&,const BigInteger&);
friend bool operator>=(const BigInteger&,const BigInteger&);
friend bool operator<=(const BigInteger&,const BigInteger&); friend ostream& operator<<(ostream&,const BigInteger&); //print the BigInteger
friend istream& operator>>(istream&, BigInteger&); // input the BigInteger public:
static const BigInteger ZERO;
static const BigInteger ONE;
static const BigInteger TEN;
};
// BigInteger.cpp const BigInteger BigInteger::ZERO=BigInteger();
const BigInteger BigInteger::ONE =BigInteger();
const BigInteger BigInteger::TEN =BigInteger(); BigInteger::BigInteger()
{
sign=true;
} BigInteger::BigInteger(int val){// construct with a int integer
if (val >= )
sign = true;
else{
sign = false;
val *= (-);
}
do{
digits.push_back( (char)(val%) );
val /= ;
} while ( val != );
} BigInteger::BigInteger(string& def){
sign=true;
for ( string::reverse_iterator iter = def.rbegin() ; iter < def.rend(); iter++){
char ch = (*iter);
if (iter == def.rend()-){
if ( ch == '+' )
break;
if(ch == '-' ){
sign = false;
break;
}
}
digits.push_back( (char)((*iter) - '' ) );
}
trim();
} void BigInteger::trim(){
vector<char>::reverse_iterator iter = digits.rbegin();
while(!digits.empty() && (*iter) == ){
digits.pop_back();
iter=digits.rbegin();
}
if( digits.size()== ){
sign = true;
digits.push_back();
}
} BigInteger::BigInteger(const BigInteger& op2){
sign = op2.sign;
digits=op2.digits;
} BigInteger BigInteger::operator=(const BigInteger& op2){
digits = op2.digits;
sign = op2.sign;
return (*this);
} BigInteger BigInteger::abs() const {
if(sign) return *this;
else return -(*this);
} BigInteger BigInteger::pow(int a)
{
BigInteger res();
for(int i=; i<a; i++)
res*=(*this);
return res;
} //binary operators
BigInteger operator+=(BigInteger& op1,const BigInteger& op2){
if( op1.sign == op2.sign ){ //只处理相同的符号的情况,异号的情况给-处理
vector<char>::iterator iter1;
vector<char>::const_iterator iter2;
iter1 = op1.digits.begin();
iter2 = op2.digits.begin();
char to_add = ; //进位
while ( iter1 != op1.digits.end() && iter2 != op2.digits.end()){
(*iter1) = (*iter1) + (*iter2) + to_add;
to_add = ((*iter1) > ); // 大于9进一位
(*iter1) = (*iter1) % ;
iter1++; iter2++;
}
while ( iter1 != op1.digits.end() ){ //
(*iter1) = (*iter1) + to_add;
to_add = ( (*iter1) > );
(*iter1) %= ;
iter1++;
}
while ( iter2 != op2.digits.end() ){
char val = (*iter2) + to_add;
to_add = (val > ) ;
val %= ;
op1.digits.push_back(val);
iter2++;
}
if( to_add != )
op1.digits.push_back(to_add);
return op1;
}
else{
if (op1.sign)
return op1 -= (-op2);
else
return op1= op2 - (-op1);
} } BigInteger operator-=(BigInteger& op1,const BigInteger& op2){
if( op1.sign == op2.sign ){ //只处理相同的符号的情况,异号的情况给+处理
if(op1.sign) {
if(op1 < op2) // 2 - 3
return op1=-(op2 - op1);
}
else {
if(-op1 > -op2) // (-3)-(-2) = -(3 - 2)
return op1=-((-op1)-(-op2));
else // (-2)-(-3) = 3 - 2
return op1= (-op2) - (-op1);
}
vector<char>::iterator iter1;
vector<char>::const_iterator iter2;
iter1 = op1.digits.begin();
iter2 = op2.digits.begin(); char to_substract = ; //借位 while ( iter1 != op1.digits.end() && iter2 != op2.digits.end()){
(*iter1) = (*iter1) - (*iter2) - to_substract;
to_substract = ;
if( (*iter1) < ){
to_substract=;
(*iter1) += ;
}
iter1++;
iter2++;
}
while ( iter1 != op1.digits.end() ){
(*iter1) = (*iter1) - to_substract;
to_substract = ;
if( (*iter1) < ){
to_substract=;
(*iter1) += ;
}
else break;
iter1++;
}
op1.trim();
return op1;
}
else{
if (op1 > BigInteger::ZERO)
return op1 += (-op2);
else
return op1 = -(op2 + (-op1));
}
}
BigInteger operator*=(BigInteger& op1,const BigInteger& op2){
BigInteger result();
if (op1 == BigInteger::ZERO || op2==BigInteger::ZERO)
result = BigInteger::ZERO;
else{
vector<char>::const_iterator iter2 = op2.digits.begin();
while( iter2 != op2.digits.end() ){
if(*iter2 != ){
deque<char> temp(op1.digits.begin() , op1.digits.end());
char to_add = ;
deque<char>::iterator iter1 = temp.begin();
while( iter1 != temp.end() ){
(*iter1) *= (*iter2);
(*iter1) += to_add;
to_add = (*iter1) / ;
(*iter1) %= ;
iter1++;
}
if( to_add != )
temp.push_back( to_add );
int num_of_zeros = iter2 - op2.digits.begin();
while( num_of_zeros--)
temp.push_front();
BigInteger temp2;
temp2.digits.insert( temp2.digits.end() , temp.begin() , temp.end() );
temp2.trim();
result = result + temp2;
}
iter2++;
}
result.sign = ( (op1.sign && op2.sign) || (!op1.sign && !op2.sign) );
}
op1 = result;
return op1;
} BigInteger operator/=(BigInteger& op1 , const BigInteger& op2 ) throw(DividedByZeroException) {
if( op2 == BigInteger::ZERO )
throw DividedByZeroException();
BigInteger t1 = op1.abs(), t2 = op2.abs();
if ( t1 < t2 ){
op1 = BigInteger::ZERO;
return op1;
}
//现在 t1 > t2 > 0
//只需将 t1/t2的结果交给result就可以了
deque<char> temp;
vector<char>::reverse_iterator iter = t1.digits.rbegin(); BigInteger temp2();
while( iter != t1.digits.rend() ){
temp2 = temp2 * BigInteger::TEN + BigInteger( (int)(*iter) );
char s = ;
while( temp2 >= t2 ){
temp2 = temp2 - t2;
s = s + ;
}
temp.push_front( s );
iter++;
}
op1.digits.clear();
op1.digits.insert( op1.digits.end() , temp.begin() , temp.end() );
op1.trim();
op1.sign = ( (op1.sign && op2.sign) || (!op1.sign && !op2.sign) );
return op1;
} BigInteger operator%=(BigInteger& op1,const BigInteger& op2) throw(DividedByZeroException) {
return op1 -= ((op1 / op2)*op2);
} BigInteger operator+(const BigInteger& op1,const BigInteger& op2){
BigInteger temp(op1);
temp += op2;
return temp;
}
BigInteger operator-(const BigInteger& op1,const BigInteger& op2){
BigInteger temp(op1);
temp -= op2;
return temp;
} BigInteger operator*(const BigInteger& op1,const BigInteger& op2){
BigInteger temp(op1);
temp *= op2;
return temp; } BigInteger operator/(const BigInteger& op1,const BigInteger& op2) throw(DividedByZeroException) {
BigInteger temp(op1);
temp /= op2;
return temp;
} BigInteger operator%(const BigInteger& op1,const BigInteger& op2) throw(DividedByZeroException) {
BigInteger temp(op1);
temp %= op2;
return temp;
} //uniary operators
BigInteger operator-(const BigInteger& op){ //negative
BigInteger temp = BigInteger(op);
temp.sign = !temp.sign;
return temp;
} BigInteger operator++(BigInteger& op){ //++v
op += BigInteger::ONE;
return op;
} BigInteger operator++(BigInteger& op,int x){ //v++
BigInteger temp(op);
++op;
return temp;
} BigInteger operator--(BigInteger& op){ //--v
op -= BigInteger::ONE;
return op;
} BigInteger operator--(BigInteger& op,int x){ //v--
BigInteger temp(op);
--op;
return temp;
} bool operator<(const BigInteger& op1,const BigInteger& op2){
if( op1.sign != op2.sign )
return !op1.sign;
else{
if(op1.digits.size() != op2.digits.size())
return (op1.sign && op1.digits.size()<op2.digits.size())
|| (!op1.sign && op1.digits.size()>op2.digits.size());
vector<char>::const_reverse_iterator iter1,iter2;
iter1 = op1.digits.rbegin();iter2 = op2.digits.rbegin();
while( iter1 != op1.digits.rend() ){
if( op1.sign && *iter1 < *iter2 ) return true;
if( op1.sign && *iter1 > *iter2 ) return false;
if( !op1.sign && *iter1 > *iter2 ) return true;
if( !op1.sign && *iter1 < *iter2 ) return false;
iter1++;
iter2++;
}
return false;
}
}
bool operator==(const BigInteger& op1,const BigInteger& op2){
if( op1.sign != op2.sign || op1.digits.size() != op2.digits.size() )
return false;
vector<char>::const_iterator iter1,iter2;
iter1 = op1.digits.begin();
iter2 = op2.digits.begin();
while( iter1!= op1.digits.end() ){
if( *iter1 != *iter2 ) return false;
iter1++;
iter2++;
}
return true;
} bool operator!=(const BigInteger& op1,const BigInteger& op2){
return !(op1==op2);
} bool operator>=(const BigInteger& op1,const BigInteger& op2){
return (op1>op2) || (op1==op2);
} bool operator<=(const BigInteger& op1,const BigInteger& op2){
return (op1<op2) || (op1==op2);
} bool operator>(const BigInteger& op1,const BigInteger& op2){
return !(op1<=op2);
} ostream& operator<<(ostream& stream,const BigInteger& val){ //print the BigInteger
if (!val.sign)
stream << "-";
for ( vector<char>::const_reverse_iterator iter = val.digits.rbegin(); iter != val.digits.rend() ; iter++)
stream << (char)((*iter) + '');
return stream;
} istream& operator>>(istream& stream, BigInteger& val){ //Input the BigInteger
string str;
stream >> str;
val=BigInteger(str);
return stream;
} //////////////////////////////////////////////////////////// int main()
{
int n;
cin>>n;
for(int i=; i<n; i++) {
BigInteger A;
BigInteger B;
BigInteger C=;
cin>>A>>B;
cout<<"A-B:"<<A-B<<endl;
cout<<"A+B:"<<A+B<<endl;
cout<<"A*B:"<<A*B<<endl;
cout<<"A/B:"<<A/B<<endl;
cout<<"A%B:"<<A%B<<endl;
cout<<"A.pow(5)"<<A.pow()<<endl;
A++;
cout<<"A++:"<<A<<endl;
A--;
cout<<"A--:"<<A<<endl;
cout<<"++B:"<<++B<<endl;
cout<<"--B:"<<--B<<endl;
cout<<"C:"<<C<<endl;
}
return ;
}
C++ BigInteger 大整数类模板(转)的更多相关文章
- C++大整数类模板
参考 :http://172.21.85.56/oj/resource/reportdetail?report_id=1678 支持 =.abs().pow().+=.-= *=./=.%=.+.-. ...
- C# 基于大整数类的RSA算法实现(公钥加密私钥解密,私钥加密公钥解密)
但是C#自带的RSA算法类RSACryptoServiceProvider只支持公钥加密私钥解密,即数字证书的使用. 所以参考了一些网上的资料写了一个RSA的算法实现.算法实现是基于网上提供的一个大整 ...
- N!的阶乘附带简单大整数类的输入输出(暂时没有深入的了解)
Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N! 我的思路:就想着大整数类去了,才发现自己还不能很好的掌握,其实这是一个大 ...
- Pollard-Rho大整数拆分模板
随机拆分,简直机智. 关于过程可以看http://wenku.baidu.com/link?url=JPlP8watmyGVDdjgiLpcytC0lazh4Leg3s53WIx1_Pp_Y6DJTC ...
- C++高精度计算(大整数类)
Java和Pathon可以不用往下看了 C++的基本数据类型中,范围最大的数据类型不同编译器不同,但是最大的整数范围只有[-2^63-2^63-1](对应8个字节所对应的二进制数大小).但是对于某些需 ...
- 大整数类BIGN的设计与实现 C++高精度模板
首先感谢刘汝佳所著的<算法竞赛入门经典>. 众所周知,C++中储存能力最大的unsigned long long 也是有着一个上限,如果我们想计算非常大的整数时,就不知所措了,所以,我写了 ...
- 用Java的大整数类BigInteger来实现大整数的一些运算
关于BigInteger的构造函数,一般会用到两个: BigInteger(String val); //将指定字符串转换为十进制表示形式: BigInteger(String val,int rad ...
- Random随机类(11选5彩票)BigInteger大数据类(华为面试题1000的阶乘)
先上Java Web图 为了简化叙述,只写Java代码,然后控制台输出 使用[Random类]取得随机数 import java.util.Random; public class Fir { pub ...
- java 常用类库:BigInteger大整数;BigDecimal大小数(解决double精度损失);
大整数BigInteger package com.zmd.common_class_libraries; import java.math.BigInteger; /** * @ClassName ...
随机推荐
- Codeforces 437B The Child and Set
题目链接:Codeforces 437B The Child and Set 開始是想到了这样的情况,比方lowbit之后从大到小排序后有这么几个数,200.100,60.50.S = 210.那先选 ...
- spring mvc DispatcherServlet详解之前传---前端控制器架构
前端控制器是整个MVC框架中最为核心的一块,它主要用来拦截符合要求的外部请求,并把请求分发到不同的控制器去处理,根据控制器处理后的结果,生成相应的响应发送到客户端.前端控制器既可以使用Filter实现 ...
- Java多态性举例说明
Java多态性的概念也可以被说成“一个接口,多个方法”. (一)相关类 class A ...{ public String show(D obj)...{ return ("A and D ...
- log4j 日志的初始化
log4j 不指定时,log4j 会默认进行初始化,如果想要制定log4j.properties的位置时,可以进行指定: PropertyConfigurator.configure(): 参数里面加 ...
- AC自动机学习笔记
AC自动机 ----多个模板的字符串匹配 字典树Trie加上失配边构成 插入操作:ac.insert(p[i],i);构造失配函数:ac.getFail();计算文本串T中每个模板串的匹配数:ac.f ...
- Bernese安装及使用
一.安装: 伯尔尼软件的安装很简单,但是在64位下,可能perl解释器安装不成功,我找了一个,并且可用,下载地址: 链接:http://pan.baidu.com/s/1hr8fgEC 密码:fj8b ...
- tableView Crash
转自:http://blog.csdn.net/hamasn/article/details/8613593 Assertion failure in -[UITableView _configure ...
- 关于T-SQL重编译那点事,内联函数和表值函数在编译生成执行计划的区别
本文出处:http://www.cnblogs.com/wy123/p/6266724.html 最近在学习 WITH RECOMPILE和OPTION(RECOMPILE)在重编译上的区别的时候,无 ...
- XmlHttp对象
我是这样理解XmlHttp对象的:xml是一种文档类型Http可以把它看做是浏览器XmlHttp:可以解释为把xml的内容读到浏览器上(网页上),把这句话封装一下,见下XmlHttp是浏览器对象,起的 ...
- [Python笔记]第九篇:re正则表达式
一.正则表达式基础 1.正则表达式介绍 正则表达式并不是Python的一部分.正则表达式是用于处理字符串的强大工具,拥有自己独特的语法以及一个独立的处理引擎,效率上可能不如str自带的方法,但功能十分 ...