Pagini recente » Istoria paginii runda/oji-2015-cls11-12/clasament | Cod sursa (job #1634916) | Cod sursa (job #424811) | Cod sursa (job #901892) | Cod sursa (job #1983988)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n;
int dmin[105][105];
int main() {
fin >> n;
for(int i = 1; i<=n; ++i)
for(int j = 1; j<=n; ++j)
fin >> dmin[i][j];
for(int k = 1; k<=n; ++k)
for(int i = 1; i<=n; ++i)
for(int j = 1; j<=n; ++j)
if(i!=j && dmin[i][k] && dmin[k][j] && (!dmin[i][j] || dmin[i][j]>dmin[i][k]+dmin[k][j]))
dmin[i][j]=dmin[i][k]+dmin[k][j];
for(int i = 1; i<=n; ++i){
for(int j = 1 ; j<=n; ++j)
fout << dmin[i][j]<<" ";
fout << "\n";
}
return 0;
}