problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03352 | s948499677 | Wrong Answer | x=int(input())
ans=[1]
for i in range(2,50):
y=2
while i**y<=x:
ans.append(i**y)
y+=1
print(ans[-1]) |
p03352 | s389577781 | Wrong Answer | x = int(input())
import math
while True:
#print(math.sqrt(x))
if(str(math.sqrt(x))[-2] == "." and str(math.sqrt(x))[-1] == "0"):
print(x)
exit()
else:
x = x - 1
|
p03352 | s648386883 | Wrong Answer | """
author : halo2halo
date : 24, Jan, 2020
"""
import sys
# import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
X = int(readline())
ans = 1
while ans * ans <= X:
ans += 1
print(ans - 1)
|
p03352 | s921974412 | Wrong Answer | import math
x = int(input())
for i in range(1,int(math.sqrt(x))+2):
if i**2 > x:
print((i-1)**2) |
p03352 | s303973410 | Wrong Answer | import math
x = int(input())
ans = 1
for i in range(2, x):
p_max = math.floor(math.log(x, i))
if p_max < 2:
break
ans = max(ans, i**p_max)
print(ans) |
p03352 | s974730856 | Wrong Answer | 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 math.log(i, j).is_integer():
print(i)
exit() |
p03352 | s255520116 | Wrong Answer | n = int(input())
x = 1
ans = 0
while ans < n:
x += 1
ans = x**2
print((x-1)**2) |
p03352 | s997760992 | Wrong Answer | X = int(input())
for i in range(1, 1000):
if i ** 2 > X:
print((i-1)**2)
break |
p03352 | s478158025 | Wrong Answer | import math
x = int(input())
sq_x = int(x ** 0.5)
ans = 0
for i in range(2, sq_x + 1):
t = i ** i
while True:
t *= i
if t > x:
break
ans = max(ans, t)
print(ans)
|
p03352 | s615807440 | Wrong Answer | x = int(input())
ans = 1
while ans**2 < x:
ans+=1
print(max((ans-1)**2,1)) |
p03352 | s259884248 | Wrong Answer | N = int(input())
result = 0
for i in range(1,int(N**0.5)+1):
result = i
print(result ** 2) |
p03352 | s015342481 | Wrong Answer | n=int(input())
res=1
k=1
for b in range(1,int(n**0.5)+1):
for p in range(2,n):
if b**p>n:
break
else:
res=b**p
print(res) |
p03352 | s752010183 | 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 | s625527432 | Wrong Answer | pow = [1]
for p in range(2,32):
i=1
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 | s305857695 | Wrong Answer | import math
X=int(input())
max_num=0
for i in range(1,10):
tei=math.floor(X**(1/i))
if max_num<tei**i:
max_num=tei**i
print(max_num)
|
p03352 | s815540374 | Wrong Answer | import sys
from math import floor
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
x = I()
ans = 1
for i in range(2, x):
temp = floor(x**(1/i))
if temp == 1:
break
ans = max(ans, temp**i)
print(ans)
if __name__ == '__main__':
main() |
p03352 | s253340196 | Wrong Answer | import sys
# input処理を高速化する
input = lambda: sys.stdin.readline().rstrip()
N = int(input())
expo = set()
for i in range(1, 32):
for j in range(2, 10):
if i ** j >= 1000:
break
expo.add(i ** j)
expo = sorted(list(expo), reverse=True)
for e in expo:
if e <= N:
print(e)
exit() |
p03352 | s684634472 | Wrong Answer | from math import log, sqrt
X = int(input())
max_num = 1
for i in range(2, int(sqrt(X)) + 1):
max_num = max(max_num, i ** int(log(X, i)))
print(max_num) |
p03352 | s081520224 | Wrong Answer | x = int(input())
ans = 1
n = 1
while True:
if n*n > x:
break
else:
ans = n**2
n += 1
print(ans)
|
p03352 | s004019428 | Wrong Answer | X = int(input())
ans = 0
for i in range(1, X):
for j in range(2, X):
num = i ** j
if num > X:
break
ans = num
print(ans) |
p03352 | s363693657 | Wrong Answer | X = int(input())
lst = []
for i in range(100):
for j in range(2,10):
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 | s041683458 | Wrong Answer | X=int(input())
ans=1
for i in range(1000):
for n in range(1000):
if i**n<=X:
ans=i**n
else:
break
print(max(ans,X)) |
p03352 | s213306444 | Wrong Answer | from math import sqrt, log
x = int(input())
ans = 1
for i in range(2, int(sqrt(x)) + 1):
ans = max(ans, int(pow(i, int(log(x, i)))))
print(ans)
|
p03352 | s060764009 | Wrong Answer | from math import sqrt
X=int(input())
ans=0
for i in range(1,int(sqrt(X))+1):
now=i
b=2
while i!=1:
if X<=i**b:
break
now=i**b
b+=1
ans=max(ans, now)
print(ans) |
p03352 | s495885714 | Wrong Answer | X=int(input())
import math
num = []
for i in range(1,X+1):
if i == int(math.sqrt(i)) ** 2:
num.append(i)
print(max(num)) |
p03352 | s536794440 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
def solve():
X = ini()
ans = 1
for p in range(2, X):
a = p * p
while a < X:
ans = max(ans, a)
a *= p
return ans
print(solve())
|
p03352 | s691313145 | Wrong Answer | from math import log,floor
X = int(input())
if X < 4:
print(1)
else:
answer = 0
for b in range(2,X):
if floor(log(X,b)) > 1:
answer = max(answer,int(b**floor(log(X,b))))
print(answer) |
p03352 | s575817083 | Wrong Answer | X=int(input())
numbers=[]
for a in range(1,1001):
if (a**0.5).is_integer():
numbers.append(a)
answer=[a for a in numbers if a<=X]
print(max(answer))
|
p03352 | s647021708 | Wrong Answer | n =(int)(input())
ans=0
for i in range(n):
if i*i <= n:
ans =i
print(ans) |
p03352 | s983157258 | Wrong Answer | def main():
X = int(input())
ans = 1
for b in range(1,X+1):
for p in range(2,10):
a = b**p
if a > X:
break
elif ans < a and a < X:
ans = a
print(ans)
if __name__ == '__main__':
main() |
p03352 | s724401671 | Wrong Answer | x = int(input())
l = [1]
for i in range(2,int(x**0.5)+1):
num = i
num *= num
while num < x:
l.append(num)
num *= num
print(max(l)) |
p03352 | s896269324 | Wrong Answer | x = int(input())
i = 1
while i * i <= x:
i += 1
print((i - 1) ** 2)
|
p03352 | s277399418 | Wrong Answer | x = int(input())
y = 0
if x==1:
print(1)
else:
for a in range(2,(x+1)):
for b in range (2,10):
if b==2 and a**b>x:
print(y)
elif a**b<x:
y=max(a**b,y)
|
p03352 | s979973325 | Wrong Answer | x = int(input())
for i in range(x):
for j in range(2, 32):
if (x-i)**(1/j) % 1 == 0:
print(x-i)
exit() |
p03352 | s013714391 | Wrong Answer | import math
x = int(input())
for i in range(x,1,-1):
if (math.sqrt(i)).is_integer():
print (i)
exit ()
|
p03352 | s769699154 | Wrong Answer | x = int(input())
while x >= 1:
if str(x**(1/2) * 10)[-1] == "0":
print(x)
break
else:
x -= 1 |
p03352 | s490243582 | Wrong Answer | x = int(input())
ans = [1]
b = 2
p = 2
while b**p < x:
while b**p<x:
ans.append(b**p)
p += 1
b += 1
p = 2
print(ans[-1]) |
p03352 | s470205805 | Wrong Answer | x = int(input())
ans = 1
for i in range(2, int(x**(0.5))+1):
j = 2
while True:
k = i**j
if k > x:
break
else:
ans = max(ans, i)
j += 1
print(ans) |
p03352 | s727605047 | Wrong Answer | x=int(input())
import math
k=int(math.sqrt(x))
print(k**2) |
p03352 | s195729301 | Wrong Answer | 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 math.log(i, j).is_integer():
print(i)
exit()
if i == 1:
print(1)
|
p03352 | s447274111 | Wrong Answer | x = int(input())
for i in range(x,0,-1):
if (i ** .5).is_integer():
print(i)
break |
p03352 | s090018688 | Wrong Answer | x = int(input())
ans = 1
for b in range(1, int(1000**.5)+1):
for p in range(2, 10):
if b**p <= x:
ans = b**p
print(ans)
|
p03352 | s936049812 | Wrong Answer | import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
from decimal import *
import numpy as np
import math
if __name__ == '__main__':
n =int(input())
a = int(math.sqrt(n))
print(a*a) |
p03352 | s576944266 | Wrong Answer | x = int(input())
while x >= 1:
if x**(1 / 2) % 1 == 0:
print(x)
break
else:
x -= 1 |
p03352 | s878515867 | Wrong Answer | a=int(input())
d=0
for i in range(33):
b=i+2
while b<a:
b=b*(i+2)
c=b/(i+2)
if d<c:
d=c
print(int(d)) |
p03352 | s026223719 | Wrong Answer | X = int(input())
final = 0
for i in range(40):
for j in range(1,11):
if i**j > X:
final = max(ans,final)
break
ans = i**j
print(final) |
p03352 | s607839028 | Wrong Answer | print(int(int(input())**0.25)) |
p03352 | s588341351 | Wrong Answer | 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**i,ans)
print(ans)
|
p03352 | s798965111 | Wrong Answer | X = int(input())
ans = [1]
for i in range(2, X):
v = i * i
while v < X:
ans.append(v)
v *= i
print(max(ans))
|
p03352 | s667467547 | Wrong Answer | import sys
X = int(input())
L = []
for i in range(1,32):
for j in range(1,10):
if X <= i**j:
L.append(i**(j-1))
break
print(max(L))
|
p03352 | s165433928 | Wrong Answer | X = int(input())
a = 0
while a == 0:
b = 0
N, n = X, X
for i in range(2, int(X ** 0.5) + 2):
if b == 0:
while N % i == 0:
N //= i
b = 1
else:
break
if N == 1:
ans = n
a = 1
print(ans)
X -= 1 |
p03352 | s622970846 | Wrong Answer | x = int(input())
ans = 1
for i in range(x, 0, -1):
m = i
for j in range(2,int(m**0.5)+2):
if m%j==0:
while m%j ==0:
m //= j
if m== 1 and j != i:
print(i)
exit()
print(ans)
|
p03352 | s353708915 | Wrong Answer | x = int(input())
ans = 1
for i in range(x, 0, -1):
m = i
for j in range(2,int(m**0.5)+2):
if m%j==0:
while m%j ==0:
m //= j
if m== 1:
print(i)
exit()
print(ans) |
p03352 | s105370332 | Wrong Answer | X=int(input())
ans=1
for i in range(X):
for n in range(X):
if i**n<=X:
ans=i**n
print(ans) |
p03352 | s317007586 | Wrong Answer | X = int(input())
ans = 0
for i in range(1, X+1):
for j in range(2, X+1):
if i**j > X:
break
else:
ans = max(ans, i**j)
print(ans)
|
p03352 | s940379925 | Wrong Answer | x=int(input())
for i in range(x):
ima=x-i
for j in range(ima+1):
if j*j==ima:
print(ima)
exit() |
p03352 | s531020418 | Wrong Answer | X=int(input())
l=[1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400, 441, 484, 529, 576, 625, 676, 729, 784, 841, 900, 961]
for i in range(len(l)):
if X>l[i]:
print(l[i-1])
exit() |
p03352 | s643386784 | Wrong Answer | def f(N):
for i in range(N):
for j in range(N):
if (e := pow(i, j)) <= N:
yield e
n = int(input())
print(max(f(n))) |
p03352 | s992767624 | Wrong Answer | 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
else:
break
print(maxi) |
p03352 | s252300707 | Wrong Answer | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
x = int(read())
print(int(x**0.5)**2)
|
p03352 | s932461511 | Wrong Answer | x = int(input())
for i in range(1,x+1):
for n in range(2,10):
if i**n <= x:
count = i**n
print(count) |
p03352 | s545460561 | Wrong Answer | X = int(input())
n = 0
while n**2 <= X:
n+=1
print((n-1)**2) |
p03352 | s451728138 | Wrong Answer | x = int(input())
y = 0
for i in range(x):
for j in range(2,x):
if i**j <= x:
y = max(y, i**j)
else:
break
print(y) |
p03352 | s410657639 | Wrong Answer | import math
x = int(input())
for i in reversed(range(x+1)):
if int(round(math.sqrt(i))**2) == i:
print(i)
break |
p03352 | s171547228 | Wrong Answer | x = int(input())
def solve(num):
result = True
for i in range(2, num+1):
c = 0
while num%i==0:
c += 1
num //= i
if c%2==0:
continue
else:
result = False
break
return result
for i in range(x, 0, -1):
if solve(i)==True:
print(i)
break |
p03352 | s583884726 | Wrong Answer | X = int(input())
count = 1
for i in range (1,50):
if i ** 2 <= X:
count = i ** 2
print(count) |
p03352 | s894897349 | Wrong Answer | X = int(input())
ans=0
for p in range(2,10):
for b in range(1,32):
if(b**p <= X):
ans = X
print(ans) |
p03352 | s605125326 | Wrong Answer | import math
x=int(input())
l=[1]
for i in range(2,int(math.sqrt(x))+1):
p=i
while 1:
p*=i
if p<=x:
l.append(p)
else:
break
print(l[-1]) |
p03352 | s227564805 | Wrong Answer | print((int(int(input())**.5))**2) |
p03352 | s270834352 | 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 | s789878459 | Wrong Answer | import bisect,collections,copy,itertools,math,numpy,string
def I(): return int(input())
def S(): return input()
def LI(): return list(map(int,input().split()))
def LS(): return list(input().split())
##################################################
X = I()
print(int(X**0.5)**2)
|
p03352 | s173318663 | Wrong Answer | x = int(input())
print((int(x ** 0.5)) ** 2) |
p03352 | s279816993 | Wrong Answer | from math import sqrt, log
x = int(input())
ans = 1
for i in range(2, int(sqrt(x)) + 1):
n = int(pow(i, max(2, int(log(x, i)))))
if n <= x:
ans = max(ans, n)
print(ans)
|
p03352 | s165937857 | Wrong Answer | from math import *
print(floor(sqrt(int(input())))**2)
|
p03352 | s863276849 | Wrong Answer | X = int(input())
check =[]
check2=[]
for i in range(1,33):
for s in range(2,11):
check.append(pow(i,s))
#print(check)
for i in check:
if i<=X:
check2.append(i)
print(check2)
print(max(check2))
|
p03352 | s395043664 | Wrong Answer | X = int(input())
print(int((X ** 0.5)) ** 2)
|
p03352 | s226740605 | Wrong Answer | X = int(input())
for i in range(40):
if i**2 > X:
print((i-1)**2)
break |
p03352 | s450145808 | Wrong Answer | a = int(input())
mx = 1
for i in range(2,a):
j=2
while i**j <a:
print(i,j)
mx = max(i**j,mx)
j+=1
print(mx) |
p03352 | s072663196 | Wrong Answer | x = int(input())
ma = 0
for i in range(1,100):
for j in range(1,100):
if i**j <= x:
ma = max(ma,i**j)
print(ma) |
p03352 | s712325608 | Wrong Answer | n = int(input())
p = int(n**0.5)**2
print(p) |
p03352 | s758735753 | 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):
print(X)
break
X -= 1
|
p03352 | s669208926 | Wrong Answer | x = int(input())
i = 1
while x > i**2:
i += 1
if x == i**1:
print(i**2)
else:
print((i-1)**2) |
p03352 | s561283330 | Wrong Answer | import sys
import math
x = int(input())
for i in range(int(math.sqrt(x))+1, 0, -1):
if i * i <= x:
print(i*i)
sys.exit(0) |
p03352 | s274249452 | Wrong Answer | a=int(input())
d=0
for i in range(1000):
b=i+2
while b<a:
b=b*(i+2)
c=b/(i+2)
if d<=c:
d=c
print(int(d)) |
p03352 | s702474377 | Wrong Answer | print(int(int(input())**(0.5))**2) |
p03352 | s317289460 | Wrong Answer | X = int(input())
val = 1
for b in range(1, int(X**0.5)+1):
for p in range(2,X):
if b**p > X:
break
else:
val = b**p
print(val) |
p03352 | s831035194 | Wrong Answer | import math
x = int(input())
x_root = math.sqrt(x)
print(int(x_root)**2) |
p03352 | s802308273 | Wrong Answer | x = int(input())
l = [1]
for i in range(2,int(x**0.5)+1):
num = i
num *= num
while num <= x:
l.append(num)
num *= num
print(max(l))
|
p03352 | s235188823 | Wrong Answer | X = int(input())
num_list = [1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400, 441, 484, 529, 576,
625, 676, 729, 784, 841, 900, 961, 1024]
i = 0
while num_list[i] <= X:
i += 1
print(num_list[i - 1]) |
p03352 | s889923399 | Wrong Answer | X=int(input())
a=0
while True:
#print(a**2)
if a**2>X:
print((a-1)**2)
exit()
a+=1 |
p03352 | s986996244 | Wrong Answer | N = 0
X = int(input())
while N**2 <= X:
N += 1
print((N-1)**2) |
p03352 | s474144650 | Wrong Answer | x=int(input())
ans=1
for i in range(2,x):
a=i
while a*i<=x:
a*=i
if ans<a:
ans=a
print(ans) |
p03352 | s678631703 | Wrong Answer | X = int(input())
ans = 0
for n in range(2,1000):
ans = max(ans,int(X**(1/n))**n)
print(ans) |
p03352 | s790200781 | Wrong Answer | X = int(input())
ans = 0
for i in range(1,40):
if X >= i*i:
ans = i*i
print(ans) |
p03352 | s555176702 | Wrong Answer | X = int(input())
m = 1
while (m+1)**2 <= X:
m += 1
print(m*m) |
p03352 | s223163294 | Wrong Answer | X = int(input())
l = []
if X < 4:
print(1)
else:
for i in range(2, int(X ** 0.5) + 1):
j = 2
while i ** j <= X:
j += 1
l.append(i ** j)
l.sort()
print(l[-1])
|
p03352 | s158206106 | Wrong Answer | X = int(input())
ans = 0
for i in range(X):
for j in range(2, X):
if X >= i**j:
ans = i**j
else:
break
print(ans) |
p03352 | s042038208 | Wrong Answer | x=int(input())
for i in range(x, 0, -1):
for j in range(1, i+1):
if i == j*j:
print(i)
exit() |
p03352 | s170373095 | Wrong Answer | X=int(input())
ans=0
for i in range(1000):
if i*i<=X:ans=i
else:break
print(ans**2) |
p03352 | s732213595 | Wrong Answer | N = int(input())
if N==1:
print(1)
else:
for i in reversed(range(1, N)):
num = str(i**(0.5))
check = num[num.index('.'):]
if len(check)==2 and check==('.0'):
print(i)
break |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.