Pagini recente » Cod sursa (job #1859768) | Clasament Summer Challenge 2007, Runda 2 | Cod sursa (job #2682524) | Cod sursa (job #1743357) | Cod sursa (job #2566542)
#include <iostream>
#include <fstream>
using namespace std;
int a[101][101], n;
int main() {
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> a[i][j];
fin.close();
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]) && 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';
}
fout.close();
return 0;
}