Cod sursa(job #2050339)
| Utilizator | Data | 28 octombrie 2017 09:14:36 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[102][102],x,y,dmin=1e9;
int dist[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(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;g<<'\n',++i)
for(int j=1;j<=n;++j)
g<<a[i][j]<<" ";
return 0;
}
