Pagini recente » Cod sursa (job #1486190) | Cod sursa (job #730152) | Cod sursa (job #815211) | Cod sursa (job #1908384) | Cod sursa (job #2355519)
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[100][100];
int n;
int main() {
fin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
fin>>a[i][j];
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}