problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03352 | s946877918 | Accepted | X = int(input())
max_num = 1
for bosuu in range(1, 50):
for sisuu in range(2, 11):
num = bosuu ** sisuu
if (num <= X):
max_num = max(max_num, num)
else:
break
print(max_num)
|
p03352 | s411426905 | Accepted | X=int(input())
ans=1
for i in range(1,X):
for j in range(2,10):
if i**j<=X:
ans=max(ans,i**j)
print(ans) |
p03352 | s497204022 | Accepted | X=int(input())
if X==1:
print(1)
exit()
ans=1
for i in range(2,11):
for j in range(1001):
if j**i<=X:
if ans<j**i:
ans=j**i
print(ans) |
p03352 | s646976457 | Accepted |
def myAnswer(X:int) -> int:
numbers = [i for i in range(2,X+1)]
ans = 1
for p in numbers:
i = 2
while True:
if(p**i <= X):
ans = max(p**i,ans)
i += 1
else:
break
return ans
def modelAnswer():
tmp=1
def main():
X = int(input())
print(myAnswer(X))
if __name__ == '__main__':
main() |
p03352 | s202791655 | Accepted | N = int(input())
ans = 0
if N <= 3:
print(N)
exit(0)
for i in range(2, 33):
for j in range(2, 11):
t = i ** j
if t <= N:
ans = max(ans, t)
print(ans)
|
p03352 | s810798952 | Accepted | from math import sqrt
x = int(input())
l = []
for i in range(1, x + 1):
for j in range(1, int(sqrt(i)) +1):
for k in range(2, 10):
if j ** k == i:
l.append(i)
print(max(l)) |
p03352 | s189436473 | Accepted | X = int(input())
ans = 1
for b in range(2, X + 1):
p = 2
while True:
res = b ** p
if (res > X):
break
else:
p += 1
ans = max(ans, res)
print(ans)
|
p03352 | s701862684 | Accepted | X=int(input())
ans = 0
for i in range(1,101):
for j in range(2,11):
if ans < pow(i,j) <=X:
ans = pow(i,j)
print(ans) |
p03352 | s966833422 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import bisect
def main():
X = int(input())
result = []
for i in range(1, 33):
result += [i ** j for j in range(2, 10)]
result.sort()
index = bisect.bisect_right(result, X)
print(result[index - 1])
if __name__ == "__main__":
main()
|
p03352 | s789308141 | 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 | s716231730 | 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 | s175049529 | Accepted | X = int(input())
A = [1]
for i in range(2, 40):
j = 2
while(1):
if i**j > X: break
A.append(i**j)
j += 1
print(max(A))
|
p03352 | s262525412 | Accepted | x = int(input())
ans = 1
for i in range(2, x+1):
a = i*i # a^2
while a <= x:
ans = max(ans, a)
a *= i # a^{2<n}
print(ans)
|
p03352 | s929097628 | Accepted | X = int(input())
ans = []
for i in range(1, 1000):
for j in range(2, 11):
if i**j > X:
continue
ans.append(i**j)
print(max(ans))
|
p03352 | s321784625 | Accepted | x = int(input())
ans = 1
for i in range(1,x):
for j in range(2,50):
if i**j<=x:
ans = max(ans,i**j)
else:
break
if i**2>x:
break
print(ans) |
p03352 | s774946004 | Accepted | from math import *
x = int(input())
lst1 = list(range(2, int(sqrt(1000)) + 1))
lst2 = [1, 1000]
for n in lst1:
i = 2
while n ** i < 1000:
lst2.append(n ** i)
i += 1
lst2 = list(set(lst2))
lst2.sort()
for i in range(len(lst2)):
if x < lst2[i]:
print(lst2[i - 1])
exit()
print(lst2[-1]) |
p03352 | s906714641 | Accepted | import sys
import math
import bisect
def main():
A = []
for i in range(1, 33):
for j in range(2, 11):
val = i ** j
if val <= 1200:
A.append(val)
else:
break
A.sort()
x = int(input())
p = bisect.bisect_right(A, x)
print(A[p-1])
if __name__ == "__main__":
main()
|
p03352 | s333150730 | Accepted | import math
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 | s570876206 | 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 | s220618036 | 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 | s282738693 | Accepted | x = int(input())
ans = 1
for i in range(1, x + 1):
for j in range(2, 32):
for k in range(2 , 10):
if i == j ** k:
ans = i
print(ans) |
p03352 | s314632273 | Accepted | x=int(input())
ans=1
for i in range(2,10):
for j in range(1,33):
if j**i>ans and j**i<=x:
ans=j**i
print(ans) |
p03352 | s365081629 | Accepted | import math
x = int(input())
ans = [1]
s = int(math.sqrt(x))
if s >= 2:
for i in range(2,s+1):
temp = i
while True:
temp *= i
if temp <= x:
ans.append(temp)
else:
break
print(max(ans)) |
p03352 | s956732046 | Accepted | x = int(input())
if x == 1:
print("1")
exit(0)
ans = 1
for b in range(2, 1000 + 1):
for p in range(2, 10+1):
bp = b**p
if bp <= x:
ans = max(ans, bp)
print(ans)
|
p03352 | s231332120 | Accepted | x = int(input())
y = 0
if x==1 or x==2 or x==3 or x==4:
print(1)
exit()
else:
for a in range(2,(x+1)):
for b in range (2,10):
if b==2 and a**b>x:
print(y)
exit()
elif a**b<=x:
y=max(a**b,y)
|
p03352 | s670406944 | Accepted | X=int(input())
n=1
for b in range(2,X):
p=2
while(True):
x=b**p
if x<=X:
n=max(x,n)
p+=1
else:
break
print(n) |
p03352 | s985721440 | Accepted | X = int(input())
count = [1]
for x in range (2,50):
for y in range (2,10):
if x ** y <= X:
count.append(x ** y)
print(max(count)) |
p03352 | s889882091 | Accepted | # coding:utf-8
import math
x = int(input())
num = math.floor(x ** 0.5)
ans = 1
for i in range(1, num + 1):
for j in range(2, x):
if i ** j > x:
break
if i ** j > ans:
ans = i ** j
print(ans)
|
p03352 | s777392322 | Accepted | x = int(input())
ans = 1000000
for b in range(1,32):
for p in range(2,10):
if x-b**p < 0:
continue
ans = min(ans,abs(x-(b**p)))
print(x-ans)
|
p03352 | s952763004 | Accepted | X = int(input())
max_num = 1
for i in range(1, X + 1):
for j in range(2, X + 1):
num = i ** j
if num <= X:
if num > max_num:
max_num = num
else:
break
print(max_num) |
p03352 | s028026216 | Accepted | x = int(input())
ans = 1
for i in range(2, int(x**(1/2)//1+1)):
v = 1
while v*i <= x:
v *= i
ans = max(ans, v)
print(ans) |
p03352 | s468438663 | Accepted | X=int(input())
a=1
b=2
p=2
while b<=int(X**.5):
if b**p<=X:
a=max(a,b**p)
p+=1
else:
b+=1
p=2
print(a)
|
p03352 | s469125190 | Accepted | x=int(input())
ans=1
for num in range(2,x+1):
k=x
cnt=0
while k>=num:
k//=num
cnt+=1
if cnt>=2:
ans=max(ans,pow(num,cnt))
print(ans) |
p03352 | s937706702 | Accepted | X = int(input())
if X == 1:
print(1)
exit()
b = 2
ans = 0
while b ** 2 <= X:
p = 2
while b ** p <= X:
p += 1
ans = max(ans, b ** (p-1))
b += 1
print(ans) |
p03352 | s750777368 | Accepted | X=int(input())
X_=int(X**0.5)+1
ans=1
for i in range(2,X+1):
for j in range(2,X_):
bi=i
while True:
if bi%j!=0:
break
bi//=j
if bi==1:
ans=i
print(ans) |
p03352 | s464511990 | Accepted | x = int(input())
s = set([1])
for i in range(2,501):
for j in range(2,501):
if (i**j) <= x:
s.add(i**j)
print(max(list(s))) |
p03352 | s207798506 | Accepted | import sys
import time
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
X = int(readline())
r = int(X**0.5)
ans = 1
for i in range(r,0,-1):
tmp = i
if i ==1:
break
while tmp<=X:
ans = max(ans,tmp)
tmp *=i
print(ans)
if __name__ == '__main__':
main() |
p03352 | s414591087 | Accepted | x = int(input())
if x < 4:
print(1)
exit()
ans = 1 # 1^b = 1
for i in range(2, x+1): # [2,x]
a = i # a^1
while a < x:
a *= i # a^b,(b>=2)
if a <= x: ans = max(ans, a)
print(ans)
|
p03352 | s042117052 | Accepted | import sys
input = sys.stdin.readline
def main():
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)
if __name__ == '__main__':
main() |
p03352 | s427855049 | Accepted | X = int(input())
ans = 1
for b in range(2, 40):
p = 2
while True:
val = b ** p
if val > X:
break
ans = max(ans, val)
p += 1
print(ans)
|
p03352 | s788493634 | Accepted | import math
X=int(input())
max_num = 0
for i in range(2,10):
tei = math.floor(X**(1/i))
if (tei+1)**i <= X: tei = tei + 1
if max_num < tei**i:
max_num = tei**i
print(max_num) |
p03352 | s256606055 | Accepted | X = int(input())
l=[]
for i in range(1,101):
for j in range(2,11):
if i**j > 1000:
break
else:
l.append(i**j)
for k in range(X):
if X - k in l:
print(X-k)
break |
p03352 | s790348378 | Accepted | X=int(input())
s=set(i**j for i in range(40) for j in range(2,10) if i**j<=X)
print(max(s)) |
p03352 | s328000606 | 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 | s589791814 | Accepted | import math
N = int(input())
max = 0
for i in range(int(math.sqrt(N)+1)):
for j in range(10):
if(i**j>max and i**j <=N):
max = i**j
print(max) |
p03352 | s426909596 | Accepted | import sys
input = sys.stdin.readline
X = int(input())
x = int(X ** (1/2))
ans = 1
for i in range(2,x+1) :
a = 1
e = 0
while a == 1 :
k = i ** e
if k > X :
k = i ** (e-1)
a = 0
break
e+=1
ans = max(ans,k)
print(ans) |
p03352 | s606963513 | Accepted | x = int(input())
ma = 0
for i in range(1,100):
for j in range(2,100):
if i**j <= x:
ma = max(ma,i**j)
print(ma) |
p03352 | s848956041 | Accepted | x = int(input())
count = 1
for i in range(1,x+1):
for n in range(2,10):
if i**n <= x:
count = max(i**n,count)
print(count) |
p03352 | s775932465 | Accepted | X = int(input())
List = [1]
a =0
for i in range(2,35):
for j in range(2,11):
a = i**j
if a <= 1000:
List.append(i**j)
else:
break
List.sort()
k = 0
for i in range(len(List)):
if List[i] > X:
k = i-1
break
elif List[i] == X:
k = i
break
print(List[k]) |
p03352 | s835234276 | Accepted | x=int(input())
r=int(x**0.5)
a=1
for b in range(r+1):
for p in range(10):
if b**p <=x :
a=max(a,b**p)
else:
break
print(a)
|
p03352 | s955648476 | Accepted | x = int(input())
ans = 1
for i in range(2, x + 1):
for j in range(2, 20):
if i**j > x:
break
ans = max(ans, i**j)
print(ans)
|
p03352 | s552196768 | Accepted | x = int(input())
ans = 1
for b in range(1, 100):
for p in range(2, 100):
if b ** p <= x:
ans = max(ans, b ** p)
print(ans)
|
p03352 | s856821566 | Accepted |
x=int(input())
m=1
if x<=3:
print(1)
else:
for p in range(2,12):
a=2
while a**p<=x:
m=max(m,a**p)
a+=1
print(m)
|
p03352 | s291995465 | Accepted | x = int(input())
a = 1
for i in range(2, x + 1):
for j in range(1, x + 1):
if j ** i <= x:
a = max(a, j ** i)
else:
break
print(a) |
p03352 | s689021784 | Accepted | x=int(input())
A=[1]
for i in range(2,x+1):
p=2
if i**p>x:
break
while i**p<=x:
A.append(i**p)
p+=1
print(max(A)) |
p03352 | s367812807 | Accepted | from math import sqrt
x = int(input())
ans = 1
i = 1
for i in range(2, int(sqrt(x)) + 1):
j = i
while j <= x:
j *= i
ans = max(ans, j // i)
print(ans) |
p03352 | s154711430 | Accepted | x = int(input())
n = [1]
for i in range(2, 1001):
p = 2
while i ** p <= 1000:
n.append(i ** p)
p += 1
while not x in n:
x -= 1
print(x) |
p03352 | s374859544 | Accepted | x = int(input())
A = [a**b for a in range(1, 35) for b in range(2, 10) if a**b <= x]
A.sort()
print(A[-1]) |
p03352 | s157434639 | Accepted | n = int(input())
a = {1}
for b in range(2,n):
p = 2
x = b**p
while x <= n:
a.add(x)
x = b**p
p += 1
print(max(a)) |
p03352 | s851994826 | Accepted | x = int(input())
maxval = 0
for i in range(1,int(x**0.5)+1):
for j in range(2,8):
pwr = i**j
if pwr<=x:
maxval = max(maxval,pwr)
print(maxval) |
p03352 | s385671179 | Accepted | x = int(input())
ans = 1
for b in range(1, 1001):
for p in range(2, 11):
now = b ** p
if now <= x:
ans = max(ans, now)
print(ans) |
p03352 | s357935703 | Accepted | n = int(open(0).read().rstrip())
exes = {1}
for i in range(2,1001):
if not i in exes:
to_add = i
while to_add * i <= 1000:
to_add *= i
exes.add(to_add)
print(max(filter(lambda x:x<=n, exes))) |
p03352 | s541635215 | Accepted | X = int(input())
A = []
k=20
for i in range(1,int(X**0.5)+1):
for j in range(k):
if i**j<=X:
A.append(i**j)
elif i++j > X:
k = j+1
break
print(max(A))
|
p03352 | s807507137 | Accepted | x = int(input())
ans = 1
for i in range(1,1001):
for j in range(2,10):
if(i**j > x) : break
ans = max(ans,i**j)
print(ans) |
p03352 | s677272962 | Accepted | X=int(input())
if X==1:print(1)
else:
res = 1
for i in range(2,X+1):
for j in range(2,11):
if i**j <= X:
res = max(res,i**j)
else:
break
print(res) |
p03352 | s653017476 | Accepted | x = int(input())
if x <= 3:
print(x)
exit()
ans = 0
for i in range(2, int(x**0.5)+1):
s = 0
t = 1
while i**t <= x:
s = i**t
t += 1
ans = max(ans, s)
print(ans) |
p03352 | s459152862 | Accepted | x = int(input())
ans = [1]
for i in range(2, 1001):
p = 2
while i**p <= x:
ans.append(i**p)
p += 1
ans.sort(reverse=True)
#print(ans)
print(ans[0])
|
p03352 | s447208633 | Accepted | n=int(input())
m=-1
for p in range(2,10):
for b in range(1,32):
if b**p<=n:
m=max(m,b**p)
else:break
print(m) |
p03352 | s835436810 | Accepted | x = int(input())
ans = 0
for i in range(1,1000):
for j in range(2,1000):
if i ** j <= x:
ans = max(ans,i ** j)
else:
break
print(ans) |
p03352 | s377334080 | Accepted | X = int(input())
ans = 0
for i in range(1, 101):
for j in range(2, 101):
if i ** j <= X:
if i ** j > ans:
ans = i ** j
print(ans)
|
p03352 | s067273596 | Accepted | n=int(input())
ans = 1
i = 2
while i**2 <= n:
u = 2
while i**u <= n:
ans = max(i**u, ans)
u += 1
i += 1
print(ans) |
p03352 | s831162163 | 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 | s332871539 | Accepted | X=int(input())
s=set(pow(i,j) for i in range(40) for j in range(2,10) if pow(i,j)<=X)
print(max(s)) |
p03352 | s755611639 | Accepted | x=int(input())
res=0
for b in range(x+1):
for p in range(2,x+2):
if res<(b**p)<=x:
res=b**p
elif b**p>x:
break
print(res)
|
p03352 | s106426464 | Accepted | x = int(input())
res = []
for i in range(2, int(x**0.5)+2):
for j in range(2, 10):
if i**j <= x:
res.append(i**j)
if x == 1:
print(1)
else:
print(max(res)) |
p03352 | s695796656 | Accepted | x = int(input())
ans = 1
for b in range(1, 34):
for p in range(2, 34):
if b**p <= x:
ans = max(ans, b**p)
print(ans) |
p03352 | s097826456 | Accepted | a = int(input())
l = []
for i in range(100):
for j in range(2,10):
if i**j <= a:
l.append(i**j)
print(max(l)) |
p03352 | s133761599 | Accepted | x = int(input())
n = set()
n.add(1)
for i in range(2,33):
a = i
beki = 2
while a**beki <= x:
n.add(a**beki)
beki += 1
if a**beki > x:
break
print(max(n))
|
p03352 | s127039988 | Accepted | l = [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]
X = int(input())
while 1:
if X in l:
print(X)
break
X -= 1
|
p03352 | s210883199 | Accepted | X = int(input())
ans = 0
for i in range(1,40):
for j in range(2,10):
if X >= i**j and i**j > ans:
ans = i**j
print(ans) |
p03352 | s139112341 | Accepted | s=set()
s.add(1)
x=1001
for i in range(2,1000):
k=i*i
while k<x:
s.add(k)
k*=i
#print(sorted(s))
l=[i for i in range(1001)]
for i in range(1,1001):
if i in s:
l[i]=i
else:
l[i]=l[i-1]
print(l[int(input())]) |
p03352 | s274952706 | Accepted | x = int(input())
ans = 0
for i in range(1, x+2):
for j in range(2, x+2):
if i**j <= x:
ans = max(ans, i**j)
else:
break
print(ans) |
p03352 | s787230341 | Accepted | X=int(input())
res=0
for b in range(1,1000):
for p in range(2,1000):
if b**p<=X :
res=max(res,b**p)
else:
break
print(res) |
p03352 | s947109503 | Accepted | X=int(input())
ans=0
for i in range(1,X+1):
for j in range(2,11):
t=i**j
if t<=X:
ans=max(ans,t)
print(ans) |
p03352 | s946533946 | Accepted | X = int(input())
res = 1
for i in range(X):
for p in range(2, X):
if i ** p <= X:
res = max(res, i ** p)
else:
break
print(res)
|
p03352 | s147255768 | Accepted | x=int(input())
ans=1
for i in range(2,10):
for j in range(1,1000):
tmp = j**i
if tmp <= x:
ans=max(ans,tmp)
print(ans) |
p03352 | s210342480 | Accepted | x = int(input())
lis = []
for i in range(1,1001):
for j in range(2,11):
lis.append(i**j)
cand = [i for i in lis if i<=x]
print(max(cand)) |
p03352 | s257369149 | Accepted | ans = []
X = int(input())
for i in range(1,50):
for j in range(2,20):
if (i ** j)<= X:
ans.append(i**j)
print(max(ans)) |
p03352 | s462185578 | 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, math.floor(math.log2(X))+1):
if b ** p <= X:
ans = max(ans, b ** p)
print(ans)
if __name__ == '__main__':
main() |
p03352 | s705932815 | 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 | s397843617 | Accepted | x = int(input())
c = [1]
for i in range(2,32):
num = 2
while i**num <= x:
c.append(i**num)
num += 1
print(max(c))
|
p03352 | s944940778 | Accepted | import math
x = int(input())
ans = 0
exponent = []
for i in range(1,int(math.sqrt(x))+1):
for j in range(2, int(math.log(x, 2))+1):
ans = i ** j
exponent.append(ans)
exponent.sort()
exponent = [i for i in exponent if i <= x]
if x == 1:
print(1)
else:
print(max(exponent)) |
p03352 | s696216235 | Accepted | X = int(input())
r = 1
for b in range(2, int(X**(0.5)+1)):
for p in range(2, 11):
if b**p > X:
break
r = max(r, b**p)
print(r)
|
p03352 | s911074626 | Accepted | x=int(input())
ans=1
for i in range(2,int(x**0.5)+1):
p=1
while i*p<=x:
p*=i
ans=max(p,ans)
print(ans) |
p03352 | s833723377 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
x = int(input())
m = 0
for i in range(1, 1000):
for j in range(2, 100):
k = pow(i, j)
if k <= x:
m = max(m, k)
print(m)
if __name__ == '__main__':
resolve()
|
p03352 | s508185821 | Accepted | X = int(input())
answer = 0
for b in range(1,100+1):
for p in range(2,10+1):
if b**p <= X:
answer = max(answer, b**p)
print(answer) |
p03352 | s405359459 | 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 | s536149110 | Accepted | x = int(input())
l = [1]
for i in range(2, int(x ** 0.5)+1):
t = 2
while True:
if i ** t <= x:
l.append(i ** t)
t += 1
else:
break
l.sort()
print(l[-1]) |
p03352 | s250753253 | Accepted | x = int(input())
if x == 1:
print("1")
exit()
def func(p):
q = p
while q < x:
q *= p
if q == x:
return q
if q / p == p:
return 1
else:
return q // p
z = []
a = 2
while a <= x:
z.append(func(a))
a += 1
print(max(z))
|
p03352 | s348396422 | Accepted | def main():
x = int(input())
ans = 1
for i in range(2, int(x**0.5)+1):
b = i
p = 1
while b**(p+1) <= x:
p += 1
ans = max(ans, b**p)
print(ans)
if __name__ == "__main__":
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.