Pagini recente » Cod sursa (job #502322) | Cod sursa (job #2814647) | Cod sursa (job #3245719) | Cod sursa (job #2532597) | Cod sursa (job #2871261)
#include <fstream>
#include <vector>
using namespace std;
int a[105][105];
int d[105][105];
int n;
void read() {
ifstream fin("royfloyd.in");
fin >> n;
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
fin >> a[i][j];
fin.close();
}
void init() {
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
d[i][j] = a[i][j];
}
void royFloyd() {
for(int k = 0; k < n; ++k)
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
if(d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
}
void write() {
ofstream fout("royfloyd.out");
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j)
fout << d[i][j] << " ";
fout << endl;
}
fout.close();
}
int main() {
read();
init();
royFloyd();
write();
return 0;
}