Pagini recente » Cod sursa (job #1842524) | Cod sursa (job #685177) | Cod sursa (job #1042810) | Sandbox (cutiuţa cu năsip) | Cod sursa (job #1705886)
#include <fstream>
using namespace std;
#define inf 9000
int main(){
int N,i,j,k;
int mat[101][101];
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
//Citeste mat
in >> N;
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
{
in >> mat[i][j];
if(mat[i][j] == 0) mat[i][j] = inf;
}
for(k = 1; k <= N; k++)
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
{
if(i != j && i != k && j != k)
if(mat[i][j] > mat[i][k] + mat[k][j])
{
mat[i][j] = mat[i][k] + mat[k][j];
}
}
for(i = 1; i <= N; i++)
{
for(j = 1; j <= N; j++)
{
if(mat[i][j] != inf)
out<<mat[i][j]<<" ";
else
out<<0<<" ";
}
out<<endl;
}
in.close();
out.close();
return 0;
}