POJ - 2248 Addition Chains
#include<stdio.h>
const int N = 110;
int n,path[N];
bool dfs(int u,int k)
{
if(u==k) return path[u-1]==n;
bool st[N]={0};
for(int i=u-1;i>=0;i--)
for(int j=i;j>=0;j--)
{
int s=path[i]+path[j];
if(s>n||s<=path[u-1]||st[s]) continue;
st[s]=true;
path[u]=s;
if(dfs(u+1,k)) return true;
}
return false;
}
int main()
{
path[0]=1;
while(scanf("%d",&n)&&n)
{
int k=1;
while(!dfs(1,k)) k++;
for(int i=0;i<k;i++) printf("%d ",path[i]);
puts("");
}
return 0;
}