PY
py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#
# Hello, I am Pedro Maimere, welcome to
# my code. Please rate and comment!
#
# This code tries to answer the following
# challenge:
# "Challenge: how many odious numbers
# smaller than 10.000 can you find
#
# odious numbers are non-negative numbers
# that have an odd number of ones in the
# binary expansion
# 21 = 10101 = 3
# 50 = 110010 = 3
# Challenge: how many odious numbers smaller
# than 10.000 can you find?"
#
# The objective is to subtract all powers of
# 2 from each number from 1 to 9999. These
# powers are registered in the bits
# variable. If the number of powers (i.e.,
# the number of bits) is odd, add 1 to the
# counter (variable odiousNum).
##
from math import floor, log2
odiousNum = 0
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run