Problem:


Score : 200 points

Problem Statement

Find the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.

Constraints

1 \leq N \leq 10^9

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the largest square number not exceeding N.

Sample Input 1

10

Sample Output 1

9

10 is not square, but 9 = 3 × 3 is. Thus, we print 9.

Sample Input 2

81

Sample Output 2

81

Sample Input 3

271828182

Sample Output 3

271821169



Sample input:
10


Sample output:
9

Submission status: Wrong Answer

Solution code:
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
# import statistics
import bisect
import copy
import fractions
import math
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))
def unite(x, y):
    # それぞれのノードの根を求める
    x = root(x)
    y = root(y)
    if x == y:
        return
    # node[x]の根をyに変更する
    node[x] = y
def same(x,y): return bool(root(x) == root(y))
def root(x):
    if node[x] == x:  # xが根の場合
        return x
    else:
        node[x] = root(node[x])  # 経路圧縮
        return node[x]
def dfs(v):
    # ノードに訪れた
    visited[v] = True
    for v2 in range(n):
        if graph[v][v2] == False:  # そもそもvとv2が辺でつながっていない
            continue
        if visited[v2] == True:  # もう見た
            continue
        dfs(v2)


n = II()
ans = 1
for i in range(1, n):
    ans = i ** 2
    if ans > n:
        print((i-1) ** 2)
        exit()

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(N):
  if N < i**2:
    print((i-1)**2)
    break

Submission status: Wrong Answer

