Pagini recente » Cod sursa (job #863090) | Cod sursa (job #1106774) | Cod sursa (job #1544310) | Cod sursa (job #1258951) | Cod sursa (job #352543)
Cod sursa(job #352543)
#include <fstream>
#include <limits>
using namespace std;
int main(){
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int m[100][100];
int n;in>>n;
for(int j=0;j<n;j++){
for(int i=0;i<n;i++){
in>>m[i][j];
if(!m[i][j]){
m[i][j]=numeric_limits<int>::max()/2;
}
}
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(m[i][j]>m[i][k]+m[k][j]){
m[i][j]=m[i][k]+m[k][j];
}
}
}
}
for(int j=0;j<n;j++){
for(int i=0;i<n;i++){
if(m[i][j]==numeric_limits<int>::max()/2||i==j){
out<<"0 ";
}else{
out<<m[i][j]<<" ";
}
}
out<<"\n";
}
}