PyCon.Co 2020 Monadical Challenge


Problem descriptions: monadical.com/pycon-puzzles



Problem 1: Vehicles & Passengers (easier)

# Write an algorithm that finds the least expensive way # to send everyone from Bogota to Medellin, and prints the cost! def puzzle(num_people, vehicles): # put your code here, then click submit # ... return final_cost ### Tests test_vehicles = ( {'capacity': 10, 'cost': 250}, {'capacity': 5, 'cost': 50}, {'capacity': 15, 'cost': 275}, {'capacity': 6, 'cost': 20}, ) assert puzzle(7, test_vehicles) is None assert puzzle(15, test_vehicles) == 275 assert puzzle(16, test_vehicles) == 270 assert puzzle(17, test_vehicles) is None

Problem 2: Decoding Secret Messages (harder)

# Crack the code, and write a function to decode # any new messages you receive from mystery envelopes. def puzzle(encoded_message): # put your code here, then click submit # ... return plaintext ### Tests secret_messages = ( "Ig Bsz swEo IrpHEtCxNN xLC ELDRLU, OSYP ocTiWp Bkauhn.", "Rfcg fhvCC DAzs MrQL OK GLPSQYI eVca eMYYh Rl yheiw MpthltAzm'C nyCv.", "Fftqesjv YoCqM HJrJM xKKRQICWWMSM bX TBlhWee gcia wdasu elu.", "Lbvh fz vrqsF WCuJ fIIPxLH ICFOX HeJi aa iefdl ako Zrukimhoht syFrzAyxwGwz.", "Ig Bsz DiwD FB vuK LNvNQCC JP QFIOQWO XROgdZfZ, pecqe kv f iwxu IEwIJvF vT pyQAI jYNJV fYcfU gURVbhb.", "Wjvk ynl ykypnG FIGCyxP, BRFCWII Ig GPe ARAZfgYt, wnu edr qlmy JAHF trLt DJ ANLVOQW.", "BfcxxnlBt sD osIJvJ NCwK TGMa.", "EyromhoA rC nrHIuI MBvJ GLPMKFMY.", "Sjospj pA lpFGsG KztH yLKOLFZ.", "CpospjD qB mqGHtH LAuI zMLPMKFEYKK.", "Fmcw ny jnDEqE IxrF HzOQCC.", "Sqcuwj pA lpFGsG KztH zBLRE.", "RfcgegosqCI oBICJJ.", ) for message in secret_messages: print(puzzle(message))

Lastly, please fill out your name and email so that we can contact you if you win:




(we won't send any newsletters or spam)








Monadical © 2020 | Full-Stack Development Consultancy