Comments on It's Hip to be Square
Parent
It's Hip to be Square
Challenge
A catalogue type challenge that simply asks: Given an integer n (where n>=0) as input return a truthy value if n is a perfect square or a falsey value if not.
Rules
- You may take input by any reasonable, convenient means.
- You need not handle inputs greater than what your chosen language can natively handle nor which would lead to floating point inaccuracies.
- Output should be one of two consistent truthy/falsey values (e.g.,
trueorfalse,1or0) - truthy if the input is a perfect square, falsey if it's not. - This is code-golf so lowest byte count wins.
Test Cases
Input: 0
Output: true
Input: 1
Output: true
Input: 64
Output: true
Input: 88
Output: false
Input: 2147483647
Output: false
[Python 3], 20 19 bytes …
2y ago
[Ruby], 16 bytes ```ruby - …
2y ago
[APL (Dyalog Extended)], 3 byt …
2y ago
[Haskell], 24 bytes Probabl …
2y ago
[Prolog (SWI)], 42 bytes …
2y ago
Japt, 6 3 bytes Cut in half …
2y ago
[Python 3], 46 bytes Saved …
2y ago
[Husk], 5 bytes ±£Θİ□ …
2y ago
[C (gcc)], 57 64 bytes …
2y ago
Vyxal, 2 bytes ``` ∆² ``` …
2y ago
[C (gcc)], 40 bytes …
2y ago
[PHP], 69 37 bytes …
2y ago
Sclipting, (UTF-16) 8 bytes …
2y ago
[C (clang)], 189 181 176 173 b …
2y ago
C (gcc), 37 bytes ``` C f( …
2y ago
Lua 5.4, 9 bytes ``` lua n …
2y ago
JavaScript (V8), 13 bytes ` …
2y ago
Embed ESCR, 28 characters [ …
2y ago
[dc], 9 bytes ?dvd-^p …
2y ago
J, 6 bytes ```J 0=1|%: `` …
2y ago
Post
Python 3, 46 bytes
Saved 8 bytes thanks to Shaggy!
lambda n:[n-i*i or exit(1)for i in range(1+n)]
Python 3.8 (pre-release), 50 54 52 bytes
Fixed a silly mistake thanks to Shaggy and saved 2 bytes!
for i in range(1+(x:=int(input()))):x-i*i or exit(1)
Here's a stupid solution that outputs using the exit code (1 if it's a perfect square, 0 otherwise).
0 comment threads