For testing how long it takes to execute a loop of 10^9 turns, I have come up with a wonder that the code gets AC within 15 ms!!!!! Though the loop part is not related to the solution. Then I did the same with one extra nested loop and still the time taken was 15 ms :D I chose problem 592B for the test and my code is given below:

include <bits/stdc++.h>

using namespace std;

int main() { long long N, lol; for(long long i = 0; i < 10000000000LL; i++) { for(long long j = 0; j < 10000000000LL; j++){ lol = 100%100; } } cin >> N; cout << (N — 2) * (N — 2) << endl; return 0; }

How is that possible???