cr496352127的博客

题目描述：    This time, you are supposed to find A+B where A and B are two matrices, and then count the number of zero rows and columns.输入：    The input consists of several test cases, each

1. 从n个人中选择k个人的不同组合数法一：递归        由n个人里选k个人的组合数=由n-1个人里选k个人的组合数+由n-1个人里选k-1个人的组合数。此公式本身是递归的，因此可编写递归函数实现这一过程，其中递推结束条件是n=k或k=0，这时的组合数为1，然后开始回归。源代码：#include using namespace std;int comm(int n,int

题目描述：Starting from point (0,0) on a plane, we have written all non-negative integers 0,1,2, ... as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1), (2,0), and (3, 1)