[acm 1001] c++ 大数加法 乘法 幂
北大的ACM 1001
代码纯手动编写 - -
#include <iostream>
#include <cstdio>
#include <cstring> class BigNumber
{
struct BigNumberNode
{
BigNumberNode():n(0), prev(NULL), next(NULL){}
BigNumberNode(int N):n(N), prev(NULL), next(NULL){} int n;
BigNumberNode *prev, *next;
}; BigNumberNode *head, *tail;
int dot_before; // 小数点之前的数量
int dot_later; // 小数点之后的数量 void InsertNodeAtBegin(int n)
{
BigNumberNode *new_node = new BigNumberNode(n);
if(head != NULL)
{
head->prev = new_node;
new_node->prev = NULL;
new_node->next = head;
head = new_node;
}
else
{
head = new_node;
tail = new_node;
new_node->prev = NULL;
new_node->next = NULL;
}
} void InsetNodeAtEnd(int n)
{
BigNumberNode *new_node = new BigNumberNode(n);
if(head != NULL)
{
new_node->prev = tail;
new_node->next = NULL;
tail->next = new_node;
tail = new_node;
}
else
{
head = new_node;
tail = new_node;
new_node->prev = NULL;
new_node->next = NULL;
}
} void DeleteBegin()
{
if(head != NULL)
{
if (head->next != NULL)
{
BigNumberNode* temp = head->next;
delete head;
head = temp;
temp->prev = NULL; if (dot_before != 0)
{
dot_before--;
}
else
{
dot_later--;
}
}
else
{
Free();
}
}
} void DeleteEnd()
{
if(tail != NULL)
{
if (tail->prev != NULL)
{
BigNumberNode* temp = tail->prev;
delete tail;
tail = temp;
temp->next = NULL; if (dot_later != 0)
{
dot_later--;
}
else
{
dot_before--;
}
}
else
{
Free();
}
}
} // 去除前/后导 0
// 去除前/后导 0
void ClearZeros()
{
// 后导 0
BigNumberNode *p; int max_limit = dot_later;
for(int i = 0; i < max_limit; i++)
{
p = tail; if(p->n == 0)
{
DeleteEnd();
}
else
{
break;
}
} // 前导 0
max_limit = dot_before;
for(int i = 0; i < max_limit; i++)
{
p = head; if(p->n == 0)
{
DeleteBegin();
}
else
{
break;
}
}
} BigNumber Mul(const BigNumber &Scale)
{
const BigNumber &a = *this, &b = Scale;
BigNumber sum_big_number; int sum = 0;
int reserve = 0;
int tag = 0; BigNumberNode *pa = a.tail, *pb = b.tail; // xxxxxx a
// xxx b
// --------- Mul
// xxxxxx
// xxxxxx
// xxxxxx
// --------- Add
// xxxxxxxxx while(pb)
{
BigNumber temp_big_number;
pa = a.tail;
while(pa)
{
sum = pa->n * pb->n + reserve;
reserve = sum / 10;
temp_big_number.InsertNodeAtBegin(sum - reserve * 10);
temp_big_number.dot_before++;
pa = pa->prev;
} if (reserve)
{
temp_big_number.InsertNodeAtBegin(reserve);
temp_big_number.dot_before++;
reserve = 0;
} for (int i = 0; i < tag; i++)
{
temp_big_number.InsetNodeAtEnd(0);
temp_big_number.dot_before++;
} sum_big_number += temp_big_number; tag++;
pb = pb->prev;
} sum_big_number.dot_later = a.dot_later + b.dot_later; if (sum_big_number.dot_before > sum_big_number.dot_later)
{
sum_big_number.dot_before -= sum_big_number.dot_later;
}
else
{
int temp = sum_big_number.dot_later - sum_big_number.dot_before;
sum_big_number.dot_before = 0;
for (int i = 0; i < temp; i++)
{
sum_big_number.InsertNodeAtBegin(0);
}
} sum_big_number.ClearZeros(); return sum_big_number;
} public: ~BigNumber()
{
Free();
} BigNumber(): head(NULL), tail(NULL), dot_before(0), dot_later(0)
{
} BigNumber(const char *Str): head(NULL), tail(NULL), dot_before(0), dot_later(0)
{
Free();
AdaptFormString(Str);
} BigNumber(const BigNumber& Source): head(NULL), tail(NULL), dot_before(0), dot_later(0)
{
*this = Source;
} const BigNumber& operator=(const BigNumber& Source)
{
if (this != &Source)
{
this->Free(); BigNumberNode *p = Source.head;
while(p)
{
this->InsetNodeAtEnd(p->n);
p = p->next;
} this->dot_before = Source.dot_before;
this->dot_later = Source.dot_later;
} return *this;
} BigNumber operator+(const BigNumber Addend)
{
const BigNumber &a = *this, &b = Addend;
BigNumber new_number; BigNumberNode *pa, *pb;
int sum, remain, odd;
int reserve = 0;
bool is_dot_before_longer_is_a; // 帮助标记小数点之前的部分
bool is_dot_later_longer_is_a; // 小数点之后
if(a.dot_later > b.dot_later)
{
pa = a.tail;
pb = b.tail;
remain = b.dot_later;
odd = a.dot_later - b.dot_later;
is_dot_later_longer_is_a = true;
}
else
{
pa = b.tail;
pb = a.tail;
remain = a.dot_later;
odd = b.dot_later - a.dot_later;
is_dot_later_longer_is_a = false;
} for (int i = 0; i < odd; i++)
{
new_number.InsertNodeAtBegin(pa->n);
new_number.dot_later++;
pa = pa->prev;
} for (int i = 0; i < remain; i++)
{
sum = pa->n + pb->n + reserve;
reserve = sum / 10;
new_number.InsertNodeAtBegin(sum - reserve * 10);
new_number.dot_later++;
pa = pa->prev;
pb = pb->prev;
} // 小数点之前
if(a.dot_before > b.dot_before)
{
remain = b.dot_before;
odd = a.dot_before - b.dot_before;
is_dot_before_longer_is_a = true;
}
else
{
remain = a.dot_before;
odd = b.dot_before - a.dot_before;
is_dot_before_longer_is_a = false;
} BigNumberNode *temp; // 用于交换 pa pb
if (is_dot_before_longer_is_a && is_dot_later_longer_is_a
|| !is_dot_before_longer_is_a && !is_dot_later_longer_is_a)
{
// 不用交换
}
else
{
temp = pa;
pa = pb;
pb = temp;
} for (int i = 0; i < remain; i++)
{
sum = pa->n + pb->n + reserve;
reserve = sum / 10;
new_number.InsertNodeAtBegin(sum - reserve * 10);
new_number.dot_before++;
pa = pa->prev;
pb = pb->prev;
} for (int i = 0; i < odd; i++)
{
sum = pa->n + reserve;
reserve = sum / 10;
new_number.InsertNodeAtBegin(sum - reserve * 10);
new_number.dot_before++;
pa = pa->prev;
} // 检测是否最后还有一位
if (reserve)
{
new_number.InsertNodeAtBegin(reserve);
new_number.dot_before++;
reserve = 0;
} new_number.ClearZeros(); return new_number;
} BigNumber operator*(const BigNumber& Scale)
{
return Mul(Scale);
} BigNumber& operator+=(const BigNumber Addend)
{
BigNumber &a = *this;
const BigNumber &b = Addend; BigNumberNode *pa = a.tail, *pb = b.tail;
int sum = 0, remain = 0, odd = 0;
int reserve = 0; // 小数点之后
if(a.dot_later > b.dot_later)
{
remain = b.dot_later;
odd = a.dot_later - b.dot_later; for (int i = 0; i < odd; i++)
{
pa = pa->prev;
}
}
else
{
remain = a.dot_later;
odd = b.dot_later - a.dot_later; char *odd_n = new char[odd];
for (int i = 1; i <= odd; i++)
{
odd_n[odd - i] = pb->n;
pb = pb->prev;
} for (int i = 0; i < odd; i++)
{
a.InsetNodeAtEnd(odd_n[i]);
a.dot_later++;
}
delete odd_n;
} for (int i = 0; i < remain; i++)
{
sum = pa->n + pb->n + reserve;
reserve = sum / 10;
pa->n = sum - reserve * 10; pa = pa->prev;
pb = pb->prev;
} // 小数点之前
if(a.dot_before > b.dot_before)
{
remain = b.dot_before;
odd = a.dot_before - b.dot_before; for (int i = 0; i < remain; i++)
{
sum = pa->n + pb->n + reserve;
reserve = sum / 10;
pa->n = sum - reserve * 10; pa = pa->prev;
pb = pb->prev;
} for (int i = 0; i < odd; i++)
{
sum = pa->n + reserve;
reserve = sum / 10;
pa->n = sum - reserve * 10; pa = pa->prev;
}
}
else
{
remain = a.dot_before;
odd = b.dot_before - a.dot_before; for (int i = 0; i < remain; i++)
{
sum = pa->n + pb->n + reserve;
reserve = sum / 10;
pa->n = sum - reserve * 10; pa = pa->prev;
pb = pb->prev;
} for (int i = 0; i < odd; i++)
{
sum = pb->n + reserve;
reserve = sum / 10;
a.InsertNodeAtBegin(sum - reserve * 10);
a.dot_before++;
pb = pb->prev;
} } // 检测是否最后还有一位
if (reserve)
{
a.InsertNodeAtBegin(reserve);
a.dot_before++;
} a.ClearZeros(); return *this;
} void _Print()
{
if(dot_before == 0 && dot_later == 0)
{
putchar('0');
}
else if (dot_later == 0)
{
BigNumberNode *p = head; while(p)
{
putchar(p->n + '0');
p = p->next;
}
}
else
{
BigNumberNode *p = head; for(int i = 0; i < dot_before; i++)
{
putchar(p->n + '0');
p = p->next;
} putchar('.'); while(p)
{
putchar(p->n + '0');
p = p->next;
}
}
} void PrintString()
{
if(dot_before == 0 && dot_later == 0)
{
putchar('0');
}
else if (dot_later == 0)
{
char *temp = new char[dot_before + dot_later + 2], *ptemp = temp;
BigNumberNode *p = head; while(p)
{
*ptemp = p->n + '0';
ptemp++;
p = p->next;
}
*ptemp = 0; std::cout<<temp<<'\n';
delete[] temp;
}
else
{
char *temp = new char[dot_before + dot_later + 2], *ptemp = temp;
BigNumberNode *p = head; for(int i = 0; i < dot_before; i++)
{
*ptemp = p->n + '0';
ptemp++;
p = p->next;
} *ptemp = '.';
ptemp++; while(p)
{
*ptemp = p->n + '0';
ptemp++;
p = p->next;
}
*ptemp = 0; std::cout<<temp<<'\n';
delete[] temp;
}
} void Free()
{
BigNumberNode *p = head, *temp; while(p)
{
temp = p;
p = p->next;
delete temp;
} head = NULL;
tail = NULL;
dot_before = 0;
dot_later = 0;
} // 从字符串建立数据,未加入错误检测
void AdaptFormString(const char *Str)
{
Free(); const char *pc = Str; // 小数点之前
while(*pc)
{
if(*pc != '.') // 0 ~ 9
{
InsetNodeAtEnd(*pc - '0');
dot_before++;
pc++;
}
else // 小数点之后
{
pc++;
while(*pc)
{
InsetNodeAtEnd(*pc - '0');
dot_later++;
pc++;
}
break;
}
} ClearZeros();
} }; // 自顶向下的动态规划
BigNumber* BigNumberPowUP(BigNumber* result[], int pow)
{
if( result[pow] )
{
return result[pow];
}
else
{
int left = pow / 2;
int right = pow - left; result[left] = BigNumberPowUP(result, left);
result[right] = BigNumberPowUP(result, right); result[pow] = new BigNumber((*result[left]) * (*result[right])); return result[pow];
}
} BigNumber BigNumberPow(const BigNumber& R, int pow)
{
BigNumber *result[26] = {0}; result[1] = new BigNumber(R); BigNumberPowUP(result, pow); BigNumber Result = *result[pow]; for (int i = 0; i <= pow; i++)
{
delete result[i];
} return Result;
} int main(void)
{
char Rstr[10];
int n; while(scanf("%s%d", Rstr, &n) != EOF)
{
BigNumber result = BigNumberPow(Rstr, n);
result.PrintString();
} return 0;
}
[acm 1001] c++ 大数加法 乘法 幂的更多相关文章
- vector、string实现大数加法乘法
理解 vector 是一个容器,是一个数据集,里边装了很多个元素.与数组最大的不同是 vector 可以动态增长. 用 vector 实现大数运算的关键是,以 string 的方式读入一个大数,然后将 ...
- sdut2613(This is an A+B Problem)大数加法(乘法）
#include <iostream>#include <stdio.h>#include <string.h>#include <stdlib.h>u ...
- java实现大数加法、乘法（BigDecimal）
之前写过用vector.string实现大数加法,现在用java的BigDecimal类,代码简单很多.但是在online-judge上,java的代码运行时间和内存大得多. java大数加法:求a+ ...
- Hat's Fibonacci（大数加法+直接暴力）
题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=1250 hdu1250: Hat's Fibonacci Time Limit: 2000/1000 M ...
- 玲珑杯1007-A 八进制大数加法（实现逻辑陷阱与题目套路）
题目连接:http://www.ifrog.cc/acm/problem/1056 DESCRIPTION Two octal number integers a, b are given, and ...
- 【大数加法】POJ-1503、NYOJ-103
1503:Integer Inquiry 总时间限制: 1000ms 内存限制: 65536kB 描述 One of the first users of BIT's new supercompu ...
- NI笔试——大数加法
NI笔试: 1.找出字符串第一次出现的字符.用数组建立哈希表,然后再扫描字符串并判断次数是否为1. 2.大数加法,即字符串加法.因为之前写过乘法,就以为是乘法.然后就把乘法写上去了····= = 好了 ...
- A + B Problem II（大数加法）
http://acm.hdu.edu.cn/showproblem.php?pid=1002 A + B Problem II Time Limit: 2000/1000 MS (Java/Other ...
- 大数加法~HDU 1002 A + B Problem II
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1002 题意: 数学题,A+B; 思路,这个数非常大,普通加法一定会超时,所以用大数加法.大数加法的基 ...
随机推荐
- centos7安装串口终端kermit
1. 将usb转串口连接到PC上.通过dmesg命令可以查看USB转串口是否被PC识别.显示 ……attachec to ttyUSB0即被识别. 2. 安装kermit. [seif@cen ...
- java实现图片文字识别的两种方法
一.使用tesseract-ocr 1. https://github.com/tesseract-ocr/tesseract/wiki上下载安装包安装和简体中文训练文件 window64位安装 ...
- 用PL/sql连接oracle 弹窗出现 could not resolve the connect identifier specified 这个错误
1 错误如下图: 图1 2.可能原因: 配置oracle客户端中tnsnames.ora文件时,把数据库名弄错,如下图: 图2 箭头所指位置出错.箭头处应该为我们安装时的数据库名(通常是orcl).而 ...
- 对接京东jos遇到的坑 记录一下。方便查询
坑很多,有一些忘记了.文档乱的很,有问题可以私信我一下我看能不能想起来. 坑一.添加商品接口. {"error_response": {"code":" ...
- Docker搭建tomcat运行环境（Dockerfile方式）
上一篇文章的基本做法是通过centOS的官方镜像启动一个容器,然后进入到容器中,手动敲命令安装JDK跟tomcat,这个跟在linux下搭建没有什么区别,只是用来熟悉docker命令,并且在日常开发中 ...
- Oracle 维护数据的完整性 一 约束
简介:约束用于确保数据库满足特定的商业规则.在Oracle中,约束包括以下几种: 1.not null 非空约束 该劣质不能为null 2.unique 唯一约束 ...
- MySQL 的更新操作update
1 更新操作(单表更新) 1)单表更新 update [low_priority] [ignore] table_reference set col_name1={expr1|default},col ...
- zato集群部署
注: SQL ODB和Cluster’s config需要首先依次创建,其他三个次序随意 对不熟悉的命令,使用server create *** -h 查看帮助文档 修改完后配置文件,要重启(zato ...
- React.js 小书 Lesson21 - ref 和 React.js 中的 DOM 操作
作者:胡子大哈 原文链接:http://huziketang.com/books/react/lesson21 转载请注明出处,保留原文链接和作者信息. 在 React.js 当中你基本不需要和 DO ...
- org.springframework.web.bind.MissingServletRequestParameterException: Required String parameter 'xxxx' is not present
org.springframework.web.bind.MissingServletRequestParameterException: Required String parameter 'xxx ...