fallingskies

递归的基本概念 一个函数调用其自身，就是递归。 例1    求n!的递归函数 int Factorial(int n){ if(n==0) return 1; else return n*Factorial(n-1); } 递归的作用 替代多重循环 解决本来就是用递归型式定义的问题 将问题分解为规模更小的子问题进行求解 … 例2   汉诺塔问题 void Hanoi(int n,...

1005 Spell It Right (20 分) Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English. Input Specification: Each input file co...

1006 Sign In and Sign Out (25 分) At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the reco...

1007 Maximum Subsequence Sum (25 分) Given a sequence of K integers { N​1​​, N​2​​, …, N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, …, N​j​​ } where 1≤i≤j≤K. The Maximum Subsequ...

明天再写