Pagini recente » Cod sursa (job #1964927) | Cod sursa (job #2781345) | Cod sursa (job #2130929) | Cod sursa (job #921156) | Cod sursa (job #849686)
Cod sursa(job #849686)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in"); ofstream out("royfloyd.out");
int n, a[105][105];
void roy_floyd(){
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] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i!=j)
a[i][j] = a[i][k] + a[k][j];
}
int main(){
in>>n;
for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) in>>a[i][j];
roy_floyd();
for ( int i = 1; i <= n; i++) {
for ( int j = 1; j <= n; j++) out<<a[i][j]<<' ';
out<<'\n';
}
return 0;
}