blob: 09f6731bbc83ccb2344a56fc02d4ec6b4e1a034c (
plain)
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
29
30
31
32
33
34
35
36
37
|
#!/usr/bin/env python3
# Challenge 114
#
# TASK #2 - Higher Integer Set Bits
# Submitted by: Mohammad S Anwar
# You are given a positive integer $N.
#
# Write a script to find the next higher integer having the same number of
# 1 bits in binary representation as $N.
#
# Example
# Input: $N = 3
# Output: 5
#
# Binary representation of $N is 011. There are two 1 bits. So the next higher
# integer is 5 having the same the number of 1 bits i.e. 101.
#
# Input: $N = 12
# Output: 17
#
# Binary representation of $N is 1100. There are two 1 bits. So the next higher
# integer is 17 having the same number of 1 bits i.e. 10001.
import sys
def num_1bits(n):
return sum([int(x) for x in "{:b}".format(n)])
def next_same_1bits(n):
num1s = num_1bits(n)
while True:
n += 1
if num_1bits(n)==num1s:
return n
print(next_same_1bits(int(sys.argv[1])))
|
