Q8.7

//有点错误，下面附表达 
#include <iostream>
using namespace std;

const int m1 = 25, m2 = 10, m3 = 5, m4 = 1;
const int num = 10;
int total = 0;
bool reached[num * 2];
int pre[num * 2];

void path(int n)
{
	while(n > 0)
	{
		cout << pre[n] << " ";
		n -= pre[n];		
	}
	cout << endl;
}

void dfs(int n)
{
	if(n > num || reached[n])
		return;
	
	if(n == num)
	{
		total ++;
		path(n);
		return;
	}
	reached[n] = true;
	pre[n + m1] = m1;dfs(n + m1);	
	pre[n + m2] = m2;dfs(n + m2);
	pre[n + m3] = m3;dfs(n + m3);
	pre[n + m4] = m4;dfs(n + m4);
}

int main(void)
{
	memset(reached, false, sizeof(reached));
	memset(pre, 0, sizeof(pre));
	dfs(0);
	cout << total << endl;
	
	return 0;
}

#include <iostream>
using namespace std;

int cnt = 0;
void sumN(int sum, int c, int n){
    if(sum >= n){
        if(sum == n) ++cnt;
        return;
    }
    else{
        if(c >= 25)
            sumN(sum+25, 25, n);
        if(c >= 10)
            sumN(sum+10, 10, n);
        if(c >= 5)
            sumN(sum+5, 5, n);
        if(c >= 1)
            sumN(sum+1, 1, n);
    }
}
int sum_n(int sum, int c, int n){
    int ways = 0;
    if(sum <= n){
        if(sum == n) return 1;
        if(c >= 25)
            ways += sum_n(sum+25, 25, n);
        if(c >= 10)
            ways += sum_n(sum+10, 10, n);
        if(c >= 5)
            ways += sum_n(sum+5, 5, n);
        if(c >= 1)
            ways += sum_n(sum+1, 1, n);
    }
    return ways;
}
int make_change(int n, int denom){
    int next_denom = 0;
    switch(denom){
    case 25:
        next_denom = 10;
        break;
    case 10:
        next_denom = 5;
        break;
    case 5:
        next_denom = 1;
        break;
    case 1:
        return 1;
    }
    int ways = 0;
    for(int i=0; i*denom<=n; ++i)
        ways += make_change(n-i*denom, next_denom);
    return ways;
}
int main(){
    int n = 10;
    sumN(0, 25, n);
    cout<<cnt<<endl;
    cout<<make_change(n, 25)<<endl;
    cout<<sum_n(0, 25, n)<<endl;
    return 0;
}