B. Diagonal Walking v.2

題目鏈接 Mikhail walks on a Cartesian plane. He starts at the point (0,0), and in one move he can go to any of eight adjacent points. For example, if Mikhail is currently at the point (0,0), he can go to

>>阅读原文<<