OJ Board

Your code looks correct at first glance. But why you use arrays?
In this problem you only need to store maximum complient number, corresponding proposal name and minimal price, i.e. 2 integers and 1 string through all cycle.
And what you can try to do besides: init value for "compliance" should be ...

Thank you for your reply, ec3_limz!

I finally got AC; my mistake was trivial and stupid (as usual) - too small array for input data ([1..5000] instead of [1..5001]).

Best regards

Please anybody hint what's up with P152!

The problem seems quite easy, if using "brute force" approach, although too slow. I tryed some variants, always getting WA.
There is some unclear things for me:

1. Should I consider last line of input (0 0 0) like an ordinary case to check?

2. May I ...

I've just got AC for this problem after 2 attempts.
Second (successful) variant had only 1 change: Single type to Double,
I wrote in Pascal.
Besides, in your variant I noticed one small bug:
you check r>=1.0e-6 BEFORE adding new calculated "r" to "sum". I think this last addition may cause wrong ...

It seems you mess sequence elements and their ordering numbers.
For 3 element sequence x1,x2,x3 the only requirement to be 'jolly' is:
{Abs(x1-x2), Abs(x2-x3)} in [1,2] (without repetitions).

So following number triples all are jolly:
1,2,4; 4,2,1; 104,102,101; -5,-7,-6.

Hi to all!

I'd like to resume discussion on input problems.
All advices above work well in case of known amount of numbers in the line. But if you need to read indefinite (may be very big) number of integers? Same problem with very long Strings.
I've got many WA, TLE, MLE with several "primitive ...

Hi to ALL!

I'm an old Pascal user and fan ("old" also means age), and hardly can change this language to anything else. My version of Pascal is BP and so far I had very less problems with BP-GPC compatibility. But when I started to submit programs, I had received many "Compile Error" and WA, until ...