Challenges

Reddit challenges in python language.

Files Code and Result

challenge1_easy

challenge2_easy

challenge3_easy

challenge4_easy

challenge5_easy

challenge6_easy

challenge7_easy

challenge8_easy

challenge9_easy

challenge10_easy

challenge11.easy

challenge12_easy

challenge13_easy

challenge14_easy

challenge15_easy

challenge16_easy

challenge17_easy

challenge18_easy

challenge19_easy

challenge20_easy

challenge21_easy

challenge22_easy

challenge23_easy

challenge25_easy

challenge26_easy

challenge27_easy

challenge28_easy

challenge29_easy

challenge30_easy

challenge31_easy

challenge32_easy

challenge33_easy

challenge34_easy

challenge35_easy

challenge36_easy

challenge37_easy

challenge38_easy

challenge39_easy

challenge40_easy

challenge41_easy

challenge42_easy

challenge44_easy

challenge45_easy

challenge46_easy

challenge47_easy

challenge48_easy

challenge49_easy

challenge50_easy

challenge51_easy

challenge52_easy

challenge53_easy

challenge54_easy

challenge55_easy

challenge56_easy

challenge57_easy

challenge58_easy

challenge59_easy

challenge60_easy

challenge61_easy

challenge62_easy

challenge63_easy

challenge64_easy

challenge65_easy

challenge66_Dev

challenge66_easy

challenge67_easy

challenge68_easy

challenge69_easy

challenge69_easyBonus

challenge70_easy

challenge71_easy.py

challenge72_easy

challenge73_easy

challenge74_easy

challenge76_easy

challenge77_easy

challenge78_easy

challenge79_easy

challenge80_easyone

challenge82_easy

challenge83_easy

challenge84_easy

challenge85_easy

challenge85_easybonus

challenge86_easy

challenge87_easy

challenge88_easy

challenge88_easybonus

challenge89_easy

challenge90_easy

challenge91_easy

challenge92_easy

challenge93_easy

challenge94_easy

challenge95_easy

challenge96_easy

challenge97_easy

challenge98_easy

challenge99_easy

challenge100_easy

challenge100_easybonus

challenge101_easy

challenge101_easybonus

challenge102_easy

challenge103_easy

challenge104_easy

challenge105_easy

challenge106_easy

challenge107_easy

challenge108_easy

challenge109_easy

challenge110_easy

challenge111_easy2

challenge112_easy

challenge113_easy

challenge114_easy

challenge115_easy

challenge116_easy

challenge117_easy

challenge118_easy

challenge119_easy

challenge121_easy

challenge122_easy

challenge123_easy

challenge124_easy

challenge125_easy

challenge126_easy

challenge127_easy

challenge128_easy

challenge130_easy

challenge131_east

challenge132_easy

challenge133_easy

challenge134_easy

challenge135_easy

challenge136_easy

challenge137_easy

challenge138_easy

challenge139_easy

challenge140_easy

challenge141_easy

challenge142_easy

challenge143_easy

challenge144_easy

challenge145_easy

challenge146_easy

challenge147_easy

challenge148_easy

challenge149_easy

challenge153_easy

challenge153_easy

challenge154_easy

challenge156_easy

challenge157_easy

challenge158_easy

challenge158_easybonus

challenge159_easy

challenge160_easy

challenge161_easy

challenge162_easy

challenge163__easy

challenge168_easy

challenge169_easy

challenge169_easybonus

challenge170_easy

challenge171_easy

challenge172_easy

challenge174_easy

challenge175_easy

challenge177_easy

challenge179_easy

challenge180_easy

challenge181_easy

challenge182_easy

challenge184_easy

challenge185_easy

challenge188_easy

challenge189_easy_ascii

challenge191_easy

challenge192_easy

challenge193_easy

challenge195_easy

challenge197_easy

challenge198_easy

challenge199_easy

challenge200_easy

challenge201_easy

challenge202_easy

challenge203_easy

challenge204_easy

challenge204_easyBonus

challenge205_easy

challenge205_easyBonu

challenge206_easy

challenge207_easy

challenge208_easy

challenge210_easy

challenge211_easy

challenge212_easy

challenge212_easybonus

challenge213_easy

challenge214_easy

challenge215_easy

challenge216_easy

challenge217_easy

challenge218_easy

challenge218_easyBonus1

challenge218_easyBunus2

challenge219_easy

challenge220_easy.py

challenge221_easy

challenge221_easy

challenge222_easy

challenge222_easy.py

challenge223_easy

challenge226_easy

challenge226_easy

challenge228_easy.py

challenge228_easydev

challenge229_easy

challenge229_easybonus.py

