Or those 4 sides are diagonal sides

All are complex!
in example:
q1=-2i r1=2
q2=-3i r2=-3

Yes, rank list does not update :(

For each mass store amount of possibilities you can get it. If this
number exceeds to than you can lower it downto 2.
NumGet: array[0..MaxCardMass * MaxCards] of byte;

For each mass store atleast one (if possible) card wich can create
that mass.
WhatGet: array[1..MaxCardMass * MaxCards] of byte;

You need 1000*100 * 2 arrays of bytes.

Start DP with 0 cards;
NumGet[0] := 1;

for CurrentCard <- 1 to CardCount do
    for i <-SumOfAllCards - CardWeight[CurrentCard] DOWNTO (!!!) 0 do
      if NumGet[i] <> 0 then
         Inc(NumGet[i + CardWeight[CurrentCard]], NumGet[i]);
         if NumGet[i + CardWeight[CurrentCard]] > 2 the
              NumGet[i + CardWeight[CurrentCard]] := 2
         if WhatGet[i + CardWeight[CurrentCard]] = 0 then
              WhatGet[i + CardWeight[CurrentCard]] := CurrentCard;

Downto needed to avoid next trap:
consider we can get mass 100
know we check card with mass 10
when i = 100 we mark that we can get 110
when i = 110 and it is (already marked) we mark 120
when i = 120 ...
...

Hope this will be helpfull...

I have no tests, but it could be overflow or wrong compare function

I have had AC.

It is obvious two objects can not be located at one point (otherwise we'd mention it in the statement).

But if you have some new correct tests, you may send them to dimanyes@gmail.com, and we will add them into the test set.

Which VC? 'cuz my VC2005 eats both %lld and %I64d, both __int64 and long long.

Find it as intersection of two arbitrary convex polygons, otherwise you'll bury yourself in special cases.

To do so get all points of one polygon inside the other, all points of the other polygon inside the first one, and also all their intersections by non-parallel sides.

Then find area of their convex hull. Angle/distance sorting step is enough to find that hull.

What do you mean by "symmetric"? It's 45-degrees turn.

Teams 4 and 5 played 0-0. Outcome for ANY pair of teams must be 0-3, 3-0 or 1-1

Edited by author 22.08.2008 14:21

Any body????

My program on Pascal with simple interval tree gets AC. I don't understand, what problem with C++ may you have???

And, output is defined incorrectly a bit: "In the first line output the number of “PERFECT” step-periods, ..." - any word about word "Perfect" in output.

no comments.