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