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: Accepted

Solution code:

import math
n=int(input())
print(int(math.sqrt(n))**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
r = 0
while True:
  if r*r > N:
    break
  r += 1
print (r-1)**2

Submission status: Accepted

Solution code:
from math import sqrt
N = int(input())
for i in range(int(sqrt(N))+1,0,-1):
    if i*i <= N:
        ans = i*i
        break
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

test = int(float(n**0.5)//1)

print(test**2)

Submission status: Accepted

Solution code:
import math

N = int(input())
n = math.floor(math.sqrt(N))
print(n**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

while(1):
    sqrtn=n**(1/2)
    if sqrtn-sqrtn//1==0:
        print(int(sqrtn**2))
        break
    n-=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
ans = 1

n = 1
while n * n <= N:
  ans = n * n
  n += 1

print(ans)

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools

def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())

def swap(s,pos):
    s[pos]-=1
    s[pos+1]+=1
    print(s)
    if pos == n-2: return s
    if s[pos+2] == 0: swap(s,pos+1)
    return s


n = ip()                              #入力整数1つ
#left,n= (int(i) for i in input().split())      #入力整数横2つ
#n,x,y = (int(i) for i in input().split())    #入力整数横3つ
#n,m,x,y= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[ip() for i in range(n)]    #入力セット(整数改行あり)(2/2)



#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
a = math.sqrt(n)
print(pow(int(a),2))

Submission status: Accepted

Solution code:
N = int(input())

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = map(int,input().split())   |	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = list(map(int,input().split()))	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]

import collections
import math

#### START
n = int(input())

for i in range(1, 1000000):
  a = i*i
  if a > n:
    print((i-1)*(i-1))
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
n=int(input())
almost=math.floor(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: Accepted

Solution code:
print(int(pow(int(input()),1/2))**2)

Submission status: Accepted

Solution code:
N=int(input())
m=int(pow(N,1/2))
print(m*m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lists = [i * i for i in range(4 * (10 ** 4))]
N = int(input())

back_state = 1
for i in lists:
    if i - N > 0:
        print(back_state)
        exit(0)
    back_state = i

Submission status: Accepted

Solution code:
import math

N=int(input())
ans=int(math.sqrt(N))**2

print(ans)

Submission status: Accepted

Solution code:
int_n = int(input())

result = 0

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import sqrt
n = int(input())
for k in range(2, int(sqrt(n))+2):
    if k**2 > n:
        print((k-1)**2)
        break

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# Luis Yoichi Morales January 2019
import math


N = int( raw_input())
sqroot=int(math.sqrt(N))

print sqroot**2

Submission status: Accepted

Solution code:
N = int(input())

for i in range(N):
  if (N**0.5).is_integer():
    print(N)
    break
  N = N - 1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    i = 1
    last = 1
    while True:
        r = i ** 2
        if r > n:
            print(last)
            break
        last = r
        i += 1



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

N = int(input())

N_tmp = int(math.sqrt(N))
print(N_tmp ** 2)

Submission status: Accepted

Solution code:
# ABC 077
import math
def getInt(): return int(input())
N = getInt()
for i in range(N,0,-1):
    #print(i,end=',')
    sqr = int(math.sqrt(i))
    #print(sqr,end=',')
    if i==sqr**2: break
print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import math

n = int(input())

print(math.floor(math.sqrt(n))**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

sq = int(N**(1/2))**2

print(sq)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n=int(input())

mylist=[]
for i in range(31624):
    mylist.append(i**2)
ans=0    

for i in mylist:
    if i <= n:
        ans=i

print(ans)

Submission status: Accepted

Solution code:
n = int(input())

if n == 1:
    print(1)

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

Submission status: Accepted

Solution code:
from math import floor, sqrt

N = int(input())

print(floor(sqrt(N)) ** 2)

Submission status: Accepted

Solution code:
import math
n = int(input())
rt = math.sqrt(n)
fl = math.floor(rt)
print(fl * fl)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

n = int(input())

print(math.floor(math.sqrt(n)) ** 2)

Submission status: Accepted

Solution code:
N = int(input())
print(int(pow(N, 1/2)) ** 2)
#コピペです。

Submission status: Accepted

Solution code:
N = int(input())
import math
for i in range(N):
     if int(math.sqrt(N-i)) == math.sqrt(N-i):
         print(N-i)
         exit()
     else:
         continue

Submission status: Accepted

Solution code:
sq=[i**2 for i in range(100000)]
n=int(input())
ans=0
for i in range(100000):
    if sq[i]>n:
        ans=i-1
        break
print(sq[ans])

Submission status: Accepted

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

Submission status: Accepted

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

    i += 1
    if i >= 10000000:
        break

Submission status: Accepted

Solution code:
import math

def main() :
	N = int(input())
	for i in range(N,0,-1) :
		a = math.sqrt(i)
		if (a.is_integer()) :
			print(i)
			return

main()

Submission status: Accepted

Solution code:
N=int(input())
Ans=0
for i in range(100000):
    if Ans<i**2 and i**2<=N:
        Ans=i**2
print(Ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = int(math.sqrt(N))
print(ans**2)

Submission status: Accepted

Solution code:
N = int(input())

x = N**(0.5)
if(N%x == 0):
  print(N)
else:
  print(int(x)**2)

Submission status: Accepted

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

Submission status: Accepted

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


abc077_b()

Submission status: Accepted

Solution code:
N = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B Around Square
import math
a = int(input())
print(int(math.sqrt(a))**2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    """Function."""
    n = int(input())

    temp = 1
    while temp ** 2 <= n:
        temp += 1

    print((temp-1) ** 2)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from math import sqrt


def main():
    n = int(input())
    print(int(sqrt(n)) ** 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import math
N = int(input())
n = int(math.sqrt(N))
print(n ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
N = int(input())
root = math.sqrt(N)
root = math.floor(root)
ans = root*root
print(ans)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N=int(input())

for i in range(1,10**5):
    if i**2>N:
        break

print((i-1)**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import sqrt

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

n = int(input())
n = math.sqrt(n)
n = math.floor(n)
m = n * n
print(m)

Submission status: Accepted

Solution code:
import math;a=int(math.sqrt(int(input()))//1);print(a*a)

Submission status: Accepted

Solution code:
N = int(input())

for i in range(10**5):
    if(i**2 > N):
        print((i-1)**2)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
a = int(input())
for i in range(a,-1,-1):
    if math.sqrt(i).is_integer() == True:
        print(i)
        break

Submission status: Accepted

Solution code:
import math as m
n = int(input())
for i in range(n,-1,-1):
  if m.sqrt(i) == int(m.sqrt(i)):
    print(i)
    exit()

Submission status: Accepted

Solution code:
max = int(input())

i = 1

while(True):
	if( i ** 2 <= max ):
		i += 1
		continue
	else: break


print( (i-1)**2 )

Submission status: Accepted

Solution code:
n = int(input())
count = 1
while True:
    if count**2 <= n and n < (count+1)**2:
        print(count**2)
        break
    else:
        count += 1

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(N, 0, -1):
    n = math.sqrt(i)
    if float.is_integer(n):
        print(i)
        break

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
lo, hi = 1, n

while hi - lo > 1:
  x = (hi + lo) // 2
  if x * x > n:
    hi = x
  else:
    lo = x

print(lo * lo)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import math
n = int(input())
print(math.floor(n**0.5)**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n = int( input())

i=0
while True:
  nn=i**2
  if nn < n:
    i=i+1
    continue
  if nn==n:
    break
  i=i-1
  break
print(i**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def main() -> None:
    n = int(next_str())
    print(int(n ** 0.5) ** 2)

def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin


def main() -> None:
    n = int(next_str())

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


def judge(i: int, n: int) -> bool:
    if i ** 2 <= n:
        return True
    return False


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

N = int(input())
print((int(math.sqrt(N)))**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

n = int(input())
print(int(math.sqrt(n)) ** 2)

Submission status: Accepted

Solution code:
import math

n = int(input())
s = math.sqrt(n)
while s.is_integer() == False:
  n -= 1
  s = math.sqrt(n)
print(n)

Submission status: Accepted

Solution code:
n = int(input())
print(max([x**2 for x in range(1,100000) if x**2 <= n]))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
l = [i**2 for i in range(10**5)]
l.append(N)
l.sort()
if len(l) == len(list(set(l))) + 1:
  print(N)
else:
  print(l[l.index(N)-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    from math import sqrt

    n = int(input())
    ans = 0

    for i in range(int(sqrt(n)) + 1):
        ans = max(ans, i ** 2)

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

i = 1
while i*i <= n:
  ans = i*i
  i += 1
  
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
i=1
a=[]
while i*i<=n:
    a.append(i*i) 
    i+=1
print(a[len(a)-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

i = 1
now = 0

while True:
    if i * i > n:
        print(now)
        break

    now = i * i
    i += 1

Submission status: Accepted

Solution code:
import numpy as np

n = int(input())
a = int(round(np.sqrt(n)))
b = int(a-1)
c = int(a+1)

if c**2 < n+1:
    print(c**2)
elif a**2 < n+1:
    print(a**2)
elif b**2 < n+1:
    print(b**2)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
a=1
b=0
i=0
while b==0:
    i+=1
    b=i**2
    if b>N:
        print(a)
        exit()
    a=b
    b=0

Submission status: Accepted

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: Accepted

Solution code:
N = int(input())
L = []
for i in range(10**5) :
    l = i**2
    if N < l :
        print(L[-1])
        break
    else :
        L.append(l)

Submission status: Accepted

Solution code:
import math

N = int(input())
a = int(math.sqrt(N))
print(a*a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

tmp = 1
tmp2 = tmp*tmp

while N >= tmp2:
    tmp += 1
    tmp2 = tmp*tmp
print((tmp - 1)**2)

Submission status: Accepted

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

Submission status: Accepted

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

print((math.floor(n**(1/2)))**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
for i in range(32*10**4):
    if i*i<=N<(i+1)*(i+1):
        print(i*i)

Submission status: Accepted

Solution code:
from math import sqrt
from math import floor
n = int(input())
ans = floor(sqrt(n))
print(ans**2)

Submission status: Accepted

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()
print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    N = int(input())
    i = 1
    while i * i <= N:
        i += 1
    print((i - 1) * (i - 1))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# 平方根

print(int(int(input())**.5)**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor, sqrt

print(floor(sqrt(int(input()))) ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2
n = int(input())

cnt = 1

while cnt**2 <= n :
    cnt = cnt + 1
    
cnt = cnt - 1
print(cnt**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())

print(int(np.sqrt(n))**2)

Submission status: Accepted

Solution code:
#2
n = int(input())
N = int(float(n)**0.5)
N2 = N**2
print(N2)

Submission status: Accepted

Solution code:
#2
n = int(input())
p = 0
for i in range(int(n**0.5)+1):
    if i**2<=n: p=i
print(p**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
k = 1

while k ** 2 <= n :
    k += 1

print((k - 1) ** 2)

Submission status: Accepted

Solution code:
#2
n = int(input())
num = 1

a = int(n**(0.5))

        
print(a**2)

Submission status: Accepted

Solution code:
#2
n = int(input())
cnts = 0
while(cnts**2 <= n):
    cnts += 1

print((cnts-1)**2)

Submission status: Accepted

Solution code:
#2

n = int(input())
a=1
raw=0

while raw <= n:
    raw=a*a
    a=a+1

print((a-2)*(a-2))

Submission status: Accepted

Solution code:
#2
n = int(input())
s = 1
p = 1
while (True):
    p = s * s
    s = s + 1
    if (s*s > n) :
        break
    
print(p)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
for i in range(a+1):
    if (a-i)**(1/2) % 1 == 0:
        print(a-i)
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#77b
n=int(input())
print(int((n**(.5)//1)**2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())


print(int(math.sqrt(int(input())))**2)

Submission status: Accepted

Solution code:
# cook your dish here
n=int(input())

a = int(n**(0.5))
print(a**2)

Submission status: Accepted

Solution code:
N = int(input())
L = []
for i in range(31624) :
    l = int(i**2)
    L.append(l)
for j in range(31624) :
    if L[j+1] > N :
        print(L[j])
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# utf-8:
import math as np


def main():
    n = int(raw_input())
    a = int(np.sqrt(n))
    print(a * a)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
IN = input()
IN = int(IN)

i = 1

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

Submission status: Accepted

Solution code:

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

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

    print(ans)


if __name__ == "__main__":
        main()

Submission status: Accepted

Solution code:
import math

N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

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

    for i in range(n, 0, -1):
        if int(i ** 0.5) ** 2 == i:
            print(i)
            break


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

print(max_square)

Submission status: Accepted

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: Accepted

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

while(True):
    a = math.sqrt(N)
    b = a*a
    decimal, integer = modf(a)
    if decimal==0:
        print(N)
        exit()
    N-=1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
ans = 0
for i in range(1, 32000):
	if pow(i, 2) <= N and pow(i, 2) >= ans:
		ans = pow(i, 2)
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
print(sorted(filter(lambda x: x <= n, [i ** 2 for i in range(int(n ** 0.5) + 1)]))[-1])

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
ans = 0
for i in range(1, 32000):
	if i ** 2 <= N and i ** 2 >= ans:
		ans = i * i
print(ans)

Submission status: Accepted

Solution code:
"""
https://abc077.contest.atcoder.jp/tasks/abc077_b
"""
n=int(input())
i=1
while (i**2)<=n:
    i=i+1
print((i-1)**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

L = []
for i in range(N + 1):
    if i * i <= N:
        L.append(i * i) 
    else:
        break

print(max(L))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

i=1
while i**2<=N:
    i=i+1
print((i-1)**2)