simp_pro's blog

By simp_pro, history, 15 months ago, In English

Question link

Submission link

My solution is in O(n^2*log(mod)) . It should pass easily

  • Vote: I like it
  • -28
  • Vote: I do not like it

| Write comment?
»
15 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

looks like undefined behavior cause it gets WA9 with other compiler https://codeforces.com/contest/1794/submission/199837718