Pagini recente » Cod sursa (job #2170295) | Cod sursa (job #2623925) | Cod sursa (job #2881898) | Cod sursa (job #121582) | Cod sursa (job #2276210)
#include <iostream>
#include <fstream>
using namespace std;
ifstream scan("royfloyd.in");
ofstream print("royfloyd.out");
int n ,ad[1005][1005] ;
int main()
{
scan >> n;
for(int i = 1 ; i <= n ; ++i)
for(int j = 1 ; j <= n ; ++j)
scan >> ad[i][j];
for(int k = 1 ; k <= n ; k++)
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
if(ad[i][k]&&ad[k][j]&&ad[i][j])
ad[i][j] = min(ad[i][j],ad[i][k]+ad[k][j]);
for(int i = 1 ; i <= n ; i ++ ){
for(int j = 1 ; j <= n ; j ++ )
print << ad[i][j] << " ";
print << "\n";
}
return 0;
}