Pagini recente » Cod sursa (job #1552586) | Istoria paginii runda/simulareinfo_oji_7_9/clasament | Cod sursa (job #2300653) | Cod sursa (job #2526531) | Cod sursa (job #903504)
Cod sursa(job #903504)
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int a[101][101], n;
void citire()
{
f>>n;
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
f>>a[i][j];
}
void fw()
{
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
for (int k=1; k<=n; ++k)
if (a[i][j]>a[i][k]+a[k][j] && a[i][k]!=0 && a[k][j]!=0)
a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
for (int i=1; i<=n; ++i)
{
for (int j=1; j<=n; ++j)
g<<a[i][j]<<" ";
g<<'\n';
}
}
int main()
{
citire();
fw();
afisare();
return 0;
}