Блог пользователя Ferrarixxx

Автор Ferrarixxx, история, 6 лет назад, По-английски

Hi, Thanks for opening this Link :)

Heres the Problem Link: Problem D Link
My Submission Link: Please Click Me

I have Commented my logic which is same as that of editorial Very simple

Thanks For Reading

Hoping for a Prompt Reply.

  • Проголосовать: нравится
  • +5
  • Проголосовать: не нравится

»
6 лет назад, скрыть # |
 
Проголосовать: нравится +8 Проголосовать: не нравится

in your dfs when you write x * (n — x) % mod , this is wrong becuase you want the maximum of them and if x * (n — x) == mod -> you set it as 0, which could be the maximum. just remove the % mod in your dfs and catch overflow when you want to add to your final answer