Pagini recente » Rating uhuhuhuhuhuhu (totata) | Cod sursa (job #2018589) | Cod sursa (job #2174448) | Cod sursa (job #1551889) | Cod sursa (job #2672271)
#include <bits/stdc++.h>
using namespace std;
int A[101][101],n,m;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int oo=(1<<20);
int mini=oo,nr;
void solutie()
{ for(int i=1;i<=n;i++)
{ for(int j=1;j<=n;j++)
out<<A[i][j]<<' ';
out<<'\n';
}
}
void fw()
{ for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(A[i][k]&&A[k][j])
A[i][j]=min(A[i][j],A[i][k]+A[k][j]);
}
int main()
{ in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>A[i][j];
fw();
solutie();
return 0;
}