Pagini recente » Cod sursa (job #2057878) | Cod sursa (job #1425347) | Cod sursa (job #3258028) | Cod sursa (job #1220508) | Cod sursa (job #730115)
Cod sursa(job #730115)
#include <fstream>
using namespace std;
const int MAX = 105;
int c[MAX][MAX], n;
void citire()
{
ifstream in("royfloyd.in");
in>>n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
in>>c[i][j];
in.close();
}
void solve()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(i != j && c[i][k] && c[k][j] && (c[i][k] + c[k][j] < c[i][j] || !c[i][j]))
c[i][j] = c[i][k] + c[k][j];
}
void afisare()
{
ofstream out("royfloyd.out");
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
out<<c[i][j]<<" ";
out<<'\n';
}
out.close();
}
int main()
{
citire();
solve();
afisare();
return 0;
}