poj-1730 Perfect Pth Powers

原创 2012年03月28日 23:05:21
                                                                        J - Perfect Pth Powers
Crawling in process...Crawling failedTime Limit:1000MS    Memory Limit:10000KB    64bit IO Format:%I64d & %I64u

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
这题是要求我们求最大的平方数,按照正规的方法可能会比较难些,那我们就反着做,先求出他能开多少次方,然后在平方,求出最大的平方数。
#include <iostream>
#include <algorithm>
#include <cmath>
#include<cstdio>
#define EPS 1e-5
using namespace std;
int pow(int a,int b)
{ 
	int ans=1; 
	while(b--) 
		ans*=a; 
	return ans;
}
int main()
{
	int n;
	while(~scanf("%d", &n) && n)
	{  
		int t=1;  
		int i,ans=1;  
		if(n<0) t=-1;  
		for(i=2; i<32; i++) 
		{   
			int tmp=(long long)(pow(n*1.0*t,1.0/i)+EPS)*t;   
			if(pow(tmp,i)==n) 
				ans=i;  
		}  
		printf("%d\n",ans);
	} 
	return 0;
}

poj-1730 Perfect Pth Powers

题目链接:http://poj.org/problem?id=1730 Perfect Pth Powers Time Limit: 1000MS   Memory L...

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

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

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...

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...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj-1730 Perfect Pth Powers
举报原因:
原因补充:

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