Pagini recente » Cod sursa (job #1063696) | Cod sursa (job #1415278) | Cod sursa (job #2315116) | Cod sursa (job #2717400) | Cod sursa (job #1703862)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream be("royfloid.in");
ofstream ki("royfloid.out");
int a[101][101];
int n;
be >> n;
for(int i = 1;i<=n;i++) {
for(int j = 1;j<=n;j++) {
be >> a[i][j];
}
}
for(int k = 1;k<=n;k++) {
for(int i = 1;i<=n;i++) {
for(int j = 1;j<=n;j++) {
if(a[i][j]==0) {
if(i !=j) {
a[i][j] = a[i][k] + a[k][j];
}
}
else {
if(a[i][j]>a[i][k] + a[k][j]) {
a[i][j] = a[i][k] + a[k][j] ;
}
}
}
}
}
for(int i = 1;i<=n;i++) {
for(int j = 1;j<=n;j++) {
ki << a[i][j] ;
}
ki << endl;
}
return 0;
}