Pagini recente » Cod sursa (job #1714396) | Istoria paginii runda/temahashuri_9_17_10 | Cod sursa (job #2058076) | Cod sursa (job #2006169) | Cod sursa (job #2427464)
#if 1
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int m[10005][10005];
int n;
void roy()
{
int k, i, j;
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (m[i][k] && m[k][j] && (m[i][j] > m[i][k] + m[k][j] || !m[i][j]) && i != j)
m[i][j] = m[i][k] + m[k][j];
}
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
f >> m[i][j];
roy();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
g << m[i][j] << ' ';
g << '\n';
}
return 0;
}
#endif