Cod sursa(job #2001716)
Utilizator | Pana Claudiu Claudiu07 | Data | 17 iulie 2017 15:42:21 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[102][102];
int main()
{
f>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
f>>a[i][j];
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(k!=i && k!=j && a[i][k] && a[k][j] && a[i][k]+a[k][j]<a[i][j]) a[i][j]=a[i][k]+a[k][j];
for(int i=1; i<=n; i++)
{for(int j=1; j<=n; j++)
g<<a[i][j]<<' ';
g<<'\n';}
}