Pagini recente » Cod sursa (job #953181) | Cod sursa (job #295294) | Cod sursa (job #1286712) | Cod sursa (job #2177442) | Cod sursa (job #2207620)
#include <bits/stdc++.h>
using namespace std;
int n, a[102][102];
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
in>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
in>>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(!(i == j || i == k || j == k || !a[i][k] || !a[k][j]))
if(!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++)
{
for(int j=1; j<=n; j++)
out<<a[i][j]<<' ';
out<<'\n';
}
return 0;
}