Pagini recente » Cod sursa (job #1778475) | Cod sursa (job #1155168) | Cod sursa (job #2471934) | Cod sursa (job #722729) | Cod sursa (job #2223637)
#include<fstream>
#include<iostream>
#define N 100
#define FOR(i,a,b) for(i=a;i<=b;i++)
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,dist[N][N],i,j,k;
int main()
{
f>>n;
FOR(i,1,n)
FOR(j,1,n)
f>>dist[i][j];
FOR(k,1,n)
FOR(i,1,n)
FOR(j,1,n)
if(dist[i][j] > dist[i][k] + dist[k][j])
dist[i][j] = dist[i][k] + dist[k][j];
FOR(i,1,n)
{
FOR(j,1,n)
g<<dist[i][j]<<" ";
g<<endl;
}
return 0;
}