OJ Board

Here is my code in Pascal
[pascal]
const maxn=52;
var a:array [0..maxn,0..maxn] of boolean;
c:array [0..maxn,1..22] of boolean;
m,n,i,j,k,p,q:integer;

Begin
readln(n,m,k);
while n>0 do
begin
fillchar(a,sizeof(a),0);
fillchar(c,sizeof(c),0);
for i:=1 to m do
begin
readln(p,q);
if p<>q ...

Red Scorpion wrote:Hi!

I have solved this problem using integer, not double.

Your output is wrong:
input:
10002 1001 102
3 0 1 0 -1

Output:
93123 102 11105 102 9103

Good Luck!

Are all the test data within the range of int64?

Can you give me some detailed information about 'special correction' and 'special judge program'?

I use 'Floyd' algorithm(O(n^3)) for this problem, but i got a TLE.
I wonder if there is any better algorithm for it?
and also, they don't declare how big is the data size(n, I mean).