There are two dp-approaches already described on the webboard

So I have accepted with dp
I have two dp
Stirling numbers of the second kind and factorial
Then precalculate answer array

Well, I got WA 3 during the contest but I'm pretty sure my idea is right, ahy tests ?

Did you check small dividers? ro pollard works very poorly with them

Greedy approach is fine but why output pairs with maximum number and minimum number ??

I used a max heap in which I hold pairs like, number i (index of the sign) and frequency of that sign. Each time I pop out from that heap the 2 index with maximal frequency, decrement their frequency and update the heap from their indexes.

I was sure that there is a more simplier aproach to that problem(like greedy), without using heap, but I was just 99.9% sure that with heap I will got AC, and so it was. :)

gcc has problems when it uses FPU

unknown unknown
unknown 1

Beacuse he doesn't know whether he drank 1 or 0 cocktails last time.
And, yes, he will be asked first time.

This test looks incorrect as they can't reach any bar after 1

I solved without it.I also used "improved step-by-step barbell moving",but my solution was quite far from TLE. I modeled groove as int array,but if you use sorting on worms array and then search there some coordinates then you can possibly get TLE.

Edited by author 06.03.2009 05:20

thanks a lot ...your formula is really useful.^_^

Used everynth what is written here. However still WA8.
Any new ideas?...

kiitos

Thanx for your hint

Do u know that pi can be calculated by this formula: atan(1) * 4?

Hi,

Alright guys I have solved the problem. Being a newbie to c# caused me to submit program 35 times. I didn't realize that Math.Round() function will change 100.00 to 100 instead. Here are the lines which I changed.

double miles = distance(ship_latitude_radian, ship_longitude_radian, iceberg_latitude_radian, iceberg_longitude_radian);
            if (Math.Round(miles, 2) < 100.00)
            {
                Console.WriteLine("The distance to the iceberg: {0:F2} miles.", miles);
                Console.WriteLine("DANGER!");
            }
            else
            {
                Console.WriteLine("The distance to the iceberg: {0:F2} miles.", miles);
            }

s=floor(s*100+0.5)/100.0

Solved by making the following comparison in java:

if (Math.round(distance*100) < 10000) {
    System.out.println("DANGER!");
}

it will force it to compare with 2 digits precision.

Nautical miles are different

I want to find out too

I wonder too, always wa on test 2

Zeroes matters only if strings are equal.

Try this:
abc0125a
abc00125a
abc00125b
abc0125b

You can also try:

0000000
000

(Already sorted)

This test is incorrect

This test is correct, and the answer should be
00
00

make 2 sequences (s1 and s2) such that s1[i]+s2[i]<>2

Agreed. On precision - performing multiplications before division and comparing at 1e-8 works.