OJ Board

i'd like to do a donation but i can't use PayPal. is there any other
way? for example bank transfer?.

Thanks Astracan, that was it. Names are probably longer than
30000 (this is what i tried and what failed).
It looks that 10009 is more oriented to data reading technics
rather then to what it looks for the firs glance.

Adrian, thanks for the idea. I did follow it and finally got
accepted. However I am not sure that answers of my program
must be correct. I use primes up to 4 milions - this ensures
that for n<=1000 there is no such ambiguous situation that
more than two starting points lead to the end of range of ...

Hi, I confess I don't understand what strategie you are talking
about. If I understand well the problem the game ends when
one of the players reaches the position C , such that the next
valid (prime) is C[i+1] > C +n. My first guess was to
find such a gap and go back the way which is optimal for the ...

With use of the following program I tested correctness of
input data format. I get Runtime Error (result of call to
GenerateCrash). Can anybody tell me what is wrong?

Grzesiek

#include <stdlib.h>
#include <stdio.h>

int aInt=123, Zero=0;

void GenerateCrash(){
aInt /= Zero;
exit(1);
}

char buf ...

How about negative Y? Can be ignored a filter being below zero?
(ignored = treated nonexistent).
If not, I don't see any meanning for Y. I also get WA, with
considering -Y or without.

What output is correct for the input:

1
5 10 12 8 15 5
0

My program produces:

Workyards 1
Maximum profit is 0.
Number of pruls to buy: 0 1 3 5

I get W.A.
Can anybody give me some clue?

Regards, Grzesiek

Hi, I see loops in the input data.
The program does the following:
1) For all 26 towns: Town .prevTown = -1;
2) Next, according to input data:
...
Atown Btown
...
it is done: Town .prevTown = A.
(this is done only with the first part of
data, not with queries).
3) The following procedure is called ...