sidiomar's blog

By sidiomar, history, 5 weeks ago, In English,

So i was wondering about the Codeforces CPU speed so i wanted to make a TLE in an easy problem 630A i made an o(n^3) solution where n is 2^31-1 but still the solution gets accepted http://codeforces.com/contest/630/submission/34205932 any explications ? thnx

 
 
 
 
  • Vote: I like it  
  • +19
  • Vote: I do not like it  

»
5 weeks ago, # |
  Vote: I like it +26 Vote: I do not like it

Compiler is too smart for you. Those loops are completely useless and compiler threw them out. Try godbolt to see what compiler does.