-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution.py
31 lines (24 loc) · 1.12 KB
/
solution.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
# A square of squares
# You like building blocks. You especially like building blocks that are squares.
# And what you even like more, is to arrange them into a square of square building blocks!
# However, sometimes, you can't arrange them into a square.
# 'Instead, you end up with an ordinary rectangle! Those blasted things!
# If you just had a way to know, whether you're currently working in vain… Wait!
# That's it! You just have to check if your number of building blocks is a perfect square.
# Task
# Given an integral number, determine if it's a square number:
# In mathematics, a square number or perfect square is an integer that is the square of an integer;
# in other words, it is the product of some integer with itself.
# The tests will always use some integral number, so don't worry about that in dynamic typed languages.
# Examples
# isSquare(-1) returns false
# isSquare(0) returns true
# isSquare(3) returns false
# isSquare(4) returns true
# isSquare(25) returns true
# isSquare(26) returns false
import math
def is_square(n):
if n < 0:
return False
return math.sqrt(n) - int(math.sqrt(n)) == 0