Message from Python discussions

November 2018

— Shutil.copyfile2


Hi, anyone familiar with DCP? trying to solve this problem: Given the mapping a = 1, b = 2, ... z = 26, and an encoded message, count the number of ways it can be decoded.
For example, the message '111' would give 3, since it could be decoded as 'aaa', 'ka', and 'ak'. - However i'm solving the extended version, i need to have a list of all possible string values derived from input rather than just count of possibilities. Would appreciate if anyone gives a clue.

— I have error

ParserError: Error tokenizing data. C error: Expected 1 fields in line 12, saw 2


— I am having trouble converting a tuple into 2D array. Searched everywhere tried everything but can't get it done. This comma between coordinates is fking my brains. Any ideas?

Message permanent page

— Because you're doing it wrong in line 12

— Thank you Captain, for your service to this group. :3

— It was a quality question.

— Https://

— Read it already, doesn't work I am doing something wrong

— Yes but witch type of error!!

— Wait, lemme smell that code thru my screen...

— YW😊