1
#include <bits/stdc++.h>
2
using namespace std;
3

4
int n, k;
5
int ans;
6
int sum;
7

8
void dfs(int x, int start) {
9
  if (x == k+1) {
10
    if (sum == n) ans++;
11
    return;
12
  }
13
  for (int i = start; sum+i*(k-x+1) <= n; i++) {
14
    sum+=i;
15
    dfs(x+1,i);
16
    sum-=i;
17
  }
18
}
19

20
int main() {
21

22
  freopen("data.in","r",stdin);
23
  freopen("dfs.out","w",stdout);
24

25
  cin >> n >> k;
26
  dfs(1,1);
27
  cout << ans;
28
  return 0;
29
}

1
#include<bits/stdc++.h>
2
using namespace std;
3

4
int n,k,f[201][7];  //f[k][x] k 分成 x 份 ={f[k-1][x-1],f[k-x][x]}
5

6
int main(){
7

8
  freopen("data.in","r",stdin);
9
  freopen("dp.out","w",stdout);
10

11
    cin >> n >> k;
12
    for (int i=1;i<=n;i++) {f[i][1]=1;f[i][0]=1;}for (int x=2;x<=k;x++) {f[1][x]=0;f[0][x]=0;}  // 边界，为了防止炸，我把有0的也处理了
13
    for (int i=2;i<=n;i++)
14
        for (int x=2;x<=k;x++)
15
            if (i>x) f[i][x]=f[i-1][x-1]+f[i-x][x];
16
            else f[i][x]=f[i-1][x-1];
17
    cout<<f[n][k];
18
    return 0;
19
}

1
#include <bits/stdc++.h>
2
using namespace std;
3

4
int main() {
5
  freopen("data.in","w",stdout);
6
  srand(time(0));
7
  cout << rand()%193+7 <<" "<< rand()%4+2;
8
  return 0;
9
}

1
#include <bits/stdc++.h>
2
using namespace std;
3

4
int main() {
5
  int n = 100;
6
  while(n--) {
7
    system("DataMaker.exe");
8
    system("dfs.exe");
9
    system("dp.exe");
10
    if (system("fc dfs.out dp.out")) {
11
      break;
12
    }
13
  }
14
  return 0;
15
}