I have o(n * n) algorithm, not many calculations inside cycle, but still TLE12. Imho, everybody writes such a solutions, but in c++ in can be accepted in 0.015, but i have 1.031 (or more) in java. That's not fairly. I ask autors to increase TL up to 2 seconds, or maybe change your time checking system to prevent this...

I have ACepted this problem in 0.234 using Java without any optimizations.

I have 0.234 in C++ with simple O(N^2) algo. Square roots are slow even in C++.