Cod sursa(job #2109778)
| Utilizator | Data | 20 ianuarie 2018 09:48:04 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101];
int n;
f>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{
f>>a[i][j];
if(a[i][j]==0&&i!=j) a[i][j]=100000;
}
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}
