Pagini recente » Cod sursa (job #406778) | Statistici Caraian Ioana (caraianioana) | Cod sursa (job #463275) | Cod sursa (job #1404565) | Cod sursa (job #651966)
Cod sursa(job #651966)
#include <cstdio>
using namespace std;
int a[260][260];
int n;
const int infinite = (1<<30)- 5;
void citire()
{
freopen("royfloyd.in","r",stdin);
scanf("%d\n",&n);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j){
scanf("%d",&a[i][j]);
if(i!=j && a[i][j] == 0)
a[i][j] = infinite;
}
}
void afisare()
{
freopen("royfloyd.out","w",stdout);
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j)
printf("%d ",a[i][j]);
printf("\n");
}
}
void roy_floyd()
{
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();
roy_floyd();
afisare();
return 0;
}