Pagini recente » Cod sursa (job #1329316) | Cod sursa (job #3248652) | Cod sursa (job #2181928) | Cod sursa (job #2058644) | Cod sursa (job #1040689)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define MAX 256
#define MOD 2011
int n, i, k, a[102][102], j;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fin>>a[i][j];
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j)
a[i][j]= a[i][k]+a[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}