高精度
文章平均质量分 91
1A_coder
Just for fun!
展开
-
hdu 1042 N!
大数、hdu 1042 N!Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N! InputOne N in one line, process to the end of file. OutputFor each N, output N! in one line.原创 2014-02-25 19:41:17 · 1389 阅读 · 0 评论 -
hdu 1047 Integer Inquiry
高精度 hdu 1047 Integer InquiryProblem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers. ``This supercomputer i原创 2014-02-25 21:00:38 · 893 阅读 · 0 评论 -
hdu 1715 大菲波数
hdu 1715 大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9874 Accepted Submission(s): 3305Problem DescriptionFibonacci数列,定义如下:f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。 I原创 2014-02-26 19:23:48 · 835 阅读 · 0 评论 -
hdu 1250 Hat's Fibonacci
Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6343 Accepted Submission(s): 2111Problem Description A Fibonac原创 2014-03-01 18:27:29 · 938 阅读 · 0 评论 -
hdu 1753 大明A+B
大明A+BTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7176 Accepted Submission(s): 2520Problem Description 话说,经过了漫长的一个多月,小明已经成原创 2014-03-01 17:40:09 · 938 阅读 · 0 评论 -
hdu 4927 Series 1 (大数模板加减乘除)
Series 1Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1067 Accepted Submission(s): 390Problem DescriptionLet A be an inte原创 2014-08-23 16:49:42 · 922 阅读 · 0 评论 -
C++ 完全高精度模板 (hdu 4762)
#pragma comment(linker, "/STACK:1024000000,1024000000")#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;/*转载 2014-08-09 14:30:36 · 2849 阅读 · 0 评论