测试详情

#include <bits/stdc++.h>
using namespace std;
#define INF 27
int n, a[INF], num;

void search(int k, int sum) {
	if (sum > n) return;
	if (sum == n) {
		num++;
		return;
	}
	for (int i = 1; i <= n - 1; ++i) {
		if (i >= a[k - 1]){
			a[k] = i;
			search(k + 1, sum + i);
		}
	}
}

int main(){
	cin >> n;
	search(1, 0);
	cout << num << endl;
	return 0;
}