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

SRM 649 Div 2 Medium

Revision en1, by justforlaugh, 2015-06-29 07:53:48

I have read the solution on the editorial for this problem but I dont understand how it came with this part on the code:

for (int x = 1; x < n; ++x) {
  for (int y = 0; y <= k - 1; ++y) {
    result = Math.min(result, Math.max(F(x, y), F(n - x, k - 1 - y)) + 1);
  }
}

Can anyone help me with this. Thanks!

Tags topcoder, srm #649

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English justforlaugh 2015-06-29 07:53:48 439 Initial revision (published)