I'm still trying to wrap my head around time complexity. For F, the time soln is O(n^2). Considering that n <= 2000 and t <= 2000 then the total amount of operations is 2000*(2000*2000) = 8000000000. (T*O(N^2)) From what I've been taught, it takes roughly 10^8 operations for 1 second to pass. Therefore, I should have 2*10^8 operations for 2 seconds to pass (2 sec is time limit).

But 8000000000 > 2*10^8. Shouldn't the soln cause a time limit?