OJ Board

Sedefcho wrote:Where can we read about this algorithm ?

Do you need it for some particular problems here
at this site or for some other purpose ?

Just Google for it, you should be able to find it.

I don't need it for some problem here, it's part of something I am implementing.

Hi :) I'm implementing Weiler-Atherton's algorithm for boolean operations on concave polygons and I have a hard time dealing with the special cases. Does anyone have some knowledge on how to handle intersecting parallel edges, and stuff like that. Currently I knot how to deal with vertices which lie...

That's because someone introduced characters different than alphabetic chars and digits (which are not allowed). I supposed that this was messed up when resubmitting my problem, but I was too tired to check what was wrong this time. At least someone can fix the problem statement ... :( Generally it'...

If you can, check out 'Algorithms on Trees and Sequences' -
Aho-Corasick is described there in detail.

Hi,

Isn't the solution here just to find the largest full subgraph?

Can anyone please give me some test cases for this problem,
I keep getting WA, although I think I handle all special cases.

Petko Minkov

Okay, here is an idea. Currently I've setuped my account not to receive e-mail notification upon judge event, but when I receive compilation error I have to go and edit my user information to receive e-mail, so I can see my compilation error. So, it will be quite usefull to add something like "...

Sometimes people visit the board,
because they want to see discussion
on any problem (which may eventually
interest them). Now we have to visit
7 + 3 boards every volume. Can you
combine the boards of all volumes in one, of course leaving the volume board untouched.

Petko Minkov