![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
大数
文章平均质量分 68
小周周i
这个作者很懒,什么都没留下…
展开
-
2016"百度之星" - 资格赛 Problem B
for(i=k; i>=0; i--) { if(i==k) { if(a[k]!=0)//判断最高位是不是0 s+=a[k]+'0'; } else s+=a[i]+'0'; } return s;原创 2016-05-16 19:05:42 · 452 阅读 · 0 评论 -
nyoj 28大数阶乘
描述 我们都知道如何计算一个数的阶乘,可是,如果这个数很大呢,我们该如何去计算它并输出它? 输入 输入一个整数m(0 输出 输出m的阶乘,并在输出结束之后输入一个换行符 样例输入 50 样例输出 30414093201713378043612608166064768844377641568960512000000000000 模拟乘法运算 核心代码原创 2016-05-19 17:47:29 · 246 阅读 · 0 评论 -
uva 10106 Product 大数相乘
Sample Input 12 12 2 222222222222222222222222 Sample Output 144 444444444444444444444444 大数乘法,把字符串反过来储存在int型数组中 如s1[i] 2 1 0 乘数 1 2 5 S2[j] 2 1 0 乘数 1 2 5 5和5相原创 2016-10-18 19:56:25 · 243 阅读 · 0 评论 -
hdu 1250 Hat's Fibonacci
Problem Description 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原创 2016-10-18 21:26:01 · 308 阅读 · 0 评论 -
hdu 1023
Description As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get ou原创 2016-10-20 21:11:51 · 209 阅读 · 0 评论