Cod sursa(job #1583973)
| Utilizator | Data | 29 ianuarie 2016 16:25:51 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.77 kb |
#include <fstream>
using namespace std;
int N,M,x,y,A[101][101];
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
in>>N;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
in>>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][k]!=0 and A[k][j]!=0 and i!=j and (A[i][j]>A[i][k]+A[k][j] || A[i][j]==0))
{
A[i][j]=A[i][k]+A[k][j];
}
}
}
}
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
out<<A[i][j]<<" ";
}
out<<'\n';
}
return 0;
}
