Cod sursa(job #1130714)
| Utilizator | Data | 28 februarie 2014 15:07:35 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
#define nmax 102
#define inf 1<<30
int mat[nmax][nmax];
int n;
int main()
{
int i,j,k;
in>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
in>>mat[i][j];
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(mat[i][j]>mat[i][k]+mat[k][j]) mat[i][j]=mat[i][k]+mat[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
out<<mat[i][j]<<" ";
}
out<<"\n";
}
return 0;
}
