高精度数处理代码,C代码库,德仔网

代码语言
代码分类
【C】高精度数处理
作者: / 发布于2014/5/22/ 421

	// project name: rsa
	// file name:LargeInt.h
	// author: ism
	// date: 2012 - 5 - 1

	#include <iostream>
	using namespace std;

	#define LENGTH 1000

	class LargeInt
	{
	public:
	 // data section
	 int a[LENGTH];
	 int top;
	 // reload operations
	 friend LargeInt operator + ( LargeInt m, LargeInt n );
	 friend LargeInt operator - ( LargeInt m, LargeInt n );
	 friend LargeInt operator * ( LargeInt m, LargeInt n );
	 friend LargeInt operator / ( LargeInt m, LargeInt n );
	 //friend LargeInt operator = ( LargeInt m );
	 friend bool operator >= ( LargeInt m, LargeInt n );
	 friend ostream& operator << (ostream& os, LargeInt m);
	 //constructe functions
	 LargeInt();

	 //other functions
	 void doEmpty();
	 void setValue(string s);
	 void manageIt();
	 //void print();
	 int getTop();
	};
	////////////////////////////////////////////////////////////////////// !done
	void LargeInt::doEmpty()
	{
	 for(int i = 0; i < LENGTH; i++)
	 {
	 a[i] = 0;
	 }
	}
	////////////////////////////////////////////////////////////////////// !done
	bool operator >= ( LargeInt m, LargeInt n )
	{
	 int current = LENGTH -1 ;
	 while( current >= 0 && m.a[current] == n.a[current] )
	 {
	 current--;
	 }

	 if( current == -1)
	 {
	 return true;
	 }
	 else if( m.a[current] > n.a[current] )
	 {
	 return true;
	 }
	 else
	 {
	 return false;
	 }

	}
	////////////////////////////////////////////////////////////////////// !done
	void LargeInt::manageIt()
	{
	 for(int i = 0; i < LENGTH-1 ; i++)
	 {
	 if( a[i] >= 0 ){
	 a[i+1] += a[i] / 10;
	 a[i] %= 10;
	 }
	 else
	 {
	 a[i+1] -= 1;
	 a[i] += 10;
	 }
	 }
	}
	////////////////////////////////////////////////////////////////////// !done
	LargeInt::LargeInt()
	{
	 top = -1;
	 for(int i = 0; i < LENGTH; i++)
	 {
	 a[i] = 0;
	 }
	}

	////////////////////////////////////////////////////////////////////// !done
	LargeInt operator + (LargeInt m, LargeInt n)
	{
	 LargeInt result;

	 for(int i = 0; i < LENGTH; i++)
	 {
	 result.a[i] = m.a[i] + n.a[i];
	 }

	 result.manageIt();
	 return result;
	}
	////////////////////////////////////////////////////////////////////// !done
	LargeInt operator - (LargeInt m, LargeInt n)
	{
	 LargeInt result;

	 for(int i = 0; i < LENGTH; i++)
	 {
	 result.a[i] = m.a[i] - n.a[i];
	 }

	 result.manageIt();
	 return result;
	}
	////////////////////////////////////////////////////////////////////// !done
	LargeInt operator * (LargeInt m, LargeInt n)
	{
	 // need an error for computing the multiply operation for over flow
	 int m_top = m.getTop();
	 int n_top = n.getTop();

	 LargeInt result;
	 for(int i = 0; i <= n_top; i++)
	 {
	 for(int j = 0; j <= m_top; j++)
	 {
	 result.a[i+j] += n.a[i] * m.a[j];
	 }
	 result.manageIt();
	 }

	 return result;
	}
	//////////////////////////////////////////////////////////////////////
	LargeInt operator / (LargeInt m, LargeInt n)
	{

	}
	////////////////////////////////////////////////////////////////////// !done
	void LargeInt::setValue(string s)
	{
	 doEmpty();
	 int _s_length = s.size();
	 for(int i = 0; i < _s_length; i++)
	 {
	 a[i] = s[ _s_length - i - 1 ] - 48;
	 }
	}

	////////////////////////////////////////////////////////////////////// ! done
	ostream& operator << (ostream& os, LargeInt m)
	{
	 int _m_top= m.getTop();
	 if( _m_top < 0 )
	 {
	 _m_top = 0;
	 }
	 for(int i = _m_top; i >= 0; i--)
	 {
	 os << m.a[i];
	 }
	 return os;
	}

	////////////////////////////////////////////////////////////////////// !done
	int LargeInt::getTop()
	{
	 int top = LENGTH - 1;
	 while(a[top] == 0)
	 {
	 top--;
	 }
	 return top;
	}
	//////////////////////////////////////////////////////////////////////

	//end
	//ism
试试其它关键字
　高精度数　
同语言下
可能有用的
贡献的其它代码Label