Pagini recente » Cod sursa (job #1345693) | Cod sursa (job #1852922) | Cod sursa (job #1081549) | Cod sursa (job #982920) | Cod sursa (job #3214716)
#include <bits/stdc++.h>
#include <unordered_map>
#define nmax 105
#define MOD 1999999973
#define INF 2012345678
#define ll long long
using namespace std;
//#define fin cin
//#define fout cout
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[nmax][nmax];
bool Cond(int i, int j, int k)
{
return (a[i][k] && a[k][j] &&
a[i][j] > a[i][k] + a[k][j] &&
i != j && i != k && k != j);
}
int main()
{
int i, j, k;
fin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
fin >> a[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (Cond(i, j, k))
a[i][j] = a[i][k] + a[k][j];
for (i = 1; i <= n; i++, fout << "\n")
for (j = 1; j <= n; j++)
fout << a[i][j] << " ";
fin.close();
fout.close();
return 0;
}