模拟-高精度
你迎哥哥
这个作者很懒,什么都没留下…
展开
-
HDU 1042 N!
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1042N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57467 Accepted Submission(s): 1原创 2014-12-01 12:09:44 · 380 阅读 · 0 评论 -
HDU 2100 Lovekey
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2100LovekeyTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6266 Accepted Submission(s)原创 2014-12-07 12:17:49 · 390 阅读 · 0 评论 -
HDU 2117 Just a Numble
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2117Just a NumbleTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2381 Accepted Submiss原创 2014-12-07 13:10:11 · 478 阅读 · 0 评论 -
我的高精度除法模板
光用减法模拟太慢了,可以先预估商的值高精度除法是高精度里面最难的了。自己用一个小一点的测试数据模拟下代码运行过程就一目了然了。多敲几遍也就那样。加油!#include#includeusing namespace std;const int L=10005;int sub(int *a,int *b,int La,int Lb){ if(La<Lb) return原创 2014-12-06 22:48:12 · 603 阅读 · 0 评论 -
最小公倍数高精度模板
这可谓是大整数乘法,除法,加法,gcd的综合运用吧#include#includeusing namespace std;const int L=10005;string mul(string a,string b){ string s; int na[L],nb[L],nc[L],La=a.size(),Lb=b.size();//na存储被乘数,nb存储乘数,nc原创 2014-12-06 22:53:32 · 752 阅读 · 0 评论 -
HDU 1297 Children’s Queue
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1297Children’s QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11119 Accepted Sub原创 2014-12-02 22:58:30 · 518 阅读 · 0 评论 -
HDU 4608 I-number
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4608【科普】什么是BestCoder?如何参加?I-numberTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Tot原创 2014-12-12 17:53:59 · 617 阅读 · 0 评论 -
HDU 2054 A == B ?
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2054A == B ?Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 66431 Accepted Submissio原创 2014-12-07 12:19:52 · 380 阅读 · 0 评论 -
HDU 1063 Exponentiation&&POJ 1001 Exponentiation
题目链接 HDU 1063: http://acm.hdu.edu.cn/showproblem.php?pid=1063POJ 1001 :http://poj.org/problem?id=1001ExponentiationTime Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Ot原创 2014-12-02 22:30:44 · 573 阅读 · 0 评论 -
HDU 1002 A + B Problem II
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1002A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 227417 Accepted Su原创 2014-12-01 11:12:23 · 438 阅读 · 0 评论 -
HDU 1230 火星A+B
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1230火星A+BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10843 Accepted Submission(s):原创 2014-12-06 23:33:19 · 453 阅读 · 0 评论 -
HDU 1316 How Many Fibs?
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1316How Many Fibs?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4539 Accepted Submis原创 2014-12-07 00:13:46 · 443 阅读 · 0 评论 -
HDU 1047 Integer Inquiry
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1047Integer InquiryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13352 Accepted Subm原创 2014-12-01 11:44:16 · 383 阅读 · 0 评论 -
HDU 1250 Hat's Fibonacci
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1250Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7969 Accepted Submi原创 2014-12-01 18:30:17 · 374 阅读 · 0 评论 -
HDU 1212 Big Number
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1212Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4948 Accepted Submission原创 2014-12-02 22:47:36 · 374 阅读 · 0 评论 -
HDU 1250 Hat's Fibonacci
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1250Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7980 Accepted Submi原创 2014-12-02 22:51:48 · 416 阅读 · 0 评论 -
我的高精度乘法模板
O(n^2)复杂度的算法,以后会发布O(n*log(n))的基于快速傅里叶变换的高精乘用字符串读取数据倒序存储模拟手工运算最好自己用个比较小的数字按算法走一遍,然后就一目了然了。#include#include#include#include#include#include#include#include#include#include#include#i原创 2014-12-06 22:44:30 · 796 阅读 · 0 评论 -
压位高精度模板
原先是整型数组每个元素存1个数字,压位高精是每位存8个数字,这样可以加速8呗,空间也减小了。可谓是对整形数组的充分利用。#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long原创 2014-12-06 22:52:20 · 1932 阅读 · 0 评论 -
HDU 1753 大明A+B
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1753【科普】什么是BestCoder?如何参加?大明A+BTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submi原创 2014-12-06 23:27:14 · 534 阅读 · 0 评论 -
我的高精度加法模板
用字符串读取大整数。然后倒序存入整形数组里。最后还原成正序具体见代码#include#include#define maxn 10005char a[maxn],b[maxn];int na[maxn],nb[maxn];void add(){ memset(na,0,sizeof(na)); memset(nb,0,sizeof(nb)); i原创 2014-12-06 22:42:58 · 480 阅读 · 0 评论 -
HDU 1715大菲波数
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1715大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12206 Accepted Submission(s):原创 2014-12-06 23:07:58 · 477 阅读 · 0 评论 -
ACM-高精度模板(综合篇)
在这里,我们约定,能用int表示的数据视为单精度,否则为高精度。所有函数的设计均采用带返回值的形式。本文包含1.高精度加法2.高精度减法3.高精度乘法1)高精度乘高精度的朴素算法2)高精度乘高精度FFT优化算法3)高精度乘单精度4.高精度除法1)高精度除高精度2)高精度除单精度5.高精度取模1)高精度对高精度取模2)高精度对单精度取模6.高精原创 2015-02-01 19:20:11 · 9570 阅读 · 6 评论