Your function should turn the input integers into binary form and count the number of 1s in the binary. If the number is odd, return -1; else, return 1 (for each input).
For example, if the input number is 10:
- Turn it into binary form: 1010
- Count 1s in the binary: 2
- Judge if it's even or odd: even
- So the output is 1.
Try to find the best algorithm! My best size is 22.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers22
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1752 Solvers
-
237 Solvers
-
Sum the entries of each column of a matrix which satisfy a logical condition.
175 Solvers
-
245 Solvers
-
Sum the numbers on the main diagonal
613 Solvers
More from this Author14
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!