problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03352 | s981715259 | Wrong Answer | X = int(input())
print((int(X**(1/2)))**2) |
p03352 | s619218770 | Wrong Answer | import math
x = int(input())
ans = 1
n = math.ceil(math.sqrt(x))
for a in range(2,n):
a *= a
while a < x:
if a <= x: ans = max(ans, a)
a *= a
print(ans)
|
p03352 | s501296458 | Wrong Answer | X = int(input())
lst = []
for i in range(100):
for j in range(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 | s944083459 | Wrong Answer | X=int(input())
ans=1
for i in range(X):
for j in range(X):
if i**j<=X:
ans=i**j
print(ans) |
p03352 | s828163191 | Wrong Answer | import math
print(math.floor(int(input())**0.5)**2) |
p03352 | s291159207 | Wrong Answer | import math
x = int(input())
for i in reversed(range(x)):
if round(math.sqrt(i))**2 == i:
print(i)
break
|
p03352 | s865906720 | Wrong Answer | x = int(input())
ans = 0
for b in range(2, 33):
for p in range(2, 12):
if b**p<=x:
ans = max(ans, b**p)
print(ans)
|
p03352 | s345493858 | Wrong Answer | x = int(input())
print((int(x**0.5))**2) |
p03352 | s526156717 | Wrong Answer | x = int(input())
ans = 1 # 1^b = 1
for i in range(x+1,1,-1): # [x,2]
a = i # a^1
while a < x:
a *= i # a^b,(b>=2)
if a <= x:
print(a)
exit()
print(ans)
|
p03352 | s860510419 | 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(1001)
N = int(input())
for j in range(len(p) - 1):
if p[j] <= N < p[j + 1]:
print(p[j]) |
p03352 | s461800659 | Wrong Answer | X = int(input())
nums = set()
for b in range(1, 40):
p = 2
if b**p <= 1000:
nums.add(b**p)
p += 1
else:
continue
ans = -1
for num in nums:
if num <= X:
ans = max(ans, num)
print(ans)
|
p03352 | s725317561 | Wrong Answer | x = int(input())
pr = [1]
for i in range(2,32):
for j in range(2,11):
if (i**j < 1000)&(i**j not in pr):
pr.append(i**j)
print(max([k for k in pr if k <= x])) |
p03352 | s633628772 | Wrong Answer | n = int(input())
a = n//2
while True:
if a**2 <= n:
print(a**2)
break
a -= 1 |
p03352 | s389084362 | Wrong Answer | X = int(input())
Y = X
A = 0
while X % 2 == 0:
A += 1
X = X // 2
print(max(int(Y**0.5)**2,2**A)) |
p03352 | s909780483 | Wrong Answer | import math
x = int(input())
ans = 0
for i in range(x, -1, -1):
tmp = math.sqrt(i)
if tmp == int(tmp):
print(i)
exit()
|
p03352 | s571455715 | 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)
li2 = list(set(li))
li2.sort()
ans = 1
for k in range(len(li2)):
if (li2[k-1]<=N)&(li2[k]>N):
ans = li2[k-1]
print(ans) |
p03352 | s869960523 | Wrong Answer | import math
x = int(input())
ans = 1
for i in range(1,int(math.sqrt(x)+2)):
for j in range(2,10):
if i ** j <= x:
ans = i**j
else:
break
print(ans) |
p03352 | s439466254 | Wrong Answer | x=int(input())
a=[1]
for i in range(32):
for j in range(32):
if i**j<=x:
a.append(i**j)
print(max(a)) |
p03352 | s557143463 | Wrong Answer | x = int(input())
i = 1
a = 0
while (i)**2 <= x:
for j in range(2, 11):
if i**j > x:
a = max(ans, a)
break
ans = i**j
i += 1
print(ans) |
p03352 | s657565471 | Wrong Answer | # ABC097 B - Exponential
X = int(input())
j=1
S=[]
for i in range(X):
for j in range(X):
M = i**j
if M > X:
S.append(i**(j-1))
break
elif M == X:
exit()
print(max(S)) |
p03352 | s023601743 | Wrong Answer | import math
X = int(input())
n = math.floor(X**0.5)
print(n**2) |
p03352 | s021165463 | Wrong Answer | import math
print(math.floor(math.sqrt(int(input())))**2) |
p03352 | s777314416 | 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
while t <= x:
ans = max(ans, t)
t *= i
print(ans) |
p03352 | s885969240 | Wrong Answer | a = int(input())
l = []
for i in range(100):
for j in range(10):
if i**j <= a:
l.append(i**j)
print(max(l)) |
p03352 | s397329074 | Wrong Answer | x = int(input())
l = []
for i in range(1,33):
for y in range(2,33):
if i ** y <= x:
l.append(i**y)
else:
break
print(l[-1]) |
p03352 | s656087139 | Wrong Answer | x = int(input())
ans = 1
while ans**2 <= x:
ans+=1
print((ans-1)**2) |
p03352 | s491165374 | Wrong Answer | import math
x = int(input())
ans = 1
for i in range(1,x):
for j in range(2,x):
if i ** j <= x:
ans = i**j
else:
break
print(ans) |
p03352 | s179798678 | Wrong Answer | x = int(input())
def solve(num):
a = num
result = []
x = []
for i in range(2, int(num**(1/2))+1):
if num%i==0:
c = 0
while num%i==0:
num //= i
c += 1
result.append(c)
if num!=1:
result.append(1)
return all(i%2==0 for i in result)
for i in range(x, 0, -1):
if solve(i):
print(i)
break |
p03352 | s685444543 | Wrong Answer | x = int(input())
done = [0]*(x+1)
ans = 1
tmp = 0
for i in range(2, x):
tmp = i
while tmp*i <= x:
if not done[tmp*i]:ans+=1
done[tmp*i]=1
tmp*=i
print(ans)
|
p03352 | s031751226 | Wrong Answer | import math
print(int(math.sqrt(int(input())))**2) |
p03352 | s603103382 | Wrong Answer | x = int(input())
p2 = [i ** 2 for i in range(1, 32)]
p3 = [k ** 3 for k in range(1, 10)]
p2_3 = p2 + p3
l = list(set(p2_3))
if x in l:
l.append(x)
l.sort()
print(l[l.index(x)])
else:
l.append(x)
l.sort()
print(l[l.index(x)-1]) |
p03352 | s458409789 | Wrong Answer |
def expone():
N = int(input())
max_n = 1
for i in range(2,N+1):
for j in range(2,N+1):
if i ** j <= N:
max_n = i ** j
if i ** j > N:
break
print(max_n)
if __name__ == "__main__":
expone() |
p03352 | s704149083 | Wrong Answer | a=int(input())
b=set()
ans=0
for i in range(1,a+1):
for j in range(1,i+1):
for k in range(2,a):
if j**k==i:
ans=i
print(ans) |
p03352 | s773629763 | Wrong Answer | X = int(input())
ans = 0
for i in range(1, X+1):
for j in range(2, X+1):
num = i ** j
if num >= ans and num <= X:
ans = num
print(ans) |
p03352 | s896316086 | Wrong Answer | import math
X = int(input())
print((math.floor(math.sqrt(X)))**2)
|
p03352 | s236110359 | Wrong Answer | from bisect import *
A = [x**2 for x in range(33)]
X = int(input())
print(A[bisect_right(A,X)-1]) |
p03352 | s418118371 | Wrong Answer | x = int(input())
for i in range(34):
if i ** 2 <= x < (i+1) ** 2:
print(i ** 2)
|
p03352 | s143849937 | Wrong Answer | x = int(input())
import math
for i in range(x,0,-1):
if math.sqrt(i).is_integer():
#print(math.sqrt(i))
print(int(i))
break |
p03352 | s844013681 | Wrong Answer | s = input()
x = int(s)
y = 2
max_ans = 1
for i in range(1, x):
z = 1
while y < x:
z += 1
y = z * z
if y <= x:
max_ans = max(max_ans, y)
print(max_ans) |
p03352 | s553858134 | Wrong Answer | x=int(input())
ans=1
for i in range(2,int(x**0.5)+1):
while i*i<=x:
i*=i
ans=max(i,ans)
print(ans) |
p03352 | s902663369 | Wrong Answer | x = int(input())
ans = 0
for b in range(1, 1000):
if x < b: break
for p in range(2, 1000):
if b**p <= x and ans < b**p:
ans = b**p
else:
break
print(ans)
|
p03352 | s789191132 | Wrong Answer | import math
X = int(input())
print(int(math.sqrt(X))**2)
|
p03352 | s446865619 | Wrong Answer | import bisect
X = int(input())
cand = [1]
for x in range(2, 34):
while x <= 1000:
x *= x
cand.append(x)
cand = list(set(cand))
cand.sort()
i = bisect.bisect_right(cand, X)
print(cand[i-1])
|
p03352 | s011218390 | Wrong Answer | X=int(input())
ans=1
for i in range(1,X):
for j in range(40):
for k in range(40):
if i==j**k:
ans=j**k
print(ans) |
p03352 | s508410667 | 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)
N = int(input())
for i in range(len(p) - 1):
if p[i] <= N < p[i + 1]:
print(p[i]) |
p03352 | s189838559 | Wrong Answer | x = int(input())
pre = 0
arr = []
for b in range(331,):
print(b)
for p in range(2,33):
if b ** p <= x:
arr.append(b**p)
print(max(arr)) |
p03352 | s306323217 | Wrong Answer | X = int(input())
nums = set([1])
for i in range(2, int(1000 ** .5) +1):
b = 2
while True:
temp = i ** b
if temp > 1000:
break
nums.add(temp)
b += 1
sorted_nums = sorted(list(nums), reverse=True)
# print(f"nums:{sorted_nums}", file=sys.stderr)
for i in range(len(sorted_nums) - 1):
if sorted_nums[i] > X >= sorted_nums[i + 1]:
print(sorted_nums[i + 1]) |
p03352 | s191715589 | Wrong Answer | X = int(input())
list = []
if X == 1:
list.append(1)
elif X == 2:
list.append(2)
else:
for b in range(2, X):
p = 2
while b ** p < X:
list.append(b ** p)
p += 1
print(max(list))
|
p03352 | s339101603 | Wrong Answer | x = int(input())
for i in range(x,0,-1):
if (i**(1/2)).is_integer() or (i**(1/3)).is_integer():
print(i)
break
|
p03352 | s789150264 | Wrong Answer | from math import sqrt, log
x = int(input())
ans = 1
for i in range(2, x):
n = int(pow(i, max(2, int(log(x, i)))))
if n <= x:
ans = max(ans, n)
print(ans)
|
p03352 | s350811140 | Wrong Answer | X = int(input())
for i in range(1000):
if i**2 == X:
print(i**2)
break
elif i**2 > X:
print((i-1)**2)
break |
p03352 | s105915753 | Wrong Answer | n = int(input())
ans = 0
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 | s189076891 | Wrong Answer | X = int(input())
print((int(X**0.5))**2) |
p03352 | s991708309 | Wrong Answer | import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = int(sys.stdin.readline().rstrip())
ret = 0
for b in range(N):
for p in range(N):
if b ** p <= N:
ret = b ** p
print(ret)
if __name__ == '__main__':
main()
|
p03352 | s493089460 | Wrong Answer | n = int(input())
p = int(int(n**0.5)**2)
print(p) |
p03352 | s166328794 | Wrong Answer | import math
X=int(input())
max_num = 0
for i in range(2,10):
tei = math.floor(X**(1/i))
if max_num < tei**i:
max_num = tei**i
print(max_num) |
p03352 | s294392746 | Wrong Answer | import math
def main():
X = int(input())
ma = 1
for i in range(1, X+1):
for j in range(2, 33):
p = math.log(i, j)
if p.is_integer() == True and p >= 2:
if ma < j**p:
ma = j**p
print(int(ma))
main() |
p03352 | s978567524 | Wrong Answer | X = int(input())
import math
while not float.is_integer(math.sqrt(X)):
X -= 1
print(X) |
p03352 | s266665256 | Wrong Answer | x=int(input())
for i in range(x+1):
ima=x-i
for j in range(ima+1):
if j*j==ima:
print(ima)
exit() |
p03352 | s714444982 | Wrong Answer | X=int(input())
ans=0
for b in range(1,33):
for p in range(2,11):
if b**p<=X:
ans=b**p
print(ans) |
p03352 | s511547233 | Wrong Answer | X = int(input())
max_ans = 0
for i in range(1, X+1):
for j in range(2, X+1):
if i ** j >= X:
break
max_ans = max(max_ans, i**j)
print(max(1, max_ans)) |
p03352 | s063804922 | Wrong Answer | def solve():
X = int(input())
ans = 0
for i in range(2,32):
for j in range(2,11):
x = pow(i,j)
if X < x:
break
if ans < x:
ans = x
print(ans)
if __name__ == '__main__':
solve()
|
p03352 | s812170339 | Wrong Answer | x = int(input())
X = int(x**0.5)
print((X+1)**2 if (X+1)**2 <= x else X**2) |
p03352 | s403274350 | Wrong Answer | import math
X = int(input())
print((int(math.sqrt(X)))**2)
|
p03352 | s475804447 | Wrong Answer | x=int(input())
ans=0
for i in range(1,x):
for j in range(2,12):
if i**j<=x:
ans=max(ans,i**j)
else:
break
print(ans)
|
p03352 | s549345491 | Wrong Answer | x = int(input())
import math
ans = []
for i in range(0,x):
if math.sqrt(i).is_integer():
ans.append(i)
print(max(ans))
|
p03352 | s991145718 | Wrong Answer | x = int(input())
a = []
for i in range(x):
if i**2 <= x:
b=i*i
a.append(b)
print(1 if x == 0 else max(max(a),1)) |
p03352 | s509091359 | Wrong Answer | x = int(input())
ans = 0
for a in range(1,x):
for b in range(1,1000):
if a**b <= x:
ans = max(ans,a**b)
print(ans) |
p03352 | s317641275 | Wrong Answer | x = int(input())
l = [1]
for i in range(2,31):
num = i
num *= num
while num < x:
l.append(num)
num *= num
print(max(l)) |
p03352 | s892379877 | Wrong Answer | X = int(input())
for i in range(1, 1000):
tmp = i * i
if tmp > X:
print((i - 1) * (i - 1))
break
|
p03352 | s993809777 | 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 | s785674319 | Wrong Answer | import math
X = int(input())
ans = 0
for i in reversed(range(X+1)):
num = int(math.sqrt(i))
if num ** 2 == i and ans <= i:
ans = i
print(ans) |
p03352 | s711016888 | Wrong Answer | X = int(input())
ans = 1
for i in range(2, X + 1):
p = 2
while i ** p <= X:
ans = max(1, i ** p)
p += 1
#ans = max(1, i ** p)
print(ans) |
p03352 | s010180229 | Wrong Answer | x = int(input())
a = 0
for i in range(x):
for j in range(x):
if i**j < x and x < i**(j+1):
a = max(a,i**j)
print(a) |
p03352 | s423611841 | 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)
print(ans) |
p03352 | s116854406 | Wrong Answer | x = int(input())
li = []
for i in range(100):
n = i+1
while x >= n**2:
li.append(n**2)
n += 1
print(max(li))
|
p03352 | s989909533 | Wrong Answer | X = int(input())
ans = -1
for p in range(1, 1000+1):
for b in range(2, 10):
t = b**p
if t <= X:
if ans < t:
ans = t
else:
break
print(ans)
|
p03352 | s712315249 | Wrong Answer | import math
X=int(input())
max_num=0
for i in range(2,10):
tei=math.floor(X**(1/i))
if max_num<=tei**i:
max_num=tei**i
print(max_num) |
p03352 | s825980982 | Wrong Answer | X = int(input())
lst = []
for i in range(100):
for j in range(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 | s414787014 | Wrong Answer | X = int(input())
ans = 1
while (ans + 1) ** 2 <= X:
ans += 1
print(ans * ans)
|
p03352 | s249153672 | Wrong Answer | N = int(input())
li = []
for i in range(1,100):
for j in range(2,5):
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 | s821560215 | Wrong Answer | from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
x = readInt()
l = [0]*(x+1)
l[1]=1
for i in range(2,len(l)):
if i*i>len(l)-1:
break
else:
l[i]=1
l[i*i]=1
for i in range(len(l)-1,-1,-1):
if l[i]==1:
print(i)
break |
p03352 | s534112986 | 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)**2)
|
p03352 | s986992143 | 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 | s109607184 | Wrong Answer | x=int(input())
if x==1000:
print(1000)
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 | s075540834 | Wrong Answer | i = int(input())
ans = 0
for ii in range(i+1):
if (ii ** .5).is_integer():
ans = ii
print(ans)
|
p03352 | s921686192 | Wrong Answer | import math
X=int(input())
max_num=0
for i in range(2,11):
tei=math.floor(int(X**(1/i)))
if max_num<tei**i:
max_num=tei**i
print(max_num) |
p03352 | s711737057 | Wrong Answer | X=int(input())
i=2
beki=[]
while i<=X:
j=2
while i**j<X:
beki.append(i**j)
j+=1
i+=1
if len(beki)==0:
print(1)
else:
print(max(beki))
|
p03352 | s971421635 | Wrong Answer | import math
x = int(input())
ans = 0
mx = 0
for b in range(1, int(math.sqrt(x))+1) :
if b == 1 :
mx = 1
continue
p = 1
while b ** p < x :
mx = max(b**p, mx)
p += 1
print(mx)
|
p03352 | s543139683 | Wrong Answer | x=int(input())
print(int(x**0.5)**2) |
p03352 | s651783482 | Wrong Answer | X=int(input())
for i in range(1, X):
for j in range(2, X):
if i**j<=X:
max=i**j
print(max) |
p03352 | s297307391 | Wrong Answer | # ABC097 B - Exponential
X = int(input())
j=1
S=[]
for i in range(X):
for j in range(X):
M = i**j
if M > X:
if j == 2:
break
S.append(i**(j-1))
break
elif M == X:
exit()
print(max(S)) |
p03352 | s909159382 | Wrong Answer | x = int(input())
for i in range(x+1):
if i**2 <= x:
count = i**2
print(count) |
p03352 | s730271473 | Wrong Answer | import math
def main():
N = int(input())
print(math.floor(math.sqrt(N))**2)
main() |
p03352 | s762022195 | Wrong Answer | import math
X = int(input())
output = 1
for i in range(2,X):
for j in range(2, X):
if i ** j < X:
output = i ** j
break
print(output) |
p03352 | s625861364 | Wrong Answer | from bisect import *
A = [x**2 for x in range(33)]
X = int(input())
print(A[bisect_left(A,X)-1]) |
p03352 | s406239711 | Wrong Answer | X=int(input())
if X==1 or 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 | s934026344 | Wrong Answer | # solution
import io
nim = int(input())
mike = 1
for i in range(2,(nim+1)//2):
kite = 0
counter = 0
while kite <= nim:
m = max(mike,kite)
kite = i**counter
counter+=1
print(mike) |
p03352 | s911250819 | Wrong Answer | X=int(input())
res=0
for b in range(1,X+1):
for p in range(2,X+1):
if b**p<=X :
res=max(res,b**p)
else:
break
print(res) |
p03352 | s879307153 | Wrong Answer | X = int(input())
ans = 0
for i in range(1,40):
for j in range(2,10):
if X >= i**j:
ans = i**j
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.