Pagini recente » Cod sursa (job #2062691) | algoritmiada-2019/runda-preoji/clasament | Cod sursa (job #1626815) | Cod sursa (job #2887802) | Cod sursa (job #2482557)
#include <iostream>
#include <fstream>
#define nmax 260
using namespace std;
ifstream in("rf.in");
ofstream out("rf.out");
int n,a[nmax][nmax],str[nmax][nmax];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
in>>a[i][j];
}
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(i!=j && a[i][k] && a[k][j])
{
if (a[i][j]>a[i][k]+a[k][j] || !a[i][j])
{
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
out<<a[i][j]<<" ";
}
out<<'\n';
}
return 0;
}