UVa 10622 - Perfect P-th Powers（数论）

#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;
}