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 sys
import 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
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(str, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

for i in range(N, 1, -1):
    s = sqrt(i)
    if int(s) ** 2 == int(i):
        print(i)
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=1
l=[]
for i in range(1,n):
            if i**2>n:
                        break
            a==i**2
                               
print(a)

Submission status: Wrong Answer

Solution code:
n =int(input())

ans =[]
for i in range(n):
  if (i ** 0.5).is_integer() and i <= n:
    ans.append(i)
    
    
print(ans[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN

N = int(input().strip())

print( int(N**(1/2)) )

Submission status: Wrong Answer

Solution code:
n=int(input())
i=1
while i**2<n:
  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:
def aroundsquare(n):

    ans = 0

    for i in range(1 , n + 1):
        if n // i == i:
            ans = n - (n % i)

    return ans


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


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(a):
    if i*i > a:
        break
    else:
        ans = i*i
print(ans)

Submission status: Wrong Answer

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

for i in range(a):
    if i*i > a:
        break
    else:
        ans = i*i
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(n+1):
	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):
	if i * i > n:
		print((i-1) * (i-1))
		exit()

Submission status: Wrong Answer

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

for i in range(1, n):
	if i * i <= n:
		ans.append(i*i)
	elif i * i > n:
		print(max(ans))
		exit()


print(max(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = []

for i in range(1, n):
	if i * i <= n:
		ans.append(i*i)
	elif i * i > n:
		print(max(ans))
		exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = 0
for i in reversed(range(n)):
    if i**(0.5)%1 == 0:
        ans = i
        break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(0,n):
    if n>=i*i:
        pass
    else:
        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)**2)
        break
    elif(i*i == n):
        print(i**2)
        break

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
def f(n):
  pre = 1
  s = 1
  i = 1
  while s < n:
    pre = s
    s = i * i
    i += 1
  return pre
print(f(int(input())))

Submission status: Wrong Answer

Solution code:
N = int(input())
import math
x = math.ceil(N**0.5)
print(x**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):
    a = i*i
    if a<=n:
        ans = max(ans, a)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
i = 1
while i ** 2 < N:
    i += 1
    if i ** 2 > N:
        print((i - 1) ** 2)
        sys.exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

for ni in range(n, 1, -1):
  if (ni ** .5).is_integer():
    print(ni)
    exit(0)

Submission status: Wrong Answer

Solution code:
#coding:utf-8

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:
#coding:utf-8

n =int(input())

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

Submission status: Wrong Answer

Solution code:
#coding:utf-8

n =int(input())

for i in range(n):
  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 ** 2 > n:
        print((i-1)**2)
        import sys
        sys.exit()

Submission status: Wrong Answer

Solution code:
n = int(input())

import math

if n == 1:
	print(1)
else:
	for i in range(n,1,-1):
		k = math.sqrt(i)
		#print(i)
		if k.is_integer():
			print(i)
			break

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = 1

import math

for i in range(n,1,-1):
	k = math.sqrt(i)
	#print(i)
	if k.is_integer():
		print(i)
		break

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import floor, ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
	n = INT()
	for i in range(n, 2,  -1):
		q = floor(sqrt(i))
		if i == q**2:
			print(i)
			sys.exit()

if  __name__=='__main__':
	main()

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 permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
	n = INT()
	for i in range(n, 2,  -1):
		if sqrt(i) == int(sqrt(i)):
			print(i)
			sys.exit()

if  __name__=='__main__':
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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()
  elif i**i==n:
    print(i*i)
    exit()

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()
  elif i**i==n:
    print(i**i)
    exit()

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())
ans=0
for i in range(N):
    if i**2<=N:
        ans=i**2
    else:
        break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
for i in range(1,100000):
    if i**2<=n:
        a.append(i)
print(max(set(a)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 1

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

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 1
n = 1

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

ans = (n-1)**2
print(ans)

Submission status: Wrong Answer

Solution code:
import math

n = int(input())
for i in range(int(math.sqrt(n)),1, -1):
    print(i**2)
    exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(round(int(input())**.5)**2)

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(0,10 ** 9 + 1,1):
    a = i ** 2
    if a >= n:
        break
print((i - 1) ** 2)

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(0,10**9,1):
    a = i ** 2
    if a >= n:
        break
print((i - 1) ** 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(Answer)

Submission status: Wrong Answer

Solution code:
n = int(input())

list1 = [0]
i = 1
while list1[-1] < n:
    list1.append(i**2)
    i += 1

print(list1[-2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
print(n**.5)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
ans=[]
for i in range(n):
  if i*i <=n:
    ans.append(i)
print(max(ans)**2)

Submission status: Wrong Answer

Solution code:
n = int(input())

for i in range(n + 1, 0, -1):
    if i ** 0.5 == i ** 0.5 // 1:
        print(i)
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(int(int(input())**.5**2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(str(int(input())**.5).split('.')[0])

Submission status: Wrong Answer

Solution code:
print(int(int(input())**.5//1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())

ans=0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import sqrt
N = int(input())
i = 1
while True:
    if i ** 2 >= N:
        print((i-1)**2)
        break
    i += 1

Submission status: Wrong Answer

Solution code:
def solve():
    n = int(input())
    for i in range(1, n):
        if i ** 2 > n:
            return (i - 1) ** 2


def resolve():
    print(solve())


if __name__ == "__main__":
    resolve()

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:
def solve():
    n = int(input())
    for i in range(1, n + 1):
        if i ** 2 > n:
            return (i - 1) ** 2


def resolve():
    print(solve())


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
def solve():
    n = int(input())
    for i in range(n, 1, -1):
        if i ** 0.5 % 1 == 0:
            return i


def resolve():
    print(solve())


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    n = int(input())
    for i in range(n, 1, -1):
        if i ** 0.5 % 1 == 0:
            return i


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = []

for i in range(n+1,1,-1):
    if len(ans) == 1:
        print(max(ans))
        break
    elif (i**0.5).is_integer() :
        ans.append(int(i))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
# [exit(0) if i ** 2 > N else print(i ** 2) if (i+1) ** 2 > N else print("", end="") for i in range(1, N)]
for i in range(1, N):
    if i ** 2 >= N:
        print((i - 1) ** 2)
        break

Submission status: Wrong Answer

Solution code:
N = int(input())
# [exit(0) if i ** 2 > N else print(i ** 2) if (i+1) ** 2 > N else print("", end="") for i in range(1, N)]
for i in range(1, N):
    if i ** 2 > N:
        print((i - 1) ** 2)
        break

Submission status: Wrong Answer

Solution code:
N = int(input())
[exit(0) if i ** 2 > N else print(i ** 2) if (i+1) ** 2 > N else print("",end="") for i in range(1, N)]

Submission status: Wrong Answer

Solution code:
N = int(input())
[exit(0) if i ** 2 > N else print(i ** 2) if (i+1) ** 2 > N else print(end="") for i in range(1, N)]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(1, N+2):
    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**2 >= N:
        print((i-1)**2)
        exit()

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(1, N):
    if i**2 <= N:
        pass
    else:
        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:
# -*- coding: utf-8 -*-

N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())

list=[]
if N==0:
    list.append(0)
for i in range(0,N,1):
    if i**2 <= N:
        list.append(i**2)
    else:
        break
print(max(list))

Submission status: Wrong Answer

Solution code:
N=int(input())

list=[]
for i in range(0,N,1):
    if i**2 <= N:
        list.append(i**2)
    else:
        break
print(max(list))

Submission status: Wrong Answer

Solution code:
n = (int(input()))
ans = 1
for i in range(1,int(n**.5)):
  if i**i<=n:ans=max(ans,i**i)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
print(int(a**2-1))

Submission status: Wrong Answer

Solution code:
import math
import sys
n = int(input())
for i in range(n+1, 0, -1):
    s = math.sqrt(i)
    if s == math.floor(s):
        print(i)
        sys.exit()

Submission status: Wrong Answer

Solution code:
import math
import sys
n = int(input())
for i in range(n+1, 0, -1):
    s = math.sqrt(i)
    if s == int(s):
        print(i)
        sys.exit()

Submission status: Wrong Answer

Solution code:

n = int(input())
for i in range(1, 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, 1, -1):
    if (i ** 0.5) % 1 == 0:
        print(i)
        exit()

Submission status: Wrong Answer

Solution code:

n = int(input())
for i in range(n+1, 1, -1):
    if (i ** 0.5) % 1 == 0:
        print(i)
        exit()

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(N,1,-1):
  if (i**0.5).is_integer():
    print(int(i))
    exit()

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
def main():
  N = int(input())
  v = int(math.sqrt(N))
  return v*v


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
round=lambda x:(x*2+1)//2
print(int(round(math.sqrt(int(input()))) ** 2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math

# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    ans = 1
    
    for i in range(N,0,-1):
        tmp = math.sqrt(i)
        if tmp.is_integer():
            print(i)
            #sys.exit()
            	
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if N != 1:
	for i in range(0,N):
	    if i*i <= N:
	        continue
	    else:
	    	print((i-1)*(i-1))
	    	break

else:
	print(0)

Submission status: Wrong Answer

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

if N != 0:
	for i in range(0,N):
	    if i*i <= N:
	        continue
	    else:
	    	print((i-1)*(i-1))
	    	break

else:
	print(0)

Submission status: Wrong Answer

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

for i in range(0,N):
    if i*i <= N:
        continue
    else:
    	print((i-1)*(i-1))
    	break

Submission status: Wrong Answer

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

for i in range(int(N/2),0,-1):
	if i*i <= N:
		print(i*i)
		break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# ABC077-B 模範解答
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):
  a=i*i
  if a>n:
    a= (i-1)*(i-1)
    break
print(a)

Submission status: Wrong Answer

Solution code:
n = int(input())

print((round(n ** 0.5)) ** 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt, floor

n = int(input())
rt = floor(sqrt(n))
print(rt^2)

Submission status: Wrong Answer

Solution code:
from math import sqrt, ceil

n = int(input())
rt = int(sqrt(n))
print(rt^2)

Submission status: Wrong Answer

Solution code:
from math import sqrt, ceil

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

Submission status: Wrong Answer

Solution code:
from math import sqrt, floor

n = int(input())
print((floor(sqrt(n)))^2)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
for i in range(n):
    if n < i**2:
        print((i-1)**2)
        sys.exit()

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import time
import re
import math

def main():
    n=int(input())
    print(math.pow(math.floor(math.sqrt(n)),2))
main()

Submission status: Wrong Answer

Solution code:
N = int(input())
print(int(N**.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:
n = int(input())
def solve(i,n):
    if i**2 >n:
        return print((i-1)**2)
    else:
        return solve(i+1,n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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