Cod sursa(job #2905430)
Utilizator | Data | 21 mai 2022 14:59:12 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream F("royfloyd.in");
ofstream G("royfloyd.out");
#define C(i) for(i=0;i<n;++i)
short d[100][100],n,i,j,k;
int main()
{
F>>n;
C(i)
C(j)
F>>d[i][j];
C(k)
C(i)
C(j)
if(i!=j&&d[i][k]&&d[k][j]&&(!d[i][j]||d[i][j]>d[i][k]+d[k][j]))
d[i][j]=d[i][k]+d[k][j];
C(i) {
C(j)
G<<d[i][j]<<' ';
G<<'\n';
}
return 0;
}