![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
高精度
GadyPu
NEVER GIVE UP ON YOUR DREAMS!!!
展开
-
poj 1001 Exponentiation
ExponentiationDescriptionProblems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing ex原创 2015-01-09 20:08:47 · 319 阅读 · 0 评论 -
hdu 1316 How Many Fibs?
大数原创 2015-06-15 21:59:55 · 311 阅读 · 0 评论 -
hdu 1212 Big Number
大数原创 2015-06-14 17:35:33 · 352 阅读 · 0 评论 -
hdu 1023 Train Problem II
大数原创 2015-06-15 19:13:30 · 370 阅读 · 0 评论 -
hdu 1250 Hat's Fibonacci
大数加法原创 2015-06-14 10:58:14 · 351 阅读 · 0 评论 -
c++大数模板
高精度原创 2015-05-31 19:27:04 · 459 阅读 · 0 评论 -
poj 3982 序列
大数加法原创 2015-03-23 21:44:55 · 344 阅读 · 0 评论 -
poj 1503 Integer Inquiry
大数加法原创 2015-03-08 15:52:59 · 327 阅读 · 0 评论 -
poj 2389 Bull Math
大数乘法原创 2015-03-06 16:43:05 · 395 阅读 · 0 评论 -
hoj 1533 Fibonacci Numbers
A Fibonacci sequence is calculated by adding the previous two members of the sequence, with the first two members being both 1.f(1) = 1, f(2) = 1, f(n > 2) = f(n - 1) + f(n - 2)Your task is to原创 2015-01-03 16:46:12 · 423 阅读 · 0 评论 -
hdu 1715 大菲波数
大数原创 2015-06-15 21:48:29 · 361 阅读 · 0 评论