Cod sursa(job #1248911)
| Utilizator | Data | 26 octombrie 2014 11:07:35 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n,a[101][101];
void abc()
{
int k,i,j;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j && a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]))
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
int i,j;
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
abc();
for(i=1;i<=n;i++,cout<<'\n')
for(j=1;j<=n;j++)
cout<<a[i][j]<<' ';
return 0;
}
