yeyun666的博客

Problem Description Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N! Input One N in one line, process to the end of file. Output For each N, output N! in one line.

大数相加思想： 用数组储存数字，统一长度，然后同位相加，大于9则进位，取余，判断最高位是否有进位情况 代码如下 #include #include char s1[10000]; char s2[10000]; int ss1[10000]; int ss2[10000]; int ss3[10000]; int main() {     //数组清零     mem

Problem Description 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 those numb

Problem Description Recall 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