【IDA*】【POJ3134】Power Calculus

Power Calculus

Starting with x and repeatedly multiplying by x, we can compute x31 with thirty multiplications:
x2 = x × x, x3 = x2 × x, x4 = x3 × x, …, x31 = x30 × x.
The operation of squaring can be appreciably shorten the sequence of multiplications. The following is a way to compute x31 with eight multiplications:
x2 = x × x, x3 = x2 × x, x6 = x3 × x3, x7 = x6 × x, x14 = x7 × x7, x15 = x14 × x, x30 = x15 × x15, x31 = x30 × x.
This is not the shortest sequence of multiplications to compute x31. There are many ways with only seven multiplications. The following is one of them:
x2 = x × x, x4 = x2 × x2, x8 = x4 × x4, x8 = x4 × x4, x10 = x8 × x2, x20 = x10 × x10, x30 = x20 × x10, x31 = x30 × x.
If division is also available, we can find a even shorter sequence of operations. It is possible to compute x31 with six operations (five multiplications and one division):
x2 = x × x, x4 = x2 × x2, x8 = x4 × x4, x16 = x8 × x8, x32 = x16 × x16, x31 = x32 ÷ x.
This is one of the most efficient ways to compute x31 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 xn 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−3, 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 xn 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
Output
0
6
8
9
11
9
13
12

题目大意：给定数x和n，求x^n,只能用乘法和除法，算过的结果可以被利用。问最少多少次就够了，n<=1000

题目等价于从数字1开始, 用加减法, 最少算多少次能得到n

#include<iostream>
using namespace std;

int val[1010];//存一个搜索路径上每一步的结果
int pos,n;

bool ida(int now,int dep){
    if(now>dep)return 0;
    if(val[pos]<<(dep-now)<n)return 0;//估价函数：用最快的倍增都不能达到n，退出
    if(val[pos]==n)return 1;
    ++pos;
    for(int i=0;i<pos;++i){
        val[pos]=val[pos-1]+val[i];//上一个数与前面所有的数相加
        if(ida(now+1,dep))return 1;
        val[pos]=abs(val[pos-1]-val[i]);//上一个数与前面所有的数相减，取绝对值
        if(ida(now+1,dep))return 1;
    }
    --pos;
    return 0;
}

int main(){
    while(cin>>n,n){
        int dep;
        for(dep=0;;++dep){
            val[pos=0]=1;
            if(ida(0,dep))break;
        }
        cout<<dep<<endl;
    }
    //system("pause");
    return 0;
}