OJ Board

I tested it at my home PC with the input and receive right answer

Still WA. I receive right answer on
4 1 1
0
2 4 1
1
3 4 1
1

I use BFS search. Why here can be a problem. All the times i keep in the array c[][][], where c [j][0]-number of times when person i meets person j.
I post my code. Maybe someone will see some mistakes, as i'm already tired of thinking ...

Hi! Give me please critical input for this problem.

Hi! Could you help me with finding lexikografically smallest path? I use DP from left to right. Should i check all the paths with the same weight from the last column and then find the smallest path or there is easier solution?

Hi! I saw that some guys solved 640 in 0.00 or something like that. Is it possible to find such a quick algorithm or they just did precalculation?

Hi! I'm rostik. I'm a student of the NaUKMA University (Kiev, Ukraine). We ' d like to install an online-judge system on our university server. I'm one of the group of students who is responsible for doing this. i'd be very grateful for getting any possible information from you about the online ...

Hi! I can't submit my programme on USACO - the grade shows Your program ('prg') exited with signal #139 () when presented with test case 2, shown below...
I consider the problem is with my I/O, as the first test my programme passes. Here is my code:
[cpp]
#include <stdio.h>
#include <stdlib.h ...

Try to write
[cpp]#include <cstdio>[/cpp]
instead of [cpp]include <stdio.h>[/cpp]

Great thanks!

Great thanks!

OK. Thanks, maybe i have problems with my cygwin, as there are no files in the bin directory... And my cygwin.bat returns "Bad name file"

And what about non-char array?

And what do i have to write in the cygwin.bat to use gcc compiler?

Is there the same function in c++ as FILLCHAR in Pascal?
How to fill the array will special value quickly?

Thanks a lot! I'll try it ...