Perfect square (#8877)

Algorithm Analysis

Let $a = n$ . If $a \times a = n$ , then the number $n$ is a perfect square.

Example

Let $n = 27$ . Then $a = 27 = 5$ . We check: $5 \times 5 \neq = 27$ , therefore $27$ is not a perfect square.

Algorithm Implementation

Read a real number $n$ .

scanf("%lf", &n);

Calculate $a = n$ .

a = (int)sqrt(n);

If $a \times a = n$ , then the number $n$ is a perfect square.

if (a * a == n) printf("%d\n", a);
else puts("No");

Java Implementation

import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner con = new Scanner(System.in);
        double n = con.nextDouble();
        int a = (int)Math.sqrt(n);
        if (a * a == n)
            System.out.println(a);
        else
            System.out.println("No");
        con.close();
    }
}

Python Implementation

Read a real number $n$ .

import math

n = float(input())

Calculate $a = n$ .

a = int(math.sqrt(n))

If $a \times a = n$ , then the number $n$ is a perfect square.

if a * a == n: print(a)
else: print("No")