Pagini recente » Cod sursa (job #1356118) | Cod sursa (job #1159164) | Cod sursa (job #2202306) | Cod sursa (job #1198621) | Cod sursa (job #2122295)
#include <fstream>
using namespace std;
int a[105][105],n;
void royfloyd(){
int i, j, k;
for(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][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k]+ a[k][j];
}
int main(){
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> a[i][j];
royfloyd();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
fout << a[i][j] << " " ;
fout << endl;
}
return 0;
}