Topic: Bit Manipulation Problem / Level: intermediate

Problem: Create a function that counts how many integers from 1 to n can be expressed as the sum of two distinct squares.

Run the code to see the output here...