ZOJ 1937 Addition Chains(DFS)

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
vector<int>stak,ans;
int n;
void dfs(){
	if(stak[stak.size()-1]==n){
		if(stak.size()<ans.size()){
			ans=stak;
		}
		return;
	}else if(stak.size()>=ans.size()||stak[stak.size()-1]>n)return;
	for (int i=stak.size()-1;i>=0;--i){
		stak.push_back(stak[stak.size()-1]+stak[i]);
		dfs();
		stak.pop_back();
	}
}
int main(){
	while (scanf("%d",&n)&&n){
		ans.clear();
		stak.clear();
		for (int i=0;i<=n;++i){
			ans.push_back(i);
		}
		stak.push_back(1);
		dfs();
		for (int i=0;i<ans.size();++i){
			if(i>0)printf(" ");
			printf("%d",ans[i]);
		}
		printf("\n");
	}
	return 0;
}