Pagini recente » Cod sursa (job #1514731) | Cod sursa (job #289950) | Cod sursa (job #2000076) | Cod sursa (job #279080) | Cod sursa (job #2144948)
#include <bits/stdc++.h>
using namespace std;
ifstream F("royfloyd.in");
ofstream G("royfloyd.out");
int a[105][105], n;
int main()
{
F >> n;
for(int i = 1; i <= n; ++ i){
for(int j = 1; j <= n; ++ j)
F >> 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][k] && a[k][j] && i != j && i != k && j != k && (a[i][j]>a[i][k]+a[k][j]||!a[i][j]))
a[i][j]=a[i][k]+a[k][j];
for(int i = 1; i <= n; ++ i, G << '\n'){
for(int j = 1; j <= n; ++ j)
G << a[i][j] << " ";
}
return 0;
}