Pagini recente » Cod sursa (job #484002) | Cod sursa (job #1263994) | Cod sursa (job #421895) | Cod sursa (job #1087350) | Cod sursa (job #2221821)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int a[105][105];
int main() {
int n;
fin>>n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
fin>>a[i][j];
for (int nod=1;nod<=n;nod++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (a[i][nod]+a[nod][j]<a[i][j])
a[i][j]=a[i][nod]+a[nod][j];
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
fout<<a[i][j]<<' ';
fout<<'\n';
}
return 0;
}