Pagini recente » Istoria paginii runda/oni-2012-ziua2-11-12/clasament | Cod sursa (job #1899527) | Cod sursa (job #2906775) | Cod sursa (job #2806232) | Cod sursa (job #2395433)
#include <fstream>
using namespace std;
const int INF = 1 << 20;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int main()
{
int n, a[101][101];
in>>n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
{
in>>a[i][j];
if (i != j && a[i][j] == 0)
{
a[i][j] = INF;
}
}
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];
}
}
}
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
if (a[i][j] == INF)
{
a[i][j] = 0;
}
out<<a[i][j]<<" ";
}
out<<"\n";
}
return 0;
}