OJ Board

Hi!

I came across a bit difficult problem which I cannot cope with.
It says that in input there are two sets of points on plane (coordinates are given). The task is to assign points from one set to the points from another set in a way that no segment made form two points will intersect

Has anybody ...

In fact, it's too slow. I need to know faster algo. Please help me!

Unfortunately, those libraries do not satisfy me. I'd like to know how it's done and which algo has been used.

And what about division?

Hi!

I'm facing up a bignum problems right now. I tried to write substraction, addition, multiplication and division on bignums. However, coding multiplication and division took me too long and I'm not still able to write it. Substraction and addition with carry operations can be easily written.

So ...