Pagini recente » Cod sursa (job #14175) | Cod sursa (job #2028288) | Cod sursa (job #1910941) | Cod sursa (job #1341306) | Cod sursa (job #2685827)
#include <iostream>
#include <bits/stdc++.h>
#define MAX 101
#define INF 2000
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int N,M;
int Graph[MAX][MAX];
int main()
{
in>>N;
for(int i=1; i<=N; i++)
for(int j=1; j<=N; j++)
in>>Graph[i][j];
for(int k=1; k<=N; k++)
for(int i=1; i<=N; i++)
for(int j=1; j<=N; j++)
if(Graph[i][j]> Graph[i][k]+Graph[k][j])
{
Graph[i][j] = Graph[i][k]+Graph[k][j];
}
for(int i=1; i<=N; i++)
{
for(int j=1; j<=N; j++)
out<<Graph[i][j]<<" ";
out<<'\n';
}
return 0;
}