Codeforces Round not_a_round (Div.0) EDITORIAL. A.Pirates of the Carribbean.

Revision en2, by Kolwdfurr_Rad, 2023-05-09 09:44:30

This problem requires us to think sequentially.

Let us state the facts : - We must go from the top left corner to the bottom right corner . - We can only move right or down.

You may think that this question is dreadfully complicated as there are 2^(m+n-2) ways to go from the top left corner to the bottom right. If we check every possible path to find the path in which Captain Shan and his gang encounter the most mystical treasures the time take will be way too high and we will clearly get TLE for larger m and n.

Kolwdfurr_Rad $$$a=b$$$ a=b

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en16 English Kolwdfurr_Rad 2023-05-10 10:47:44 0 (published)
en15 English Kolwdfurr_Rad 2023-05-10 10:47:19 8 (saved to drafts)
en14 English Kolwdfurr_Rad 2023-05-09 18:25:03 0 (published)
en13 English Kolwdfurr_Rad 2023-05-09 17:40:45 2
en12 English Kolwdfurr_Rad 2023-05-09 17:24:07 138
en11 English Kolwdfurr_Rad 2023-05-09 17:21:42 12
en10 English Kolwdfurr_Rad 2023-05-09 17:19:15 662
en9 English Kolwdfurr_Rad 2023-05-09 12:13:50 2070 Tiny change: '===\nThis problem r' -> '===\nThis ### problem r'
en8 English Kolwdfurr_Rad 2023-05-09 09:48:50 4 Tiny change: '===\nThis problem r' -> '===\nThis ### problem r'
en7 English Kolwdfurr_Rad 2023-05-09 09:48:39 57 Tiny change: '===\nThis problem r' -> '===\nThis ### problem r'
en6 English Kolwdfurr_Rad 2023-05-09 09:48:12 4 Tiny change: '===\nThis problem r' -> '===\nThis ### problem r'
en5 English Kolwdfurr_Rad 2023-05-09 09:48:00 60
en4 English Kolwdfurr_Rad 2023-05-09 09:46:29 147
en3 English Kolwdfurr_Rad 2023-05-09 09:44:51 6 Tiny change: 'there are 2^(m+n-2) ways to g' -> 'there are $2^{m+n-2}$ ways to g'
en2 English Kolwdfurr_Rad 2023-05-09 09:44:30 44 Tiny change: 'nd n. \n\n' -> 'nd n. \n\n[user:Kolwdfurr_Rad]\n$a=b$\na=b'
en1 English Kolwdfurr_Rad 2023-05-08 23:29:26 612 Initial revision (saved to drafts)