Pagini recente » Cod sursa (job #1433069) | Cod sursa (job #1481742) | Cod sursa (job #1303615) | Cod sursa (job #979245) | Cod sursa (job #2102385)
#include<bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N=101;
const int oo=100001;
int n,c[N][N];
void citire(){
in>>n;
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{in>>c[i][j];if(c[i][j]==0)if(i!=j)c[i][j]=oo;}
in.close();
}
void royfloyd(){
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)if(c[i][k]&&c[k][j])
if(c[i][j]>c[i][k]+c[k][j]){c[i][j]=c[i][k]+c[k][j];}
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
out<<c[i][j]<<" ";
out<<"\n";}
out.close();
}
int main(){
citire();
royfloyd();
return 0;}