Pagini recente » Cod sursa (job #2458888) | Cod sursa (job #2148069) | Cod sursa (job #1026) | Cod sursa (job #1644838) | Cod sursa (job #2210767)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[101][101], b[101][101], i, j, k, n;
int main(){
in >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++){
in >> a[i][j];
b[i][j] = a[i][j];
}
for(i = 1; i <= n; i++)
b[i][i] = 0;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
for(k = 1; k <= n; k++)
if(b[i][j] > b[i][k] + b[k][j])
b[i][j] = b[i][k] + b[k][j];
for(i = 1; i <= n; i++, out << "\n")
for(j = 1; j <= n; j++)
out << b[i][j] << " ";
return 0;
}