How this code can be acepted !!

Правка en1, от ExpectoPatronum, 2021-02-01 19:54:28

105860386 If I'm not mistaken the complexity of this code is O(n) with 1 <= n <= 10^9 . Please explain to me !!. Thank you.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский ExpectoPatronum 2021-02-01 19:54:28 168 Initial revision (published)