Pagini recente » Cod sursa (job #1682898) | Cod sursa (job #2636618) | Cod sursa (job #1751650) | Cod sursa (job #671185) | Cod sursa (job #1984469)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101], N;
int main()
{
f>>N;
int i, j, k;
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
f>>a[i][j];
for(k = 1; k <= N; k++)
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
if(a[i][k] && a[k][j] && i!=j)
if(a[i][k] + a[k][j] < a[i][j])
a[i][j] = a[i][k] + a[k][j];
for(i = 1; i <= N; i++)
{
for(j = 1; j <= N; j++)
g<<a[i][j]<<" ";
g<<'\n';
}
return 0;
}