Pagini recente » Cod sursa (job #883173) | Cod sursa (job #2846362) | Cod sursa (job #2967108) | Cod sursa (job #1735885) | Cod sursa (job #2953182)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, m, a[101][101], x, y, cost;
const int INF = 0x3f3f3f3f;
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
fin >> a[i][j];
}
}
for(int i = 1; i <= m; i++)
{
fin >> x >> y >> cost;
a[x][y] = cost;
}
for(int k = 1; k <= n; k++)
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(a[i][j] > a[i][k] + a[k][j] && i != j)
{
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;
}