poj-1730 Perfect Pth Powers

原创 2012年03月28日 12:35:57

题目链接:http://poj.org/problem?id=1730

Perfect Pth Powers
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 13099   Accepted: 2990

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

17
1073741824
25
0

Sample Output

1
30
2
题意:输入一个数x,若为0则结束。否则,我们知道这个数x必定存在相应的a,b,使得x等于a的b次方;这样的a,b有至少一对。你所要做的就是求出最大的b。

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	long long n;     //int不能满足要求了...
	while(scanf("%lld",&n)!=EOF)
	{
		if(n==0) break;
		long long  m;
		int i;
		int ans=1;
		if(n<0)       //n可能为为负数
		{	m=-n;i=3;}    //负数当然得要是某个负数的奇次幂咯
		else
		{	m=n;i=2;}
		double eps=1e-12;   //精度很重要的,不能太小
		double p;
		for(;i<=32;)
		{
			p=pow(m*1.0,1.0/i);    //pow(int,int)提交报错....改为float
			if(fabs(int(p+eps)-p)<eps)    //x等于a的b次方,b是整数,a也要是整数哦.
				ans=i;
			if(n<0)
				i+=2;     //负数当然得要是某个负数的奇次幂咯
			else
				i++;  
		}
		printf("%d\n",ans);
	}
	return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

poj 1730Perfect Pth Powers(分解质因数)

Perfect Pth Powers Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 16746   Accep...

poj 1730 Perfect Pth Powers

题目大概意思 给你一个x 令 x=b^p 求最大的p 例如 81=9^2=3^4则p的值为 4 一看蒙啦,这怎么求啊,数据范围在2^32次方之内,纠结,这种题一定会有算法, 再看列出几个...

poj 1730 Perfect Pth Powers 筛法

poj 1730 Perfect Pth Powers 筛法 We say that x is a perfect square if, for some integer b, x = b2. Sim...
  • k_l_c_
  • k_l_c_
  • 2016年08月08日 21:27
  • 183

poj 1730 -- Perfect Pth Powers

http://poj.org/problem?id=1730 Perfect Pth PowersTime Limit: 1000MS Memory Limit: 10000KTotal Submi...

POJ 1730 Perfect Pth Powers 解题报告(因式分解)

Perfect Pth Powers Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 1634...
  • kbdwo
  • kbdwo
  • 2014年04月21日 15:52
  • 771

J - Perfect Pth Powers解题报告

J - Perfect Pth Powers Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I6...

Perfect Pth Powers解题报告

Description We say that x is a perfect square if, for some integer b, x = b2. Similarly, x is a p...

zoj 2124 Perfect Pth Powers

/* zoj 2124 数论 题意:求使得 x = b^p的最大的p。 思路:将n分解质因数,原题相当于求所有质因子次数的最大公约数。 注意有负数情况,若为负数则应求最大奇公约数。 ...

J - Perfect Pth Powers解题报告(陈渊)

J - Perfect Pth Powers Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I6...

J - Perfect Pth Powers解题报告(张宇)

J - Perfect Pth Powers Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I6...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj-1730 Perfect Pth Powers
举报原因:
原因补充:

(最多只允许输入30个字)