問(wèn)題:
http://acm.pku.edu.cn/JudgeOnline/problem?id=1664思路:
就是根據(jù)題意進(jìn)行DFS，要注意的是如何避免重復(fù): 所放蘋(píng)果數(shù)目遞減
居然一會(huì)就AC了哈哈，暑假的鍛煉還是有些成果的：）
代碼:
1 #include<stdio.h>
2 #include<stdlib.h>
3 #include<string.h>
4 int n, m;
5 int total;
6
7 void
8 dfs(int level, int left, int last)
9 {
10 int i, up;
11 if(level==n) {
12 if(left == 0)
13 ++total;
14 return;
15 }
16 up = left<last ? left : last;
17 for(i=up; i>=0; i--)
18 dfs(level+1, left-i, i);
19 }
20
21 int
22 main(int argc, char **argv)
23 {
24 int tests;
25 scanf("%d", &tests);
26 while(tests--) {
27 scanf("%d %d", &m, &n);
28 total = 0;
29 dfs(0, m, m);
30 printf("%d\n", total);
31 }
32 }