POJ 3134 - Power Calculus

Power Calculus

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 1666		Accepted: 884

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

题意：快速计算x^n，例如x^31,x² = x × x, x⁴ = x² × x², x⁸ = x⁴ × x⁴, x¹⁶ = x⁸ × x⁸, x³² = x¹⁶ × x¹⁶, x³¹ = x³² ÷ x.

至少需要６次乘法，现在输入ｎ，求至少需要多少次乘法。

思路：

找出一个序列，从１开始，利用序列里面的已有的任意两个数通过＋或－得到下一个数，直到得到ｎ的最短序列长度就是答案。

DFS　剪枝：如果通过序列里面最大的一个数Ｘ一直乘２乘剩下的次数都得不到n，则当前方案不行。

#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <set>

using namespace std;

//#define WIN
#ifdef WIN
typedef __int64 LL;
#define iform "%I64d"
#define oform "%I64d\n"
#define oform1 "%I64d"
#else
typedef long long LL;
#define iform "%lld"
#define oform "%lld\n"
#define oform1 "%lld"
#endif

#define S64I(a) scanf(iform, &(a))
#define P64I(a) printf(oform, (a))
#define S64I1(a) scanf(iform1, &(a))
#define P64I1(a) printf(oform1, (a))
#define FOR(i, s, t) for(int (i)=(s); (i)<(t); (i)++)

const int INF = 0x3f3f3f3f;
const double eps = 10e-9;
const double PI = (4.0*atan(1.0));

const int maxn = 1000 + 20;
int n;
int vis[maxn];
int num;
int limtDept;

bool dfs() {
    if(num > limtDept) return false;
    if(vis[num] == n) return true;
    if(vis[num]<<(limtDept-num) < n) return false;
    for(int i=0; i<=num; i++) {
        num++;
        vis[num] = vis[num-1] + vis[i];
        if(vis[num] <= 2000 && dfs()) return true;
        vis[num] = vis[num-1] - vis[i];
        if(vis[num] > 0 && dfs()) return true;
        num--;
    }
    return false;
}

int main() {

    while(scanf("%d", &n) != EOF && n) {
        memset(vis, 0, sizeof(vis));
        limtDept = 0;
        while(limtDept <= 20) {
            vis[num=0] = 1;
            if(dfs()) break;
            limtDept++;
        }
        printf("%d\n", limtDept);
    }

    return 0;
}