challenge231_easy

challenge232_easy

challenge232_easy

challenge232_easybonus

challenge232_easybonus

challenge234_easy

challenge234_easybonus

challenge235_easy

challenge236_easy

challenge237_easy

challenge238_easy

challenge238_easybonus

challenge239_easy

challenge240_easy

challenge242_easy

challenge242_easy

challenge242_easyBonus

challenge243_easy

challenge245_easy

challenge245_easyBonus

challenge246_easy

challenge247_easy

challenge249_easy

challenge252_easy

challenge252_easy

challenge253_easy

challenge254_easy

challenge255_easy

challenge257_easy

challenge261_easy

challenge267_easy

challenge269_easy

challenge270_easy

challenge272_easy

challenge277_easy

challenge282_easy

challenge282_easy_bonus

challenge283_easy

challenge284_easy

challenge286_easy

challenge287_easy

challenge288_easy

challenge290_easy

challenge290_easybonus

challenge291_easy

challenge291_easybonus

challenge340_easy

challenge341_easy

challenge342_easy

challenge344_easy

challenge282_easy_bonus

'''
Binary numbers (base 2) are written using 1s and 0s to represent which
powers of 2 sum together to create the decimal number.
16 	8 	4 	2 	1
1 	0 	0 	1 	1

A 1 represents using that power of 2 and a 0 means not using it.
In the above example there is a one in the 16s, 2s and the 1s so we do:

10011 = 16 + 2 + 1 = 19

meaning that 10011 is binary for 19

The Fibonacci Sequence has a similar property that any positive
integer can be written in the form of Fibonacci numbers
(with no repeats). For example:

25 = 21 + 3 + 1

If we use the same form as for writing binary, with the Fibonacci
sequence instead of powers of 2, we can represent which Fibonacci
numbers we use with a 1, and the ones we don't with a 0.
13 	8 	5 	3 	2 	1 	1
1 	0 	1 	0 	0 	1 	0

1010010 = 13 + 5 + 1 = 19

meaning that 101001 is 'Base Fib' for 19

The task is to create a converter to convert to and from decimal
to 'Base Fib' Due to the nature of the Fibonacci Sequence, many
numbers have multiple representations in 'Base Fib', for the moment
these are to be ignored - any form is acceptable.
Input description

You will be given a line of input for each conversion, stating
the base it is currently in, and the number to convert seperated by space

10 16
10 32
10 9024720
F 10
F 1
F 111111
F 100000
F 10110110100111001

Output description

The program should output the converted number, in it's expected base, e.g.

1001000
10101000
1010100101010100000010001000010010
1
1
20
8
2868

Notes/Hints

    List of Fibonacci Numbers, though you can generate these yourself quite easily.

Your language probably already has a list of primes, although for the
bonus you may need to create you own list of Fibonacci Numbers.

Bonus

Now, a specific form is required for the 'Base Fib' answers.

Because each term of the sequence is the sum of the previous two, the 'Base Fib'
form of a decimal number in the Fibonacci sequence can either be the term itself,
or the previous two, e.g.

8             = 100000
8 = 5 + 3     = 11000
8 = 5 + 2 + 1 = 10101

For the bonus challenge, give the output with the least 1's.
Bonus input

10 8
10 16
10 32
10 9024720
'''


import re

bonus = '''10 8
10 16
10 32
10 9024720'''

def fibonacci_gen_list(max):
    '''generates fib. numbers
    to the input number'''
    fib_list = []
    a, b = 0, 1
    while a < max:
        #a, b = b, a+b
        b = a + b
        a = b - a
        fib_list.append(a)
    return fib_list


def dec2fib(num):
    '''(int) -> number
    convert a base 10 number
    to fibonacci base'''
    fib_list = fibonacci_gen_list(num)
    out_string = ''

    for x in range(len(fib_list) - 1, -1, -1):
        if num // fib_list[x] == 1:
            out_string += '1'
        else:
            out_string += '0'
        num = num % fib_list[x]

    out_string = out_string.lstrip('0')
    return out_string

if __name__ == '__main__':
    output = {}
    bonus = bonus.split('\n')

    for line in bonus:
        #  extract number -----------------
        number = re.findall('(?<=\s)[\d+]*', line)
        number = str(number[0])
        #-- base 10 to base fib ----------
        fib_num = dec2fib(int(number))
        ones = fib_num.count('1')
        output[number] = ones
    minkey = min(output, key=output.get)
    minval = output[minkey]
    print('{0}{1}{2}{3}'.format('Minimum number of ones: ', minval, ' from number ', minkey))

Result

Minimum number of ones: 1 from number 8