Pagini recente » Cod sursa (job #2430979) | Cod sursa (job #1296506) | Soluții Summer Challenge 2009, Runda 2 | Cod sursa (job #1572625) | Cod sursa (job #1045748)
#include<fstream>
#include<iostream>
#define pinf 10000
using namespace std;
int a[102][102],n,m,i,j;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
void citire(int &n)
{int i,j;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>a[i][j];
if(i!=j&&a[i][j]==0) a[i][j]=pinf;
}}
void afisare(int &n)
{for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
if(a[i][j]==pinf) g<<0<<" ";
else g<<a[i][j]<<" ";
g<<'\n';
}}
void RoyFloyd(int &n) // 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(n);
RoyFloyd(n);
afisare(n);
}