Cody

Problem 23. Finding Perfect Squares

Solution 2009965

Submitted on 8 Nov 2019 by Alessandra Iacobone
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
a = [2 3 4]; assert(isequal(isItSquared(a),true))

c = 1 1 1 c = 1 1 1 c = 1 0 1 c = 1 0 0 b = logical 1

2   Pass
a = [20:30]; assert(isequal(isItSquared(a),false))

c = 1 1 1 1 1 1 1 1 1 1 1 c = 0 1 1 1 1 1 1 1 1 1 1 c = 0 0 1 1 1 1 1 1 1 1 1 c = 0 0 0 1 1 1 1 1 1 1 1 c = 0 0 0 0 1 1 1 1 1 1 1 c = 0 0 0 0 0 1 1 1 1 1 1 c = 0 0 0 0 0 0 1 1 1 1 1 c = 0 0 0 0 0 0 0 1 1 1 1 c = 0 0 0 0 0 0 0 0 1 1 1 c = 0 0 0 0 0 0 0 0 0 1 1 c = 0 0 0 0 0 0 0 0 0 0 1 c = 0 0 0 0 0 0 0 0 0 0 0 b = logical 0

3   Pass
a = [1]; assert(isequal(isItSquared(a),true))

c = 1 c = 1 b = logical 1

4   Pass
a = [6 10 12 14 36 101]; assert(isequal(isItSquared(a),true))

c = 1 1 1 1 1 1 c = 1 1 1 1 1 1 c = 1 0 1 1 1 1 c = 1 0 0 1 1 1 c = 1 0 0 0 1 1 c = 1 0 0 0 0 1 c = 1 0 0 0 0 0 b = logical 1

5   Pass
a = [6 10 12 14 101]; assert(isequal(isItSquared(a),false))

c = 1 1 1 1 1 c = 0 1 1 1 1 c = 0 0 1 1 1 c = 0 0 0 1 1 c = 0 0 0 0 1 c = 0 0 0 0 0 b = logical 0