Pagini recente » Cod sursa (job #2161362) | Cod sursa (job #1068504) | Cod sursa (job #1589999) | Cod sursa (job #834326) | Cod sursa (job #611113)
Cod sursa(job #611113)
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
long long n,x[101][101];
void royfloyd() {
int i,j,k;
for(k=1;k<=n;++k)
for(i=1;i<=n;++i) if(i!=k)
for(j=1;j<=n;++j) if(j!=i && j!=k)
if(x[i][j]>=x[i][k]+x[k][j])
x[i][j]=x[i][k]+x[k][j];
}
int main() {
int i,j;
in >> n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j) {
in >> x[i][j];
if(i!=j && !x[i][j])
x[i][j]=(1<<29);
}
royfloyd();
for(i=1;i<=n;++i) {
for(j=1;j<=n;++j) {
if(x[i][j]==(1<<29))
x[i][j]=0;
out << x[i][j] << " ";
}
out << "\n";
}
return 0;
}