Mai intai trebuie sa te autentifici.
Cod sursa(job #1899535)
| Utilizator | Data | 2 martie 2017 19:58:09 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.81 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int n,a[110][110];
void citire()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
void royfloyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(i!=j&&a[i][j]>a[i][k]+a[k][j]&&a[i][k]&&a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
}
void afisare()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
citire();
royfloyd();
afisare();
//cout << "Hello world!" << endl;
return 0;
}
