Problem 2270. Bit calculation
Give me the count of numbers from 1 to n having their last two bits as 0.
For example
function y = ret_count(4)
y = x;
end
Here 4 means you have to check the numbers between 1 to 4.
So the answer will be 1 as binary value of 4 is 00000100.
Here n in the function is the number of numbers to be checked starting from 1.
Solution Stats
Problem Comments
-
1 Comment
Nguyen Gia
on 28 Mar 2022
i think cody has problem with input argument of type "double". When I use Matlab IDE i got the total correct answer
Solution Comments
Show commentsGroup

Project Euler II
- 12 Problems
- 51 Finishers
- Sums of cubes and squares of sums
- Sum of big primes without primes
- Project Euler: Problem 11, Largest product in a grid
- Highly divisible triangular number (inspired by Project Euler 12)
- Divisors for big integer
- Large Sum (inspired by Project Euler 13)
- Longest Collatz Sequence
- Project Euler: Problem 16, Sums of Digits of Powers of Two
- Project Euler: Problem 18, Maximum path sum I
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Numbers spiral diagonals (Part 1)
- Numbers spiral diagonals (Part 2)
Problem Recent Solvers217
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!