Pagini recente » Cod sursa (job #2936119) | Cod sursa (job #2879917) | Istoria paginii info-oltenia-2018/individual/7-8 | Cod sursa (job #2534120) | Cod sursa (job #2732109)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int nMax = 1e3 + 5;
int n, a[nMax][nMax];
void read(){
cin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
cin >> 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])
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
void print(){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++)
cout << a[i][j] << " ";
cout << "\n";
}
}
int main()
{
read();
solve();
print();
return 0;
}