Pagini recente » Cod sursa (job #2104897) | Cod sursa (job #957351) | Cod sursa (job #2633038) | Cod sursa (job #2686137) | Cod sursa (job #1993955)
#include <iostream>
#include <fstream>
using namespace std;
int n,m[105][105];
void read(){
fstream fin("royfloyd.in",ios::in);
fin >> n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin >> m[i][j];
fin.close();
}
void rf(){
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(m[i][k] && m[k][j] && (m[i][j] > m[i][k] + m[k][j] || !m[i][j]) && i != j)
m[i][j] = m[i][k] + m[k][j];
}
void write(){
fstream fout("royfloyd.out",ios::out);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
fout << m[i][j] << " ";
fout << "\n";
}
}
int main()
{
read();
rf();
write();
return 0;
}