Codechef Biteration #2 BIT2C complexity

Правка en1, от Tutis, 2019-09-20 21:27:06

Can someone explain or prove, why calculating all possible values for every interval doesn't get TLE?

I think it should be $$$O(n!)$$$.

My solution.

Problem link.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Tutis 2019-09-20 21:27:06 308 Initial revision (published)