Pagini recente » Cod sursa (job #2637757) | Cod sursa (job #452406) | Cod sursa (job #2150455) | Cod sursa (job #572121) | Cod sursa (job #1463565)
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, A[101][101];;
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>A[i][j];
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; 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=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
cout<<A[i][j]<<" ";
cout<<'\n';
}
return 0;
}