POJ3134 UVA1374 UVALive3621 ZOJ2824 Power Calculus【IDA*】

Power Calculus

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 2249		Accepted: 1231

Description

Starting with x and repeatedly multiplying by x, we can compute x³¹ with thirty multiplications:

x² = x × x, x³ = x² × x, x⁴ = x³ × x, …, x³¹ = x³⁰ × x.

The operation of squaring can be appreciably shorten the sequence of multiplications. The following is a way to compute x³¹ with eight multiplications:

x² = x × x, x³ = x² × x, x⁶ = x³ × x³, x⁷ = x⁶ × x, x¹⁴ = x⁷ × x⁷, x¹⁵ = x¹⁴ × x, x³⁰ = x¹⁵ × x¹⁵, x³¹ = x³⁰ × x.

This is not the shortest sequence of multiplications to compute x³¹. There are many ways with only seven multiplications. The following is one of them:

x² = x × x, x⁴ = x² × x², x⁸ = x⁴ × x⁴, x⁸ = x⁴ × x⁴, x¹⁰ = x⁸ × x², x²⁰ = x¹⁰ × x¹⁰, x³⁰ = x²⁰ × x¹⁰, x³¹ = x³⁰ × x.

If division is also available, we can find a even shorter sequence of operations. It is possible to compute x³¹ with six operations (five multiplications and one division):

x² = x × x, x⁴ = x² × x², x⁸ = x⁴ × x⁴, x¹⁶ = x⁸ × x⁸, x³² = x¹⁶ × x¹⁶, x³¹ = x³² ÷ x.

This is one of the most efficient ways to compute x³¹ if a division is as fast as a multiplication.

Your mission is to write a program to find the least number of operations to compute xⁿ by multiplication and division starting with x for the given positive integer n. Products and quotients appearing in the sequence should be x to a positive integer’s power. In others words, x⁻³, for example, should never appear.

Input

The input is a sequence of one or more lines each containing a single integer n. n is positive and less than or equal to 1000. The end of the input is indicated by a zero.

Output

Your program should print the least total number of multiplications and divisions required to compute xⁿ starting with x for the integer n. The numbers should be written each in a separate line without any superfluous characters such as leading or trailing spaces.

Sample Input

1
31
70
91
473
512
811
953
0

Sample Output

0
6
8
9
11
9
13
12

Source

Japan 2006

问题链接：POJ3134 UVA1374 UVALive3621 ZOJ2824 Power Calculus

问题简述：（略）

问题分析：

  使用IDA*算法实现。

程序说明：（略）

题记：（略）

参考链接：（略）

AC的C++语言程序如下：

/* POJ3134 UVA1374 UVALive3621 ZOJ2824 Power Calculus */

#include<iostream>

using namespace std;

const int N = 1000;
int n, ans, now[N + 1];

bool idax(int dep)
{
    if(dep > ans)
        return false;
    if((now[dep] << (ans - dep)) < n) // 剪枝
        return false;
    if(now[dep] == n)
        return true;

    for(int i=0; i<=dep; i++) {
        now[dep + 1] = now[dep] + now[i];
        if (idax(dep + 1))
            return true;
        now[dep + 1] = now[dep] - now[i];
        if (idax(dep + 1))
            return true;
    }

    return false;
}

int main()
{
    now[0] = 1;

    while(cin>>n && n) {
        ans = 0;
        while(!idax(0))
            ans++;
        cout << ans << endl;
    }

    return 0;
}