Solution code:
N = int(input())
print((N**0.5//1)**2)

Submission status: Wrong Answer

Solution code:
import math

# 入力
N=int(input())

print(int(math.sqrt(N)))

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=0
for i in range(n):
  if i**2<=n:
    ans=i**2
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(int(N**0.5))

Submission status: Wrong Answer

Solution code:
n=int(input())
for a in range(n):
 if a*a<=n:
  continue
 else:
  print((a-1)**2)
  break

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=1
for i in range(n):
  if i**2>n:
    break
  else:
    ans=i**2
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=0
for i in range(n):
  if i**2>n:
    break
  else:
    ans=i**2
print(ans)

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
print(math.floor(math.sqrt(n)))
"""
memo = [1]
for i in range(2,math.ceil(math.sqrt(n))+1):
    memo.append(i*i)
print(memo[len(memo)-1])
"""

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
  m = (i+1) ** 2
  if m > n:
    print(i**2)
    break

Submission status: Wrong Answer

Solution code:
n=int(input())

a=n

for i in range(n):
  if (float.is_integer(a**0.5)):
    print(n)
  else:
    a=a-1

Submission status: Wrong Answer

Solution code:
n=int(input())

for i in range(n):
  if (float.is_integer(n**0.5)):
    print(n)
  else:
    n=n-1

Submission status: Wrong Answer

Solution code:
from math import sqrt
n = int(input())
for i in range(n,1,-1):
    if sqrt(i).is_integer():
        print(i)
        break
    else:
        continue

Submission status: Wrong Answer

Solution code:
from math import sqrt
n = int(input())
for i in range(n,1,-1):
    if sqrt(i).is_integer():
        print(int(sqrt(i)))
        break
    else:
        continue

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(1,n):
 if i*i>n:
  print((i-1)**2)
  break
 else:
  continue

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(n):
 if i*i>n:
  print((i-1)**2)
  break
 else:
  continue

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(n):
 if i*i>n:
  print(i-1)
  break
 else:
  continue

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
    if i**2 > n:
        print((i-1)**2)
        break
    elif i**2 == n:
        print(n)
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
    if i**2 > n:
        print((i-1)**2)
        break
    elif i**2 == n:
        print(i**2)
        break

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(n,1,-1):
    j=i**0.5
    if j.is_integer():
        print(i)
        break

Submission status: Wrong Answer

Solution code:
N=int(input())
a=0
for x in range(N):
	if x*x > N:
		break
	a=x*x
print(a)

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n+1, 1, -1):
    calc = pow(i, 0.5)
    if calc.is_integer():
        break
print(i)

Submission status: Wrong Answer

Solution code:
N = int(input())
i = 1
while(i**2<=N):
  i += 1
print(i-1)

Submission status: Wrong Answer

Solution code:
n=int(input())
x=round(n**0.5)
print(x**2)

Submission status: Wrong Answer

Solution code:
# -*- coding utf-8 -*-
n=int(input())
ans=[]

for i in range(1,n+1,1):
    z=i**0.5
    if z%1==0:
        ans.append(z)


print(round(z**2))

Submission status: Wrong Answer

Solution code:
n=int(input())
i=1
while True:
    if i**2>=n:
        print((i-1)**2)
        break
    i+=1

Submission status: Wrong Answer

Solution code:
N = int(input())

m = 0
for i in range(1, N):
    if i**2 > N:
        break
    m = i**2
print(m)

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
for i in range(N + 1, 1, -1):
	if math.sqrt(i).is_integer():
		print(i)
		exit()

Submission status: Wrong Answer

Solution code:
N = int(input())
for x in range(31623,1,-1):
    if N >= x * x:
        print(x * x)
        exit()

Submission status: Wrong Answer

Solution code:
print(int(int(input()) ** 0.5 ** 2))

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 1
for i in range(N):
  if i**2 > N:
    break
  else:
    ans = i**2
    
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
for i in range(N):
  if i**2 > N:
    break
  else:
    ans = i**2
    
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

vsum = 0
for i, v in enumerate(range(1, N, 2)):
	vnext = vsum + v
	if N < vnext:
		print(i**2)
		break
	vsum = vnext

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=1
for i in range(10000):
  if i**2 <= n:
    ans=i**2
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
for i in range(N):
    if N < i ** 2:
        ans = (i-1) ** 2
        break
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
for i in range(N):
    if N <= i ** 2:
        ans = i ** 2
        break
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(int(n**.5)+1,0,-1):
  if n>i**2:
    print(i**2)
    break

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(int(n**.5)+1):
  if n>i**2:
    print(i**2)
    break

Submission status: Wrong Answer

Solution code:
import math


N = int(input())
ans = [i*i for i in range(math.ceil(math.sqrt(N))) if i * i <= N]
print(ans[-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
n = (N**0.5) //1
print(n**2)

Submission status: Wrong Answer

Solution code:
n=int(input())

for i in range(1,n+1):
    x=i*i
    if x>n:
        print((i-1)*(i-1))
        exit()

Submission status: Wrong Answer

Solution code:
n=int(input())

for i in range(1,n):
    x=i*i
    if x>n:
        print((i-1)*(i-1))
        exit()

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
    x=i*i
    if x>n:
        print((i-1)*(i-1))
        exit()

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n//2):
    x=i*i
    if x>n:
        print((i-1)*(i-1))
        exit()

Submission status: Wrong Answer

Solution code:
n=int(input())
i=1
while i*i<=n:
    i+=1
print(i*i)

Submission status: Wrong Answer

Solution code:
n=int(input())
i=1
while i^2<=n:
    i+=1
print(i)

Submission status: Wrong Answer

Solution code:
n=int(input())
i=1
while i^2<=n:
    i+=1
print(i-1)

Submission status: Wrong Answer

Solution code:
n=int(input())
i=1
while i^2<=n:
    i+=1
print(n-1)

Submission status: Wrong Answer

Solution code:
num = 0
N = int(input())
for i in range(N, 1, -1):
    for j in range(1, N+1):
        if i == j * j:
            num = i
            print(num)
            exit()

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(1, N):
    if i ** 2 > N:
        print((i - 1) ** 2)
        break

Submission status: Wrong Answer

Solution code:
import math

n = int(input())

for i in reversed(range(n)):
    if math.sqrt(i).is_integer():
        print(i)
        break

Submission status: Wrong Answer

Solution code:
import math

n = int(input())

for i in reversed(range(n+1)):
    if math.sqrt(i) * math.sqrt(i) == float(i):
        print(i)
        break

Submission status: Wrong Answer

Solution code:
import math

n = int(input())

for i in reversed(range(n)):
    if math.sqrt(i) * math.sqrt(i) == float(i):
        print(i)
        break

Submission status: Wrong Answer

Solution code:
a = int(input())

ans = 1
while a > ans * ans:
    ans += 1
ans -= 1
print(ans * ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
x=1
heiho=0
while 1:
    if heiho >n:
        print(befor)
        break
    x+=1
    befor=heiho
    heiho=x*x

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import sqrt
N = int(input())
print(int(sqrt(N)))

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
print(int(math.sqrt(n)))

Submission status: Wrong Answer

Solution code:
n = int(input())
print(int(n ** 0.5))

Submission status: Wrong Answer

Solution code:
n = int(input())
i=1
res = 0
while i*i<=n:
    if i*i==n:
        res=i*i
    i+=1
print(i)

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n+1):
    if n < i*i:
        break
print((i-1)**2)

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n+1):
    print(i)
    if n < i*i:
        break
print((i-1)**2)

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
    if n < i*i:
        break
print((i-1)**2)

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(0,N,1):
  if (i+1)*(i+1) > N:
    print(i*i)
    break

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(n,1,-1):
    if (i**(1/2)).is_integer():
        print(i)
        break

Submission status: Wrong Answer

Solution code:
print(round(int(input())**0.5)**2)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans = 0
i=0
while ans<n:
    i+=1
    ans=i*i
print((i-1)**2)

Submission status: Wrong Answer

Solution code:
a=[i**2 for i in range(1,10000)]
t=int(input())
for s in range(len(a)):
  if t<a[s]:
    print(a[s-1])
    break

Submission status: Wrong Answer

Solution code:
int(int(input()) ** 0.5)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
for i in range(N):
    if i*i <= N:
        ans = i*i
    else:
        break
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
    if i**2 > n:
        print((i-1)**2)
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
l = []
for i in range(n):
    if i**2 <= n:
        l.append(i**2)
print(max(l))

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n+1):
    if i**2 > n:
        print((i-1)**2)
        exit()

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
    if i**2 > n:
        print((i-1)**2)
        exit()

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
almost=round(math.sqrt(n))
ans=0
for i in range(almost,n+1):
    if i <= math.sqrt(n):
        ans=i**2
    else:
        break
print(ans)

Submission status: Wrong Answer

Solution code:
import math
print(round(math.sqrt(int(input())))**2)

Submission status: Wrong Answer

Solution code:
import math
int_n = int(input())

result = 0

for i in range(int_n, 1, -1):
    if abs(math.sqrt(i) - int(math.sqrt(i))) == 0:
        print(i)
        exit(0)

Submission status: Wrong Answer

Solution code:
import math
int_n = int(input())

result = 0

for i in range(int_n, 1, -1):
    if math.sqrt(i) == int(math.sqrt(i)):
        print(i)
        exit(0)

Submission status: Wrong Answer

Solution code:
import math
int_n = int(input())

result = 0

for i in range(int_n, 1, -1):
    if math.sqrt(i) - int(math.sqrt(i)) == 0:
        print(i)
        exit(0)

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(10000):
  if (10000-i)**2<=n:
    print((10000-i)**2)
    exit()

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(10*5):
  if (10**5-i)**2<=n:
    print((10**5-i)**2)
    exit()

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(36):
  if (36-i)**2<=n:
    print((36-i)**2)
    exit()

Submission status: Wrong Answer

Solution code:
int_n = int(input())

result = 0

for i in range(int_n):
    if i ** 2 <= int_n:
        result = i**2
    else:
        break
print(result)

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(1,n+1):
    if i**2 > n:
        print((i-1)**2)
        break

Submission status: Wrong Answer

Solution code:
from math import floor, sqrt
N = int(input())
k = (N**(1/2))**2
a = floor(k)
print(a)

Submission status: Wrong Answer

Solution code:
from math import floor, sqrt
N = int(input())
print(floor(N**(1/2)**2))

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
k = round(math.sqrt(N))
print(k**2)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans=0
for i in range(int(N**(1/2))):
  if (i+1)**2<N:
    ans=(i+1)**2
    
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

if N == 1:
    sq = 1
else:
    i = 1
    sq = 1
    while sq < N:
        i = i + 2
        sq = sq + i

    sq = sq-i

print(sq)

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(1,n+1):
    if i**2>n:
        print((i-1)**2)
        break

Submission status: Wrong Answer

Solution code:
N = int(input())
k = 0

for i in range(N+1):
    if (i**2 <= N):
        k = i**2
    else:
        print(k)
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
i = 1
while True:
    if i ** 2 > n:
        print((i-1)**2)
        break

    i += 1
    if i >= 10000:
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
i = 1
while True:
    if i ** 2 > n:
        print(i-1)
        break

    i += 1
    if i >= 1000000:
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
i = 1
while True:
    if i ** 2 > n:
        print(i-1)
        break

    i += 1
    if i >= 10000:
        break

Submission status: Wrong Answer

Solution code:
N = int(input())
# print(int(pow(N, 1/2)) ** 2)
for i in range(N+1):
    if i ** 2 > N:
        print((i-1)**2)
        break

Submission status: Wrong Answer

Solution code:
N = int(input())
# print(int(pow(N, 1/2)) ** 2)
for i in range(N):
    if i ** 2 > N:
        print((i-1)**2)
        break

Submission status: Wrong Answer

Solution code:
N = int(input())
x = int(N**(0.5))
if(N%x == 0):
  print(N)
else:
  print((int(N**(0.5))-1)**2)

Submission status: Wrong Answer

Solution code:
N = int(input())

print((int(N**(0.5))-1)**2)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 1
for i in range(N):
    if i * i <= N:
        ans = i * i
    else:
        break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(N + 1):
    if i * i > N:
        break

print((i - 1) * (i - 1))

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(N):
    if i * i > N:
        break

print((i - 1) * (i - 1))

Submission status: Wrong Answer

Solution code:
# coding: utf-8
N = int(input())
for i in range(1,N+1):
    if i == 1:
        print(1)
        break
    if i**2 > N:
        print((i-1)**2)
        break

Submission status: Wrong Answer

Solution code:
# coding: utf-8
N = int(input())
for i in range(N):
    if i**2 > N:
        print((i-1)**2)
        break

Submission status: Wrong Answer

Solution code:
N=int(input())
kekka=0

if(N==1):
    print("1")
    quit()

for i in range(N):
    kekka=i**2
    
    if(kekka>N):
        print((i-1)**2)
        quit()

Submission status: Wrong Answer

Solution code:
N=int(input())
kekka=0

for i in range(N):
    kekka=i**2
    if(kekka>N):
        print((i-1)**2)
        quit()

Submission status: Wrong Answer

Solution code:
import numpy as np    
N=int(input())
print(int(np.sqrt(N)))

Submission status: Wrong Answer

Solution code:
from math import sqrt

n = int(input())
ans = round(sqrt(n))
print(pow(ans,2))

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(n // 2):
    if i ** 2 > n:
        print((i - 1) ** 2)
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
ans=0
for i in range(n):
    if i*i <= n:
        ans = i*i
    else:
        print(ans)
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0

while True:
	if ans * ans >= n:
		break
	ans += 1
	
print(ans*ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0

while True:
	if ans * ans >= n:
		break
	ans += 1
	
print(ans)

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
int(math.sqrt(x))**2

Submission status: Wrong Answer

Solution code:
import numpy as np
print(int(10**(np.log10(int(input()))/2))**2)

Submission status: Wrong Answer

Solution code:
import numpy as np
int(10**(np.log10(int(input()))/2))**2

Submission status: Wrong Answer

Solution code:
from math import ceil, sqrt

n = int(input())
print(ceil(sqrt(n)) ** 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n+1, 1, -1):
    x = str(i ** 0.5).split('.')
    if x[-1] == '0':
        print(i)
        exit()

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(n):
    if i**2<=n:
      c=i**2
    else:
        break
print(c)

Submission status: Wrong Answer

Solution code:
N = int(input())

kotae = []
for i in range(N):
    if i*i > N:
        break
    else:
        kotae.append(i*i)
    
print(max(kotae))

Submission status: Wrong Answer

Solution code:
import math
print(int(math.sqrt(int(input())))^2)

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

ans = []
for i in range(int(math.sqrt(N)) + 1):
    if i**2 < N:
        ans.append(i**2)

print(ans[len(ans)-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
for i in range(N):
    if i*i>N:
        break
    ans=i*i
    
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(n):
    if i*i>n:
        print((i-1)*(i-1))
        exit()

Submission status: Wrong Answer

Solution code:
N = int(input())
max_num = 0
for i in range(N):
    max_num = i**2
    if max_num > N:
        print((i-1)**2)
        exit()

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n + 1):
    if n < i * i:
        print((i - 1) * (i - 1))
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n + 1):
    if n < i ** 2:
        break
print((i - 1) ** 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
    if n < i ** 2:
        break
print((i - 1) ** 2)

Submission status: Wrong Answer

Solution code:
import math
print(int(math.sqrt(int(input()))//1))

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
for i in range(n):
    sq = i ** 2
    if sq <= n:
        ans = sq
    else:
        break
print(ans)

Submission status: Wrong Answer

Solution code:
#2
n = int(input())
s = 0
for i in range (1,n):
    if i**2 <= n:
        s = i**2
    else:
        continue
print(s)

Submission status: Wrong Answer

Solution code:
n=int(input())
x=0
y=0
while n>x:
    y+=1
    x= y**2
print((y-1)**2)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 2
for num in range(2, N):
    if num**2 <=N:
        ans = max(ans, num**2)
    else:
        break
print(ans)

Submission status: Wrong Answer

Solution code:

def main():
    n = int(input())


    for i in range(1,n):
        if i*i > n:
            print(ans)
            exit()
        ans = i*i


if __name__ == "__main__":
        main()

Submission status: Wrong Answer

Solution code:
n = int(input())

before_square = 1
while before_square**2 < n:
    before_square += 1
before_square -= 1

print(before_square**2)

Submission status: Wrong Answer

Solution code:
n = 81
ans = 0
for i in range(1, 40000)[::-1]:
    if i * i <= n:
        ans = i*i
        break

print(ans)

Submission status: Wrong Answer

Solution code:
n =  int(input())
print(int((n ** 0.5)**2))

Submission status: Wrong Answer

Solution code:

import math

N=int(input())

for i in range(N,-1,-1):
    a=math.ceil(math.sqrt(i))
    if a*a==i:
        print(a)
        break

Submission status: Wrong Answer

Solution code:
N = int(input())
N_s = (N ** (1/2)) // 1
print(N_s ** 2)

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(N):
    n = i*i
    if n > N:
        break
        
    res = n

print(res)

Submission status: Wrong Answer

Solution code:
# input
N = int(input())

i = 1

while i ** 2 <= N:
    i += 1

print(i ** 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 1
while True :
	if (ans+1) ** 2 < n:
		ans += 1
	else:
		print(ans ** 2)
		exit()

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
for i in range(n, 0, -1):
  if math.sqrt(i) ** 2 == i:
    print(i)
    break

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 0
for i in range(x):
      if i*i > x:
            break
      ans = i*i
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
import math as m
x = round(m.sqrt(n)) + 1
while x > n :
    x = x - 1
    
print(x*x)

Submission status: Wrong Answer

Solution code:
n = int(input())
import math as m
x = m.sqrt(n)
while x > n :
    x = x - 1
    
print(x*x)

Submission status: Wrong Answer

Solution code:
n = int(input())
import math as m
x = round(m.sqrt(n))
while x > n :
    x = x - 1
    
print(x*x)

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
print(int(math.sqrt(n)))

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 1
while count*count <N:
  count += 1
print(pow(count,2))

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

box = []
for i in range(N+1):
	if math.sqrt(i)**2 == i:
		int(i)
		box.append(i)
print(max(box))

Submission status: Wrong Answer

Solution code:

def main():
    N = int(input())

    num = 1
    for i in range(1,6):
        if N >= (10**i)**2 and N < (10**(i+1))**2:
            for j in range(10**i, 10**(i+1)):
               if j**2 > 10**9 or j**2 > N:
                   print (num)
                   return
               else:
                   num = j**2
               

    print (num)


if __name__ == "__main__":
    # global stime
    # stime = time.clock()
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 1
for i in range(1,n+1):
  if i**(1/2) == int(i**(1/2)):
    ans = 1
print(i)

Submission status: Wrong Answer

Solution code:
print((lambda x:max([i*i for i in range(10001) if x>=i*i]))(int(input())))

Submission status: Wrong Answer

Solution code:
print((lambda x:max([i*i for i in range(10001) if x>=i]))(int(input())))

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
    if (i+1)**2 > n:
        print(i**2)
        exit()

Submission status: Wrong Answer

Solution code:
N = int(input())

a = 1

while a**2 < N:
    a+=1

print(a**2)

Submission status: Wrong Answer

Solution code:
n=int(input())

for i in range(n+1):
        if i*i>n:
                print((i-1)*(i-1))
                break

Submission status: Wrong Answer

Solution code:
n=int(input())

for i in range(n):
        if i*i>n:
                print((i-1)*(i-1))
                break

Submission status: Wrong Answer

Solution code:
a = int(input())
b=0

for i in range(a):
    if(i**2 > a):
        b = i - 1
        break

print(b**2)

Submission status: Wrong Answer

Solution code:
a = int(input())
b=0
while (b+1)**2 < a:
        b += 1

print(b**2)

Submission status: Wrong Answer

Solution code:
A,B,N = 0,1,int(input())
while (True):
	A += 1
	if A*A>N:
		break
	b = A*A     
print('{0} = {1}**2' .format(b,int(b**(1/2))))

Submission status: Wrong Answer

Solution code:
import numpy as np

N=int(input())
for i in range(N):
    if i*i > N:
        break
print((i-1)**2)

Submission status: Wrong Answer

Solution code:
import math as m
N = int(input())
X = m.floor(m.sqrt(N))
print(X)

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(1,n):
 if i*i>n:print(~-i*~-i);break

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(n):
 if i*i>n:print(~-i*~-i);break

Submission status: Wrong Answer

Solution code:
N = int(input())
maxsq = 0
for i in range(N):
    if(i*i <= N):
        maxsq = i*i
    elif(i*i > N):
        break;
print(maxsq)

Submission status: Wrong Answer

Solution code:
import math
print(str(math.pow(int(math.sqrt(int(input()))),2)))

Submission status: Wrong Answer

Solution code:
import math
print(str(int(math.sqrt(int(input())))))

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(N) :
    if i*i > N :
        break

print((i-1)*(i-1))

Submission status: Wrong Answer

Solution code:
n=int(raw_input())
for k in range(40000):
  if k**2>n:
    print (k-1)**2

Submission status: Wrong Answer

Solution code:
a = int(input())
import math 
b = math.sqrt(a)
c = float(b)
d = c**2
print(d)

Submission status: Wrong Answer

Solution code:
a = int(input())
import math
b = math.sqrt(a)
c = float(b)
print(c**2)

Submission status: Wrong Answer

Solution code:
a = int(input())
import math
b = math.sqrt(a)
c = float(b)
print(c)

Submission status: Wrong Answer

Solution code:
int((int(input()) ** 0.5 // 1) ** 2)

Submission status: Wrong Answer

Solution code:
n = int(raw_input())
n = n**0.5;
print n*n

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

def main():
    N = int(input())
    for i in range(N):
        if i ** 2 > N:
            return (i - 1 ) ** 2
if __name__ == "__main__":
    print(main())

Submission status: Wrong Answer

Solution code:
n=int(input())

for i in range(n+1):
    if i**2>n:
        break
print((i-1)**2)

Submission status: Wrong Answer

Solution code:
n=int(input())

for i in range(n):
    if i**2>n:
        break
print((i-1)**2)

Submission status: Wrong Answer

Solution code:
import math
def Main():
    N = int(input())
    lists = []
    for i in range(N):
        lists.append(math.sqrt(i+1))
        if i == N-1:
            print(int(math.sqrt(i+1)**2))

    #lists.sort()
    #print(int(lists[len(lists)-1]**2))


if __name__ == "__main__":
    Main()

Submission status: Wrong Answer

Solution code:
import math
def Main():
    N = int(input())
    lists = []
    for i in range(N):
        lists.append(math.sqrt(i+1))
    lists.sort()
    print(int(lists[len(lists)-1]**2))


if __name__ == "__main__":
    Main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8

n = input()
l = []
for i in xrange(1, n+1):
    s = i ** 2
    l.append(s)

    if s > n:
        print l[-2]
        break

Submission status: Wrong Answer

Solution code:
n = int(input())

a = []

for i in range(n) :
    if i**2 <= n:
      a.append(i ** 2)
    else:
      break

print(a[-1])

Submission status: Wrong Answer

Solution code:
import sys

DBG_FLAG = 0

def p_dbg(str):
    if(DBG_FLAG == 1):
        sys.stdout.flush()
        print str

# 1st. get Num

Num = int(raw_input())

p_dbg('Num : ' + str(Num))

square_max = 1

# MEMORY OVER
# for i in range(1, Num):
#     tmp = i * i
#     p_dbg(str(i) + str(square_max))
#     if(tmp <= Num):
#         square_max = tmp
#     else:
#         break

i = 1
tmp = 1
while tmp < Num:
    p_dbg(str(i) + ':' + str(square_max))
    square_max = tmp
    tmp = i*i
    i = i+1

print square_max

Submission status: Wrong Answer

Solution code:
a = int(input())
import math
def Bround(a):
    while True:
        s = math.sqrt(a)
        if s * s == a:
            return a
        else:
            a -= 1
print(Bround(a))

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import numpy
# Your code here!
N = int(input())
X = numpy.sqrt(N)

if (X**X)==N:
    print(X*X)
else:
    print(int(X)*int(X))

Submission status: Wrong Answer

Solution code:
N = int(input().strip())

count = 0
while True:
    if (count + 1) ** 2 > N:
        print(count)
        break
    count += 1

Submission status: Wrong Answer

Solution code:
import math

N = int(input())
rN = math.sqrt(N)

print(int(rN))

Submission status: Wrong Answer

Solution code:
import math

a = int(input())
for n in range(a):
    if pow(math.sqrt(a-n),2) == (a-n):
        if a-n == int(a-n):
            break
print(a-n)

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
print(round(math.sqrt(N))**2)

Submission status: Wrong Answer

Solution code:
import sys

n = int(input())
n2 = int(n/2)

for i in range(n2, 0, -1):
    if i * i <= n:
        print(i * i)
        sys.exit(0)

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
for i in range(N)[::-1]:
  a = math.sqrt(i)
  if a % 1 == 0:
    print(i)
    break
  else:
    continue

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import math

def main():
    N = int(input())
    for i in reversed(range(N)):
        int_sqrt = int(math.sqrt(i))
        if i == int_sqrt ** 2:
            print(i)
            return None

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def solve():
    N = int(input())
    ans = 0
    while ans*ans < N:
        ans += 1
    print((ans-1)**2)

solve()

Submission status: Wrong Answer

Solution code:
N = int(input())
n = 1
while True:
	if (n + 1) ** 2 >= N:
		break
	else:
		n += 1
print(n ** 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n):
	if i**2 > n:
		print((i-1)**2)
		break

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(n//2+1):
	if i**2 > n:
		print((i-1)**2)
		break

Submission status: Time Limit Exceeded

Solution code:
import math
N = int(input())

ans = 1
for i in range(1,N+1):
  j = math.sqrt(i)
  if j == int(j):
    ans = i
    
print(ans)