Pagini recente » Cod sursa (job #837951) | Cod sursa (job #1104094) | Borderou de evaluare (job #1554456) | Borderou de evaluare (job #1989694) | Cod sursa (job #3143203)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, a[105][105];
int main()
{
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(a[i][k] && a[k][j] && i != j && (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++, out << '\n')
for(int j=1; j<=n; j++)
out << a[i][j] << ' ';
return 0;
}