Pagini recente » Cod sursa (job #2921138) | Cod sursa (job #2494845) | Cod sursa (job #255850) | Cod sursa (job #141730) | Cod sursa (job #3121509)
#include <fstream>
using namespace std;
int n, a[101][101];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void citire(){
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> a[i][j];
}
void rf(){
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];
}
int main()
{
citire();
rf();
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++)
fout << a[i][j] << ' ';
fout << "\n";
}
fin.close();
fout.close();
return 0;
}