problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03352 | s096906279 | Wrong Answer | N = int(input())
for i in range(1,N+1)[::-1]:
for j in range(2,35):
if i%j == 0:
if (i//j)%j == 0:
print(i)
break
else:
continue
break
|
p03352 | s031138341 | Wrong Answer | n = int(input())
import math as m
if n < 4:
print(1)
exit(0)
perfect = 1
for i in range(2,int(n**0.5)+1):
x = i**(int(m.log(n,i)))
perfect = max(perfect,x)
if perfect == n:
break
print(int(perfect)) |
p03352 | s866009024 | Wrong Answer | X = int(input())
x = 0
if X == 1:
print(X)
else:
for i in range(2,int(X ** 0.5) + 1):
n = 1
a = i
while n < X :
n *= a
if n // a > x:
x = (n // a)
print(x) |
p03352 | s870718159 | Wrong Answer | X = int(input())
fact = [1]
for i in range(2, 40):
p = i
while(p <= 1000):
fact.append(p)
p = p*i
fact.sort()
ans = 0
for n in fact:
if(n <= X):
ans = n
else:
print(ans)
break |
p03352 | s957158594 | Wrong Answer | import math
x = int(input())
s = math.floor(math.sqrt(x))
if x == 1:
print(1)
exit()
if x == 2 or 3:
print(2)
exit()
def l(k,p):
return(int(math.floor(math.log(p)/math.log(k))))
ans = 0
for i in range(2,s+1):
ans = max(ans, i ** l(i,x))
print(ans)
|
p03352 | s313482831 | Wrong Answer | X=int(input())
max=X//2+1
r=0
for b in range(1,X):
for p in range(2,X):
r=b**p
if r>=X:
r=0
break
elif r>=max:
max=r
#print(b,p,r)
if r>=X:
break
print(max) |
p03352 | s782161567 | Wrong Answer | import math
x = int(input())
for i in range(x,0,-1):
if math.sqrt(i).is_integer() == True:
print(i)
break |
p03352 | s858869786 | Wrong Answer | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import collections
x = int(input())
li = [1]
b = 2
while True:
if b == 100:
break
p = 2
while True:
d = b**p
if d>=x:
break
li.append(d)
p += 1
b+=1
li.sort()
print(li[-1]) |
p03352 | s107320233 | Wrong Answer | a=int(input())
i=0
while i**2<=a:
i=i+1
print((i-1)**2) |
p03352 | s826236401 | Wrong Answer | # -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')
def solve():
x = int(input())
ans = 1
for i in range(1, x + 1):
if i * i <= x:
ans = i * i
print(ans)
t = 1
# t = int(input())
for case in range(1,t+1):
ans = solve()
"""
a aa c ca c a b a ab a b c
"""
|
p03352 | s550815348 | Wrong Answer | 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 | s110711966 | Wrong Answer | X=int(input())
if X==1:
max=1
if X==2:
max=1
else:
for i in range(1, X):
for j in range(2, X):
if i**j<=X:
max=i**j
print(max) |
p03352 | s462339244 | Wrong Answer | x=int(input())
ma=1
for i in range(2,x):
ex=i**3
for j in range(x):
if ex>x:
if ex>ma and ex//i<=x:
ma=ex//i
break
ex=ex*i
print(ma) |
p03352 | s242611967 | Wrong Answer | x = int(input())
for i in range(1, x+1):
v = i ** (1/2)
if v.is_integer():
ans = int(i)
print(ans) |
p03352 | s144277048 | Wrong Answer | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import collections
x = int(input())
i = 1
while True:
a = i**2
if x<a:
break
i+=1
print((i-1)**2) |
p03352 | s359631056 | Wrong Answer |
x = int(input())
ans = int(x ** 0.5)
print(ans **2)
|
p03352 | s847699615 | Wrong Answer | x=int(input())
a=[1]
for i in range(1,300):
for j in range(2,300):
if i**j<=x:
a.append(i**j)
print(a[-1]) |
p03352 | s467800009 | Wrong Answer | 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 | s168883858 | Wrong Answer | n=int(input())
if n==1:
print(1)
exit()
i,j=1,2
m=i**j
while(i**j<n):
i=1
while(True):
f=(i+1)**j<=n
if f==True:
i+=1
else:
break
m=max(m,i**j)
j+=1
print(m) |
p03352 | s630461387 | Wrong Answer | x = int(input())
min = 1000
for i in range(1,1000):
for j in range(2,40):
if x-i**j < min and 0 < x-i**j:
min = x-i**j
print(x-min)
|
p03352 | s261663603 | Wrong Answer | 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):
if i**2 <= x:
num = i**2
print(num) |
p03352 | s723557137 | Wrong Answer | x=int(input())
l=[1]
for i in range(2,32):
k=2
while i**k<1000:
l.append(i**k)
k+=1
l=sorted(l)
for i in range(len(l)-1):
if l[i]<=x<l[i+1]:
print(l[i])
exit()
print(961) |
p03352 | s364540628 | Wrong Answer | import numpy as np
N = int(input())
expo = []
for i in range(1,10):
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 | s044466262 | Wrong Answer | import math
X=int(input())
max_num = 0
for i in range(1,9):
tei = math.floor(X**(1/i))
if max_num < tei**i:
max_num = tei**i
print(max_num) |
p03352 | s692692727 | Wrong Answer | x = int(input())
while x >= 1:
if x**(1 / 2) == int(x**(1 / 2)):
print(x)
break
else:
x -= 1 |
p03352 | s706313079 | Wrong Answer | N = int(input())
li = []
for i in range(1,100):
for j in range(2,50):
if i**j<=1000:
li.append(i**j)
li.sort()
ans = 1
for k in range(len(li)):
if (li[k]>N)&(li[k-1]<N):
ans = li[k-1]
print(ans) |
p03352 | s180175418 | Wrong Answer | X=int(input())
d=[1]
for i in range(2,1001):
p=2
while i**p<X:
d.append(i**p)
p+=1
d=list(set(d))
print(max(d)) |
p03352 | s220044305 | Wrong Answer | 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):
p = i**2
if p <= x:
ans = p
else:
print(ans)
break
|
p03352 | s863390188 | Wrong Answer | x=int(input())
ma=1
for i in range(x):
ex=1
for j in range(x):
ex=ex*i
if ex>x:
if ex//i>ma:
ma=ex//i
break
print(ma) |
p03352 | s648294314 | Wrong Answer | n=int(input())
ans=1
for b in range(2,100):
tmp=1
for p in range(2,10):
tmp*=b
if tmp<=n :
ans=max(ans,tmp)
print(ans) |
p03352 | s626710009 | Wrong Answer | x = int(input())
ans = 1
for i in range(100):
for j in range(100):
if x < i**j: break
else: ans = max(ans, i**j)
print(ans) |
p03352 | s681912285 | Wrong Answer | x = int(input())
a = []
for i in range(x):
if i**2 <= x:
b=i*i
a.append(b)
print(max(max(a),1)) |
p03352 | s125116770 | Wrong Answer | print(int(int(input())**0.5)**2) |
p03352 | s084459968 | Wrong Answer | X = int(input())
n = 0
while n**2 <= X:
ans = n**2
n+=1
print(ans) |
p03352 | s851246533 | Wrong Answer | x=int(input())
a=[1]
for i in range(1,32):
for j in range(1,32):
if i**j<=x:
a.append(i**j)
print(max(a)) |
p03352 | s200435011 | Wrong Answer | import math
X = int(input())
max_exp = -1
for i in range(1, X+1):
tmp = math.sqrt(i)
if tmp.is_integer() and i > max_exp:
max_exp = max(max_exp, i)
if i == 1000:
max_exp = max(1000, max_exp)
print(int(max_exp)) |
p03352 | s934375550 | Wrong Answer | # coding:utf-8
import math
x = int(input())
num = math.floor(x ** 0.5)
# print(num)
print(num ** 2)
|
p03352 | s003561664 | Wrong Answer | import math
x = int(input())
res = int(math.sqrt(x))
print(res * res) |
p03352 | s886772591 | Wrong Answer | X = int(input())
M = 0
for i in range(1, X):
for p in range(2, 10):
if M < i ** p < X:
M = i ** p
else:
break
print(M)
|
p03352 | s352538213 | Wrong Answer | x = int(input())
ans = 1
for i in range(2, int(x**0.5)+1):
j = 0
while i**j < x:
ans = max(i**j, ans)
j += 1
print(ans) |
p03352 | s023368505 | Wrong Answer | x=int(input())
ans=0
for b in range(2,1000):
for p in range(2,10):
temp=b**p
if temp <= x:
ans=max(temp,ans)
print(ans) |
p03352 | s995757747 | Wrong Answer | x = int(input())
for i in range(x, 0, -1):
ans = i
div = []
for j in range(2,int(x**0.5)+2):
count = 0
if i%j ==0:
while i%j==0:
i //= j
count += 1
div.append(count)
if i != 1:
div.append(1)
if len(div) == 1 and div[0] > 1:
print(ans)
break
else:
print(1) |
p03352 | s659613609 | Wrong Answer | x=int(input())
ans=0
for i in range(31):
if x>=(i+1)**2:
ans=(i+1)**2
else:
print(ans)
break |
p03352 | s868342654 | Wrong Answer | #!/usr/bin/env python3
import math
x = int(input())
ans = 1
n = 2
while n < 5:
c = 1
while x >= c**n:
ans = max(ans,c**n)
c += 1
n += 1
print(ans)
|
p03352 | s072403519 | Wrong Answer | from math import sqrt
x = int(input())
cnt = 0
l = []
for i in range(1, x + 1):
for j in range(1, int(sqrt(i)) +1):
if j ** 2 == i:
l.append(i)
print(max(l)) |
p03352 | s956113749 | Wrong Answer | def primes(x):
res = []
a = 2
while x >= a*a:
while x % a == 0:
x //= a
res.append(a)
a += 1
if x != 1:
res.append(x)
return res
x = int(input())
if x < 4:
print(1)
else:
for i in reversed(range(4,x+1)):
p = primes(i)
if len(p) > 1 and len(set(p)) == 1:
print(i)
break
|
p03352 | s232629876 | Wrong Answer |
def expone():
N = int(input())
while N > 0:
i = 1
while i <= N:
if i ** 2 == N:
print(N)
return 0
i += 1
N -= 1
if __name__ == "__main__":
expone() |
p03352 | s564062903 | Wrong Answer | X=int(input())
import math
ans=[math.pow(math.floor(math.pow(X,1/i)),i) if math.pow(math.floor(math.pow(X,1/i)),i)<=X else 0 for i in range(2,10)]
print(int(max(ans))) |
p03352 | s546174639 | Wrong Answer | import math
X = int(input())
def expo(x):
ans = 1
for i in range(1,x+1):
if math.sqrt(i).is_integer() == True:
ans = i
return ans
print(expo(X)) |
p03352 | s819775104 | Wrong Answer | X = int(input())
for i in range(X,0,-1):
if i**2 <= X:
print(i**2)
exit() |
p03352 | s926903831 | Wrong Answer | 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(40) if is_prime(i)]
num = []
for i in lis:
for j in range(2, 11):
if i**j <= X:
num.append(i**j)
if X == 1:
print(1)
else:
print(max(num)) |
p03352 | s659754932 | Wrong Answer | n=int(input())
i=1
while((i+1)**2<=n):
i+=1
print(i**2) |
p03352 | s403872634 | Wrong Answer | from math import sqrt
X=int(input())
print(int(sqrt(X))**2) |
p03352 | s796280602 | Wrong Answer | import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 6)
mod = 10**9+7
cnt = 0
ans = 0
num = []
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
AL = al.upper()
x = k()
for i in range(x+1):
if i**2<=x:
ans = i
print(ans**2)
|
p03352 | s756162535 | Wrong Answer | x = int(input())
for i in range(40,0,-1):
for j in range(40,1,-1):
if i**j<=x:
print(i**j)
exit() |
p03352 | s735148390 | Wrong Answer | from math import sqrt
X = int(input())
def f():
for x in range(X, 0, -1):
for p in range(X, 1, -1):
if x ** (1 / p) == int(x ** (1 / p)):
return x
return 1
print(f()) |
p03352 | s030159975 | Wrong Answer | x = int(input()) # 入力が1つ
# map(int, input().split()) # 入力が複数
# [int(i) for i in input().split()] # 配列で数字
ans = 0
for i in range(1000 + 1):
if i ** 2 <= x:
ans = max(ans, i ** 2)
print(ans) |
p03352 | s187924619 | Wrong Answer | X = int(input())
X_half = X // 2
max_ans = 1
tmp_max = 0
for i in range(1,X_half+1):
for j in range(2,X_half+1):
tmp = i ** j
if tmp<=X:
tmp_max = tmp
break
max_ans = max(max_ans, tmp_max)
print(max_ans)
|
p03352 | s998594441 | Wrong Answer | # -*- coding: utf-8 -*-
x = int(input())
ans = 1
for i in range(x):
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 | s771547751 | Wrong Answer | import sys
X = int(input())
L = []
for i in range(1,32):
for j in range(2,10):
if X <= i**j:
L.append(i**(j-1))
break
print(max(L))
|
p03352 | s070625523 | Wrong Answer | 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
print(max(L))
|
p03352 | s571571470 | Wrong Answer | import math
X = int(input())
if X < 4:
print(1)
exit()
for x in range(X, 0, -1):
for y in range(2, x, 1):
log = math.log(x, y)
div, mod = divmod(log, 1)
if mod == 0:
print(x)
exit()
|
p03352 | s794765299 | Wrong Answer | y = 0
x = int(input())
for i in range(1001):
x2 = i**2
if x2 <= x:
y = x2
print(y) |
p03352 | s401835880 | Wrong Answer | X=int(input())
numbers=[]
for a in range(1,1001):
if (a**0.5).is_integer():
numbers.append(a)
elif (a**(1/3)).is_integer():
numbers.append(a)
elif (a**(0.2)).is_integer():
numbers.append(a)
elif (a**(1/7)).is_integer():
numbers.append(a)
answer=[a for a in numbers if a<=X]
print(round(max(answer)))
|
p03352 | s490825730 | Wrong Answer | X=int(input())
if X==1:
print(1)
exit()
N=[1]
i=2
while True:
N.append(i**2)
i+=1
if N[-1]>1000:
break
N.append(X)
N.sort()
if N.count(X)==2:
print(N[N.index(X)])
else:
print(N[N.index(X)-1]) |
p03352 | s483921906 | Wrong Answer | x = int(input())
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 | s769135305 | Wrong Answer | import math
x = int(input())
ans = 1
n = math.floor(math.sqrt(x))
for i in range(2,n+1):
a = i
while a < x:
if a <= x: ans = max(ans, a)
a *= a
print(ans)
|
p03352 | s013035069 | Wrong Answer | N = int(input())
for i in range(N):
if(i*i > N):
print((i-1)*(i-1))
break |
p03352 | s577926462 | Wrong Answer | x = int(input())
y = int(x**0.5)
if (y+1)**2 <= x:
y += 1
print(y**2) |
p03352 | s725555878 | Wrong Answer | X = int(input())
cmax = 0
for i in range(2,int(X**0.5)+1):
k = 2
while i**k<=X:
k += 1
cmax = max(cmax,i**(k-1))
print(cmax) |
p03352 | s008271608 | Wrong Answer | x=int(input())
l=[]
for i in range(1,x+1):
for j in range(1,x+1):
if j*j==i:
l.append(j*j)
if j*j*j==i:
l.append(j*j*j)
if j*j*j*j==i:
l.append(j*j*j*j)
print(max(l)) |
p03352 | s609232093 | Wrong Answer | import math
x = int(input())
b = 1
for i in range(2, int(math.sqrt(x)) + 1):
p = int(math.log(x, i))
b = max(b, i ** p)
print(b) |
p03352 | s446179343 | Wrong Answer | X = int(input())
A = []
for i in range(2,10):
for j in range(1, int(X**(1/i))+1):
A.append(j**i)
print(X-min([abs(a - X) for a in A])) |
p03352 | s773220444 | Wrong Answer | X = int(input())
def han(n, k):
if int(n**(1/k)) == n**(1/k):
return True
else:
return False
while 1:
if han(X, 2) or han(X, 3) or han(X, 5) or han(X, 7) or han(X, 4) or han(X, 6) or han(X, 8) or han(X, 9) or han(X, 10) or han(X, 11) or han(X, 12) or han(X, 13):
print(X)
break
X -= 1
|
p03352 | s619234139 | Wrong Answer | import math
X=int(input())
max_num=0
for i in range(2,11):
tei=math.floor(X**(1/i))
if max_num<tei**i:
max_num=tei**i
print(max_num) |
p03352 | s686466704 | Wrong Answer | import math
x = int(input())
ans = 1 # 1^b
n = math.floor(math.sqrt(x))
for i in range(2,n+1):
a = i# a^1
while a < x:
a *= a # a^{<=2}
if a <= x: ans = max(ans, a)
print(ans)
|
p03352 | s145047936 | Wrong Answer | 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)
print(p)
N = int(input())
for i in range(len(p) - 1):
if p[i] <= N < p[i + 1]:
print(p[i]) |
p03352 | s300969483 | Wrong Answer | def is_prime(n):
for i in range(2, n + 1):
if i * i > n:
break
if n % i == 0:
return False
return n != 1
prime = []
for i in range(1,1001):
if is_prime(i):
prime.append(i)
pow = [1]
for p in prime:
i=1
while p**i<=1000:
pow.append(p**i)
i += 1
X = int(input())
x = X
while x>0:
if x in pow:
ans = x
break
x -= 1
print(ans) |
p03352 | s214369158 | Wrong Answer | a=int(input())
result=[]
for i in range(a+1):
if i**2<=a:
result.append(i**2)
print(max(result)) |
p03352 | s277722410 | Wrong Answer | import math
x = int(input())
print(math.floor(x**0.5) ** 2) |
p03352 | s483647910 | Wrong Answer | n = int(input())
import math as m
if n < 4:
print(1)
exit(0)
perfect = 1
for i in range(2,int(n**0.5)+1):
x = i**(int(m.log(n,i)))
perfect = max(perfect,x)
if perfect == n:
break
print(perfect) |
p03352 | s233876264 | Wrong Answer | x = int(input())
res = 0
for i in range(1, x):
for j in range(2, x):
cand = i ** j
if x >= cand:
if cand > res:
res = cand
print(res) |
p03352 | s839887124 | Wrong Answer | import numpy as np
X = int(input())
while X > 0:
a = np.sqrt(X)
if a.is_integer() == True:
break
else:
X -= 1
print(X) |
p03352 | s698746151 | Wrong Answer | X=int(input())
a=2
ans=1
if X==1:
print(1)
exit()
else:
while a<1001:
for i in range(2,1001):
if a**i<=X:
ans=a**i
else:
break
a+=1
print(ans) |
p03352 | s303866320 | Wrong Answer | # from sys import stdin
import math
X = int(input())
# for i in range(33):
ans = 0
for i in range(int(math.sqrt(X))+1):
for x in range(11):
print(i,x)
if i**x < X and i**x > ans:
ans = i**x
print(ans)
|
p03352 | s561823108 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
x=int(input())
for i in range(1,33):
if i**2>x:
print((i-1)**2)
break
resolve() |
p03352 | s368499072 | Wrong Answer | import math
X = int(input())
max_exp = -1
for i in range(1, X+1):
tmp = math.sqrt(i)
if tmp.is_integer():
max_exp = max(max_exp, i)
print(int(max_exp)) |
p03352 | s924224208 | Wrong Answer | # -*- coding: utf-8 -*-
#----------
X = int(input().strip())
#----------
candidate=set()
max_num = int( 1000**(1/2) )
for i in range( max_num + 1 ):
for j in range( max_num + 1 ):
calc = i**j
if calc <= 1000:
candidate.add(i**j)
ans=0
for i in candidate:
if i <= X and ans < i:
ans = i
print(ans)
|
p03352 | s064186243 | Wrong Answer | from math import sqrt
X = int(input())
for x in reversed(range(1, X+1)):
flag = False
for i in range(2,11):
t = x**(1/i)
if t.is_integer():
print(x)
flag = True
break
if flag:
break
|
p03352 | s474197578 | Wrong Answer | x=int(input())
data=[1,2,3,5,7,11,13,17,19,23,29,31]
ans=0
for i in data:
for j in range(2,10):
if i**j<=x:
ans=max(ans,i**j)
else:
break
print(ans) |
p03352 | s591457528 | Wrong Answer | x = int(input())
c = 1
for n in range(1, x):
for p in range(2, x):
print(n, n ** p)
if n ** p <= x:
c = max(n ** p, c)
else:
break
print(c) |
p03352 | s623084855 | Wrong Answer | x=int(input())
i=0
while True:
if (i+1)**2>x:
break
i+=1
print(i**2) |
p03352 | s845530682 | Wrong Answer | import math
x = int(input())
sq_x = int(x ** 0.5)
ans = 0
for i in range(2, sq_x + 1):
p = int(math.log(x, i))
ans = max(ans, i ** p)
print(ans)
|
p03352 | s600042639 | Wrong Answer | import numpy as np
x = int(input())
for i in range(x, -1, -1):
if np.sqrt(i) % 1 == 0:
print(i)
break |
p03352 | s471386022 | Wrong Answer | import math
X=int(input())
max_num=0
c=[]
for i in range(2,11):
tei=math.floor(X**(1/i))
c.append(tei**i)
print(max(c)) |
p03352 | s702587228 | Wrong Answer | N = int(input())
li = []
for i in range(1,100):
for j in range(2,10):
if i**j<=1000:
li.append(i**j)
list(set(li)).sort()
ans = 1
for k in range(len(li)):
if (li[k-1]<N)&(li[k]>=N):
ans = li[k-1]
print(ans) |
p03352 | s744954980 | Wrong Answer | 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,9):
if k == 2 and i**k > x:
print(ans)
exit()
elif i**k < x:
ans = max(i**k,ans)
|
p03352 | s165210309 | Wrong Answer | # B. Exponential
# https://atcoder.jp/contests/abc097/tasks/abc097_b
x = int(input())
ans = 1
for b in range(2, int(x ** .5) + 2):
p = 2
while b ** p <= x:
ans = b ** p
p += 1
print(ans) |
p03352 | s519418676 | Wrong Answer | x = int(input())
import math
ans = []
for i in range(0,x+1):
if math.sqrt(i).is_integer():
ans.append(i)
print(max(ans))
|
p03352 | s277153062 | Wrong Answer | X = int(input())
n = 0
while n**2 < X:
ans = n**2
n+=1
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.