![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
大数
文章平均质量分 79
coco430
这个作者很懒,什么都没留下…
展开
-
UVA 10106 - Product(大数乘法)
Product The ProblemThe problem is to multiply two integers X, Y. (0250)The InputThe input will consist of a set of pairs of lines. Each line in pair contains one multip原创 2013-07-24 11:41:43 · 520 阅读 · 0 评论 -
UVA 10494 - If We Were a Child Again(大数除法和取模)
If We Were a Child AgainInput: standard inputOutput: standard outputTime Limit: 7 seconds “Oooooooooooooooh!If I could do the easy mathematics like my school days!!I can guarante原创 2013-07-24 13:20:45 · 434 阅读 · 0 评论 -
UVA 465 - Overflow(大数)
Overflow Write a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expression is too large to be原创 2013-07-24 11:47:24 · 421 阅读 · 0 评论 -
UVA 424 - Integer Inquiry(大数加法)
Integer Inquiry One 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原创 2013-07-24 11:35:10 · 473 阅读 · 0 评论 -
UVA 748 - Exponentiation
Exponentiation Problems 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 experi原创 2013-07-24 13:10:45 · 384 阅读 · 0 评论 -
HDU 1250 - Hat's Fibonacci(大数斐波那契)
Hat's FibonacciTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence原创 2013-08-09 14:19:17 · 687 阅读 · 0 评论