高精度模版:
稍加整合
#define MAXN 9999
#define MAXSIZE 10
#define DLEN 4
class BigNum {
private:
int a[(int)1e4+2000]; //可以控制大数的位数
int len; //大数长度
public:
BigNum() {
len = 1;
memset(a, 0, sizeof(a));
} //构造函数
BigNum(const int); //将一个int类型的变量转化为大数
BigNum(const char *); //将一个字符串类型的变量转化为大数
BigNum(const BigNum &); //拷贝构造函数
BigNum &operator=(const BigNum &); //重载赋值运算符,大数之间进行赋值运算
friend istream &operator>>(istream &, BigNum &); //重载输入运算符
friend ostream &operator<<(ostream &, BigNum &); //重载输出运算符
BigNum operator+(const BigNum &) const; //重载加法运算符,两个大数之间的相加运算
BigNum operator-(const BigNum &) const; //重载减法运算符,两个大数之间的相减运算
BigNum operator*(const BigNum &) const; //重载乘法运算符,两个大数之间的相乘运算
BigNum operator/(const int &) const; //重载除法运算符,大数对一个整数进行相除运算
BigNum operator^(const int &) const; //大数的n次方运算
int operator%(const int &) const; //大数对一个int类型的变量进行取模运算
bool operator>(const BigNum &T) const; //大数和另一个大数的大小比较
bool operator>(const int &t) const; //大数和一个int类型的变量的大小比较
void print(); //输出大数
};
BigNum::BigNum(const int b) //将一个int类型的变量转化为大数
{
int c, d = b;
len = 0;
memset(a, 0, sizeof(a));
while (d > MAXN) {
c = d - (d / (MAXN + 1)) * (MAXN + 1);
d = d / (MAXN + 1);
a[len++] = c;
}
a[len++] = d;
}
BigNum::BigNum(const char *s) //将一个字符串类型的变量转化为大数
{
int t, k, index, l, i;
memset(a, 0, sizeof(a));
l = strlen(s);
len = l / DLEN;
if (l % DLEN)
len++;
index = 0;
for (i = l - 1; i >= 0; i -= DLEN) {
t = 0;
k = i - DLEN + 1;
if (k < 0)
k = 0;
for (int j = k; j <= i; j++)
t = t * 10 + s[j] - '0';
a[index++] = t;
}
}
BigNum::BigNum(const BigNum &T) : len(T.len) //拷贝构造函数
{
int i;
memset(a, 0, sizeof(a));
for (i = 0; i < len; i++)
a[i] = T.a[i];
}
BigNum &BigNum::operator=(const BigNum &n) //重载赋值运算符,大数之间进行赋值运算
{
int i;
len = n.len;
memset(a, 0, sizeof(a));
for (i = 0; i < len; i++)
a[i] = n.a[i];
return *this;
}
istream &operator>>(istream &in, BigNum &b) //重载输入运算符
{
char ch[MAXSIZE * 4];
int i = -1;
in >> ch;
int l = strlen(ch);
int count = 0, sum = 0;
for (i = l - 1; i >= 0;) {
sum = 0;
int t = 1;
for (int j = 0; j < 4 && i >= 0; j++, i--, t *= 10) {
sum += (ch[i] - '0') * t;
}
b.a[count] = sum;
count++;
}
b.len = count++;
return in;
}
ostream &operator<<(ostream &out, BigNum &b) //重载输出运算符
{
int i;
cout << b.a[b.len - 1];
for (i = b.len - 2; i >= 0; i--) {
cout.width(DLEN);
cout.fill('0');
cout << b.a[i];
}
return out;
}
BigNum BigNum::operator+(const BigNum &T) const //两个大数之间的相加运算
{
BigNum t(*this);
int i, big; //位数
big = T.len > len ? T.len : len;
for (i = 0; i < big; i++) {
t.a[i] += T.a[i];
if (t.a[i] > MAXN) {
t.a[i + 1]++;
t.a[i] -= MAXN + 1;
}
}
if (t.a[big] != 0)
t.len = big + 1;
else
t.len = big;
return t;
}
BigNum BigNum::operator-(const BigNum &T) const //两个大数之间的相减运算
{
int i, j, big;
bool flag;
BigNum t1, t2;
if (*this > T) {
t1 = *this;
t2 = T;
flag = 0;
} else {
t1 = T;
t2 = *this;
flag = 1;
}
big = t1.len;
for (i = 0; i < big; i++) {
if (t1.a[i] < t2.a[i]) {
j = i + 1;
while (t1.a[j] == 0)
j++;
t1.a[j--]--;
while (j > i)
t1.a[j--] += MAXN;
t1.a[i] += MAXN + 1 - t2.a[i];
} else
t1.a[i] -= t2.a[i];
}
t1.len = big;
while (t1.a[t1.len - 1] == 0 && t1.len > 1) {
t1.len--;
big--;
}
if (flag)
t1.a[big - 1] = 0 - t1.a[big - 1];
return t1;
}
BigNum BigNum::operator*(const BigNum &T) const //两个大数之间的相乘运算
{
BigNum ret;
int i, j, up;
int temp, temp1;
for (i = 0; i < len; i++) {
up = 0;
for (j = 0; j < T.len; j++) {
temp = a[i] * T.a[j] + ret.a[i + j] + up;
if (temp > MAXN) {
temp1 = temp - temp / (MAXN + 1) * (MAXN + 1);
up = temp / (MAXN + 1);
ret.a[i + j] = temp1;
} else {
up = 0;
ret.a[i + j] = temp;
}
}
if (up != 0)
ret.a[i + j] = up;
}
ret.len = i + j;
while (ret.a[ret.len - 1] == 0 && ret.len > 1)
ret.len--;
return ret;
}
BigNum BigNum::operator/(const int &b) const //大数对一个整数进行相除运算
{
BigNum ret;
int i, down = 0;
for (i = len - 1; i >= 0; i--) {
ret.a[i] = (a[i] + down * (MAXN + 1)) / b;
down = a[i] + down * (MAXN + 1) - ret.a[i] * b;
}
ret.len = len;
while (ret.a[ret.len - 1] == 0 && ret.len > 1)
ret.len--;
return ret;
}
int BigNum::operator%(const int &b) const //大数对一个int类型的变量进行取模运算
{
int i, d = 0;
for (i = len - 1; i >= 0; i--) {
d = ((d * (MAXN + 1)) % b + a[i]) % b;
}
return d;
}
BigNum BigNum::operator^(const int &n) const //大数的n次方运算
{
BigNum t, ret(1);
int i;
if (n < 0)
exit(-1);
if (n == 0)
return 1;
if (n == 1)
return *this;
int m = n;
while (m > 1) {
t = *this;
for (i = 1; i << 1 <= m; i <<= 1) {
t = t * t;
}
m -= i;
ret = ret * t;
if (m == 1)
ret = ret * (*this);
}
return ret;
}
bool BigNum::operator>(const BigNum &T) const //大数和另一个大数的大小比较
{
int ln;
if (len > T.len)
return true;
else if (len == T.len) {
ln = len - 1;
while (a[ln] == T.a[ln] && ln >= 0)
ln--;
if (ln >= 0 && a[ln] > T.a[ln])
return true;
else
return false;
} else
return false;
}
bool BigNum::operator>(const int &t) const //大数和一个int类型的变量的大小比较
{
BigNum b(t);
return *this > b;
}
void BigNum::print() //输出大数
{
int i;
cout << a[len - 1];
for (i = len - 2; i >= 0; i--) {
cout.width(DLEN);
cout.fill('0');
cout << a[i];
}
//cout << endl;
}
//这个除1可能会有问题
//此模板解决位数不大的题可以,位数很多为tle
#include<cstdio>
#include<algorithm>
#include<vector>
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
const int MAXW = 2007;
struct BigNum{///数值保存从0位开始
int num[MAXW];///数值,逆序保存
int op;///表示符号位,1表示正数,-1表示负数
int size;///数的位数
BigNum(){
size=1, op=1;
memset(num, false, sizeof(num));
}
void Cin(){
char s[N];
scanf("%s", s);
size = strlen(s);
for(int i=0,k=size-1;i<size;++i){
if(s[i]=='-'){
k--;
op = -1;
}else{
num[k--] = s[i] - '0';
}
}
if(op == -1){
size--;
}
}
void GetText(int n){
size = log10(n)+1;
for(int i=0; i<size;++i){
num[i] = n % 10;
n /= 10;
}
}
bool operator <= (const BigNum &b)const{///去符号比较大小
if(size > b.size)return false;
if(size < b.size)return true;
for(int i=size-1; i>=0;--i){
if(num[i] > b.num[i])return false;
if(num[i] < b.num[i])return true;
}
return true;
}
void operator = (const BigNum &b){
size = b.size, op=b.op;
for(int i=0; i<b.size; i++){
num[i] = b.num[i];
}
}
void operator = (const int &b){
int x = b;
op=1;
if(x < 0){
op = -1;
x = -x;
}
size = 0;
do{
num[size++] = x % 10;
x /= 10;
}while(x);
}
BigNum operator * (const BigNum &b)const{
BigNum res;
res.op = b.op * op;
res.size = size + b.size - 1;
for(int i=0; i<b.size; i++){
for(int j=0; j<size; j++){
res.num[i+j] += num[j] * b.num[i];
}
}
res.CarryBit();
return res;
}
BigNum operator * (const int &b)const{
int x = b;
BigNum res;
res.size = size;
if(x < 0){
res.op = res.op * -1;
x = -x;
}
for(int i=0; i<size; i++){
res.num[i] = num[i] * x;
}
res.CarryBit();
return res;
}
friend BigNum operator + (BigNum a, BigNum b){
BigNum res;
if(a.op != b.op){
res = a - b;
b.op = b.op * -1;
}else{
res.op = a.op;
res.size = max(a.size, b.size);
for(int i=0; i<res.size; i++){
res.num[i] = a.num[i] + b.num[i];
}
res.CarryBit();
}
return res;
}
friend BigNum operator + (BigNum a, int b){
BigNum res;
res = b;
res = res + a;
return res;
}
friend BigNum operator - (BigNum a, BigNum b){///b值小,先比较在进行相减
BigNum res;
b.op = b.op * -1;
if(a.op == b.op){
res = a + b;
}else{
if(a <= b)swap(a,b);
res.size = a.size;
res.op = a.op;
for(int i=0; i<res.size; i++){
if(i < b.size){
res.num[i] = a.num[i] - b.num[i];
}else{
res.num[i] = a.num[i];
}
}
res.BorrowBit();
}
return res;
}
friend BigNum operator - (BigNum a, int b){
BigNum res;
res = b;
res = a - res;
return res;
}
friend BigNum operator / (BigNum a, int b){
BigNum tmp = a;
int r=0;
for(int i=tmp.size-1;i>=0;--i){
r=r*10+a.num[i];
if(r<b)tmp.num[i]=0;
else{
tmp.num[i]=r/b;
r%=b;
}
}
while(tmp.size>=2&&!tmp.num[tmp.size-1]){
tmp.size--;
}
return tmp;
}
friend BigNum operator / (BigNum a, BigNum b){
BigNum c,f;
c=0,f=0;
for(int i=a.size-1;i>=0;--i){
f=f*10;
f.num[0]=a.num[i];
while(b<=f){
f=f-b;
c.num[i]++;
}
}
c.size=a.size;
while(c.size>=2&&!c.num[c.size-1]){
c.size--;
}
return c;
}
friend BigNum operator ^(const BigNum &_a, const int &_m){
BigNum result, a=_a;
result.num[0] = 1;
int m = _m;
while(m){
if(m & 1){
result = result * a;
}
a = a * a;
m >>= 1;
}
return result;
}
BigNum operator <<(const int &k)const{
BigNum tmp;
for(int i=size-1; i>=0; i--){
tmp.num[i+k] = num[i];
}
tmp.size = size + k;
tmp.CarryBit();
return tmp;
}
void CarryBit(){///进位,注意减法的时候进位结果需要是非负数
for(int i=0; i<size; i++){
if(num[i] >= 10){
if(i+1==size){
num[i+1] = 0;
size += 1;
}
num[i+1] += num[i]/10;
num[i] %= 10;
}
}
while(size > 1 && !num[size-1]){
size--;
}
if(size == 1 && !num[0]){
op = 1;
}
}
void BorrowBit(){
for(int i=0; i<size; i++){
if(num[i] < 0){
num[i] += 10;
num[i+1] -= 1;
}
}
while(size > 1 && !num[size-1]){
size--;
}
if(size == 1 && !num[0]){
op = 1;
}
}
void Out(){
if(op == -1)
printf("-");
for(int i=size-1; i>=0; i--)
printf("%d", num[i]);
printf("\n");
}
};
int Find(const BigNum &a, BigNum &Mod){
int i;
BigNum t;
for(i=1; i<=9; i++){
t = (((a*2)<<1)+i) * i;
if(t <= Mod){
continue;
}
break;
}
i--;
t = (((a*2)<<1)+i) * i;
Mod = Mod - t;
return i;
}
BigNum Sqrt(const BigNum &a){
BigNum ans, Mod;
int len=a.size-1;
if(a.size % 2 == 0){
Mod = Mod + (a.num[len]*10+a.num[len-1]);
len -= 2;
}else{
Mod = Mod + a.num[len];
len -= 1;
}
ans = Find(ans, Mod);
while(len > 0){
Mod = (Mod<<2) + (a.num[len]*10+a.num[len-1]);
ans = (ans<<1) + Find(ans, Mod);
len -= 2;
}
return ans;
//Very simple problem - SGU 111(大数开方)
}
BigNum divide1(BigNum a,int b,int &r){
BigNum tmp = a;
for(int i=tmp.size-1;i>=0;--i){
r=r*10+a.num[i];
if(r<b)tmp.num[i]=0;
else{
tmp.num[i]=r/b;
r%=b;
}
}
while(tmp.size>=2&&!tmp.num[tmp.size-1]){
tmp.size--;
}
return tmp;
}
int main(){
BigNum a, b;
a.Cin();
b.Cin();
a = a * b;
a.Out();
a = Sqrt(a);
a.Out();
int c=0;
a = divide1(a,2,c);
a.Out();
a = a*10;
a.Out();
a=a/10;
a.Out();
b = 5;
a=a/b;
a.Out();
a=a-1;
a.Out();
a=a-1;
a.Out();
return 0;
}
日天板子
const int MAXL = 6e3 + 5;
const int MAXW = 9999;
const int DLEN = 4;
class Big {
public:
int a[MAXL], len;
Big(const int b = 0) {
int c, d = b;
len = 0;
memset(a, 0, sizeof(a));
while(d > MAXW) {
c = d - (d / (MAXW + 1)) * (MAXW + 1);
d = d / (MAXW + 1);
a[len++] = c;
}
a[len++] = d;
}
Big(const char *s) {
int t, k, index = 0, L = strlen(s);
memset(a, 0, sizeof(a));
len = L / DLEN;
if(L % DLEN) len++;
for(int i = L - 1; i >= 0; i -= DLEN) {
t = 0;
k = i - DLEN + 1;
if(k < 0) k = 0;
for(int j = k; j <= i; j++) t = t * 10 + s[j] - '0';
a[index++] = t;
}
}
Big operator/(const LL &b)const {
Big ret;
LL down = 0;
for(int i = len - 1; i >= 0; i--) {
ret.a[i] = (a[i] + down * (MAXW + 1)) / b;
down = a[i] + down * (MAXW + 1) - ret.a[i] * b;
}
ret.len = len;
while(ret.a[ret.len - 1] == 0 && ret.len > 1) ret.len--;
return ret;
}
bool operator>(const Big &T)const {
int ln;
if(len > T.len) return true;
else if(len == T.len) {
ln = len - 1;
while(a[ln] == T.a[ln] && ln >= 0) ln--;
if(ln >= 0 && a[ln] > T.a[ln]) return true;
else return false;
} else return false;
}
Big operator+(const Big &T)const {
Big t(*this);
int big = T.len > len ? T.len : len;
for(int i = 0; i < big; i++) {
t.a[i] += T.a[i];
if(t.a[i] > MAXW) {
t.a[i + 1]++;
t.a[i] -= MAXW + 1;
}
}
t.len = t.a[big] ? big + 1 : big;
return t;
}
Big operator-(const Big &T)const {
bool flag;
Big t1, t2;
if(*this > T) t1 = *this, t2 = T, flag = 0;
else t1 = T, t2 = *this, flag = 1;
int big = t1.len;
for(int i = 0, j; i < big; i++) {
if(t1.a[i] < t2.a[i]) {
j = i + 1;
while(t1.a[j] == 0) j++;
t1.a[j--]--;
while(j > i) t1.a[j--] += MAXW;
t1.a[i] += MAXW + 1 - t2.a[i];
} else t1.a[i] -= t2.a[i];
}
t1.len = big;
while(t1.a[t1.len - 1] == 0 && t1.len > 1) t1.len--, big--;
if(flag) t1.a[big - 1] = 0 - t1.a[big - 1];
return t1;
}
LL operator%(const LL &b)const {
LL d = 0;
for(int i = len - 1; i >= 0; i--) d = ((d * (MAXW + 1)) % b + a[i]) % b;
return d;
}
Big operator*(const Big &T) const {
Big ret;
int i, j, up, temp, temp1;
for(i = 0; i < len; i++) {
up = 0;
for(j = 0; j < T.len; j++) {
temp = a[i] * T.a[j] + ret.a[i + j] + up;
if(temp > MAXW) {
temp1 = temp - temp / (MAXW + 1) * (MAXW + 1);
up = temp / (MAXW + 1);
ret.a[i + j] = temp1;
} else {
up = 0;
ret.a[i + j] = temp;
}
}
if(up != 0) ret.a[i + j] = up;
}
ret.len = i + j;
while(ret.a[ret.len - 1] == 0 && ret.len > 1) ret.len--;
return ret;
}
void print() {
printf("%d", a[len - 1]);
for(int i = len - 2; i >= 0; i--) printf("%04d", a[i]);
}
};