Pagini recente » oni_mixt1 | Cod sursa (job #3223849) | Diferente pentru implica-te/arhiva-educationala intre reviziile 223 si 215 | Cod sursa (job #3281849) | Cod sursa (job #3286844)
#include <fstream>
#include <queue>
#include <vector>
#include <cstring>
#include <algorithm>
#include <numeric>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n, x, a[200][200];
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
cin>>x;
a[i][j]=x;
}
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(i!=j && 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++,cout<<'\n')
for(int j=1; j<=n; j++)
cout<<a[i][j]<<' ';
return 0;
}