POJ1945 Power Hungry Cows【DFS】

Power Hungry Cows
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 6441 Accepted: 1593

Description

FJ’s cows would like to be able to compute integer powers P (1 <= P <= 20,000) of numbers very quickly, but need your help. Because they’re going to be computing powers of very large numbers, they can only keep around two work variables for intermediate results.

The first of those work variables is initialized to the number (denoted x) for which they are calculating the power; the other is initialized to 1. The cows can both multiply and divide any pair of the work variables and store the result in any work variable, but all results are stored as integers.

For example, if they want to compute x^31, one way to perform the calculation is:
WV1 WV2

                                  Start:   x    1

Multiply first by first, store in second: x x^2

              Multiply second by second:   x   x^4Multiply second by second:   x   x^8Multiply second by second:   x   x^16Multiply second by second:   x   x^32Divide second by first:   x   x^31

Thus, x^31 can computed in six operations. Given the power to be computed and the the number of work variables, find the minimum number of operations to calculate the power.

Input

A single line with one integer: P.

Output

A single line with a single integer that is the minimum number of operations it requires to compute the power.

Sample Input

Sample Output

Source
USACO 2002 February

问题链接：POJ1945 Power Hungry Cows
问题简述：给定一个数，通过自乘或者乘或除以任意一个变换过的数，问最多经过多少次操作能变换成目标数。
问题分析：
给定两个加数a = 1, b = 0；每一步可以执行a2，b2，a-b之一的操作，使得目标状态达到n。可以用DFS来实现。
后一种解法是牛人提供的，参见参考链接。是不是某种离线打表可以得出这个结论？
程序说明：（略）
参考链接：POJ 1945 Power Hungry Cows 我的解法
题记：（略）

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

/* POJ1945 Power Hungry Cows */#include <iostream>
#include <algorithm>
#include <cstdio>using namespace std;int n;int dfs(int x, int y, int d, int m)
{if(x == 0 && y == 0) return 0;if(d > m) return 0;if(x == n || y == n) return 1;if(n % __gcd(x, y)) return 0;if((y << (m - d)) < n) return 0;int nx, ny;nx = x, ny = y << 1;if(dfs(nx, ny, d + 1, m)) return 1;nx = x << 1, ny = y;if(nx > ny) swap(nx, ny);if(dfs(nx, ny, d + 1, m)) return 1;nx = y, ny = y << 1;if(dfs(nx, ny, d + 1, m)) return 1;nx = x, ny = x << 1;if(dfs(nx, ny, d + 1, m)) return 1;nx = x, ny = x + y;if(dfs(nx, ny, d + 1, m)) return 1;nx = x + y, ny = y;if(nx > ny) swap(nx, ny);if(dfs(nx, ny, d + 1, m)) return 1;nx = x, ny = y - x;if(nx > ny) swap(nx, ny);if(dfs(nx, ny, d + 1, m)) return 1;nx = y, ny = y - x;if(nx > ny) swap(nx, ny);if(dfs(nx, ny, d + 1, m)) return 1;return 0;
}int main()
{scanf("%d", &n);for(int k = 0; ;k++)if(dfs(0, 1, 0, k)) {printf("%d\n", k);break;}return 0;
}

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

/* POJ1945 Power Hungry Cows */#include <iostream>using namespace std;int main()
{int n;cin >>n;switch (n) {case 19997 : cout << "18" << endl; break;case 15151 : cout << "17" << endl; break;case 11111 : cout << "17" <<  endl; break;case 10007 : cout << "16" <<  endl; break;case 5123 : cout << "14" << endl; break;case 5111 : cout << "15" << endl; break;case 1234 : cout << "13" << endl; break;case 1024 : cout << "10" << endl; break;case 1023 : cout << "11" << endl; break;case 1010 : cout << "12" << endl; break;case 31 : cout << "6" << endl; break;}return 0;
}

POJ1945 Power Hungry Cows【DFS】相关推荐

P2742 [USACO5.1]圈奶牛Fencing the Cows /【模板】二维凸包
P2742 [USACO5.1]圈奶牛Fencing the Cows /[模板]二维凸包题目: 给定一些点,问围住所有点所用的围栏的长度题解: 凸包模板题凸包详细代码: #include&l ...
Bailian2815 城堡问题【DFS】
2815:城堡问题总时间限制: 1000ms 内存限制: 65536kB 描述 1 2 3 4 5 6 7 ############################# 1 # | # | # | | ...
Bailian2816 红与黑【DFS】
2816:红与黑总时间限制: 1000ms 内存限制: 65536kB 描述有一间长方形的房子,地上铺了红色.黑色两种颜色的正方形瓷砖.你站在其中一块黑色的瓷砖上,只能向相邻的黑色瓷砖移动.请写一 ...
NUC1158 Lake Counting【DFS】
Lake Counting 时间限制: 1000ms 内存限制: 65536KB 通过次数: 1总提交次数: 1 问题描述 Due to recent rains, water has pooled ...
NUC1399 Sum It Up【DFS】
Sum It Up 时间限制: 1000ms 内存限制: 65535KB 通过次数: 1总提交次数: 1 问题描述 Given a specified total t and a list of n ...
HDU1181 变形课【DFS】（废除）
新题解参见:HDU1181 变形课[DFS+关系闭包+bitset] 变形课 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 13107 ...
【DFS】巧妙取量的倒油问题
题目描述 [题目描述] 有三个容器,容量分别为 a,b,c(a> b > c ),一开始a装满油,现在问是否只靠abc三个容器量出k升油.如果能就输出"yes",并且 ...
[kuangbin]专题三 Dancing Links Squiggly Sudoku HDU - 4069【DFS】【精确覆盖】
[题目描述] Today we play a squiggly sudoku, The objective is to fill a 9*9 grid with digits so that each ...
POJ - 3179 Corral the Cows【离散化】【前缀和】
[题目描述] Farmer John wishes to build a corral for his cows. Being finicky beasts, they demand that the ...

POJ1945 Power Hungry Cows【DFS】

POJ1945 Power Hungry Cows【DFS】相关推荐

最新文章

热门文章