OJ Board

Hi.

There is one hole in the problem:
imagine we have 16 letters with the same first 3 digits, but with different last 2 digits.

We could pack 15 letters into the one (!) 3-digit-bundle. But how we could choose letter should be sent first-class?

Please, tell me, where I was wrong.

What about order of execution of arguments of binary operations in this problem?

Should A have value 1 or 2 in the result of executing "B=(A=1)+(A=2)" ?
And what should be the value of C after executing C=A+(A=1), where A had value 0 before?

Is there multiple input in 108?

I've seen some solutions on this board using multiple input and some solutions that doesn't use multiple input....

Hi.

My algorithm for 588 works like this: for every wall I cut off the half plane at the back side of the wall from the resulting polygon. Then I check whether resulting polygon is empty. If it so, I say "impossible". Where I was wrong?