problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03352 | s042715548 | Wrong Answer | x = int(input())
vis = [False for _ in range(1001)]
vis[0] = True
vis[1] = True
for i in range(2,1001):
tmp = i
while (tmp < 1001):
vis[tmp] = True
tmp *= i
best = 0
for i in range(x+1):
if vis[i] and i > best:
best = i
print(i) |
p03352 | s141306306 | Wrong Answer | x = int(input())
print(int(x**(1/2))**2) |
p03352 | s296162735 | Wrong Answer | def main():
X = int(input())
ma = 0
for b in range(1, X+1):
for p in range(2, X+1):
if b**p > X:
break
ma = max(ma, b**p)
print(ma)
if __name__ == '__main__':
main()
|
p03352 | s756734515 | Wrong Answer | import math
X = int(input())
ans = 1
for Y in range(X,1,-1):
for b in range(Y,2,-1):
p = math.log(Y,b)
if p % 1 ==0 and p > 1:
ans = max(ans, b ** p)
print(int(ans)) |
p03352 | s606277437 | Wrong Answer | from math import sqrt, log
x = int(input())
ans = 1
for i in range(2, int(sqrt(x)) + 1):
ans = int(pow(i, int(log(x, i))))
print(ans)
|
p03352 | s058230104 | Wrong Answer | x=int(input())
ans=0
for i in range(2,x):
for j in range(1,12):
if i**j<=x:
ans=max(ans,i**j)
else:
break
print(ans) |
p03352 | s887628357 | 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
elif X == i**j:
print(i**j)
sys.exit(0) #平方数忘れ
print(max(L)) |
p03352 | s043530004 | Wrong Answer | X = int(input())
n = 1
while n ** 2 <= X:
n += 1
if n ** 2 == X:
print(X)
else:
print((n-1) ** 2) |
p03352 | s773149039 | 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 or num ** 3 == i and ans <= i:
ans = i
print(ans) |
p03352 | s060026162 | Wrong Answer | import math
n=int(input())
ans = 1
for i in range(int(math.sqrt(n))+1):
for j in range(int(math.sqrt(n))+1):
if i**j < n and ans < i ** j:
ans = i**j
print(ans) |
p03352 | s013150522 | Wrong Answer | X = int(input())
ans = 1
for i in range(X):
N, n = X - i, X - i
b = 0
for j in range(2, n):
if b == 0:
while N % j == 0:
N //= j
b = 1
else:
break
if b == 1 and N == 1:
ans = n
break
print(ans) |
p03352 | s823109082 | Wrong Answer | from bisect import bisect_right
a = int(input())
dp = [1]
t = 1
while t**2<=1000:
dp.append(t**2)
t+=1
print(dp[bisect_right(dp,a)-1])
|
p03352 | s491897364 | Wrong Answer | import math
x = int(input())
print(int(math.sqrt(x)) ** 2)
|
p03352 | s334829336 | Wrong Answer | import math
X = int(input())
print(math.floor(X**(1/2))**2) |
p03352 | s905510393 | Wrong Answer | x = int(input())
i = 1
while (i+1)**2 < x:
i += 1
print(i**2) |
p03352 | s559811353 | Wrong Answer | 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 | s889547895 | Wrong Answer | X = int(input())
while(1):
for i in range(2,11):
f = pow(X,1.0/float(i))
if(f.is_integer()):
print(X)
exit()
X-=1
|
p03352 | s217100428 | Wrong Answer | x = int(input())
print(max(i ** j for i in range(1, 34) for j in range(1, 11) if i ** j <= x))
|
p03352 | s923560975 | Wrong Answer | X = int(input())
lst = []
for i in range(1,101):
for j in range(2,11):
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 | s090575824 | Wrong Answer | X = int(input())
ans = 1
for b in range(1,101):
for p in range(2,10):
if X >= b**p:
ans = b**p
print(ans) |
p03352 | s656522694 | Wrong Answer | x = int(input())
l = [1]
for i in range(2,32):
num = i
num *= num
while num < x:
l.append(num)
num *= num
print(max(l)) |
p03352 | s433115918 | Wrong Answer | X = int(input())
lst = []
for i in range(1,101):
for j in range(2,11):
if i**j > 1000:
break
else:
lst.append(i**j)
print(sorted(lst))
for k in range(X):
if X - k in lst:
print(X-k)
break
|
p03352 | s778201066 | Wrong Answer | import sys
def resolve():
X = int(input())
cands = [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]
for i in range(len(cands)):
if cands[i] > X:
print(cands[i-1])
return
if '__main__' == __name__:
resolve() |
p03352 | s996851095 | Wrong Answer | x = int(input())
ans = 1
for i in range(2, int(x**(0.5))+1):
j = 2
while True:
i = i**j
if i > x:
break
else:
ans = max(ans, i)
j += 1
print(ans) |
p03352 | s395056105 | Wrong Answer | x = int(input())
b = 1
p = 2
a = [b ** p]
i = 0
j = 0
while (b+i) ** (p+j) <= x:
while True:
if (b+i) ** p <= x:
a.append((b+i) ** (p+j))
else:
break
i += 1
j += 1
print(max(a)) |
p03352 | s820924538 | Wrong Answer | x = int(input())
a = []
for i in range(x):
if i**2 <= x:
b=i*i
a.append(b)
print(0 if x == 0 else max(max(a),1))
|
p03352 | s481834502 | Wrong Answer | X=int(input())
max=1
for i in range(1, X):
for j in range(2, X):
if i**j<=X:
if i**j>max:
max=i**j
else:
break
print(max) |
p03352 | s943897089 | Wrong Answer | a=int(input())
d=0
for i in range(40):
b=i+2
while b<a:
b=b*(i+2)
c=b/(i+2)
if d<=c:
d=c
print(int(d)) |
p03352 | s500096528 | Wrong Answer | from math import *
x = int(input())
lst1 = list(range(2, int(sqrt(1000)) + 1))
lst2 = [1]
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 | s995130734 | Wrong Answer | k=int(input())
ans=1
while ans**2<k:
ans+=1
print(1 if k==1 else (ans-1)**2) |
p03352 | s925105317 | Wrong Answer | x = int(input())
b = 1
p = 2
a = []
i = 0
j = 0
while (b+i) ** (p+j) <= x:
i = 0
while (b+i) ** p <= x:
a.append((b+i) ** (p+j))
i += 1
j += 1
print(max(a)) |
p03352 | s741101058 | Wrong Answer | import math
x = int(input())
ans = 0
for i in range(x, -1, -1):
tmp = math.sqrt(i)
if math.sqrt(i).is_integer():
print(i)
exit()
|
p03352 | s232098714 | 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:
break
print(ans) |
p03352 | s902163628 | Wrong Answer | X = int(input())
ans = 0
for i in range(1, 32, 1):
if i*i<=X:
ans = i
print(ans*ans) |
p03352 | s359862030 | Wrong Answer | ls = [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())
for i in range(len(ls)):
if X<=ls[i]:
print(ls[i])
break |
p03352 | s511157722 | Wrong Answer | x = int(input())
for i in reversed(range(x + 1)):
if (i ** 0.5).is_integer():
print(i)
break
|
p03352 | s259650881 | Wrong Answer | import sys
import math
x = int(input())
li = [1]
for i in range(2,40):
tmp = 1
while (i ** tmp <= 1000):
li.append(i ** tmp)
tmp += 1
for i in range(x, 0, -1):
if (i in li):
print(i)
sys.exit() |
p03352 | s625681727 | Wrong Answer | from math import floor, log
x = int(input())
ans = 1
for i in range(2, floor(x ** 0.5) + 1):
temp = i ** floor(log(x, i))
if temp > ans:
ans = temp
print(ans) |
p03352 | s226834542 | Wrong Answer | import math
X = int(input())
b = 1
for i in range(100,1,-1):
a = math.floor(math.log(X, i))
b = max(i**a,b)
print(b) |
p03352 | s048670270 | Wrong Answer | #B - Exponential
X = int(input())
for i in range(X,0,-1):
X_1 = i**0.5
if X_1.is_integer():
print(i)
exit()
else:
pass |
p03352 | s722419700 | Wrong Answer | N = int(input())
ans = 0
for i in range(1, N):
for j in range(1, 20):
if i ** j > N:
break
ans = max(i ** j, ans)
print(ans)
|
p03352 | s534000731 | Wrong Answer | x=int(input())
ans=1
while (ans+1)**2<=x:
ans+=1
print(ans**2) |
p03352 | s862826876 | Wrong Answer | x = int(input())
ans = 0
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 | s504873973 | Wrong Answer | X=int(input())
p=[]
p.append(1)
for i in range(2,1000):
for j in range(1,10):
p.append(pow(i,j))
p.sort()
ans=0
for i in range(len(p)):
if p[i]>X:
break
ans=p[i]
print(ans) |
p03352 | s668201528 | Wrong Answer | x = int(input())
for i in range(x, 0, -1):
if int(i**(1/2))**2==i:
print(i)
break |
p03352 | s686793854 | Wrong Answer | x = int(input())
ans = 0
for i in range(1,x+1):
for j in range(2,x+1):
if i**(1/j) % 1 == 0:
ans = i
print(ans) |
p03352 | s373306324 | Wrong Answer | x = int(input())
r = []
for i in range(1,999):
if i*i >= 1000:
break
r.append(i*i)
r.reverse()
for y in r:
if x >= y:
print(y)
break |
p03352 | s596462886 | Wrong Answer | x = int(input())
for i in range(x):
for j in range(2, 31):
if (x-i)**(1/j) % 1 == 0:
print(x-i)
exit() |
p03352 | s765217477 | Wrong Answer | x = int(input())
c = 1
while c:
for i in range(2, 10):
y = x ** (1 / i)
if y % 1 == 0:
print(x)
c = 0
break
x -= 1 |
p03352 | s185871113 | Wrong Answer | x = int(input())
print(int(x**(1/2))**2) |
p03352 | s744668085 | Wrong Answer | import itertools
import sys
input = sys.stdin.readline
X = int(input())
ans = 0
for i in itertools.count(2):
b = int(X**(1/i))
ans = max(ans, b**i)
if b == 1:
break
print(ans)
|
p03352 | s149643477 | Wrong Answer | import math
X=int(input())
a=math.sqrt(X)
b=int(a)
ans=1
for i in range (2,b+1):
for j in range(2,10):
if b**j <=X <b**(j+1):
ans=max(ans,b**j)
break
print(ans) |
p03352 | s347939222 | Wrong Answer | import math
x = int(input())
print(int(math.sqrt(x))**2) |
p03352 | s891262983 | 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):
if i**x < X and i**x > ans:
ans = i**x
print(ans)
|
p03352 | s778103851 | Wrong Answer | X=int(input())
for i in range(1,33):
if (i)**2 > X:
print((i-1)**2)
break |
p03352 | s462141096 | Wrong Answer | X = int(input())
Max = 0
for i in range(2,3):
b = int(X**(1/i))
B = (b)**i
if Max < B:
Max = B
print(Max) |
p03352 | s152859632 | 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):
for j in range(10):
if i**j <= x:
num = i**j
print(num) |
p03352 | s463175084 | Wrong Answer | X = int(input())
print(int(X**0.5-1)**2) |
p03352 | s734834154 | Wrong Answer | X = int(input())
while 1:
if X**0.5 == int(X**0.5):
print(X)
break
X -= 1 |
p03352 | s583627236 | Wrong Answer | X = int(input())
while(1):
for i in range(2,10):
if(pow(X,1.0/float(i))%1.0==0.0):
print(X)
exit()
X-=1 |
p03352 | s468772007 | Wrong Answer | a = int(input())
if a==1:
print(1)
exit()
res = 0
import math
for i in range(2,32):
x = int(math.log(a,i))
if x ==1:
pass
else:
j = i**x
res = max(res,j)
print(res) |
p03352 | s719538463 | Wrong Answer | x = int(input())
print(int(x**(1/2))**2) |
p03352 | s185096051 | Wrong Answer | import math
k=int(input())
print(int(math.sqrt(k))**2) |
p03352 | s366290343 | 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(X)
else:
print(max(beki))
|
p03352 | s083255403 | Wrong Answer | n = int(input())
for i in range(1, 11):
if i**2 > n:
print((i-1)**2)
break
|
p03352 | s130625290 | Wrong Answer | import math
a = int(input())
print(int(math.pow(a,1/3)) ** 3)
|
p03352 | s639363164 | Wrong Answer | import math
X = int(input())
if X < 4:
print(1)
exit()
for x in range(X, 0, -1):
print("x:", x)
for y in range(2, x, 1):
print("y:", y)
log = math.log(x, y)
print("log:", log)
div, mod = divmod(log, 1)
if mod == 0:
print(x)
exit()
|
p03352 | s919876726 | Wrong Answer | x = int(input())
print(int(x**0.5)**2) |
p03352 | s046876032 | Wrong Answer | X = int(input())
count = [1]
for x in range (1,50):
for y in range (1,10):
if x ** y <= X:
count.append(x ** y)
print(max(count)) |
p03352 | s233809767 | Wrong Answer | import math
X = int(input())
b = int(math.sqrt(X))
print(b**2) |
p03352 | s581542919 | Wrong Answer | import math
X = int(input())
ans = 1
for Y in range(X,1,-1):
for b in range(Y,1,-1):
p = math.log(Y,b)
if p % 1 ==0 and p > 1:
ans = max(ans, b ** p)
print(int(ans)) |
p03352 | s802448815 | Wrong Answer | 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 | s109251293 | Wrong Answer | X = int(input())
so = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
a = 0
for i in so:
if i ** 2 <= X:
a += 1
b = []
x = 1
for i in range(a):
y = so[i]
while y <= X:
y *= so[i]
y = y // so[i]
b.append(y)
b = sorted(b, reverse = True)
if len(b) == 0:
print(1)
else:
print(b[0])
|
p03352 | s159744253 | Wrong Answer | from math import log,floor
X = int(input())
if X < 4:
print(1)
else:
answer = 0
for b in range(2,X):
answer = max(answer,int(b**floor(log(X,b))))
print(answer) |
p03352 | s844489234 | Wrong Answer | n = int(input())
A = []
for i in range(40):
for j in range(20):
A.append(i**j)
A = sorted(A)
ans = 0
for i in A:
if i <= n:
ans = i
else:
break
print(ans) |
p03352 | s579993041 | Wrong Answer | import math
x = int(input())
if x == 1:
print(1)
exit()
ans = 2
n = math.ceil(math.sqrt(x))
for a in range(n,1,-1):
if a*a <= x:
ans = a*a
break
print(ans)
|
p03352 | s538277421 | Wrong Answer | import math
X=int(input())
a=math.sqrt(X)
b=int(a)
ans=1
for i in range (2,b+1):
for j in range(1,10):
if b**j <=X <b**(j+1):
ans=max(ans,b**j)
break
print(ans) |
p03352 | s682714802 | Wrong Answer | x=int(input())
res=0
for b in range(x):
for p in range(2,x):
if res<(b**p)<=x:
res=b**p
elif b**p>x:
break
print(res)
|
p03352 | s946081422 | Wrong Answer | import sys
input = sys.stdin.readline
X = int(input())
ans = [1]
for i in range(2, 1 + int(X ** (1/2))):
ans.append(i)
while i < X:
i *= i
if i <= X:
ans.append(i)
print(max(ans)) |
p03352 | s371651780 | Wrong Answer | n = int(input())
l = []
l.append(1)
for i in range(2,40):
b = i**2
while b <= 1000:
l.append(b)
b*= i
l.sort()
for i in range(len(l)):
if n < l[i]:
print(l[i-1])
exit()
|
p03352 | s267951891 | Wrong Answer | x = int(input())
ans = 0
for b in range(1, 1001):
for p in range(2, 1001):
if b ** p > x:
break
ans = b ** p
print(ans) |
p03352 | s575729180 | Wrong Answer | x = int(input())
tmp = int(x**0.5)+2
ans = 1
for i in range(1,tmp):
for j in range(2,tmp):
if x >= i**j:
ans = i**j
print(ans)
|
p03352 | s749788460 | Wrong Answer | n = int(input())
for i in range(11):
if i**2 > n:
print((i-1)**2)
break |
p03352 | s376396850 | Wrong Answer | x = int(input())
i = 1
while i**2<=x:
i+=1
print((i-1)**2) |
p03352 | s055429383 | Wrong Answer | X = int(input())
so = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
a = 0
for i in so:
if i ** 2 <= X:
a += 1
b = []
x = 1
for i in range(a):
y = so[i]
while y <= X:
y *= so[i]
y = y // so[i]
b.append(y)
b = sorted(b, reverse = True)
if len(b) == 0:
print(1)
else:
print(b[0])
|
p03352 | s218858698 | 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 / p
z = []
a = 2
while a <= x:
z.append(func(a))
a += 1
print(max(z))
|
p03352 | s810303561 | 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 | s153550670 | Wrong Answer | for i in range(1,int(input())+1)[::-1]:
for j in range(2,int(i**(1/2))+1):
if i%j==0:
temp=i
while temp%j==0:
temp//=j
if temp==1:print(i);exit() |
p03352 | s123478376 | Wrong Answer | n = int(input())
x = 1
ans = 0
while ans <= n:
x += 1
ans = x**2
print((x-1)**2) |
p03352 | s775313112 | Wrong Answer | x=int(input())
ans=0
for i in range(32):
if x>=(i+1)**2:
ans=(i+1)**2
else:
print(ans)
break |
p03352 | s017370073 | Wrong Answer | # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# -------------------------------------------------------------
X = int(input())
print(int(X**.5)**2) |
p03352 | s747112764 | Wrong Answer | import math
X = int(input())
if X <= 3:
print(1)
else:
ans = 0
for i in range(2,int(X**0.5)+1):
p = int(math.log(X,i))
if p <= 1:
continue
ans = max(i**p,ans)
print(ans) |
p03352 | s514667623 | Wrong Answer | x = int(input())
ans = 0
for a in range(2, 33):
for b in range(2, 10):
if a**b > x:
break
ans = max(ans, a**b)
print(ans) |
p03352 | s644757820 | Wrong Answer | from math import sqrt
from math import floor
from math import log
x=int(input())
ans=[1]
for i in range(2,x+1):
l=floor(log(x,i))
if l>1:
ans.append(i**l)
print(max(ans)) |
p03352 | s369955043 | Wrong Answer | import math
X = int(input())
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 | s204825884 | 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 | s702547897 | Wrong Answer | import math
X = int(input())
ans = 0
if X == 1:
print(1)
exit()
for i in reversed(range(X)):
num = int(math.sqrt(i))
if num ** 2 == i and ans < i:
ans = i
print(ans) |
p03352 | s768137080 | Wrong Answer | import math
x = int(input())
for i in range(x,0,-1):
if math.sqrt(i)%1 == 0:
print(i)
break |
p03352 | s917242032 | Wrong Answer | x = int(input())
r = int(x**0.5)
for i in reversed(range(1, x+1)):
for j in range(1, r+1):
for k in range(2, r+1):
if i == j**k:
print(i)
exit() |
p03352 | s351628768 | Wrong Answer | x=int(input())
l=[1]
for i in range(2,int(x**0.5)+1):
l.append(int(x**(1/i))**2)
print(max(l)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.