Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

Grid's paths, River crossing pawn, and avoiding Knight's move, start to end count

Revision en6, by yawn_lento, 2026-07-21 05:09:09

my attemt using Monte Carlo, effective when the number is small, but will resulting in RE when dealing with larger numbers You can view the full, well-formatted C++ source code here on GitHub:https://github.com/yawn-lento/yawn-scodes/blob/main/P10002-%E8%92%99%E5%A1%94%E5%8D%A1%E7%BD%97%E9%9A%8F%E6%9C%BA%E5%B0%9D%E8%AF%95.cpp suggestions :using DP will always be better

Tags monte carlo, grid paths, start to end

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en9 English yawn_lento 2026-07-22 05:33:52 33 Tiny change: 'introduced. However,' -> 'introduced(though still not very effective). However,'
en8 English yawn_lento 2026-07-22 05:23:58 970
en7 English yawn_lento 2026-07-21 05:10:51 12
en6 English yawn_lento 2026-07-21 05:09:09 82
en5 English yawn_lento 2026-07-21 05:05:33 1583
en4 English yawn_lento 2026-07-21 05:01:28 42
en3 English yawn_lento 2026-07-21 04:55:47 22
en2 English yawn_lento 2026-07-21 04:53:13 26
en1 English yawn_lento 2026-07-21 04:51:02 1725 Initial revision (published)