Pagini recente » Cod sursa (job #1003343) | Cod sursa (job #2870852) | Cod sursa (job #1261231) | Cod sursa (job #852212) | Cod sursa (job #2425008)
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[103][103];
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++)
{
a[i][j] = min(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";
}
fin.close();
fout.close();
return 0;
}