Pagini recente » Cod sursa (job #3202068) | Cod sursa (job #1319744) | Cod sursa (job #1060897) | Istoria paginii summer-challenge-2009/clasament/runda-2 | Cod sursa (job #679898)
Cod sursa(job #679898)
#include <fstream>
#define sizen 110
int a[sizen][sizen], n;
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f >> n;
for(int i = 0; i < n; i ++)
for(int j = 0; j < n; j ++)
f >> a[i][j];
for(int k = 0; k < n; k ++)
for(int i = 0; i < n; i ++)
for(int j = 0; j < n; j ++)
if(a[i][k] != 0 && a[k][j] != 0)
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
for(int i = 0; i < n; i ++)
{
for(int j = 0; j < n; j ++)
g << a[i][j] << ' ';
g << '\n';
}
}