C++大数模板

其他 2018-05-18 15:22:39 阅读次数: 3 
#include<bits/stdc++.h>
using namespace std;
#define maxn 120
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(0);
const BigInteger BigInteger::ONE =BigInteger(1);
const BigInteger BigInteger::TEN =BigInteger(10);


BigInteger::BigInteger()
{
    sign=true;
}


BigInteger::BigInteger(int val) // construct with a int integer
{
    if (val >= 0)
        sign = true;
    else
    {
        sign = false;
        val *= (-1);
    }
    do
    {
        digits.push_back( (char)(val%10) );
        val /= 10;
    }
    while ( val != 0 );
}


BigInteger::BigInteger(string& def)
{
    sign=true;
    for ( string::reverse_iterator iter = def.rbegin() ; iter < def.rend();  iter++)
    {
        char ch = (*iter);
        if (iter == def.rend()-1)
        {
            if ( ch == '+' )
                break;
            if(ch == '-' )
            {
                sign = false;
                break;
            }
        }
        digits.push_back( (char)((*iter) - '0' ) );
    }
    trim();
}

void BigInteger::trim()
{
    vector<char>::reverse_iterator iter = digits.rbegin();
    while(!digits.empty() && (*iter) == 0)
    {
        digits.pop_back();
        iter=digits.rbegin();
    }
    if( digits.size()==0 )
    {
        sign = true;
        digits.push_back(0);
    }
}


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(1);
    for(int i=0; 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 = 0;        //½øλ
        while ( iter1 != op1.digits.end() && iter2 != op2.digits.end())
        {
            (*iter1) = (*iter1) + (*iter2) + to_add;
            to_add = ((*iter1) > 9);    // ´óÓÚ9½øһλ
            (*iter1) = (*iter1) % 10;
            iter1++;
            iter2++;
        }
        while ( iter1 != op1.digits.end() )    //
        {
            (*iter1) = (*iter1) + to_add;
            to_add = ( (*iter1) > 9 );
            (*iter1) %= 10;
            iter1++;
        }
        while ( iter2 != op2.digits.end() )
        {
            char val = (*iter2) + to_add;
            to_add = (val > 9) ;
            val %= 10;
            op1.digits.push_back(val);
            iter2++;
        }
        if( to_add != 0 )
            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 = 0;  //½èλ

        while ( iter1 != op1.digits.end() && iter2 != op2.digits.end())
        {
            (*iter1) = (*iter1) - (*iter2) - to_substract;
            to_substract = 0;
            if( (*iter1) < 0 )
            {
                to_substract=1;
                (*iter1) += 10;
            }
            iter1++;
            iter2++;
        }
        while ( iter1 != op1.digits.end() )
        {
            (*iter1) = (*iter1) - to_substract;
            to_substract = 0;
            if( (*iter1) < 0 )
            {
                to_substract=1;
                (*iter1) += 10;
            }
            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(0);
    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 != 0)
            {
                deque<char> temp(op1.digits.begin() , op1.digits.end());
                char to_add = 0;
                deque<char>::iterator iter1 = temp.begin();
                while( iter1 != temp.end() )
                {
                    (*iter1) *= (*iter2);
                    (*iter1) += to_add;
                    to_add = (*iter1) / 10;
                    (*iter1) %= 10;
                    iter1++;
                }
                if( to_add != 0)
                    temp.push_back( to_add );
                int num_of_zeros = iter2 - op2.digits.begin();
                while(  num_of_zeros--)
                    temp.push_front(0);
                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(0);
    while( iter != t1.digits.rend() )
    {
        temp2 = temp2 * BigInteger::TEN + BigInteger( (int)(*iter) );
        char s = 0;
        while( temp2 >= t2 )
        {
            temp2 = temp2 - t2;
            s = s + 1;
        }
        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) + '0');
    return stream;
}

istream& operator>>(istream& stream, BigInteger& val)
{
    //Input the BigInteger
    string str;
    stream >> str;
    val=BigInteger(str);
    return stream;
}

char s[150];
int num[150];
BigInteger fac[150];

BigInteger gcd(BigInteger a,BigInteger b)
{
	if(b==0) return a;
	return gcd(b,a%b);
}

int main()
{
	int n;
	fac[0]=1;
	for(int i=1;i<=100;i=i+1)
	fac[i]=fac[i-1]*i;
	scanf("%d%s",&n,s);
	for(int i=0;i<n;i++)
	num[s[i]-'A']=num[s[i]-'A']+1;
	BigInteger A=1;
    for(int i=0;i<26;i=i+1)
	{
		A*=fac[num[i]];
	}
	BigInteger B=fac[n];
	
	BigInteger g=gcd(A,B);
	
	cout<<A/g<<"/"<<B/g<<endl;
	
	return 0;
}

猜你喜欢

转载自blog.csdn.net/dllpxfire/article/details/80300567
今日推荐
火速冲上 GitHub 热榜 —— 开源编程语言、框架哪有这么可爱？
北京人形机器人创新中心发布全球首个纯电驱拟人奔跑的全尺寸人形机器人“天工”
LFOSSA 源来如此公开课 | 掌握云原生未来：CNCF 认证全面攻略与备考秘籍
国产云输入法——仅华为无云端数据上传安全问题
开源日报 | 工业开源项目OGG 1.0；姐姐，你要和我一起配置火狐吗；苹果AI遥遥落后？Fedora 40
开放签电子签章：停止新增，优化体验，前进更进（五一假期前工作）
周排行
Metasploit文件目录与入侵基本概念
跨域(CORS)请求问题[No 'Access-Control-Allow-Origin' header is present on the requested resource]常见解决方案
CodeIgniter 源码解读之 CodeIgniter.php（二）
SAS入门之（四）改变数据类型
初识元组
[数学建模]数学建模算法和模型（B站视频）（二）
Nginx 服务器源码安装配置流程
C#实现语音视频录制 【基于MCapture + MFile】
开发进度4
下载安装vue的方法网址
每日归档
更多
2024-04-28(0)
2024-04-27(56)
2024-04-26(39)
2024-04-25(22)
2024-04-24(36)
2024-04-23(26)
2024-04-22(39)
2024-04-21(0)
2024-04-20(6)
2024-04-19(5)

代码天地 © 2018 codetd.com

境外服务器   最新电视剧2022