Discussion @ 1028. Stars @ Timus Online Judge

sony Is it strange to such a prolem? [4] // Problem 1028. Stars 4 Oct 2004 21:08

I only think of a O(N^2) algo for this problem.
At first,I wrote it in Pascal,But TLE.
And then,I wrote it in C,and got AC.
Who can do the explanation for me?
Thanks!

Vlad Veselov [PMG17, Vinnitsa - KNU, Kiev] What is difference in time they worked? [3] // Problem 1028. Stars 5 Oct 2004 16:23

Sandro Re: What is difference in time they worked? [2] // Problem 1028. Stars 11 Jul 2005 23:34

I got AC with N^2 CPP solution in 0.968 sec. Maybe judges should decrease the Time Limit.

Dmitry 'Diman_YES' Kovalioff My O(N^2) / 247 bytes on Delphi is 0.515 sec. (-) [1] // Problem 1028. Stars 12 Jul 2005 09:01

Vladimir Yakovlev (USU) Time limit was reduced (+) // Problem 1028. Stars 25 Jul 2005 21:06

New time limit is 0.25 sec. Bruteforce gets TL now.
All recent submits were rejudged.

Discussion of Problem 1028. Stars