Pagini recente » Cod sursa (job #2051185) | Cod sursa (job #2236603) | Cod sursa (job #2804650) | Cod sursa (job #1054397) | Cod sursa (job #2571756)
#include <iostream>
#include <cstdio>
using namespace std;
int m[102][102], n;
void roy() {
for (int i=0;i<n;i++) {
for (int l=0;l<n;l++) {
for (int k=0;k<=n;k++) {
if (m[l][k]>m[l][i]+m[i][k]) {
m[l][k]=m[l][i]+m[i][k];
}
}
}
}
}
int main()
{
int i, l;
FILE *fin, *fout;
fin=fopen("royfloyd.in" ,"r");
fout=fopen("royfloyd.out" ,"w");
fscanf(fin, "%d" ,&n);
for (i=0;i<n;i++) {
for (l=0;l<n;l++) {
fscanf(fin, "%d" ,&m[i][l]);
}
}
roy();
for (i=0;i<n;i++) {
for (l=0;l<n;l++) {
fprintf(fout, "%d " ,m[i][l]);
}
fprintf(fout, "\n");
}
cout << "Hello world!" << endl;
return 0;
}