problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03352 | s009978459 | Accepted | n = int(input())
max_ = 1
for i in range(2, n):
k = i
c = 1
while k <= n:
k *= i
c += 1
if c > 2:
max_ = max(max_, k//i)
print(max_) |
p03352 | s818162476 | Accepted | x=int(input())
n=2
for i in range(x,1,-1):
for j in range(2,x):
if i<j:
break
n=2
while j**n<=i:
if j**n==i:
print(i)
exit()
n+=1
print(x)
|
p03352 | s212650206 | Accepted | x = int(input())
ans = 1
for b in range(2,32):
p = 2
while b**p <= x:
ans = max(ans, b**p)
p += 1
print(ans) |
p03352 | s725252306 | Accepted | #import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pri = lambda x: print(*x, sep='\n')
X = int(input())
res = 1
for i in range(2, X):
if X < i:
break
for j in range(2, 10):
val = pow(i, j)
if X < val:
break
if res < val:
res = val
print(res) |
p03352 | s136958237 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
X = int(readline())
if X <= 3:
print(1)
return
ans = 0
for n in range(2, X):
p = 2
while pow(n, p) <= X:
if ans < pow(n, p):
ans = pow(n, p)
p += 1
print(ans)
return
if __name__ == '__main__':
main()
|
p03352 | s209836598 | Accepted | N = int(input())
ans = 0
for i in range(1,35):
for k in range(2,10):
if i**k <= N and i**k >= ans:
ans = i**k
print(ans) |
p03352 | s359308026 | Accepted | N = int(input())
ans = 0
for i in range(1, N + 1):
for j in range(2, 20):
if i ** j > N:
continue
ans = max(i ** j, ans)
print(ans)
|
p03352 | s023141917 | Accepted | import sys
input = sys.stdin.readline
X = int(input())
ans = [1]
for i in range(2, 1 + int(X ** (1/2))):
ans.append(i)
x = i
while x < X:
x *= i
if x <= X:
ans.append(x)
print(max(ans)) |
p03352 | s762864513 | Accepted | pow = [1]
for p in range(2,32):
i=2
while p**i<=1000:
pow.append(p**i)
i += 1
#print(pow)
X = int(input())
x = X
while x>0:
if x in pow:
ans = x
break
x -= 1
print(ans) |
p03352 | s900955377 | Accepted | x=int(input())
m=-1000
if 1<=x<=3:
print(1)
exit()
else:
for b in range(2,x+1):
for p in range(2,11):
if x>=b**p:
m=max(m,b**p)
print(m)
|
p03352 | s148733511 | Accepted | x = int(input())
res = []
for i in range(1, 33):
for j in range(2, 10):
cand = i ** j
if x >= cand:
res.append(cand)
res = sorted(res)
print(res[-1]) |
p03352 | s022115244 | Accepted | X = int(input())
maxnum = 0
for i in range(1, X+1):
for j in range(2, X+2):
if i**j > X:
break
maxnum = max(maxnum, i**j)
print(maxnum) |
p03352 | s263740749 | Accepted | X = int(input())
se = set(n**e for n in range(32) for e in range(2,11) if n**e <= X)
answer = max(se)
print(answer)
|
p03352 | s471092222 | Accepted | p = []
p.extend([i ** 2 for i in range(int(1000**(1/2)) + 1)])
p.extend([i ** 3 for i in range(int(1000**(1/3)) + 1)])
p.extend([i ** 5 for i in range(int(1000**(1/5)) + 1)])
p.extend([i ** 7 for i in range(int(1000**(1/7)) + 1)])
p.sort()
p.append(1000)
p.append(1001)
N = int(input())
for j in range(len(p) - 1):
if p[j] <= N < p[j + 1]:
print(p[j]) |
p03352 | s473028968 | Accepted | X=int(input())
M=1
for b in range(2,X+1):
if b*b<=X:
a=b*b
while a*b<=X:
a*=b
M=max(M,a)
print(M)
|
p03352 | s010056223 | Accepted | import itertools
import sys
input = sys.stdin.readline
X = int(input())
ans = 1
for b in range(2, X+1):
for i in itertools.count(2):
bp = b ** i
# print(bp)
if bp <= X:
ans = max(ans, bp)
else:
break
print(ans)
|
p03352 | s240307795 | Accepted | x = int(input())
lst = [i**2 for i in range(1,32)]+[8,27,125,216,343,512,1000]+[32,243]+[128]+[1001]
lst.sort()
for i in range(len(lst)):
if lst[i]<=x<lst[i+1]:
print(lst[i]) |
p03352 | s290571715 | Accepted | r = range(1,32)
x = int(input())
print(max(b**p for p in r[1:] for b in r if b**p <= x)) |
p03352 | s907838403 | Accepted | import sys
inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())
x = inint()
ans = 0
for i in range(1,33):
for j in range(2,10):
if ans < i**j <= x:
ans = i**j
print(ans)
|
p03352 | s233025681 | Accepted | x = int(input())
ans = 0
for a in range(2,x):
for b in range(2,10):
if a**b <= x:
ans = max(ans,a**b)
#print(a,b)
if x == 1:
print(1)
exit()
print(ans) |
p03352 | s234091030 | Accepted | a = int(input())
m = 1
for i in range(a//2+1):
for j in range(1,10):
if a>=i**j and m <i**j:
m = i**j
if a < i**j:
break
print(m)
|
p03352 | s659839990 | Accepted | x = int(input())
if x == 1:
print(1)
exit()
for i in reversed(range(1, x + 1)):
for j in range(2, 101):
for k in range(2, 101):
number = j ** k
if number == i:
print(i)
exit()
|
p03352 | s822952953 | Accepted | x = int(input())
ans = 0
for i in range(x):
for j in range(2,10):
if i**j <= x:
ans = max(ans,i**j)
#print(ans,i,j)
else:
break
if ans == 0:
ans = 1
print(ans) |
p03352 | s634826894 | Accepted | X = int(input())
upper = int(X**0.5//1)+1
max = 0
for x in range(1,upper):
for i in range(9):
if max < x**(i+1) <= X:
max = x ** (i+1)
print(max) |
p03352 | s987552515 | Accepted | #B - Exponential
import math
X = int(input())
def expo(x):
ans = 1
for i in reversed(range(1,x+1)):
for j in range(int(math.sqrt(x))+1):
for k in range(2,int(math.sqrt(x))):
if i == j**k:
ans = i
return ans
return ans
print(expo(X)) |
p03352 | s277147097 | Accepted | import math
X = int(input())
if X == 1:
print(1)
exit()
for i in reversed(range(1, X+1)):
for j in range(2, int(math.sqrt(i))+1):
if abs(math.log(i, j) - round(math.log(i, j))) <= 0.0000001:
print(i)
exit()
if i == 1:
print(1)
|
p03352 | s697232755 | Accepted | X = int(input())
b = 2
p = 2
ans = 1
for b in range(1, X+1):
for p in range(2, X+1):
beki = b ** p
if beki <= X:
ans = max(ans, beki)
else:
break
print(ans)
|
p03352 | s717485512 | 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 # b**pがx以上は計算を省く
print(c)
|
p03352 | s678625215 | 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 | s585547572 | Accepted | x=int(input())
a=1
for i in range(2,x):
j=2
while i**j<=x:
a=max(a,i**j)
j+=1
print(a) |
p03352 | s855388543 | Accepted | X = int(input())
ans = []
ans.append(1)
for i in range(2, X):
a = i*i
while a <= X:
ans.append(a)
a *= i
print(max(ans))
|
p03352 | s952824921 | Accepted | x=int(input())
ans=1
for i in range(1, x):
for j in range(2, x):
if i**j<=x : ans=max(ans, i**j)
else: break
print(ans) |
p03352 | s246727112 | Accepted | X = int(input())
res = 1
for i in range(2,32):
p = 2
while i**p <= X:
if res < i**p:
res = i**p
p += 1
print(res) |
p03352 | s627728301 | Accepted | x = int(input())
a = []
for i in range(1,33):
for j in range(2,9):
tmp = i**j
if tmp <= x:
a.append(tmp)
print(max(a)) |
p03352 | s783395979 | Accepted | n = int(input())
s = set()
for i in range(1, 32):
s.add(i ** 2)
for i in range(1, 11):
s.add(i ** 3)
for i in range(1, 7):
s.add(i ** 4)
for i in range(1, 5):
s.add(i ** 5)
s.add(i ** 6)
s.add(i ** 7)
s.add(i ** 8)
s.add(i ** 9)
s.add(i ** 10)
t = list(s)
t.sort()
t = [x for x in t if x <= 1000]
res = 0
for tt in t:
res = tt if tt <= n else res
print(res) |
p03352 | s168315349 | Accepted | X = int(input())
ans = 1
for i in range(1,X+1):
for j in range(2,X+1):
if i**j <= X:
ans = max(ans,i**j)
else:
break
print(ans)
|
p03352 | s936563187 | Accepted | x=int(input())
li=[]
for i in range(32):
for j in range(2,6):
if pow(i,j)<=x:
li.append(pow(i,j))
print(max(li)) |
p03352 | s394868383 | Accepted | import math
x = int(input())
ans = 1
for i in range(2, int(x ** 0.5) + 1):
p = 1
while i ** p <= x:
p += 1
ans = max(ans, i ** (p - 1))
print(ans) |
p03352 | s161538588 | Accepted | x=int(input())
def pow(b,x):
res=b
while True:
if res*b<=x:
res=res*b
else:
break
return res
ans=1
for i in range(2,x+1):
if i**2<=x:
ans=max(ans,pow(i,x))
print(ans) |
p03352 | s194203721 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
x=int(input())
ans=0
for i in range(1,33):
for j in range(2,11):
y=i**j
if y<x:
ans=max(y,ans)
elif y==x:
ans=max(y,ans)
break
else:
break
print(ans)
resolve()
|
p03352 | s151219209 | Accepted | N = int(input())
li = []
for i in range(1,100):
for j in range(2,20):
if i**j<=10000:
li.append(i**j)
li2 = list(set(li))
li2.sort()
ans = 0
for k in range(len(li2)):
if (li2[k-1]<=N)&(li2[k]>N):
ans = li2[k-1]
print(ans) |
p03352 | s176455516 | Accepted | X=int(input())
a=[]
for i in range(32):
for j in range(2,10):
if i**j<= 1000:
a.append(i**j)
continue
break
for i in sorted(list(set(a)))[::-1]:
if i <= X:
print(i)
break |
p03352 | s041911681 | Accepted | X = int(input())
ans = 1
i = 2
while i * i <= X:
j = 1
maxi = i
while i ** j <= X:
maxi = i ** j
j += 1
ans = max(ans, maxi)
i += 1
print(ans) |
p03352 | s711945423 | Accepted | x = int(input())
tmp = 1
for b in range(1, x):
for p in range(2,x):
if b**p <= x:
tmp = max(tmp, b**p)
else:
break
print(tmp)
|
p03352 | s992204891 | Accepted | X = int(input())
lst=[1]
for p in range(2,10):
i=2
while i ** p <= X:
lst.append(i ** p)
i+=1
#print(lst)
print(max(lst)) |
p03352 | s326305710 | Accepted | n=int(input())
ans=0
if n==1:
print(1)
exit()
for i in range(n):
for j in range(2,11):
if i**j<=n:
ans=max(ans,i**j)
print(ans) |
p03352 | s777145329 | Accepted | x=int(input())
i=1
mx=i
while(i**2<x):
i+=1
j=2
while(i**j<=x):
j+=1
if i**(j-1)>mx:
mx=i**(j-1)
print(mx) |
p03352 | s036576942 | Accepted | def main():
X = int(input())
maxi = 1
if X <= 2:
print(1)
return
for b in range(2, X):
for p in range(2, X):
if b**p > X:
break
else:
maxi = max(maxi, b**p)
print(maxi)
main() |
p03352 | s220961342 | Accepted | def m_pow(x, n) -> int:
"""
O(log n)
"""
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K *= x
x *= x
n //= 2
return (K * x)
ans = 1
x = int(input())
for i in range(2, 1001):
for j in range(2, 1001):
n = m_pow(i, j)
if n <= x:
ans = max(n, ans)
else:
break
print(ans)
|
p03352 | s901205762 | Accepted | def is_prime(n):
if n <= 1:
return False
for i in range(2, n):
if n % i == 0:
return False
return True
X = int(input())
lis = [i for i in range(1,34)]
num = []
for i in lis:
for j in range(2, 11):
if i**j <= X:
num.append(i**j)
print(max(num)) |
p03352 | s222878616 | Accepted | x = int(input())
if x == 1:
print(1)
exit()
ans = 0
for n in range(2, x):
i = 2
while n ** i <= x:
ans = max(ans, n ** i)
i += 1
print(ans) |
p03352 | s368755543 | Accepted | x = int(input())
bekijo = 1
for i in range(2,x+1):
for j in range(2,x+1):
if i ** j > x: break
bekijo = max(bekijo, i**j)
print(bekijo) |
p03352 | s449317713 | Accepted | X = int(input())
ans = 0
for i in range(1,int(X**0.5)+1):
tmp = 0
for j in range(2,11):
y = i**j
if y > X:
break
tmp = max(y,tmp)
ans = max(tmp,ans)
print(ans) |
p03352 | s146132271 | Accepted | x = int(input())
ans = 0
for i in range(1,32):
for j in range(2,10):
if i**j <= x:
ans = max(ans,i**j)
print(ans) |
p03352 | s362314520 | Accepted | x = int(input())
lst = []
for i in range(1,101):
for j in range(2,10):
lst.append(i**j)
lst.sort(reverse=True)
for n in lst:
if n <= x:
print(n)
break |
p03352 | s360110184 | Accepted | X = int(input())
if X < 4:
print(1)
exit()
ans = 1
for x in range(2,X-1):
for p in range(2,X-1):
if(x**p > X): break
ans = max(ans, x**p)
print(ans) |
p03352 | s474309697 | Accepted | x = int(input())
ans = 1
for i in range(x):
for j in range(2, x):
if x < i**j: break
else: ans = max(ans, i**j)
print(ans) |
p03352 | s870526844 | Accepted | import math
n = int(input())
ans = [1]
b = int(math.sqrt(n))
if b >= 2:
for i in range(2,b+1):
temp = i
while True:
temp*=i
if temp <= n:
ans.append(temp)
else:
break
print(max(ans))
|
p03352 | s261777361 | 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 | s008636194 | Accepted | x = int(input())
s = []
for p in range(2, 11):
for b in range(1, 1001):
if b ** p <= x:
s.append(b ** p)
else:
break
print(sorted(s)[-1])
|
p03352 | s845844564 | Accepted | X = int(input())
max_v = 1
b = 2
for i in range(2, X):
b =i
for j in range(2,X):
p = j
if b**p > max_v and b**p <= X:
#print(b, p)
max_v = b**p
elif b**p > X:
break
print(max_v) |
p03352 | s960380692 | Accepted | import sys
X = int(input())
L = []
for i in range(1,32):
for j in range(1,10):
if X < i**j:
if j != 2:
L.append(i**(j-1))
break
break
elif X == i**j and j != 1:
print(i**j)
sys.exit(0) #平方数忘れ
print(max(L)) |
p03352 | s658972490 | Accepted | X=int(input())
ans=1
for b in range(2,32):
for p in range(2,10):
if b**p>X:
break
else:
if ans<b**p:
ans=b**p
print(ans) |
p03352 | s069305917 | Accepted | X = int(input())
X_half = X // 2
max_ans = 1
tmp_max = 0
for i in range(1,X_half+10):
for j in range(2,X_half+10):
tmp = i ** j
if tmp<=X:
tmp_max = tmp
max_ans = max(max_ans, tmp_max)
print(max_ans)
|
p03352 | s336930320 | Accepted | X = int(input())
ans = 0
for i in range(1,500):
for j in range(2,10):
if i**j<=X:
ans = max([ans, i**j])
else:
break
print(ans) |
p03352 | s773838026 | Accepted | x=int(input())
ans=[1]
for i in range(2,x+1):
k=2
while True:
a=i**k
if a<=x:
ans.append(a)
k+=1
else:
break
print(max(ans)) |
p03352 | s925008806 | Accepted | import bisect
X=int(input())
s=set()
for i in range(1,1000):
for j in range(2,11):
if(i**j<=X):
s.add(i**j)
else:
break
li=sorted(s)
print(li[bisect.bisect_right(li,X)-1]) |
p03352 | s459673409 | Accepted | import sys
input = sys.stdin.readline
x = int(input())
ans = 1
for i in range(2, x + 1):
j = i
while True:
j *= i
if j > x:
if abs(x - ans) >= abs(x - j//i) and j//i != i:
ans = j//i
break
print(ans) |
p03352 | s123671846 | Accepted | #素因数分解して列挙する関数、約数列挙ではない！
from collections import Counter
def factorize(n):
b = 2
fct = []
while b * b <= n:
while n % b == 0:
n //= b
fct.append(b)
b = b + 1
if n > 1:
fct.append(n)
f = Counter(fct).values()
if 1 not in f and len(set(f))==1:
return True
return False
X = int(input())
for i in range(X,0,-1):
f = factorize(i)
if f==True or i==1:
print(i)
break |
p03352 | s404489172 | Accepted | x = int(input())
if x <= 3:
print(1)
exit()
res = 0
for i in range(2, 33):
for j in range(2, 12):
a = i ** j
if a <= x:
res = max(res, a)
print(res) |
p03352 | s253872198 | Accepted | import math
x=int(input())
if x==1:
print(1)
exit()
ans = 0
for i in range(2,math.ceil(x**(0.5))):
j=2
tmp = i**j
while tmp<=x:
ans = max(ans, tmp)
j+=1
tmp = i**j
print(ans) |
p03352 | s162846376 | Accepted | #!/usr/bin/env python3
x = int(input())
ans = 1
for i in range(2,int(x**1/2) + 1):
p = 2
while True:
if i**p > x: break
else:
ans = max(ans,i**p)
p += 1
print(ans) |
p03352 | s879375059 | Accepted | x = int(input())
ans = 0
for i in range(1, 100):
for j in range(2, 100):
y = pow(i, j)
if y <= x:
ans = max(ans, y)
print(ans)
|
p03352 | s865000475 | Accepted | x = int(input())
if x ==1:
print(1)
else:
ans = []
for i in range(1, x):
for j in range(2, x//i):
if i**j>x:
break
else:
ans.append(i**j)
print(max(ans)) |
p03352 | s434314122 | Accepted | X=int(input())
ans=0
for b in range(1,33):
for p in range(2,11):
if b**p<=X:
ans=max(b**p,ans)
print(ans) |
p03352 | s929175525 | Accepted | n=int(input())
ans=int(1)
for i in range(1,n):
for j in range(2,10):
if ans<=pow(i,j)<=n:
ans=pow(i,j)
print(ans) |
p03352 | s764320733 | Accepted | x = int(input())
li = [1]
for i in range(2,32):
cnt = 2
while i**cnt<=x:
li += [i**cnt]
cnt +=1
print(max(li)) |
p03352 | s027001761 | Accepted | x = int(input())
r = 1
for b in range(1, int(x**0.5 + 1)):
for p in range(2, 11):
if b**p > x:
break
r = max(r, b**p)
print(r) |
p03352 | s952340526 | Accepted | x = int(input())
ans = 1
for i in range(1,int(x**0.5)+1):
for j in range(2,x//2 + 1):
if x >= i**j:
ans = max(i**j, ans)
print(ans) |
p03352 | s361989825 | Accepted | X = int(input())
max_expo = 1
for p in range(2,10):
for b in range(X):
if max_expo < (b**p) <= X:
max_expo = (b**p)
print(max_expo) |
p03352 | s137391028 | Accepted | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import collections
x = int(input())
li = [1]
b = 2
for b in range(1,x+1):
for p in range(2,11):
if b**p<=x:
li.append(b**p)
print(max(li)) |
p03352 | s604219930 | Accepted | X = int(input())
cmax = 1
for i in range(2,int(X**0.5)+1):
k = 2
while i**k<=X:
cmax = max(cmax,i**k)
k += 1
print(cmax) |
p03352 | s913151853 | Accepted | ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
x = ni()
num = 1
for i in range(100):
for j in range(2,10):
if i**j <= x:
num = max(num,i**j)
print(num) |
p03352 | s304426734 | Accepted | import math
X = int(input())
bp = {b**p for b in range(1,int(math.sqrt(X))+1) for p in range(2,10) if b**p <= X}
print(max(bp)) |
p03352 | s499016222 | Accepted | x = int(input())
ans = 0
for i in range(1, x + 1):
for j in range(2, x + 2):
if i ** j <= x:
ans = max(ans, i ** j)
else:
break
print(ans) |
p03352 | s823690820 | Accepted | import math
x = int(input())
maximum = 1
for i in range(2, math.ceil(x**0.5)):
for j in range(1, 12):
if(maximum < i**j <= x):
maximum = i**j
print(maximum) |
p03352 | s473462117 | Accepted | x = int(input())
ans = 0
if x == 1:
print(1)
exit(0)
for b in range(1,x+1):
for p in range(2,x):
if b**p <=x:
ans = max(ans,b**p)
else:break
print(ans) |
p03352 | s841145724 | Accepted | x = int(input())
ans = 0
for i in range(1, 100):
if i**2 > x:
ans = (i - 1)**2
break
for i in range(1, 100):
if i**3 > x:
ans = max(ans, (i - 1)**3)
break
for i in range(1, 100):
if i**5 > x:
ans = max(ans, (i - 1)**5)
break
for i in range(1, 100):
if i**7 > x:
ans = max(ans, (i - 1)**7)
break
print(ans) |
p03352 | s813056632 | Accepted | ls = [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,1020]
X = int(input())
for i in range(len(ls)):
if X<ls[i]:
print(ls[i-1])
break
|
p03352 | s879883716 | Accepted | x = int(input())
ex = [0 for i in range(1001)]
ex[1] = 1
for i in range(2, 1001):
tmp = i * i
while tmp <= 1000:
ex[tmp] = 1
tmp *= i
for i in range(x, 0, -1):
if ex[i] == 1:
print(i)
break
|
p03352 | s412421031 | Accepted | X = int(input())
ans = 1
for i in range(2, X + 1):
for j in range(2, X + 1):
a = i ** j
if a > X:
break
elif a > ans:
ans = a
print(ans) |
p03352 | s192154072 | Accepted | def main():
X = int(input())
ans = [1]
for b in range(1, 32):
for p in range(2, 10):
if b ** p <= X:
ans.append(b**p)
ans.sort()
print(ans[-1])
if __name__ == "__main__":
main()
|
p03352 | s942769228 | Accepted | X = int(input())
maxi = 0
if X < 4:
print(1)
exit()
for i in range(1, X+1):
for j in range(2, X+1):
if i**j <= X and i**j >= maxi:
maxi = i**j
if i**j > X:
break
print(maxi) |
p03352 | s436728490 | Accepted | X = int(input())
ans = 1
i = 2
while i * i <= X:
a = i
while a * i <= X:
a *= i
ans = max(ans, a)
i += 1
print(ans) |
p03352 | s375565422 | Accepted | import math
x=int(input())
lis=[1]
for i in range(2,math.ceil(math.sqrt(x))):
n=i*i
while n<=x:
lis.append(n)
n*=i
print(max(lis)) |
p03352 | s502606292 | Accepted |
x = int(input())
bekis = set()
bekis.add(1)
ans = 1
for b in range(2,35):
for p in range(2,11):
num = pow(b,p)
if num <= x:
ans = max(ans,num)
else:
break
print(ans) |
p03352 | s115062516 | Accepted | import sys
x = int(input())
ans = 0
for i in reversed(range(1, x + 1)):
for j in reversed(range(2, x+1)):
if i % j != 0:
continue
w = i // j
p = 1
while w % j == 0:
w //= j
p += 1
if w == 1 and p >= 2:
print(i)
sys.exit()
print(1)
|
p03352 | s404559137 | Accepted | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
x = ni()
ans = 0
for i in range(100):
for j in range(2,11):
p = i**j
if p <= x:
ans = max(ans, p)
else:
continue
print(ans) |
p03352 | s147457673 | Accepted | x=int(input())
ans=1
for i in range(34,1,-1):
cur=i
while cur<=x:
cur*=i
if cur<=x:
ans=max(ans,cur)
print(ans)
|
p03352 | s595930916 | Accepted | import math
X=int(input())
A=[1]
for b in range(2,32):
for p in range(2,10):
if b**p>X:
break
elif b**p not in A:
A.append(b**p)
print(max(A))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.