大数
文章平均质量分 80
落叶晚秋
努力,变得更强!!!
展开
-
杭电oj-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.原创 2015-11-01 18:37:41 · 2441 阅读 · 0 评论 -
大数相加
大数相加思想:用数组储存数字,统一长度,然后同位相加,大于9则进位,取余,判断最高位是否有进位情况代码如下#include #include char s1[10000];char s2[10000];int ss1[10000];int ss2[10000];int ss3[10000];int main(){ //数组清零 mem原创 2015-11-01 19:14:21 · 302 阅读 · 0 评论 -
杭电oj-1047-Integer Inquiry
Problem 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 numb原创 2016-04-09 11:53:43 · 491 阅读 · 0 评论 -
杭电oj-1316-How Many Fibs?
Problem DescriptionRecall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n >= 3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range原创 2016-04-09 12:01:34 · 346 阅读 · 0 评论