UVa 10622 - Perfect P-th Powers(数论)
来源:互联网 发布:如何查看网卡mac地址 编辑:程序博客网 时间:2024/05/21 10:36
#include <algorithm>#include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <cmath>using namespace std;int find(int n){for (int i = 2 ; i < 50000 ; ++ i) {if (pow(0.0+i, (int)(log10(fabs(n+0.0))/log10(i+0.0)+0.01)) == n)return (int)(log10(fabs(n+0.0))/log10(i+0.0)+0.01);if (pow(0.0-i, (int)(log10(fabs(n+0.0))/log10(i+0.0)+0.01)) == n)return (int)(log10(fabs(n+0.0))/log10(i+0.0)+0.01);}return 1;}int main(){int n;while (cin >> n && n)cout << find(n) << endl; return 0;}
给你一个数,找到他能表示一个幂的最大的指数。
分析:数论。直接枚举50000内所有的底数即可。
说明:1.注意负数的情况,先算对应整数,在取反判断;2.log10()函数的精度问题。
0 0
- UVA 10622 - Perfect P-th Powers(数论)
- uva 10622 - Perfect P-th Powers(数论)
- UVA 10622 Perfect P-th Powers(数论)
- UVa 10622 - Perfect P-th Powers(数论)
- UVa 10622 - Perfect P-th Powers
- UVA - 10622 Perfect P-th Powers
- UVA 10622 - Perfect P-th Powers
- UVa 10622 - Perfect P-th Powers
- UVa 10622 - Perfect P-th Powers
- Perfect P-th Powers UVA
- uva 10622——Perfect P-th Powers
- UVa 10622 - Perfect P-th Powers(对数+快速幂)
- UVA 10622 Perfect P-th Powers (唯一分解定理 + GCD)
- 10622 - Perfect P-th Powers(唯一分解定律)
- UVa10622 Perfect P-th Powers
- POJ 1730 Perfect Pth Powers(数论)
- UVA 10622(p343)----Perfect Pth Powers
- 【数论】poj1730 Perfect Pth Powers
- 程序员的级别
- bash: service: command not found 错误的解决方法
- LRUCache源码学习
- yum的错误
- C++标准库之Unities-笔记2
- UVa 10622 - Perfect P-th Powers(数论)
- Grammar API
- Java实现网页截屏
- 动漫推荐之东京暗鸦
- Linux系统命令缩写
- LatticeGrammar API
- 【PAT】1030. 完美数列(25)
- Spring 学习笔记 - 1
- 15周【项目1-用二进制文件处理学生成绩】