Submission #3456255

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <time.h>
#include <list>

using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define reps(x,c) for(auto x:c)
#define all(x) begin(x), end(x)
#define pb(a) emplace_back(a) 
#define mp(a,b) make_pair((a),(b))
#define pl pair<ll,ll>
#define INF 2147483600
#define MOD 1000000007
#define fi first
#define se second
#define dbg(x) cout << #x"="<< (x) << endl
#define dbgv(x) cout<<#x<<endl;reps(y,x){cout<<y<<" ";}cout<<endl

int main(){
	ll x;cin>>x;
	ll temp,temp2,ans_num=1;
	int sqrt_x = ceil(sqrt(x) + 0.1);
  FOR(p,2,sqrt_x){
  	temp=x;
  	temp2=0;
  	while(temp/p>0){
  		temp2++;
  		temp/=p;
  	}
  	if(ans_num<pow(p,temp2)){
  		ans_num=pow(p,temp2);
  	}
  }
  cout<<ans_num<<endl;
  return 0;
}

Submission Info

Judge Result