Pagini recente » Cod sursa (job #2706977) | Cod sursa (job #614472) | Istoria paginii runda/oji20091112 | Cod sursa (job #1623088) | Cod sursa (job #1705878)
#include <fstream>
using namespace std;
int main(){
int N,i,j,k;
int mat[100][100];
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];
}
for(k = 1; k <= N; k++)
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
{
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++)
out<<mat[i][j]<<" ";
out<<endl;
}
in.close();
out.close();
return 0;
}