Pagini recente » Cod sursa (job #1356641) | Cod sursa (job #627804) | Cod sursa (job #2168741) | Cod sursa (job #1031399) | Cod sursa (job #2621766)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105];
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> 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(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++)
fout << a[i][j] <<' ';
fout << '\n';
}
}