Pagini recente » Cod sursa (job #2526694) | Cod sursa (job #2651358) | Cod sursa (job #1399298) | Cod sursa (job #2377526) | Cod sursa (job #2427356)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int d[100][100];
int main()
{
if(!in)
{
cout << "eroare";
return -1;
}
int n;
in >> n;
for(int i = 0; i < n; ++i)
for(int j = 0;j < n; ++j)
in >> d[i][j];
for(int k = 0; k < n; ++k)
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
if(d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
out << d[i][j] << ' ';
out << '\n';
}
in.close();
out.close();
}