http://poj.org/problem?id=1730
Perfect Pth Powers
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 14897 | Accepted: 3356 |
Description
We say that x is a perfect square if, for some integer b, x = b
2. Similarly, x is a perfect cube if, for some integer b, x = b
3. More generally, x is a perfect pth power if, for some integer b, x = b
p. Given an integer x you are to determine the largest p such that x is a perfect p
th power.
Input
Each test case is given by a line of input containing x. The value of x will have magnitude at least 2 and be within the range of a (32-bit) int in C, C++, and Java. A line containing 0 follows the last test case.
Output
For each test case, output a line giving the largest integer p such that x is a perfect p
th power.
Sample Input
17 1073741824 25 0
Sample Output
1 30 2
Source
题意:求一个32位整数n写成整数幂的形式,指数最大是多少。
表示各种wa。。自己的精度有问题。。关键的是还有负数,负数要单独处理。。
数的情况要先把x变成-x去计算,如果最后结果是偶数,显然是不可能的(一个数的偶次方怎么可能是负数),此时要不断将结果减半,直到为奇数。
举例:64对应的结果应该是6,-64计算后也是6,显然不可能,应该为3,即(-4)^3=-64
#include <iostream>
#include<cstdio>
#include<cmath>
举例:64对应的结果应该是6,-64计算后也是6,显然不可能,应该为3,即(-4)^3=-64
#include <iostream>
#include<cstdio>
#include<cmath>
using namespace std;
const double eps=1e-8;
int main()
{
__int64 n;
double up,down;
bool flag;
int i,t;
while(scanf("%I64d",&n)!=EOF)
{
if(n==0)
{
break;
}
flag=false;
if(n<0)
{
n=-n;
flag=true;
}
for(i=32;i>=1;i--)
{
up=ceil(pow((double)n,(double)1.0/i));//将n开i次方后向上取整
down=floor(pow((double)n,(double)1.0/i)); //将n开i次方后向下取整
if(fabs(pow(up,i)-n)
{
if(flag)//输入的数为负数
{
if(i%2==1)//即得到的为奇数才符合条件
{
t=i;
break;
}
}
else
{
t=i;
break;
}
}
}
printf("%d\n",i);
}
return 0;
}
const double eps=1e-8;
int main()
{
}
真正的大神解法是
http://zhyu.me/acm/poj-1730.html