problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03352 | s326377938 | Accepted | x=int(input())
ans=[1]
for i in range(1,x+1):
for j in range(2,35):
if i**j<=x:
ans.append(i**j)
#print(ans)
print(max(ans)) |
p03352 | s758722838 | Accepted |
#解答
x = int(input())
c = 1
for b in range(1, x):
for p in range(2, x):
if b**p <= x: c = max(c, b**p)
else: break
print(c) |
p03352 | s309857841 | Accepted | x = int(input())
ans = 1
for b in range(2,int(x**0.5)+1):
for p in range(2,10):
c = b**p
if c > x:
break
ans = max(ans,c)
print(ans) |
p03352 | s285082421 | Accepted | X = int(input())
cand = [1]
for i in range(2, X+1):
cnt = 0
x = X
while x:
x //= i
cnt += 1
if cnt > 2:
cand.append(i**(cnt-1))
print(max(cand)) |
p03352 | s434599222 | Accepted | x=int(input())
l=[1]
for i in range(2,int(x**0.5)+1):
j=1
while i**(j+1)<=x:
j+=1
l.append(i**j)
#print(l)
print(max(l)) |
p03352 | s842276243 | Accepted | X = int(input())
ans = 0
for b in range(2, 32):
for p in range(2, 32):
if b**p <= X:
ans = max(ans, b**p)
if X==1:
print(1)
else:
print(ans) |
p03352 | s177093786 | Accepted | import math
X = int(input())
sq = int(math.sqrt(X))
m = 1
for b in range(2, sq+1):
p = 2
tmp = b ** p
while tmp <= X:
m = max(tmp, m)
p += 1
tmp = b ** p
print(m)
|
p03352 | s205698278 | Accepted | x = int(input())
ans = 1
y = x**(1/2)
y = int(y)
for i in range(2,y+1):
j = 1
while j<=x:
ans = max(ans,j)
j*= i
print(ans) |
p03352 | s616481319 | Accepted | X = int(input())
lst = []
for i in range(1,101):
for j in range(2,11):
if i**j > 1000:
break
else:
lst.append(i**j)
for k in range(X):
if X - k in lst:
print(X-k)
break
|
p03352 | s451496918 | Accepted | x=int(input())
ans=1
for i in range(1,x):
for j in range(2,x):
if i**j>x:
break
ans=max(ans,i**j)
print(ans) |
p03352 | s264597418 | Accepted | import numpy as np
N = int(input())
expo = []
for i in range(1,10000):
if i == 1:
expo.append(i)
else:
for j in range(2,1000):
tmp = i**j
if tmp > N:
break
expo.append(tmp)
expo.sort()
expo = np.array(expo)
print(max(expo[expo<=N])) |
p03352 | s818927933 | Accepted | x=int(input())
ans=1
for i in range(1,1000+1):
for j in range(2,11):
if i**j<=x:
ans=max(ans,i**j)
print(ans) |
p03352 | s674907040 | Accepted | x = int(input())
a = [1,4,8,16,32,64,128,256,512,9,27,81,243,729,
25,125,625,36,216,49,343,100,1000,121,144,
169,196,225,289,324,361,400,441,484,529,576,
676,784,841,900,961]
b =[]
for num in a:
if x >= num:
b.append(num)
print(max(b)) |
p03352 | s038797112 | Accepted | X = int(input())
ans = 1
for i in range(1, X+1):
for j in range(2, X+1):
num = i ** j
if num > X:
break
if num >= ans:
ans = num
print(ans) |
p03352 | s853881657 | Accepted | x = int(input())
c = 1
for i in range(1,x):
for j in range(2,x):
if i**j <= x:
c = max(c, i**j)
else:break
print(c) |
p03352 | s334143458 | Accepted | n = int(input())
ans = 1
for i in range(2, int(n**0.5+1)):
tmp = i
while tmp <= n//i:
tmp *= i
ans = max(ans, tmp)
print(ans) |
p03352 | s813775334 | Accepted | x=int(input())
ans=0
for i in range(2,10):
for j in range(1,1001):
tmp=j**i
if tmp <=x:
ans=max(tmp,ans)
print(ans) |
p03352 | s276705538 | Accepted | # -*- coding: utf-8 -*-
x = int(input())
ans = 1
for i in range(x + 1):
for j in range(int(pow(x, 0.5)) + 1):
for k in range(int(pow(x, 0.5)) + 1):
if i == pow(j, k) and ans < i:
ans = i
print(ans)
|
p03352 | s011152466 | Accepted | x = int(input())
ans = 1
for i in range(2, x + 1):
j = 2
while i ** j <= x:
ans = max(ans, i ** j)
j += 1
print(ans)
|
p03352 | s752036340 | Accepted | X=int(input())
ans=0
for i in range(X+1):
if i*i<=X:
sum=i*i
for j in range(X):
if i**j>X:
break
sum=max(sum,i**j)
else:
break
ans=max(ans,sum)
print(ans) |
p03352 | s578842361 | Accepted | x = int(input())
ans = 0
for b in range(1, 32): # 1000**0.5より31
for p in range(2, 10): # log2(1000)より9
tmp = b**p
if tmp <= x and tmp >= ans:
ans = tmp
print(ans) |
p03352 | s884784333 | Accepted | x = int(input())
ans = 0
for b in range(1, 1001):
for p in range(2, 1001):
if b ** p > x:
break
ans = max(ans, b ** p)
print(ans) |
p03352 | s143867342 | Accepted | x=int(input())
ans=0
for i in range(1,32):
for j in range(2,11):
if pow(i,j)<=x:
ans=max(pow(i,j),ans)
print(ans) |
p03352 | s770363877 | Accepted | def main():
x = int(input())
ans = 1
for b in range(2,x):
p = 2
while True:
if b**p>x:
break
ans = max(ans,b**p)
p += 1
print(ans)
if __name__ == '__main__':
main()
|
p03352 | s251766877 | Accepted | a = int(input())
b = [1]
for i in range(2, 100):
for j in range(2,100):
b.append(i**j)
b.sort()
for i in range(1,len(b)):
if b[i] > a:
print(b[i-1])
break |
p03352 | s812846850 | Accepted | x=int(input())
ans=1
for i in range(1,1000+1):
for j in range(2,11):
if i**j<=x:
ans=max(ans,i**j)
print(ans) |
p03352 | s502639782 | Accepted | x = int(input())
ans = 1
for i in range(1,x+1):
for j in range(2,11):
if i**j <= x:
ans = max(ans,i**j)
else:
break
print(ans) |
p03352 | s034503138 | Accepted | X = int(input())
ans = 1
for b in range(1, X + 1):
for p in range(2, 11):
a = b ** p
if a <= X and ans < a:
ans = a
print(ans) |
p03352 | s477325432 | Accepted | X=int(input())
MAX=0
for i in range(1,int(X**.5)+3):
for j in range(2,10):
if i**j<=X:
if MAX < i**j:
MAX = i**j
else:
break
print(MAX) |
p03352 | s949593018 | Accepted | import math
X=int(input())
x=math.floor(math.sqrt(X))
l=list()
for i in range(1,x+1):
for n in range(1,7):
if i**n<=X and i**(n+1)>=X:
l.append(i**n)
print(max(l)) |
p03352 | s428495175 | Accepted | def Exponential(x):
ans = 0
if x == 1:
ans = 1
else:
for i in range(1, x + 1):
for w in range(2, x + 1):
if i ** w > x:
break
else:
ans = max(ans, i ** w)
return ans
def main():
x = int(input())
print(Exponential(x))
if __name__ == '__main__':
main() |
p03352 | s712325353 | Accepted | X = int(input())
l = [1]
for b in range(2,32):
p = 2
while b**p <= X:
l.append(b**p)
p +=1
print(max(l)) |
p03352 | s423332972 | Accepted | x = int(input())
ans = 0
for i in range(1,100):
for j in range(2,10):
if i**j <= x:
ans = max(ans,i**j)
print(ans)
|
p03352 | s532870981 | Accepted | x = int(input())
ans = 0
if x == 1 or x == 2 or x == 3:
print(1)
exit()
for i in range(2,33):
for k in range(2,10):
if k == 2 and i**k > x:
print(ans)
exit()
elif i**k <= x:
ans = max(i**k,ans) |
p03352 | s905746802 | Accepted | x = int(input())
maxi = 1
for i in range(2,35):
j = 2
while i**j<=x:
maxi = max(maxi,i**j)
j+=1
print(maxi) |
p03352 | s899589395 | Accepted | import math
x = int(input())
if x == 1 or x== 2 or x==3:
print(1)
exit()
s = math.floor(math.sqrt(x))
def l(k,p):
q = int(math.floor(math.log(p)/math.log(k)))
if k ** (1+q) <= p:
return(1+q)
else:
return(q)
ans = 0
for i in range(2,s+1):
ans = max(ans, i ** l(i,x))
if ans == x:
print(x)
exit()
print(ans)
|
p03352 | s235192149 | Accepted | x = int(input())
if x == 1000:
print(1000)
else :
for _ in range(1000):
if all(x**(1/i)!=int(x**(1/i)) for i in range(2, 100)):
x -= 1
else :
print(x)
break
|
p03352 | s506255086 | Accepted | x = int(input())
expo = [0]*(x+1)
expo[1] = 1
for i in range(2,x+1):
v = i*i
while v <= x:
expo[v] = 1
v *= i
for i in range(x,-1,-1):
if expo[i]:
print(i)
exit() |
p03352 | s976701222 | Accepted | from bisect import bisect_right
exps = [1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, 216, 225, 243, 256, 289, 324, 343, 361, 400, 441, 484, 512, 529, 576, 625, 676, 729, 784, 841,
900, 961, 1000]
print(exps[bisect_right(exps, int(input())) - 1]) |
p03352 | s513965074 | Accepted | x=int(input())
l=[]
if x==1:
print(1)
else:
for i in range(2,x+1):
for j in range(1,x+1):
y=j**i
if y<=x:
l.append(y)
elif y>x:
break
print(max(l)) |
p03352 | s306683796 | Accepted | X = int(input())
A = []
for i in range(1,X+1):
for j in range(2,100):
if i**j > X:
break
A.append(i**j)
print(max(A)) |
p03352 | s203558017 | Accepted | #!/usr/bin/env python3
def main():
x = int(input())
ans = 0
for b in range(1, 1000):
for p in range(2, 10):
if x >= b ** p:
ans = max(ans, b ** p)
print(ans)
if __name__ == "__main__":
main()
|
p03352 | s122095033 | Accepted | X=int(input())
a=2
temp=1
ans=1
l=[]
if X==1:
print(1)
exit()
else:
for i in range(2,41):
for j in range(2,11):
if i**j<=X:
l.append(i**j)
print(max(l)) |
p03352 | s238020849 | Accepted | from math import sqrt
x = int(input())
ans = 1
for i in range(2, int(sqrt(x)) + 1):
n = i * i
e = 2
while n <= x:
e += 1
n = pow(i, e)
ans = max(ans, pow(i, e - 1))
print(ans)
|
p03352 | s068597392 | Accepted | import sys
input = sys.stdin.readline
X = int(input())
res = 0
for b in range(1, 1000):
for p in range(2, 11):
if pow(b, p) <= X: res = max(res, pow(b, p))
print(res) |
p03352 | s912042247 | Accepted | n=int(input())
list=[]
for i in range(32):
for j in range(2,10):
ans=i**j
if ans<=n:
list.append(ans)
print(max(list))
|
p03352 | s697726064 | Accepted | import math
x = int(input())
ans = 1
for i in range(2, math.ceil(math.sqrt(x)) + 1):
y = i * i
while y <= x:
ans = max(ans, y)
y *= i
print(ans)
|
p03352 | s831465260 | Accepted | import sys
readline = sys.stdin.readline
import math
def main():
X = int(readline())
ans = 1
for b in range(1, math.floor(X**(1/2))+1):
for p in range(2, 11):
if b ** p <= X:
ans = max(ans, b ** p)
print(ans)
if __name__ == '__main__':
main() |
p03352 | s569980852 | Accepted | x = int(input())
ans = 1
for i in range(2, x+1):
tmp = i
flag = False
while tmp * i <= x:
flag = True
tmp *= i
if flag:
ans = max(ans, tmp)
print(ans)
|
p03352 | s823317785 | Accepted | x = int(input())
ans = []
for i in range(1,33):
for j in range(2,11):
if x >= i**j:
ans.append(i**j)
print(max(ans))
|
p03352 | s811678264 | Accepted | import math
X = int(input())
ans = 1
for i in range(int(math.sqrt(X))+1):
for j in range(int(math.sqrt(X))+1):
if i**j <= X and ans < i**j:
ans = i**j
print(ans) |
p03352 | s773708841 | Accepted | import sys
input = sys.stdin.readline
def main():
X = int(input())
ans = 1
for b in range(2, 32):
p = 2
while True:
y = b ** p
if y <= X:
if y > ans:
ans = y
p += 1
else:
break
print(ans)
if __name__ == "__main__":
main()
|
p03352 | s631267505 | Accepted | X=int(input())
ans=1
for i in range(2,32):
for j in range(2,10):
if i**j>ans and i**j<=X:
ans=i**j
print(ans)
|
p03352 | s287795500 | Accepted | x = int(input())
ans = 1
for i in range(2, int(x**0.5)+1):
p = 0
while i**p <= x:
if i**p > ans:
ans = i**p
p += 1
print(ans) |
p03352 | s679457872 | Accepted | X=int(input())
ans=1
for i in range(1,X+1):
for j in range(2,50):
for k in range(2,50):
if i==j**k:
ans=j**k
print(ans) |
p03352 | s208167285 | Accepted | import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
def main():
x = II()
if x == 1: print(1); exit(0)
b = 2; p = 2
maxv = 0
while True:
if b**2 > x: break
if b**p > x:
maxv = max(maxv, b**(p-1))
b += 1; p = 2
continue
p += 1
print(maxv)
if __name__ == '__main__':
main()
|
p03352 | s581473098 | Accepted | n=input()
l=len(n)
n=int(n)
ans=0
for i in range(2,7*l):
t=int(n**(1/i))
for j in range(3):
if (t+j)**i<=n:
ans=max((t+j)**i,ans)
print(ans)
|
p03352 | s187287990 | Accepted | x = int(input())
ans = 1
for i in range(2, 1000):
tmp = 2
while i**tmp <= x:
ans=max(ans, i**tmp)
tmp+=1
print(ans)
|
p03352 | s226125812 | Accepted | x = int(input())
maxv = 0
for i in range(1,100):
for j in range(2,100):
a = i ** j
a = max(a, i**j)
if i ** j <= x and maxv < a:
maxv = a
print(maxv) |
p03352 | s382653596 | Accepted | X=int(input())
a=[1]
for i in range(32):
for j in range(2,10):
if i**j > X:
break
a.append(i**j)
print(max(a)) |
p03352 | s773740995 | Accepted | def main():
x = int(input())
ans = 1
for i in range(2, int(x**0.5)+1):
n = 2
while i**n <= x:
n += 1
if ans < i**(n-1):
ans = i**(n-1)
print(ans)
if __name__ == "__main__":
main() |
p03352 | s221036306 | Accepted | X = int(input())
# Xは1000以下なので、pは2**10=1024より10まで探索すれば十分
# 同様にbは40程度まで考えれば十分
max_ex = 1
for p in range(2, 10):
for b in range(1, 40):
if max_ex < b**p <= X:
max_ex = b**p
print(max_ex) |
p03352 | s436352399 | Accepted | x = int(input())
ans = 1
for p in range(2, x+1):
for b in range(1, x+1):
if b**p <= x:
ans = max(ans, b**p)
else:
break
print(ans) |
p03352 | s640356921 | Accepted | import math
X = int(input())
dp = [[0] * 100 for _ in range(X + 1)]
maxint = 1
for i in range(2, int(math.sqrt(X)) + 1):
dp[i][1] = i
for j in range(2, 100):
dp[i][j] = dp[i][j - 1] * i
if dp[i][j] > X:
maxint = max(maxint, dp[i][j - 1])
break
print(maxint) |
p03352 | s498156579 | Accepted | x,l=int(input()),[0]*1001;l[1]=1
for i in range(2,x+1):
if l[i]==0:j=i*i
while 1:
if j>x:break
else:l[j]=1;j*=i
for i in range(x,-1,-1):
if l[i]==1:print(i);break |
p03352 | s992972150 | Accepted | from math import floor
x = int(input())
ans = 1
for i in range(2, floor(x ** 0.5) + 1):
temp = i ** 2
while temp * i <= x:
temp *= i
if temp > ans:
ans = temp
print(ans) |
p03352 | s363303432 | Accepted | x = int(input())
ans = 1
for b in range(1, x):
for p in range(2, x):
if b**p<=x:ans = max(ans, b**p)
else:break
print(ans)
|
p03352 | s323479182 | Accepted | X = int(input())
ans = 1
for b in range(1, X):
for p in range(2, X):
tmp = b ** p
if tmp > X:
break
if ans < tmp:
ans = tmp
print(ans) |
p03352 | s914536276 | Accepted | X=int(input())
ans=1
for a in range(2,33):
for b in range(2,11):
if a**b>X:
break
if a**b<=X and a**b>ans:
ans=a**b
print(ans) |
p03352 | s911061491 | Accepted | x = int(input())
ans = 1
for b in range(1,x):
for p in range(2,x):
a = b**p
if a == a // 1 and a > ans and a <= x:
ans = a
if a>x:
break
if a > x:
continue
print(ans)
|
p03352 | s311429286 | Accepted | X = int(input())
ans = 1
for i in range(2,int(X**0.5)+1):
cnt = 2
y = i**cnt
while y<=X:
ans = max(ans,y)
cnt +=1
y = y*i
print(ans) |
p03352 | s189602066 | Accepted | import math
x = int(input())
ans = 0
if x ==1:
print(1)
else:
for i in range(1,x//2):
for j in range(2,11):
tmp = i **j
if tmp <= x:
ans = max(ans,tmp)
print(ans) |
p03352 | s793098442 | Accepted | X = int(input())
ans = 1
for i in range(2,X+1):
for j in range(2,X):
if i**j <= X:
ans = max(ans,i**j)
else:
break
print(ans) |
p03352 | s912468210 | Accepted | x=int(input())
ans=0
for i in range(1,35):
for j in range(2,10):
t=i**j
if t<=x:
ans=max(ans,t)
print(ans)
|
p03352 | s110530785 | Accepted | X = int(input())
ans = 1
for i in range(2,int(X**0.5)+1):
tmp = 1
while tmp * i <= X:
tmp *= i
ans = max(ans,tmp)
print(ans) |
p03352 | s224952316 | Accepted | # coding: utf-8
# Your code here!
cand=[0,1]
for i in range(2,32):
temp=i
while True:
temp*=i
if temp<=1000:
cand.append(temp)
else:
break
cand.sort()
X=int(input())
if X==1000:
print(1000)
exit()
for i in range(1,len(cand)):
if X<cand[i]:
print(cand[i-1])
exit()
|
p03352 | s040222631 | Accepted | def resolve():
X = int(input())
ans = 1
for b in range(1000 + 1, 1, -1):
for p in range(2, 10 + 1):
if b ** p <= X:
ans = max(ans, b ** p)
print(ans)
resolve() |
p03352 | s390776316 | Accepted | N = int(input())
ans = []
for i in range(1,35):
for j in range(2,11):
if i**j <= N:
ans.append(i**j)
print(max(ans)) |
p03352 | s582586800 | Accepted | X = int(input())
p_m = 10
ans = 0
for i in range(2,int(X**0.5)+2):
for j in range(2,p_m):
if i**j <= X:
ans = max(ans, i**j)
if X == 1:
print(1)
else:
print(ans)
|
p03352 | s950341684 | Accepted | x=int(input())
ans=1
for b in range(x):
for p in range(2,x):
if b**p <= x:
ans=max(ans,b**p)
else:
break
print(ans) |
p03352 | s634644625 | Accepted | def main():
x = int(input())
limit = int(x**0.5)+2
ans = 0
for i in range(limit):
for j in range(2,limit):
p=i**j
if p <= x:
ans = max(ans, p)
else:
break
print(ans)
if __name__ == "__main__":
main() |
p03352 | s080030065 | Accepted | X = int(input())
num_list = []
for i in range(1, 33):
if i ** 2 > X:
break
for j in range(2, 11):
N = i ** j
if N > X:
break
else:
num_list.append(N)
print(sorted(set(num_list))[-1])
|
p03352 | s251967977 | Accepted | L = [0 for _ in range(1001)]
L[1] = 1
for i in range(2, 32):
base = i * i
while base <= 1000:
L[base] = 1
base *= i
X = int(input())
while L[X] == 0:
X -= 1
print(X) |
p03352 | s354723881 | Accepted | x = int(input())
beki = []
for b in range(1, 32):
for p in range(2, 10):
num = b**p
if num <= x:
beki.append(num)
beki = sorted(set(beki), reverse= True)
print(beki[0])
|
p03352 | s495633758 | Accepted | import math
x = int(input())
seen = [0] * 1001
ans = 1
for i in range(x):
if(seen[i]): pass
cur = i
if(i > 1):
while (cur <= x):
cur *= i
if(cur <= x): ans = max(ans, cur)
print(ans)
|
p03352 | s120635896 | Accepted | x = int(input())
ans = 0
for i in range(33):
for j in range(2,11):
if pow(i,j) > x: break
ans = max(ans,pow(i,j))
print(ans) |
p03352 | s409981454 | Accepted | import math
X=int(input())
max=0
for i in range(int(math.sqrt(X))):
num=i+1
j=0
while True:
buf=pow(num,j)
if buf>max:
max=buf
j=j+1
if (buf==pow(num,j))or(pow(num,j)>X):
break
print(max) |
p03352 | s398555283 | Accepted | x = int(input())
if x == 1:
print(1)
elif x == 1000:
print(1000)
else:
print(int(max(int((x ** (1 / i))) ** i for i in range(2, x + 1))))
|
p03352 | s057554049 | Accepted | import math
k=int(input())
kouho=1
for i in range(2,32):
for j in range(2,10):
a=i**j
if a>k:
break
if a>kouho:
kouho=a
print(kouho)
|
p03352 | s529195240 | Accepted | x=int(input())
maxim=0
for i in range(2,32):
for j in range(2,10):
temp=i**j
if temp<=x and maxim<temp:
maxim=temp
print(maxim if maxim>0 else 1) |
p03352 | s259768362 | Accepted | x=int(input())
ans=0
if x==1:
print(1)
exit()
for i in range(1,x):
for j in range(2,10):
if i**j<=x:
ans=max(ans,i**j)
else:
break
print(ans) |
p03352 | s478988230 | Accepted | x=int(input())
ans=1
for i in range(1,1000+1):
for j in range(2,11):
if i**j<=x:
ans=max(ans,i**j)
print(ans) |
p03352 | s077503492 | Accepted | n=(int)(input())
a=[1]
for i in range(2, n):
temp = i ** 2
while(temp <= n):
a.append(temp)
temp *= i
a = sorted(set(a))
#print(a)
print(list(i for i in a if i <= n)[-1]) |
p03352 | s302191466 | Accepted | x = int(input())
ans = [1]
for i in range(2, x):
b = i
p = 2
while b ** p <= x:
if b ** p <= x:
ans.append(b ** p)
p += 1
print(max(ans)) |
p03352 | s955788835 | Accepted | import math
x=int(input())
if x<4:
print(1)
else:
buf=0
while buf==0 and x>1:
r=int(math.sqrt(x))
for i in range(2,r+1):
ans=1
while ans<x:
ans*=i
if ans==x:
buf=1
break
if buf==0:
x-=1
print(x) |
p03352 | s388470367 | Accepted | X = int(input())
ans = 0
for i in range(2, 9 + 1):
for j in range(1, 1000 + 1):
ans_ = j ** i
ans = max(ans, ans_) if ans_ <= X else ans
print(ans) |
p03352 | s909508179 | Accepted | x = int(input())
ans = 1
for b in range(1, x):
for p in range(2, x):
tmp_ans = b ** p
if tmp_ans > x:
break
ans = max(ans, tmp_ans)
print(ans)
|
p03352 | s440566164 | Accepted | x=int(input())
ans=1
for a in range(2,1000):
p=2
while a**p<=x:
ans=max(ans,a**p)
p+=1
print(ans)
|
p03352 | s994578692 | Accepted | for i in range(1,int(input())+1)[::-1]:
for j in range(2,int(i**(1/2))+1):
if i%j==0:
temp=i
while temp%j==0:
temp//=j
if temp==1:print(i);exit()
print(1)
|
p03352 | s805590066 | Accepted | x = int(input())
ans = 1
for i in range(1, 36):
for j in range(2, 10):
if i**j <= x:
ans = max(ans, i**j)
else:
break
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.