Pagini recente » Cod sursa (job #2027203) | Cod sursa (job #470224) | Cod sursa (job #2559166) | Cod sursa (job #3216952) | Cod sursa (job #2975859)
#include<bits/stdc++.h>
using namespace std;
const int N = 105;
ifstream in ("royfloyd.in");
ofstream out("royfloyd.out");
// auto& in = cin;
// auto& out = cout;
int n, m[N][N];
void read()
{
in>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
in>>m[i][j];
}
void royfloyd()
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
for(int k=0;k<n;k++)
if(m[i][k] && m[k][j])
m[i][j] = min(m[i][j], m[i][k] + m[k][j]);
}
void show()
{
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
out<<m[i][j]<<' ';
out<<endl;
}
}
int main(){
read();
royfloyd();
show();
return 0;
}