Pagini recente » Cod sursa (job #2191351) | Cod sursa (job #664702) | Istoria paginii runda/valicaroom1 | Cod sursa (job #2647295) | Cod sursa (job #1362672)
#include<stdio.h>
#include<vector>
#define NMAX 101
using namespace std;
vector<int> T[NMAX];
int n;
void read()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int i,j,x;
scanf("%d",&n);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
scanf("%d",&x);
T[i].push_back(x);
}
}
void r0y3L0yD()
{
int i, j, k;
for (k=0; k<n;k++)
for (i=0;i<n;i++)
for (j=0;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];
}
void afis()
{
int i,j;
for(i=0;i<n;i++){
for(j=0;j<n;j++)
printf("%d ",T[i][j]);
printf("\n");
}
}
int main()
{
read();
r0y3L0yD();
afis();
return 0;
}