Pagini recente » Borderou de evaluare (job #2078220) | Cod sursa (job #1153773) | Cod sursa (job #3144435) | Cod sursa (job #2379178) | Cod sursa (job #2053889)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
short m[101][101];
int main()
{
int n;
fin >> n;
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
{
fin >> m[i][j];
}
}
for(int k = 0; k < n; ++k)
{
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
{
if(m[i][j] && m[i][k] && m[k][j])
{
if(m[i][j] > m[i][k] + m[k][j])
m[i][j] = m[i][k] + m[k][j];
}
}
}
}
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
fout << m[i][j] << " ";
fout << "\n";
}
return 0;
}