Pagini recente » Cod sursa (job #1924715) | Cod sursa (job #2036561) | Cod sursa (job #2374252) | Cod sursa (job #2053717) | Cod sursa (job #1443880)
#include<iostream>
#include<fstream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<bitset>
#include<cstring>
#include<queue>
#define ull unsigned long long
#define ll long long
#define FOR(a,b,c) for (int a=b;a<=c; ++a)
#define ROF(a,b,c) for (int a=b;a>=c; --a)
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
short N,M,a[101][101];
int main()
{
f>>N;
FOR (i,1,N)
FOR (j,1,N)
f>>a[i][j];
FOR (k,1,N)
FOR (i,1,N)
FOR (j,1,N)
if (i!=j && a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || a[i][j]==0)) a[i][j]=a[i][k]+a[k][j];
FOR (i,1,N){
FOR (j,1,N)
g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}