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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import sqrt

innum = int(input())
outnum = int(sqrt(innum))
print(outnum*outnum)

Submission status: Accepted

Solution code:
#!/usr/bin/env ptyhon

import math

num=int(input())

for i in reversed(range(1, num+1)):
    rev=math.sqrt(i)
    # print(i,rev,int(rev))
    if( rev-int(rev) == 0 ):
        print(i)
        break

Submission status: Accepted

Solution code:
import math


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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import math


def test(N):
    while True:
        num = (int(math.sqrt(N)))**2
        if num < N:
            N -= 1
        else:
            return N

if __name__ == "__main__":
    N = int(input())
    answer = test(N)
    print(answer)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    ans = 1
    
    for num in range(N, 0, -1):
        int_rt_num = int(num**0.5)
        if(num == int_rt_num**2):
            ans = num
            print(ans)
            break
    
if __name__=="__main__":
    main()

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:
import math
N = int(input())
n = int(math.sqrt(N))
print(n * n)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
import math

N = input()

sq = np.sqrt(N)
s = int(math.floor(sq))
print s*s

Submission status: Accepted

Solution code:
a = int(input())
count = 1
while True:
    b = count**2
    c = (count+1)**2
    if c > a:
        print(b)
        break
    else:
        count += 1
        b = c

Submission status: Accepted

Solution code:
# coding: utf-8
N=int(input())
maxi=0
for i in range(1,N+1):
    if pow(i,2)<=N:
        maxi=pow(i,2)
    else:
        break
print(maxi)

Submission status: Accepted

Solution code:
N = int(input())

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

