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:
import math
x=int(input())
y= math.sqrt(x)
z= y//1
print(int(z))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

N = int(input())
i = 1
while i < N:
    if((i * i) > N):
        print((i-1) * (i-1))
        break
    i += 1

Submission status: Wrong Answer

Solution code:

N = int(input())
for i in range(1,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(1,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:
import math
N = int(input())
for i in range(N, 0,-1):
    num = (i - (math.sqrt(i) ** 2))
    if num == 0:
        print(i)
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
n=int(input())
for i in range(1,10**3+2):
  if i**2>n:print((i-1)**2);exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 1
for i in range(1,N+1):
  if i % 2 == 0 and i != 2:
    continue
  j = math.sqrt(i)
  if j == int(j):
    ans = i
    
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())


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


print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

N = int(input())
for i in range(1, N):
    if i*i > N:
        print((i-1)*(i-1))
        exit()
print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

import math
N = int(input())
for i in range(1, N+1):
    if i*i > N:
        print((i-1)**2)
        exit()

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
C=0
for i in range(1,N):
  if i**2<N:
    C=i**2
  elif i**2==N:
    C=i**2
    break
  elif i**2>N:
    break
  elif N==1:
    print(1)
    exit()
print(C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

from math import floor, sqrt
ans = floor(sqrt(N))
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
N=int(input())
for i in range(N):
    if i**2>N:
        print((i-1)**2)
        sys.exit()
    else:
        pass

Submission status: Wrong Answer

Solution code:
import sys
N=int(input())
for i in range(1,N):
    if i**2>N:
        print((i-1)**2)
        sys.exit()
    else:
        pass

Submission status: Wrong Answer

Solution code:
x = int(input())
a = []
for i in range(10**5):
  if i**2<x:
    a.append(int(i**2))
print(max(a))

Submission status: Wrong Answer

Solution code:
x = int(input())
a = []
for i in range(10**5):
  if i**2<x:
    a.append(int(i**2))
  else:
    break
print(max(a))

Submission status: Wrong Answer

Solution code:
x = int(input())
a = 1
for i in range(10**5):
  if i**2<x:
    a = max(a,i**2)
  else:
    break
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(10000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy

if __name__ == "__main__":
    n = int(input())
    ans = 1
    while True:
        if ans**2>n:
            break
        ans+=1
    print(ans-1)

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(10000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy

if __name__ == "__main__":
    n = int(input())
    ans = 0
    for i in range(int(n**0.5)+1):
        ans = i
    print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(1, N):
  if i ** 2 > N:
    print((i - 1) ** 2)
    exit()

Submission status: Wrong Answer

Solution code:
def solve():
    N = int(input())
    for i in range(N, 1, -1):
        if (i ** 0.5).is_integer():
            print(i)
            exit()


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
import bisect
n = int(input())
li = []
for i in range(10000):
    li.append(i**2)
a = bisect.bisect_right(li, n)
print(li[a-1])

Submission status: Wrong Answer

Solution code:
N = int(input())

print(int(10**(0.5))**2)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(int(10**(0.5)**2))

Submission status: Wrong Answer

Solution code:
def actual(N):
    for i in range(1, N + 1):
        if i ** 2 > N:
            return (i - 1) ** 2

N = int(input())
print(actual(N))

Submission status: Wrong Answer

Solution code:
import math


def actual(N):
    for i in range(N, 1, -1):
        is_square_number = (math.sqrt(i) % 1) == 0

        if is_square_number:
            return i

N = int(input())
print(actual(N))

Submission status: Wrong Answer

Solution code:
n = int(input())

i = 1
while i * i <= n:
  i += 1

print(i - 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
mx = 0
for i in range(math.ceil(math.sqrt(N))+1):
    if i**2 < N and i**2 > mx:
        mx = i**2
        
print(mx)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(1,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:
N = int(input())

ans = 0
for i in range(N//2):
    if i**2 > N:
        ans = (i-1)**2
        break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

i = 0
while N > i**2:
    i += 1

print((i-1)**2)

Submission status: Wrong Answer

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

print(i ** 2)

Submission status: Wrong Answer

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

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:
###==================================================
### import
#import bisect
#from collections import Counter, deque, defaultdict
#from copy import deepcopy
#from functools import reduce, lru_cache
#from heapq import heappush, heappop
#import itertools
#import math
#import string
import sys
### stdin
def input(): return sys.stdin.readline().rstrip()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]
### stdout
def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))
### setting
sys.setrecursionlimit(10 ** 6)
### utils
int1 = lambda x: int(x) - 1
### constants
INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
###---------------------------------------------------

N = iIn()

n = 1
while (n**2 > N):
  n += 1
  
print(n**2)

Submission status: Wrong Answer

Solution code:
###==================================================
### import
#import bisect
#from collections import Counter, deque, defaultdict
#from copy import deepcopy
#from functools import reduce, lru_cache
#from heapq import heappush, heappop
#import itertools
#import math
#import string
import sys
### stdin
def input(): return sys.stdin.readline().rstrip()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]
### stdout
def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))
### setting
sys.setrecursionlimit(10 ** 6)
### utils
int1 = lambda x: int(x) - 1
### constants
INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
###---------------------------------------------------

N = iIn()

n = 1
while (n**2 > N):
  n += 1
  
print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

answer = 0
for i in range(1,n+1):
  if (i**2) > n:
    answer = (i-1)**2
  else :
    break

print(answer)

Submission status: Wrong Answer

Solution code:
n = int(input())

answer = 0
for i in range(n):
  if (i**2) > n:
    answer = (i-1)**2
    break

print(answer)

Submission status: Wrong Answer

Solution code:
n = int(input())

answer = 0
for i in range(1,n):
  if (i**2) > n:
    answer = (i-1)**2
    break

print(answer)

Submission status: Wrong Answer

Solution code:
n = int(input())

answer = 0
for i in range(1,n//2):
  next = i**2
  if next <= n:
    answer = i**2
  else :
    break

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
N_square_root = math.floor(math.sqrt(N))
result = 0
for i in range(N_square_root + 1):
    if math.sqrt(i).is_integer() is True:
        result = i
print(result)

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
result = 0
for i in range(N + 1):
    if i * i <= N:
        if math.sqrt(i).is_integer() is True:
            result = i
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

pre = 0
for i in range(1, N+1):
  n = i**2
  if n > N:
    print(pre)
    quit()
  
  pre = n

Submission status: Wrong Answer

Solution code:
N = int(input())
answer = 0
for x in range(1, 100000):
  if x ** 2 <= N:
    answer = x
  else:
    break
print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math 

n = int(input())

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

Submission status: Wrong Answer

Solution code:
import math 

n = int(input())

for i in range(n+1,1,-1):
  #print(i)
  if int((math.sqrt(i)))**2 == i:
    print(i)
    break

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 0
for n in range(N):
    if n*n <= N: ans = n*n
    else: break
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

for n in range(N):
    if n*n <= N: ans = n*n
    else: break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = []
for i in range(N):
    if N >= i * i:
        ans.append(i*i)
print(max(ans))

Submission status: Wrong Answer

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

a = math.sqrt(N)
a = int(a)

print(a)

Submission status: Wrong Answer

Solution code:
import numpy as np
n = int(input())
for i in range(n, 1, -1):
    if np.sqrt(i) % 1 == 0:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
sum=n
for i in range(n):
    if n >= i*i:
        sum = i*i
    else:
        break
print(sum)

Submission status: Wrong Answer

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

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:
N = int(input())

for i in range(N):
    if i**2 > N:
        print((i-1)**2)
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
print(int(x**0.25))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

def resolve():
	n = int(input())
	for i in range(n, 1, -1):
		sr = math.sqrt(i)
		if sr - math.floor(sr) == 0:
			print(i)
			return
resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

for i in range(1, int(N**0.5 + 5)):
	if i**2 > N:
		print((i-2)**2)
		break

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

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

Submission status: Wrong Answer

Solution code:
li =[]
for i in range(100000):
    li.append(i**2)
N = int(input())
ans = []
for i in range(10000):
    if li[i]<=N:
        ans.append(li[i])
print(max(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def intSqrt(n):
    x = 1
    while True:
        x2 = (x + n // x) // 2
        if abs(x - x2) <= 1:
            break
        x = x2
    return x2

n = int(input())
print(intSqrt(n)**2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())

max=0
for i in range(N+2,0,-1):
  s=int(i**(0.5))
  if i==s**2:
    max=i
    break
print(max)

Submission status: Wrong Answer

Solution code:
N=int(input())

max=0
for i in range(N+1,int(N**(0.5)),-1):
  s=int(i**(0.5))
  if i==s**2:
    max=i
    break
print(max)

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+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**2>n:
    print((i-1)**2)
    break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

square_roots = [i**2 for i in range(n) if i**2<=n]
print(max(square_roots))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(10 ** 5):
    if n <= (i * i):
        break

if n == 1:
    print("1")
else:
    print((i - 1) * (i - 1))

Submission status: Wrong Answer

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

print((count-1)**2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
if n==0:
  print(0)
  exit()
  
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):
  if i**2 > n:
    print((i-1)**2)
    break

Submission status: Wrong Answer

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

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
n = int(input())
for i in range(n,1,-1):
    if math.sqrt(i)==int(math.sqrt(i)):
        print(i)
        break

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:
#!/usr/bin/env python3
import sys


def solve(N: int):
    lb = 0
    ub = N
    while lb + 1 < ub:
        m = (lb + ub) // 2
        if m * m > N:
            ub = m
        else:
            lb = m
    print(lb * lb)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


if __name__ == '__main__':
    main()

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:
#owsiudfhowidhoewifnowienfoeinfo

print(int(float(int(input())**0.5)))

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

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

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

n = int(input())
for i in range(1, (n+1)):
    if i*i > n:
        print((i-1)*(i-1))
        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: break
print(ans)

Submission status: Wrong Answer

Solution code:
import math

n = int(input())

print(int(math.floor(n**0.5)))

Submission status: Wrong Answer

Solution code:
import math

n = int(input())

print(math.floor(n**0.5))

Submission status: Wrong Answer

Solution code:
if __name__=="main":
    i=int(input())
    print((int(i**0.5))**2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range (n,1,-1):
    ans= math.sqrt(i)
    sq= int(ans)
    sq=float(sq)
    #print(ans,sq)
    if sq==ans:
        print(i)
        break

Submission status: Wrong Answer

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

for i in range (n,3,-1):
    ans= math.sqrt(i)
    sq= int(ans)
    sq=float(sq)
    #print(ans,sq)
    if sq==ans:
        print(i)
        break

Submission status: Wrong Answer

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

for i in range (n,3,-1):
    ans= math.sqrt(i)
    sq= int(ans)
    sq=float(sq)
    #print(ans,sq)
    if sq==ans:
        print(i)
        break

Submission status: Wrong Answer

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

k = math.floor(math.sqrt(n))
print(k)

Submission status: Wrong Answer

Solution code:
import sys

n=int(input())
x=1
while 1:
  tmp=x*x
  if tmp > n:
    print(x*x)
    sys.exit()
  x+=1