POJ2248 Addition Chains

 

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5122		Accepted: 2766		Special Judge

Description

An addition chain for n is an integer sequence <a0, a1,a2,...,am="">with the following four properties: 

• a0 = 1 
• am = n 
• a0 < a1 < a2 < ... < a_m-1 < am 
• For each k (1<=k<=m) there exist two (not necessarily different) integers i and j (0<=i, j<=k-1) with ak=ai+aj

You are given an integer n. Your job is to construct an addition chain for n with minimal length. If there is more than one such sequence, any one is acceptable. 
For example, <1,2,3,5> and <1,2,4,5> are both valid solutions when you are asked for an addition chain for 5.

Input

The input will contain one or more test cases. Each test case consists of one line containing one integer n (1<=n<=100). Input is terminated by a value of zero (0) for n.

Output

For each test case, print one line containing the required integer sequence. Separate the numbers by one blank. 
Hint: The problem is a little time-critical, so use proper break conditions where necessary to reduce the search space. 

Sample Input

5
7
12
15
77
0

Sample Output

1 2 4 5
1 2 4 6 7
1 2 4 8 12
1 2 4 5 10 15
1 2 4 8 9 17 34 68 77

Source

Ulm Local 1997

 

 

DFS迭代加深。

每次优先取数列后面的大数凑成新数，如果数过小或者大于目标就剪掉。

 

/*by SilverN*/
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
const int mxn=300;
int n;
int a[mxn];
int dep[mxn];
bool v[mxn];
bool dfs(int now,int limit){
    if(now>limit)return 0;
    int i,j;
    for(i=now-1;i;i--){
        for(j=i;j;j--){
            a[now]=a[i]+a[j];
            if(a[now]>n)continue;
            if(a[now]<=a[now-1])break;
            if(a[now]==n) return 1; 
            if(dfs(now+1,limit))return 1;
        }
    }
    return 0;
}
int main(){
    a[1]=1;
    a[2]=2;
    while(scanf("%d",&n) && n){
        if(n==1){
            printf("1 
");
            continue;
        }
        if(n==2){
            printf("1 2 
");
            continue;
        }
        memset(v,0,sizeof v);
        int i,j;
        int ans=1000;
        for(i=1;i<=100;i++){
            if(dfs(3,i)){
                ans=i;
                for(j=1;j<=i;j++)printf("%d ",a[j]);
                printf("
");
                break;    
            }
        }
    }
    return 0;
}