What was the intended solution for problem D?? Was it DP or greedy??

Which Contest??

It is because you are using int i in for loop ,so when i*i>=6*(1e9) ,it causes integer overflow and hence i*i return some garbage value (in most of the cases some random negative value). Hence it causes your code to get a TLE verdict. You can improve this by using:- i<=sqrt(n).

It was a copied question from codeforces. Just take a look at this:-
https://mirror.codeforces.com/contest/622/problem/F .
Look at it's editorial if you want the slution approach.

code_ned Please make sure that I was talking about submissions made within the contest that was rated for you!! That contest was not rated for me so it makes no difference to me .

No!! There are at most 60 edges in a graph and removing each edge and doing bfs would cost me at most 60 operations . so overall our complexity would be (60)^2. You could have also used bellman ford for this but there time complexity would have been (60)^3 in worst case.

Still it will give precision errors!!! check on local compiler!!

You will most probably encounter precision errors as you have use double data type, because the values are as high as 1e18!!

When will the system testing start?? Will it take one more day :XD

.

Quickest system testing seen on codeforces :D

When system testing will start??

Will there be any system testing for this round??

Why are you creating fake accounts for asking your doubts?? I cannot see any of your submissions so I can presume that you have not tried anything.

I cannot see any of ur past submissions. How u can ask such questions if have not started anything yet??

When system testing will be done for the contest??

.

.