print(i**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

if (j - 1) ** 2 == N:
    print( ( j - 1 ) ** 2)

else:
    print( (j - 2) ** 2)

Submission status: Accepted

Solution code:
input_lines = int(input())

judge ="True"
count = 1
while  judge == "True": 
    ans = pow(count,2)
    if input_lines >= ans:
        count +=1
    else:
        judge="False"
        print(pow(count-1,2))

Submission status: Accepted

Solution code:
import sys
import math

N = int(sys.stdin.readline())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
x = int(raw_input())
a = math.floor(math.sqrt(x))
print(int(a*a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math

N = int(input())
for i in range(N):
    num = N-i
    sq = math.sqrt(num)
    if sq == int(sq):
        break
print(num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    N = int(input())
    ans1 = 0
    n = 0
    while ans1 <= N:
        ans1 = n ** 2
        n += 1

    print((n - 2) **  2)
    
    
solve()

Submission status: Accepted

Solution code:
import sys
N=input()

for i in range(100000):
	if i*i==N:
		print i*i
		sys.exit()		
	elif i*i>N:
		print (i-1)*(i-1)
		sys.exit()
	else:
		continue

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

num = int(input())
for i in reversed(range(0, num+1)):
    val = math.sqrt(i)
    if val - int(val) == 0:
        print(i)
        break

Submission status: Accepted

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

solve()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from sys import stdin, stdout
from math import sqrt

def rint():
   return map(int, stdin.readline().split())

a = int(input())
aa = int(sqrt(a))
print(aa*aa)

Submission status: Accepted

Solution code:
from math import sqrt

N = int(input())
s = int(sqrt(N))
print(int(s)**2)

Submission status: Accepted

Solution code:
import math

n = int(input())

nq = int(math.sqrt(n))
print(nq * nq)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python

# AtCoder Beginner Contest 077
# B - Around Square

from sys import stdin
from math import sqrt

def solve(N):
    return int(sqrt(N)) ** 2

N = int(stdin.readline())
print(solve(N))

Submission status: Accepted

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

"""077-b"""

import sys
import pprint
import re
import math

import itertools
pp = pprint.PrettyPrinter(indent=2)

def main():
    """Main function."""
    N = int(input())
    print(int(math.sqrt(N)) * int(math.sqrt(N)))


if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

Solution code:
import sys
import numpy as np

n = int(sys.stdin.readline().strip())
a = int(np.sqrt(n))
print(str(a*a))

Submission status: Accepted

Solution code:
from math import sqrt

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

Submission status: Accepted

Solution code:
import math

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

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

main()

Submission status: Accepted

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

print((i-1) ** 2)

Submission status: Accepted

Solution code:
import numpy as np
import copy as cp

N = int(input())
MIN = np.sqrt(N) - 1
MAX = np.sqrt(N)

m = int(MAX)
print(m**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(pow(int(math.sqrt(i)), 2))

Submission status: Accepted

Solution code:
N = int(input())

n = 1
while True:
    if n*n <= N and N < (n+1)*(n+1):
        print(n*n)
        break
    else:
        n += 1

Submission status: Accepted

Solution code:
#http://abc077.contest.atcoder.jp/
# -*- coding: utf-8 -*-
import math
n = int(input())

while(True):
    result = math.sqrt(n)
    if math.floor(result) == result: break
    n -= 1
    
print(n)

Submission status: Accepted

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

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(raw_input())
print int(math.pow(math.floor(math.sqrt(N)),2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

sqrtn = math.sqrt(n)

print(math.floor(sqrtn)**2)

Submission status: Accepted

Solution code:
import math

if __name__ == '__main__':
    N = int(input())
    print(int(math.sqrt(N)) ** 2)

Submission status: Accepted

Solution code:
import math
t=int(input())
a=int(math.sqrt(t))
print(a*a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
https://beta.atcoder.jp/contests/abc077/tasks/abc077_b

"""
import sys
from sys import stdin
input = stdin.readline


def main(args):
    N = int(input())
    ans = 1

    for i in range(int(N**0.5)+1):
        ans = i
    print(i**2)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
import math

a = int(input())
b = math.sqrt(a)
print(int(b)**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

x = int(raw_input())
sqrt = int(math.sqrt(x))
print(sqrt*sqrt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x=input()
float(y)= sqrt(x)
z= y//1
print(z)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
 
n=int(input())
k=0
for i in range(math.sqrt(n)):
    while (i+1)**2 < n:
        k+=1
print((k+1)**2)

Submission status: Runtime Error

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

for i in range(n):
  if ref * 2 < ref + k:
    ref *= 2
  else:
    ref += k

print(ref)

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


def main():
    s = input()
    t = input()
    for i, c in enumerate(s):
        if t[-i-1] != c:
            print("NO")
            return
    print("YES")

if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

n = int(s)

answer = []

x = 1
answer.append(x)

while (x * x < n):
    x += 1
    answer.append(x * x)

p = answer.pop()
ans = answer.pop()

print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())


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

print((i-1)**2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print((count-1)**2)N = int(input())
count = 1
while count ** 2 <= N:
    count += 1

print((count-1)**2)

Submission status: Runtime Error

Solution code:
Not found

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input)
ans = 1
while pow(ans,2) <= n:
  ans += 1
print(pow(ans-1,2))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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


for i in the range(n+1):
    ans= math.sqrt(i)
    ans= str(ans)
    if "." not in ans:
        print(ans)
        break

Submission status: Runtime Error

Solution code:
#abc077 b
import math 
n=int(input())
m=int(sqrt(n))
print(m*m)

Submission status: Runtime Error

Solution code:
import numpy as np
n = int(input())
a = 0
m = int(n**0.5)
for i in range(np.ceil(m)):
    if i**2 > n:
        break
    a += 1
print(a**2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
a=0
l=[]
for a in range(1,n+1):
            for i in range(1,n):
                        if a==i**2:
                                    #print(a,i)
                                    l.append(a)
                               
print(max(l))

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
typedef long long ll;
using namespace std;

int main(){
    int N; cin >> N;
    int i=1;
    while(N>=i*i){
        i++;
    }
    cout << (i-1)*(i-1);
}

Submission status: Runtime Error

Solution code:
N = int(input())

ans1 = []
ans2 = []

for i in range(1,N):
    for j in  range(1,N):
        if i == j and i*j == N:
            ans1.append(i*j)
        elif i == j and i*j <= N:
            ans2.append(i*j) 
            

if ans1 != 0:
    print(max(ans1))
else:
    print(max(ans2))

Submission status: Runtime Error

Solution code:
N = int(input())

ans1 = []
ans2 = []

for i in range(1,N):
    for j in  range(1,N):
        if i == j and i*j == N:
            ans1.append(i*j)
        elif i == j and i*j <= N:
            ans2.append(i*j) 
            

if ans1 != 0:
    print(max(ans1))
else:
    print(max(ans2))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = int(input())
for i in range(s):
    if math.sqrt(s - i).is_integer():
        print(s - i)
        break

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
l=list(range(1,n+1))
l=sorted(l,reverse=True)
ans=0
for i in l:
    if pow(i,0.5)%1==0:
        ans=i
        break
        
print(ans)

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())

for i in range(1, n):
    if i**2 <= n:
        ans = min(n, i**2)
    else:
        break

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
ans=1
for i in range(n):
    i=n-i
    for j in range(3):
        j+=int(i**0.5)-1
        if(i//j==j and i%j==0):
            ans=i
            break
    if(ans!=1):
        break
        
print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
s=[i**2 for i in range(1,10**5)]
q=sorted(s,reverse=True)
w=0
while q[w]>=n:
  w+=1
print(q[w])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
N=int(input())
n=math.sqart(N)

print(int(n)**2)

Submission status: Runtime Error

Solution code:
import math
N=int(input())
n=math.sqart(n)

print(int(n)**2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(ans)

Submission status: Runtime Error

Solution code:
import math
N = int(input())
v = math.sqrt(N)
pritn(int(v)*int(v))

Submission status: Runtime Error

Solution code:
import math
def main():
	N = int(input())
	v = int(math.sqrt(N))
    print(v*v)
if __name__ == "__main__":
	main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

N = int(input().split())

i = 0
while True:

    if i ** 2 > N:
        print ((i-1)**2)
        break

Submission status: Runtime Error

Solution code:

N = input().split()

i = 0
while True:

    if i ** 2 > N:
        print ((i-1)**2)
        break

Submission status: Runtime Error

Solution code:
n = int(input())
def solve(i,n):
    if i**2 >n:
        return print((i-1)**2)
    else:
        return solve(i+1,n)

solve(1,n)

Submission status: Runtime Error

Solution code:
N=gets.to_i
ans = 0
sq = (N**(0.5)).to_i
(sq..sq+10).each do |i|
    ans = i*i if i*i <= N
end
puts ans

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main(){
  int N;
  cin >> N;
  
  int i =1;
  while (i*i <= N)
  {
    i++;
  }
  cout << (i-1)^2 << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(n):
    x=min(x*2,x+k)

print(x)

Submission status: Runtime Error

Solution code:
#coding:utf-8

a = int(input())
while i*i <= a:
  i=i+1

i=i-1

print(i*i)

Submission status: Runtime Error

Solution code:
# coding:utf-8
abc =input().split()
a,b,c= int(abc[0]),int(abc[1]),int(abc[2])

if a+b == c:
  print("+")
  if a-b == c:
    print("?")
elif a-b == c:
  print("-")
else:
  print("!")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import exit
# A,B,C = [int(n) for n in input().split()]
N = int(input())
# a = [int(input()) for _ in range(N)]
for i in range(1,N+1):
    if(i**2>N):
        anss = i-1
        break
print(anss**2)

Submission status: Runtime Error

Solution code:
import math
N = int(input())
list_N = list(range(1,N+1))
max = -9999
for i in range(N):
    if max < int(math.sqrt(list_N[i])):
        max = int(math.sqrt(list_N[i]))

print(max*max)

Submission status: Runtime Error

Solution code:
import math
N = int(input())
list_N = list(range(1,N+1))
max = -999999999
sqrt_N = []
for i in range(N):
    if max < int(math.sqrt(list_N[i])):
        max = int(math.sqrt(list_N[i]))

print(max*max)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
fun main(args: Array<String>) {
    var N = readLine()!!.toLong()
    for(i in N downTo 0){
        var j = i.toDouble()
        var sq = (Math.sqrt(j)).toLong()
        
        if(sq * sq == i){
            println(i)
            break
        }
    }    
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
while for i in N:
  if i**2>N:
    break
  answer=i**2
print(answer)

Submission status: Runtime Error

Solution code:
N = int( input() )

for i in range( int(N**0.5)+1 ):
    ans = max( ans, i*i )

print( ans )

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

n = int(input())
a = round(0, sqrt(n))

print(a ** 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import ceil, sqrr

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

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
B.sort()
C.sort()
ans = 0
for i in range(N):
    for j in range(N):
        if A[i] < B[j]:
            for k in range(N):
                if B[j] < C[N-1-k]:
                    ans += 1
                else:
                    break
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(int(sqrt(int(input())))^2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import floor, sqrt

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

Submission status: Runtime Error

Solution code:
#2
n = int(input())
p = range(1,10**5)
q = 1
while i < n :
    i == p**2
    q = i
print(q)

Submission status: Runtime Error

Solution code:
#1
x,y,z=map(int, input().split())
count=0
for i in range(x,y+1) :
    if i%z==0 :
        count+=1
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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


def main():
    n = int(raw_input())
    for i in range(n, 0, -1):
        sqrt = np.sqrt(i)
        if sqrt - int(sqrt) == 0:
            print(i)
            break


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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


def main():
    n = int(raw_input())
    for i in range(n, 0, -1):
        sqrt = np.sqrt(i)
        if sqrt - int(sqrt) == 0:
            print(i)
            break


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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


def main():
    n = int(raw_input())
    if n == 1:
        print(n)
    else:
        for i in range(n, 0, -1):
            sqrt = np.sqrt(n)
            if sqrt - int(sqrt) == 0:
                print(n)
                break


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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


def main():
    n = int(raw_input())
    if n == 1:
        print(n)
    else:
        for i in range(n):
            sqrt = np.sqrt(n - i + 1)
            if sqrt - int(sqrt) == 0:
                print(n - i)
                break


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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


def main():
    n = int(raw_input())
    for i in range(n):
        sqrt = np.sqrt(n - i +1)
        if sqrt - int(sqrt) == 0:
            print(n - i)
            break


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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


def main():
    n = int(raw_input())
    for i in range(n):
        sqrt = np.sqrt(n - i)
        if sqrt - int(sqrt) == 0:
            print(n - i)
            break


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import bisect
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
C.sort()
res = 0
for i in B:
    res += bisect.bisect_right(A, i) * (N - bisect.bisect_left(C, i))
    
print(res)

Submission status: Runtime Error

Solution code:
N = int(input())

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

print(res)

Submission status: Runtime Error

Solution code:
N = int(input())

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

print(res)

Submission status: Runtime Error

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

print(N*N)