Submission #47225250

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <utility>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <set>
#include <vector>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
const int mod = 1e9 + 7;
const int N = 200005;
const double pai=acos(-1.0);
ll tt;
int a[N];
long long qpow(long long base,long long power){
        long long ans=1;
        while(power>0){
            if(power%2==1) ans=ans*base;
            power/=2;
            base=base*base;
        }
        return ans;
    }
void solve() {
    ll b,ans=1;
    cin>>b;
    for(ll i=1;;i++){
        ans=qpow(i,i);
        if(ans==b){
        	cout<<i;
        	return ;
		}
		else if(ans>b){
			cout<<-1;
			return ;
		}
	}
    return ;
}
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tt = 1;
	//cin >> tt;
	while (tt--) {
		solve();
	}
	return 0;
}

Submission Info

Judge Result