Pagini recente » Cod sursa (job #781309) | Cod sursa (job #2739697) | Cod sursa (job #1885022) | Cod sursa (job #2515355) | Cod sursa (job #2750297)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N = 105;
int a[N][N];
int main()
{
int n;
in >> n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
in >> a[i][j];
if(a[i][j] == 0 && i != j)
a[i][j] = 999999999;
}
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(a[i][k] + a[k][j] < a[i][j])
a[i][j] = a[i][k] + a[k][j];
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++)
if(a[i][j] == 999999999)
out << 0 << ' ';
else
out << a[i][j] << ' ';
out << '\n';
}
return 0;
}