Pagini recente » Cod sursa (job #1310459) | Cod sursa (job #1303141) | Cod sursa (job #2121769) | Cod sursa (job #3227587) | Cod sursa (job #2525637)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105];
int n;
void citire() {
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> a[i][j];
}
void solve() {
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])
a[i][j] = min(a[i][j], a[i][k]+a[k][j]);
}
void afis() {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++)
fout << a[i][j] << ' ';
fout << '\n';
}
}
int main() {
citire();
solve();
afis();
}