
大数
linmory
头疼....太难了
展开
-
hdu1250(大 数)Hat's Fibonacci
Hat's Fibonacci A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1原创 2017-09-13 20:58:43 · 317 阅读 · 0 评论 -
nyoj 1072 : 比大小(大数相减)
题目描述 给你两个很大的数,你能不能判断出他们两个数的大小呢? 比如123456789123456789要大于-123456 输入 每组测试数据占一行,输入两个不超过1000位的10进制整数a,b 数据保证输入的a,b没有前缀的0。 如果输入0 0表示输入结束。测试数据组数不超过10组 输出 如果a>b则输出“a>b”,如果a 样例输入原创 2017-10-31 20:16:07 · 219 阅读 · 0 评论 -
hdu 1402 A * B Problem Plus
A * B Problem Plus Calculate A * B. Input Each line will contain two integers A and B. Process to end of file. Note: the length of each integer will not exceed 50000. Output For each c原创 2017-11-13 10:53:11 · 219 阅读 · 0 评论 -
ZOJ - 2625 (大数)
Rearrange Them N people stand in a line, and we numbered them 1,2...n, and now you are asked to rearrange them. The ith people is considred in the front of the (i+1)th, after the rearrange, everyon原创 2018-05-05 20:53:54 · 238 阅读 · 0 评论