problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03352 | s785980973 | Wrong Answer | x = int(input())
ans = 0
for i in range(1,x+1):
for j in range(2,int(i**0.5)+2):
if i**(1/j) % 1 == 0:
ans = i
print(ans) |
p03352 | s053393368 | Wrong Answer | import sys
n = int(input())
for i in range(n,0,-1):
if ((i**(1/2))%1 == 0) or ((i **(1/3))%1 == 0) or ((i **(1/5))%1 == 0) or ((i **(1/7))%1 == 0) or ((i **(1/9))%1 == 0):
print(i)
sys.exit()
print(1)
|
p03352 | s502746016 | Wrong Answer | x = int(input())
if x == 1:
print("1")
exit()
def func(p):
q = 1
while q <= x:
if q == x:
return q
break
else:
q *= p
return q
z = []
a = 2
while a <= x:
z.append(func(a))
a += 1
print(max(z))
|
p03352 | s736830250 | Wrong Answer | import math
X = int(input())
print(int(math.sqrt(X))) |
p03352 | s553832386 | 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-1]<=N)&(li[k]>N):
ans = li[k-1]
print(ans) |
p03352 | s617056839 | Wrong Answer | x = int(input())
for i in range(x):
for j in range(2, 10):
if (x-i)**(1/j) % 1 == 0:
print(x-i)
exit() |
p03352 | s416479732 | Wrong Answer | import math
def main():
x = int(input())
print(int(math.sqrt(x))*int(math.sqrt(x)))
main()
|
p03352 | s932089052 | Wrong Answer | x = int(input())
for i in range(x):
if i**2 <= x:
count = i**2
print(count) |
p03352 | s205192472 | 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 | s876909086 | Wrong Answer | x=int(input())
ans=1
for b in range(1,x):
for p in range(2,x):
if b**p<=x: ans=b**p
else: break
print(ans) |
p03352 | s889191702 | Wrong Answer | a = int(input())
print(max(j ** i for j in range(32) for i in range(2, 10) if j ** i >= a)) |
p03352 | s737397568 | Wrong Answer | x = int(input())
if x == 1:
print("1")
exit()
def func(p):
q = 1
while q <= x:
q *= p
return q / p
z = []
a = 2
while a <= x ** 0.5:
z.append(func(a))
a += 1
print(max(z))
|
p03352 | s548898793 | Wrong Answer | N = int(input())
li = []
for i in range(2,100):
for j in range(2,5):
li.append(i**j)
li.sort()
ans = 0
for k in range(len(li)):
if (li[k-1]<N)&(li[k]>N):
ans = li[k-1]
print(ans) |
p03352 | s058637548 | Wrong Answer | x = int(input())
ans = 1
for i in range(35):
for j in range(15):
if i**j > x:
break
else:
ans = max(i**j,ans)
print(ans) |
p03352 | s992244146 | Wrong Answer | n = int(input())
a=0
if n > 1:
a = n//2
else:
a = n
while True:
if a**2 <= n:
print(a**2)
break
a -= 1 |
p03352 | s087367720 | 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
if x == 0:
print(0)
sys.exit()
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 | s611680431 | Wrong Answer | import math
x=int(input())
a=0
if x==1:
print(1)
exit()
for i in range(1,math.ceil(math.sqrt(x))):
a=max(a,i**2)
print(a) |
p03352 | s507099197 | Wrong Answer | x = int(input())
min = 10000
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
if min > 1000:
print(x)
else:
print(x-min) |
p03352 | s561619472 | Wrong Answer | n=int(input())
ans = 1
i = 2
while i**2 <= n:
u = 2
while i**u <= n:
ans = i**u
u += 1
i += 1
print(ans) |
p03352 | s805438366 | Wrong Answer | import math
x = int(input())
ans = 0
for i in range(x):
if i * i > x: break
ans = i * i
print(ans) |
p03352 | s019283955 | Wrong Answer | import math
A = int(input())
B = math.floor(math.sqrt(A))
print(B ** 2) |
p03352 | s946236729 | Wrong Answer | import math
a = int(input())
for i in range(a, 0, -1):
for j in range(2, 10):
if i == int(math.pow(i, 1/j)) ** j:
print(i)
break
else:
continue
break
|
p03352 | s190990632 | Wrong Answer | from bisect import bisect_right
a = int(input())
dp = [1]
t = 1
while t**2<=10000:
dp.append(t**2)
t+=1
if dp[-1]==a:
print(dp[-1])
exit()
elif dp[-1] > a:
print(dp[-2])
exit()
print(dp[bisect_right(dp,a)-1])
|
p03352 | s690456452 | 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:
ans = max(ans,i**j)
else:
break
print(ans)
|
p03352 | s625932252 | Wrong Answer | X = int(input())
maxi = 0
if X < 4:
print(1)
exit()
for i in range(1, X):
for j in range(2, X):
if i**j <= X and i**j >= maxi:
maxi = i**j
else:
break
print(maxi) |
p03352 | s680880339 | 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 | s543192411 | Wrong Answer | x = int(input())
ans = 1
for i in range(2, x+1):
n = 2
while i ** n < x:
ans = i ** n
n += 1
print(ans) |
p03352 | s074754293 | Wrong Answer | X=int(input())
ans=0
for i in range(1,X):
for j in range(2,11):
tmp=i**j
if ans<tmp<=X:
ans=tmp
print(ans)
|
p03352 | s442995065 | Wrong Answer | x = int(input())
if x == 1:
print("1")
exit()
ans = 0
for b in range(2,int(x**(1/2)+1)):
for p in range(2,1000):
tmp = pow(b,p)
if tmp<=x:
ans = max(ans,pow(b,p))
break
print(ans) |
p03352 | s728951506 | Wrong Answer | from math import *
n=int(input())
s=sqrt(n)
s=int(s)
print(s**2) |
p03352 | s648048349 | Wrong Answer | x=int(input())
ans=1
for i in range(1,x+1):
for j in range(2,x+1):
if i**j<=x:
ans=i**j
print(ans) |
p03352 | s297291752 | 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(1, N):
for p in range(2, N):
if b ** p <= N:
ret = max(ret, b ** p)
print(ret)
if __name__ == '__main__':
main()
|
p03352 | s915686889 | Wrong Answer | X = int(input())
ans = 1
for b in range(1,101):
for p in range(2,10):
if X >= b**p and X > ans:
ans = b**p
print(ans) |
p03352 | s753512151 | Wrong Answer | from math import sqrt
X = int(input())
N = int(sqrt(X))
print(N**2) |
p03352 | s234852194 | Wrong Answer | n =(int)(input())
ans=0
for i in range(n):
for j in range(n):
if i**j <= n:
ans=i**j
print(ans) |
p03352 | s182330356 | Wrong Answer | a=1
kazu=[]
while 1:
if a*a>1000:
break
kazu.append(a*a)
a+=1
x=int(input())
for i in range(len(kazu)):
if kazu[len(kazu)-1-i]<=x:
print(kazu[len(kazu)-1-i])
exit() |
p03352 | s369466310 | 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 | s505192352 | Wrong Answer | X = int(input())
ans = 0
for b in range(1, X):
for p in range(2, X):
tmp = b ** p
if ans < tmp and tmp <= X:
ans = tmp
print(ans) |
p03352 | s643049631 | Wrong Answer | x = int(input())
ans=0
for i in range(1, x+1):
if i**2<=x:
ans=i**2
print(ans) |
p03352 | s136037967 | Wrong Answer | X = int(input())
print(int(X**0.5)**2) |
p03352 | s646251040 | Wrong Answer | x = int(input())
pr = [1]
for i in range(2,32):
for j in range(2,10):
if (i**j < 1000)&(i**j not in pr):
pr.append(i**j)
print(max([k for k in pr if k <= x]))
print(pr) |
p03352 | s272062109 | Wrong Answer | X = int(input())
Max = 0
for i in range(2,10):
b = int(X**(1/i))
B = b**i
if Max < B:
Max = B
print(Max) |
p03352 | s902548975 | Wrong Answer | import math
x = int(input())
for i in range(x,0,-1):
if math.sqrt(i)%1 == 0 or (math.ceil(i ** (1/3)))**3 == i:
print(i)
break |
p03352 | s219369629 | Wrong Answer | x = int(input())
ans = 1
for i in range(1,x//2):
for j in range(2,10):
if i ** j <= x:
ans = i**j
print(ans) |
p03352 | s580779057 | Wrong Answer | a = int(input())
mx = 1
for i in range(2,a):
j=2
while i**j <= a:
mx = max(i**j,mx)
j+=1
else: break
print(mx) |
p03352 | s635690860 | Wrong Answer | x=int(input())
print(int(x**(1/2))**2) |
p03352 | s434568752 | Wrong Answer | x = int(input())
ans = 0
for i in range(x + 1):
if i * i > x: break
ans = i * i
print(ans) |
p03352 | s308422034 | Wrong Answer | x = int(input())
result = 0
for i in range(2,x+1):
beki = 2
while (i**beki) <= x:
result = i**beki
beki+=1
if result == 0:
print(1)
else:
print(result)
|
p03352 | s406763762 | Wrong Answer | X = int(input())
ans = 1
for i in range(2,int(X**0.5)+1):
cnt = 2
y = i**cnt
while y<X:
ans = max(ans,y)
cnt +=1
y = y*i
print(ans) |
p03352 | s333728879 | Wrong Answer | x=int(input())
l=[1]
for i in range(2,int(x**0.5)+1):
j=1
while i**(j+1)<=x:
j+=1
l.append(i**j)
print(l)
print(max(l)) |
p03352 | s608437733 | Wrong Answer | import math
X = int(input())
print((int(math.sqrt(X)))**2) |
p03352 | s381926341 | Wrong Answer | import sys
import math
input = sys.stdin.readline
MOD = 1000000007
X = int(input())
sa = 100000
res = 0
if X == 1:
print(1)
else:
for i in range(2,X):
a = int(math.log(X,i))
if (sa > (X - (i**a))) & ( a != 1):
sa = X - (i**a)
res = i**a
print(res)
|
p03352 | s942985627 | Wrong Answer | import math
X = int(input())
ans = 0
for i in reversed(range(X)):
num = int(math.sqrt(i))
if num ** 2 == i and ans < i:
ans = i
print(ans) |
p03352 | s779610658 | Wrong Answer | import math
X=int(input())
ans=0
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 | s327207820 | Wrong Answer | y = 0
x = int(input())
for i in range(1000**2+1):
x2 = i**2
if x2 <= x:
y = x2
print(y) |
p03352 | s294555318 | Wrong Answer | import sys
import math
import itertools as it
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))
if __name__ == "__main__":
l = [i*i for i in range(1,1100)]
x = I()
i = 0
while l[i] <= x:
i += 1
print(l[i-1]) |
p03352 | s762378530 | Wrong Answer | from collections import Counter
import sys
X = int(input())
num = []
if X == 1:
print(1)
sys.exit()
for j in range(1, X):
tmp = j + 1
lis = []
while tmp != 1:
for i in range(2, tmp+1):
if tmp % i == 0:
lis.append(i)
tmp = tmp // i
break
if len(Counter(lis)) == 1 and len(lis) != 1:
num.append(j+1)
print(max(num))
|
p03352 | s274718188 | Wrong Answer | x=int(input())
a=[]
for i in range(1,110):
for j in range(2,100):
if i**j<=x:
a.append(i**j)
print(a[-1]) |
p03352 | s870489616 | Wrong Answer | import math
X = int(input())
print(math.floor(X**0.5)**2) |
p03352 | s687184124 | Wrong Answer | x = int(input())
for i in range(1,100)[::-1]:
if i*i <= x:
print(i*i)
exit() |
p03352 | s201398709 | Wrong Answer | from math import sqrt
X = int(input())
for x in reversed(range(1, X+1)):
t = sqrt(x)
if t.is_integer():
print(x)
break |
p03352 | s357415938 | 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 | s431899571 | Wrong Answer | # AtCoder Beginner Contest 097
# B - Exponential
X=int(input())
for i in range (X):
a= (X-i)**0.5
if a==int(a):
print(int(a)**2)
exit()
|
p03352 | s668641566 | Wrong Answer | x=int(input())
b=[False for i in range(x)]
for i in range(1,x+1):
for j in range(2,x+1):
if i**j<=x:
b[i**j-1]=True
else:
break
for i in range(len(b),0,-1):
if b[i-1]==True:
print(i)
exit() |
p03352 | s666001419 | Wrong Answer | X=int(input())
if X==1:
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 | s861031970 | Wrong Answer | x = int(input())
i = 1
while (i+1)**2 <= x:
i += 1
print(i**2) |
p03352 | s374837504 | Wrong Answer | x = int(input())
import math
while True:
if(str(math.sqrt(x))[-2] == "."):
print(x)
exit()
else:
x = x - 1
|
p03352 | s204201716 | Wrong Answer | X=int(input())
ans=0
for i in range(X+1):
if i*i<=X:
sum=i*i
for j in range(X):
if i*(i*j)>X:
break
sum=max(sum,i*(i*j))
else:
break
ans=max(ans,sum)
print(sum) |
p03352 | s811161880 | Wrong Answer | x=int(input())
for i in range(x, 0, -1):
for j in range(1, int(i**(1/2))+1):
if i/j == j:
print(i)
exit() |
p03352 | s912314636 | Wrong Answer | x = int(input())
if x == 1:
print(1)
else:
print(int(max((x ** (1 / i) // 1) ** i for i in range(2, x + 1)))) |
p03352 | s418001834 | Wrong Answer | t = set([])
for i in range(1,32):
for s in range(2,32):
if i**s<1001:
t.add(i**s)
t = list(t)
t.sort(reverse = True)
x = int(input())
for i in range(len(t)-1):
if t[i]>x>=t[i+1]:
print(t[i+1])
break
|
p03352 | s088914321 | Wrong Answer | N=int(input())
for i in range(N,0,-1):
if int(i**0.5)**2 == i:
print(i)
break |
p03352 | s459611693 | Wrong Answer | X = int(input())
li = []
for x in range(2,11):
li += [ i**x for i in range(1,int(1000**(1/x)//1)+1)]
ans_list = sorted(list(set(li)), reverse=True)
print(ans_list)
for x in ans_list:
if x <=X:
print(x)
break |
p03352 | s440344688 | Wrong Answer | X=int(input())
n=1
for b in range(2,X):
p=2
while(True):
x=b**p
print(x)
if x<=X:
n=x
p+=1
else:
break
print(n) |
p03352 | s373797149 | Wrong Answer | x = int(input())
bekis = [1]
for i in range(2,35):
for j in range(2,15):
v = i**j
if v > x: break
bekis.append(v)
print(bekis[-1]) |
p03352 | s174167822 | Wrong Answer | x = int(input())
ans = 0
for i in range(1, x):
for j in range(2, x):
if i**j <= x:
ans = max(ans, i**j)
elif i**j > x:
break
print(ans)
|
p03352 | s825131814 | 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):
for k in range(2, max(2, j) + 1):
if j ** k == i:
l.append(i)
print(max(l)) |
p03352 | s462730060 | Wrong Answer | n=int(input())
list=[]
for i in range(32):
for j in range(10):
ans=i**j
if ans<=n:
list.append(ans)
print(max(list)) |
p03352 | s236138685 | Wrong Answer | import math
N = int(input())
print(math.floor(math.sqrt(N))**2) |
p03352 | s689377700 | Wrong Answer | from math import sqrt
X = int(input())
for x in reversed(range(1, X+1)):
flag = False
for i in range(2,12):
t = x**(1/i)
if t.is_integer():
print(x)
flag = True
break
if flag:
break
|
p03352 | s387871360 | Wrong Answer | x = int(input())
if x == 1:
print("1")
exit()
ans = 0
for b in range(2,x):
for p in range(2,1000):
tmp = pow(b,p)
if tmp<=x:
ans = max(ans,pow(b,p))
break
print(ans) |
p03352 | s356673416 | 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, int(log(x, i))))
if n <= x:
ans = max(ans, n)
print(ans)
|
p03352 | s244700860 | Wrong Answer | X = int(input())
ans = 0
for b in range(1,X):
for p in range(2, X):
if X >= b**p:
if ans < b**p:
ans = b**p
break
print(ans) |
p03352 | s304163326 | Wrong Answer | from bisect import *
A = {1}
for p in range(2,11):
for b in range(1,33):
A.add(p**b)
A = list(A)
A.sort()
X = int(input())
print(A[bisect_right(A,X)-1]) |
p03352 | s894467286 | Wrong Answer | a=int(input())
i=0
while i**2<=a:
i=i+1
print((i-1)**2) |
p03352 | s332722692 | Wrong Answer | X=int(input())
import math
print(math.floor(math.pow(X,0.5))**2) |
p03352 | s168087606 | Wrong Answer | import math
n = int(input())
print(int(math.sqrt(n))**2) |
p03352 | s408742389 | Wrong Answer | from collections import Counter
import sys
X = int(input())
num = []
if X == 1:
print(1)
sys.exit()
for j in range(1, X):
tmp = j + 1
lis = []
while tmp != 1:
for i in range(2, tmp+1):
if tmp % i == 0:
lis.append(i)
tmp = tmp // i
break
if len(Counter(lis)) == 1 and len(lis) > 1:
num.append(j+1)
print(max(num)) |
p03352 | s077588781 | 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()
print(l[-1]) |
p03352 | s553915248 | Wrong Answer | X = int(input())
x = 0
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 | s618435708 | Wrong Answer | x = int(input())
num = [i**2 for i in range(1,33)]
def binary_search(li,k):
left = 0
right = 33
while left < right:
mid = (left+right)//2
if li[mid]<=x and x<li[mid+1]:
return li[mid]
elif li[mid] < x:
left = mid+1
else:
right = mid
print(binary_search(num,x)) |
p03352 | s375310738 | Wrong Answer | from bisect import bisect_right
a = int(input())
dp = [1]
t = 1
while t**2<=10000:
dp.append(t**2)
t+=1
if dp[-1]>=a:
print(dp[-2])
exit()
print(dp[bisect_right(dp,a)-1])
|
p03352 | s724822982 | Wrong Answer | 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 = x**p
print(ans) |
p03352 | s559376014 | Wrong Answer | i = int(input())
ans = 0
for ii in range(1,i):
for p in range(2,i):
if ii == (p*p):
ans = ii
print(ans)
|
p03352 | s985972292 | Wrong Answer | import math
a = int(input())
mx = 0
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 | s059209305 | Wrong Answer | #ABC097
import math
x = int(input())
l = [1]
for i in range(int(math.sqrt(x))+1):
j = 1
for j in range(100):
if i ** j > x:
l.append(i ** (j-1))
break
print(l[-1]) |
p03352 | s994956613 | Wrong Answer | x = int(input())
import math
while True:
if(math.sqrt(x).is_integer()):
print(x)
exit()
else:
x -= 1 |
p03352 | s170840118 | Wrong Answer | import math
x = int(input())
s = math.floor(math.sqrt(x))
if x == 1:
print(1)
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 | s787787236 | Wrong Answer | x = int(input())
res = 1
for b in range(2, int(pow(1000, 1/2))+1):
flag = True
p = 2
while b**p <= x and flag:
p += 1
flag = False
if not flag: res = max(res, b**(p-1))
print(res) |
p03352 | s660263058 | Wrong Answer | import math
n = int(input())
ans = 0
for i in range(1,math.ceil(math.sqrt(n))):
for j in range(2,11):
if i ** j > n and j > 2:
ans = max(ans,i ** (j-1))
break
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.