Cod sursa(job #1984469)
| Utilizator | Data | 24 mai 2017 22:50:18 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101], N;
int main()
{
f>>N;
int i, j, k;
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
f>>a[i][j];
for(k = 1; k <= N; k++)
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
if(a[i][k] && a[k][j] && i!=j)
if(a[i][k] + a[k][j] < a[i][j])
a[i][j] = a[i][k] + a[k][j];
for(i = 1; i <= N; i++)
{
for(j = 1; j <= N; j++)
g<<a[i][j]<<" ";
g<<'\n';
}
return 0;
}
