Pagini recente » Cod sursa (job #1137081) | Cod sursa (job #101604) | Cod sursa (job #1891399) | Cod sursa (job #273210) | Cod sursa (job #2408220)
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
const string file = "royfloyd";
const ll INF = 9223372036854775807ll;
const int inf = 2147483647;
int n, v[105][105];
int main()
{
ifstream fin (file+".in");
ofstream fout (file+".out");
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
fin >> v[i][j];
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if(i != k && k != j && i != j && v[i][k] && v[k][j] && (v[i][j] > v[i][k]+v[k][j] || !v[i][j]))
v[i][j] = v[i][k]+v[k][j];
for (int i = 1; i <= n; ++i, fout << "\n")
for (int j = 1; j <= n; ++j)
fout << v[i][j] << " ";
return 0;
}