Pagini recente » Borderou de evaluare (job #3119145) | Cod sursa (job #2776777) | Cod sursa (job #669423) | Cod sursa (job #3038404) | Cod sursa (job #1194213)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[105][105];
int main()
{
f>>n;
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
f>>a[i][j];
for(int k = 0; k < n; ++k)
for(int i = 0; i < n; ++i)
for(int j = 0; 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(int i = 0; i < n; ++i, g<<'\n')
for(int j = 0; j < n; ++j)
g<<a[i][j]<<' ';
return 0;
}