Pagini recente » Cod sursa (job #2298078) | Cod sursa (job #1212861) | Cod sursa (job #1105176) | Cod sursa (job #1501444) | Cod sursa (job #3240312)
#include<bits/stdc++.h>
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';
}
}