Cod sursa(job #1124971)
Utilizator | Data | 26 februarie 2014 14:52:01 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
using namespace std;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int t[102][102],n;
scanf("%d",&n);
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)scanf("%d",&t[i][j]);
for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)
{
if(t[i][k] && t[k][j] && (t[i][j]>t[i][k]+t[k][j] || !t[i][j]) && i!=j) t[i][j]=t[i][k]+t[k][j];
}
for (int i=1;i<=n;i++){for(int j=1;j<=n;j++) printf("%d ",t[i][j]);printf("\n");}
}