Pagini recente » Cod sursa (job #424396) | Cod sursa (job #2011525) | Cod sursa (job #2868170) | Cod sursa (job #251591) | Cod sursa (job #1124914)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int graf[1000][1000];
int n;
int main()
{
int i, j, k;
in>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
in>>graf[i][j][0];
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
graf[i][j]=graf[i][j];
if(graf[i][k]+graf[k][j]<graf[i][j] || !graf[i][j] && i!=j && graf[i][k] && graf[k][j]) graf[i][j]=graf[i][k]+graf[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
out<<graf[i][j]<<" ";
}
out<<"\n";
}
return 0;
}