POJ-1730-Perfect Pth Powers
2013-08-06 20:41
459 查看
这个题要求求出所给的数n能够写成a^x,x的最大值,我直接枚举做的,注意数据有负数的情况
代码:
代码:
#include<cstdio> #include<cstring> #include<iostream> using namespace std; long long n; int main() { while(scanf("%I64d",&n)&&n) { int ans=1; long long absn=n>0?n:-n; bool getans=false; for(long long i=2;i*i<=absn;i++) { long long num=1; for(int j=1;num<=absn;j++) { num*=i; if(num==absn) { ans=max(ans,j); if(n<0) while(!(ans&1)) ans>>=1; getans=true; break; } } if(getans) break; } printf("%d\n",ans); } return 0; }
相关文章推荐
- POJ1730 Perfect Pth Powers
- poj 1730 Perfect Pth Powers(枚举)
- POJ 题目1730 Perfect Pth Powers(质因子分解)
- POJ-1730 Perfect Pth Powers 分解质因子
- poj-1730 Perfect Pth Powers
- poj-1730 Perfect Pth Powers
- POJ1730 Perfect Pth Powers (math)
- poj 1730 Perfect Pth Powers
- POJ 1730 Perfect Pth Powers - 找一个数最多是第几方数...暴力解决...
- poj 1730 Perfect Pth Powers 精度修正
- poj 1730 Perfect Pth Powers
- Poj 1730 Perfect Pth Powers
- poj 1730 Perfect Pth Powers 筛法
- poj1730 - Perfect Pth Powers
- POJ 1730 Perfect Pth Powers(数论)
- 【数论】poj1730 Perfect Pth Powers
- poj 1730 Perfect Pth Powers -----数论
- poj1730--Perfect Pth Powers
- POJ 1730 Perfect Pth Powers 解题报告(因式分解)
- zoj 2124 || poj 1730 Perfect Pth Powers