Pagini recente » Cod sursa (job #1304889) | Monitorul de evaluare | Infoarena Monthly 2014 - Solutii Runda 6 | Cod sursa (job #2746656) | Cod sursa (job #2156502)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[102][102];
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
fin >> 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 && j != k && i != k)
{
if(a[i][k] + a[k][j] < a[i][j] || a[i][j] == 0)
{
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
fout << a[i][j] << ' ';
}
fout << '\n';
}
return 0;
}