Pagini recente » Cod sursa (job #2496492) | Cod sursa (job #1540982) | Cod sursa (job #1376790) | Cod sursa (job #1121572) | Cod sursa (job #2755744)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
long long a[105][105];
long long n;
int main() {
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++) {
fin >> a[i][j];
if(a[i][j] == 0)
a[i][j] = 999999999;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
if(i != k)
for(int j = 1; j <= n; j++)
if(j != i && j != k && 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++) {
if(a[i][j] == 999999999)
fout << "0 ";
else
fout << a[i][j] << " ";
}
fout << "\n";
}
return 0;
}