Perfect Pth Powers解题报告
2012-03-30 08:34
316 查看
Description
We say that x is a perfect square if, for some integer b, x = b2. Similarly, x is a perfect cube if, for some integer b, x
= b3. More generally, x is a perfect pth power if, for some integer b, x = bp. Given an integer x you are to determine the largest p such that x is a perfect pth 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 pth power.
Sample Input
Sample Output
We say that x is a perfect square if, for some integer b, x = b2. Similarly, x is a perfect cube if, for some integer b, x
= b3. More generally, x is a perfect pth power if, for some integer b, x = bp. Given an integer x you are to determine the largest p such that x is a perfect pth 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 pth power.
Sample Input
17 1073741824 25 0
Sample Output
1 30 2 #include<stdio.h> #include<math.h> int main() { double n,b; long x,y; int i; while(scanf("%lf",&n)!=EOF) { if(n==0) break; if(n>0) { for(i=32;i>=0;i--) { b=pow(n,1.0/i); x=b; //类型转换为long y=x+1; // if(b-x<=1e-12||y-b<=1e-12) { printf("%d\n",i); break; } } } if(n<0) { n=-n; //if n《0,先转化为正数先,然后i 只能为奇数,查找i。 for(i=31;i>=1;i-=2) { b=pow(n,1.0/i); x=b; //类型转换为long。 y=x+1; // if(b-x<=1e-12||y-b<=1e-12) { printf("%d\n",i); break; } } } } return 0; }
相关文章推荐
- J - Perfect Pth Powers解题报告
- POJ-1730 Perfect Pth Powers 解题报告(数论) 最大开方数
- J - Perfect Pth Powers解题报告(张宇)
- J - Perfect Pth Powers解题报告(陈渊)
- POJ 1730 Perfect Pth Powers 解题报告(因式分解)
- 1730 Perfect Pth Powers 抄题报告
- poj1730 素数 Perfect Pth Powers
- Poj 1730 Perfect Pth Powers (数论 GCD)
- PKU 1730 Perfect Pth Powers
- POJ1730 Perfect Pth Powers
- PKU 1707 Sum of powers 解题报告
- POJ 1730 Perfect Pth Powers
- poj 1730 Perfect Pth Powers 筛法
- POJ1730_Perfect Pth Powers【水题】
- POJ_1730_Perfect Pth Powers
- [leetcode] 367. Valid Perfect Square 解题报告
- [TLE] POJ 1730 Perfect Pth Powers
- poj 1730 Perfect Pth Powers
- poj1730 - Perfect Pth Powers
- POJ 1730 Perfect Pth Powers(唯一分解定理)