uva 529 - Addition Chains(构造一个加法链) （dfs深搜 + 剪枝）

最新推荐文章于 2019-07-21 20:19:00 发布

VIP文章 SHOUXIN11111

最新推荐文章于 2019-07-21 20:19:00 发布

阅读量221

点赞数

分类专栏： dfs 模拟题文章标签： c语言

本文链接：https://blog.csdn.net/shiuxin/article/details/96492942

版权

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 < ... < am-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