C++大数操作Plus

博主近期完成了C++中大数的加减法实现,乘法也已成功,但除法还在挑战中,期待有经验者提供指导。
摘要由CSDN通过智能技术生成

按照上次的思路,最近又重新实现了加减法以及大数的乘法,除法的话,实现起来难度还有点大,有比较好的思路再来续写吧。

 

 

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<memory.h>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>

#define mem(array)  memset((array),0,sizeof((array)))
#define Qsort(array,len,cmp) qsort(array,len,sizeof(array[0]),cmp)

#define inf 0x7fffffff

#define BigLen 10000     // length of the big number's array is BigLen
#define BigCarry 1000   // carry of the big number's array is BigCarry

/***

Assumption bigNum is a big number,
then the bigNum[0] is the lowest order digit while bigNum[BigLen-2] is the highest order digit and bigNum[BigLen-1] is sign bit.
bigNum[BigLen-1] is -1 means bigNum is a negative number while bigNum[BigLen-1] is 1 means bigNum is a positive number or zero.

We could define big number like this:
int bigNum[BigLen];

PS:I'm so sorry for my poor English.

 */

using namespace std;


bool add(int *sum, int *bigNum, int num);
bool add(int *sum, int *bigNumA, int *bigNumB);
int compare(int *bigNum,int num);
int compare(int *bigNumA,int *bigNumB);
int getTopPos(int *bigNum);
bool input(int *bigNum, char *str);
bool isBigNum(int *bigNum);
bool multiply(int *product, int *bigNum, int num);
bool multiply(int *product, int *bigNumA, int *bigNumB);
bool output(int *bigNum);
bool subtract(int *sub, int *bigNum, int num);
bool subtract(int *sub, int *bigNumA, int *bigNumB);
bool transBig2Num(int *bigNum, int &num);
bool transNum2Big(int *bigNum, int num);



bool isBigNum(int *bigNum)
{
    /***
    return true if the bigNum is legal big number while return false if not
    */
    for(int i = 0; i < BigLen-1; ++i)
        if(bigNum[i] < 0 || bigNum[i] >= BigCarry)
        return false;

    if(bigNum[BigLen-1] != 1 && bigNum[BigLen-1] != -1)
        return false;
    return true;
}



bool input(int *bigNum, char *str)
{
    /***
    giving a integer string and a pointer of array which length equal to BigLen
    the integer string have to be made up of integer figure from 0 to 9 and character '-' which means negative number
    the function will return true if the string is legal while return false if not

    */
    int len = strlen(str);
    if(len > (BigLen-1)*log10(BigCarry))        // the input string is too long so that the bigNum cannot save this number
        return false;
    int start = (str[0] == '-') ? 1 : 0;
    bool isdigit = true;
    for(int i = start; i < len; ++i){
        if(str[i] < '0' || str[i] > '9'){
            isdigit = false;
            break;
        }
    }
    if(!isdigit)
        return false;   // the input string have some non numerical character except '-'
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值