Cod sursa(job #2237470)
| Utilizator | Data | 1 septembrie 2018 23:09:41 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
int i,j,k,n,d[101][101];
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
in>>d[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
out<<d[i][j]<<" ";
out<<"\n";
}
}
