Cod sursa(job #1126000)
Utilizator | Data | 26 februarie 2014 20:42:33 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,mat[101][101];
int main()
{ in>>n;
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
in>>mat[i][j];
int k;
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])&& 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;
}