POJ-2248

87 阅读 0 评论 58 点赞

我是靠谱客的博主乐观白云，最近开发中收集的这篇文章主要介绍POJ-2248，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

Addition Chains

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4019		Accepted: 2245		Special Judge

Description

An addition chain for n is an integer sequence 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

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

#include <stdio.h>
#include <string.h>

int num;

int sequence[101], min, best[101], sort[101];

void find(int n)
{
     int i;
     if (n > min)
        return ;
     if (sequence[n] == num) {
        for (i = 0; i <= n; i++)
            best[i] = sequence[i];
        best[i] = 0;
        min = n;
        return;
     }
     for (i = 0; i <= n; i++) {
         sequence[n+1] = sequence[i]+sequence[n];
         if (sequence[n+1] > num)
            break;
         if (n+1 > sort[sequence[n+1]])
            continue;
         else
            sort[sequence[n+1]] = n+1;
         find(n+1);
     }
}

int main()
{
    int i;
    sequence[0] = 1;
    num = 0;
    memset(sort, 100, sizeof(sort));
    while (scanf("%d", &num), num) {
          min = 100;
          find(0);
          for (i= 0; best[i]; i++)
              printf("%d ", best[i]);
          printf("n");
    }
    
    return 0;
}