Pagini recente » Cod sursa (job #47080) | Cod sursa (job #1630694) | Cod sursa (job #767206) | Cod sursa (job #2331039) | Cod sursa (job #3030250)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INF = 1e9+7;
int n,m;
int graf[101][101];
int d[101][101]={};
int main()
{
fin>>n;
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
fin>>graf[i][j];
if(i==j)
{
d[i][j] = 0;
}else d[i][j] = graf[i][j];
}
}
for (int k=1;k<=n;k++)
{
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
if(d[i][j]>d[i][k]+d[k][j])
{
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
cout << d[i][j] << ' ';
}cout << endl;
}
return 0;
}