Pagini recente » Cod sursa (job #1004856) | Cod sursa (job #1766849) | Autentificare | Istoria paginii runda/dornescu2 | Cod sursa (job #2912165)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define INF 1000000000
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");
int N;
int M[101][101];
int MD[101][101];
int main()
{
fi>>N;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
{
fi>>M[i][j];
MD[i][j]=M[i][j];
}
for(int k=1;k<=N;k++)
{
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
{
if(MD[i][j]>MD[i][k]+MD[k][j])
MD[i][j]=MD[i][k]+MD[k][j];
}
}
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
fo<<MD[i][j]<<" ";
fo<<"\n";
}
return 0;
}