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

challenge79_easy

challenge80_easyone

challenge82_easy

challenge83_easy

challenge86_easy

challenge94_easy

challenge104_easy

challenge130_easy

challenge143_easy

challenge146_easy

challenge148_easy

challenge149_easy

challenge153_easy

challenge154_easy

challenge158_easy

challenge158_easybonus

challenge159_easy

challenge160_easy

challenge169_easy

challenge169_easybonus

challenge172_easy

challenge174_easy

challenge175_easy

challenge177_easy

challenge180_easy

challenge181_easy

challenge185_easy

challenge192_easy

challenge193_easy

challenge197_easy

challenge198_easy

challenge199_easy

challenge201_easy

challenge202_easy

challenge203_easy

challenge204_easy

challenge204_easyBonus

challenge205_easy

challenge205_easyBonu

challenge206_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

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

challenge254_easy

challenge255_easy

challenge270_easy

challenge284_easy

challenge286_easy

challenge287_easy

challenge288_easy

challenge290_easy

challenge290_easybonus

challenge291_easy

challenge291_easybonus

challenge148_easy

'''
Combination locks are mechanisms that are locked until a specific number combination is input.
Either the input is a single dial that must rotate around in a special procedure, or have
three disks set in specific positions. This challenge will ask you to compute how much you
have to spin a single-face lock to open it with a given three-digit code.

The procedure for our lock is as follows: (lock-face starts at number 0 and has up to N numbers)

    Spin the lock a full 2 times clockwise, and continue rotating it to the code's first digit.
    Spin the lock a single time counter-clockwise, and continue rotating to the code's second digit.
    Spin the lock clockwise directly to the code's last digit.

Formal Inputs & Outputs
Input Description

Input will consist of four space-delimited integers on a single line through console standard input.
This integers will range inclusively from 1 to 255. The first integer is N: the number of digits on
the lock, starting from 0. A lock where N is 5 means the printed numbers on the dial are 0, 1, 2, 3,
and 5, listed counter-clockwise. The next three numbers are the three digits for the opening code.
They will always range inclusively between 0 and N-1.
Output Description

Print the total rotation increments you've had to rotate to open the lock with the given code.
See example explanation for details.
Sample Inputs & Outputs
Sample Input

5 1 2 3

Sample Output

21

Here's how we got that number:

    Spin lock 2 times clockwise: +10, at position 0
    Spin lock to first number clockwise: +1, at position 1
    Spin lock 1 time counter-clockwise: +5, at position 1
    Spin lock to second number counter-clockwise: +4, at position 2
    Spin lock to third number clockwise: +1, at position 3

'''

N = 5
sample = '5123'
temp = 0
increments = 2 * N

for x in range(0, len(sample)):
    temp = int(temp)
    increments += abs(int(sample[x]) - temp)
    temp = sample[x]
print(increments)

Result

21