OJ Board

There is my code (it's awful)

[cpp]#include <iostream>
#include <math.h>

using namespace std;

int ile_walut;
long double tabela [21][21];
long double tabela2[21][21];
int ile_zmian[21][21];
int ile_zmian2[21][21];
long double bylo,nowe;
int ile_bylo,ile_nowe;
int ciag[23][23][23];
int ciag2[23 ...

This program generates only input data with short output sequence. My program pass all that tests. Have anybody test input data with long output sequence.

4) floating point errors.
5) floating point errors.
6) floating point errors.

Could you explain what floating point errors may be in this problem. I used a modified Floyd-Warshall algorithm, I passed all my and forum's tests but I still give WA in online judge. I don't know why.

I found, why my program gave WA. That was a long line in my program:


[cpp]cout << "Case " << przypadek << ": The longest path from " << poczatek << " has length " << maks << ", finishing at " << najm[poczatek] << "." << endl << endl; [/cpp]

My mail klient wrap this line.

When I change this line ...

Thanks for the answer. But I would like somebody to test my program with input data and give me data for which my program generates wrong answer. Sorry for my english. Thanks.

Hi! I got a WA on this problem, too. I think that my program works good. Could someone give me input and output sample??? That is my code:
[cpp]
#include <iostream>

using namespace std;

int ile_wezlow;
int poczatek;

int maks;
int przypadek;
int tabela[110][110];
int sumy[110];
int konce[110 ...