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

Правка en8, от Kolwdfurr_Rad, 2023-05-09 09:48:50

A.Pirates of the Carribbean.

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 were to check every possible path for the one with most treasures time taken by the program will be too much and we will clearly get TLE for larger m and n. textbf{dfd} $$$a=b$$$ a=b

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en16 Английский Kolwdfurr_Rad 2023-05-10 10:47:44 0 (published)
en15 Английский Kolwdfurr_Rad 2023-05-10 10:47:19 8 (saved to drafts)
en14 Английский Kolwdfurr_Rad 2023-05-09 18:25:03 0 (published)
en13 Английский Kolwdfurr_Rad 2023-05-09 17:40:45 2
en12 Английский Kolwdfurr_Rad 2023-05-09 17:24:07 138
en11 Английский Kolwdfurr_Rad 2023-05-09 17:21:42 12
en10 Английский Kolwdfurr_Rad 2023-05-09 17:19:15 662
en9 Английский Kolwdfurr_Rad 2023-05-09 12:13:50 2070 Tiny change: '===\nThis problem r' -> '===\nThis ### problem r'
en8 Английский Kolwdfurr_Rad 2023-05-09 09:48:50 4 Tiny change: '===\nThis problem r' -> '===\nThis ### problem r'
en7 Английский Kolwdfurr_Rad 2023-05-09 09:48:39 57 Tiny change: '===\nThis problem r' -> '===\nThis ### problem r'
en6 Английский Kolwdfurr_Rad 2023-05-09 09:48:12 4 Tiny change: '===\nThis problem r' -> '===\nThis ### problem r'
en5 Английский Kolwdfurr_Rad 2023-05-09 09:48:00 60
en4 Английский Kolwdfurr_Rad 2023-05-09 09:46:29 147
en3 Английский 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 Английский 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 Английский Kolwdfurr_Rad 2023-05-08 23:29:26 612 Initial revision (saved to drafts)