Your challenge, if you accept it, is to create a program to test if Mario can go to the end of this map. Given a map, output if Mario can go from the S to the E. Mario can jump to a height of 5 blocks. Test cases: S E ===== -> true E === = S = === -> true E == = = = S = ...
00:00 - 03:0003:00 - 07:0007:00 - 12:0012:00 - 15:0015:00 - 17:0017:00 - 19:0019:00 - 20:0020:00 - 21:0021:00 - 00:00
user214599
user214599
user214599
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
00:00 - 03:0003:00 - 07:0007:00 - 12:0012:00 - 15:0015:00 - 17:0017:00 - 19:0019:00 - 20:0020:00 - 21:0021:00 - 00:00