1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
int n;
int k;
int cnt;
int a[60];
void solve1(int p,int sum,int last)
{
int i;
if(sum==n){
if(p==k){
cnt = cnt+1;
}
return;
}
if(sum>n){
return;
}
i=last;
while(i>=1){
a[p]=i;
sum=sum+i;
solve1(p+1,sum,i);
sum=sum-i;
i=i-1;
}
}
void solve2(int p,int sum,int last)
{
int i;
if(sum==n){
cnt = cnt+1;
return;
}
if(sum>n){
return;
}
i=last;
while(i>=1){
a[p]=i;
sum=sum+i;
solve2(p+1,sum,i-1);
sum=sum-i;
i=i-1;
}
}
void solve3(int p,int sum,int last)
{
int i;
if(sum==n){
cnt = cnt+1;
return;
}
if(sum>n){
return;
}
i=last;
while(i>=1){
a[p]=i;
sum=sum+i;
solve3(p+1,sum,i);
sum=sum-i;
i=i-2;
}
}
int main()
{
n = getint();
k = getint();
cnt=0;
solve1(0,0,n);
putint(cnt);
putch(10);
cnt=0;
solve2(0,0,n);
putint(cnt);
putch(10);
cnt=0;
if(n%2==0) {
solve3(0,0,n-1);
}
else {
solve3(0,0,n);
}
putint(cnt);
putch(10);
return 0;
}
|
