Pagini recente » Cod sursa (job #2192247) | Cod sursa (job #2085098) | Cod sursa (job #2068661) | Cod sursa (job #1481071) | Cod sursa (job #1145562)
#include <iostream>
#include <fstream>
using namespace std;
const int INF=2e8;
int a[101][101],n;
ifstream d("royfloyd.in");
ofstream o("royfloyd.out");
int main()
{
d>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
d>>a[i][j];
if(a[i][j]==0 && i!=j)
a[i][j]=INF;
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
o<<a[i][j];
o<<'\n';
}
return 0;
}