Pagini recente » Cod sursa (job #2205275) | Cod sursa (job #2090103) | Cod sursa (job #629644) | Cod sursa (job #120401) | Cod sursa (job #599016)
Cod sursa(job #599016)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int dist[100][100];
int main()
{
int nr, i, j, k;
fin >> nr;
for(i = 0; i < nr; i++)
for(j = 0; j < nr; j++)
fin >> dist[i][j];
for(k = 0; k < nr; k++)
for(i = 0; i < nr; i++)
for(j = 0; j < nr; j++)
if(dist[i][k] != 0 && dist[k][j] != 0 && i != j)
if(dist[i][k] + dist[k][j] < dist[i][j] || dist[i][j] == 0)
dist[i][j] = dist[i][k] + dist[k][j];
for(i = 0; i < nr; i++)
{
for(j = 0; j < nr; j++)
fout << dist[i][j] << ' ';
fout << '\n';
}
fin.close();
fout.close();
return 0;
}