Cod sursa(job #1501604)
| Utilizator | Data | 13 octombrie 2015 17:48:48 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.78 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
short N;
f>>N;
short A[N+1][N+1];
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][k]!=0)&&(A[k][j]!=0))
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; i++)
{
for(int j=1; j<=N; j++)
{
g<<A[i][j]<<" ";
}
g<<"\n";
}
return 0;
}
