Pagini recente » Cod sursa (job #1288197) | Cod sursa (job #1497851) | Cod sursa (job #2263166) | Cod sursa (job #910166) | Cod sursa (job #2566474)
#include <iostream>
#include <fstream>
using namespace std;
int a[100][100], n;
int main() {
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> a[i][j];
fin.close();
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fout << a[i][j];
fout.close();
return 0;
}