Pagini recente » Cod sursa (job #631007) | Cod sursa (job #1244504) | Cod sursa (job #2868672) | Cod sursa (job #956950) | Cod sursa (job #1096776)
#include<fstream>
#include<iostream>
using namespace std;
#define MAX 102
#define INF 2000000
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int m[MAX][MAX];
int n;
int citire()
{
f>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
f>>m[i][j];
if(i==j)
{
m[i][j] = 0;
}
}
}
return 0;
}
int afisare()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(m[i][j]!=INF)
g<<m[i][j]<<" ";
else g<<0<<" ";
}
g<<endl;
}
return 0;
}
int rf()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
for(int k=1;k<=n;k++)
{
if(m[i][j]>m[i][k]+m[k][j])
m[i][j] = m[i][k] + m[k][j];
}
}
}
return 0;
}
int main()
{
citire();
rf();
afisare();
return 0;
}