Pagini recente » Cod sursa (job #304552) | Cod sursa (job #444380) | Istoria paginii template/jc2018 | Cod sursa (job #1551098) | Cod sursa (job #1211397)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int m[110][110],n;
void read()
{
in>>n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
in>>m[i][j];
}
}
}
void solve()
{
for(int d = 1; d <= n; d++)
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(i != j && m[i][d] != 0 && m[d][j] != 0)
{
if(m[i][d] + m[d][j] < m[i][j])
{
m[i][j] = m[i][d] + m[d][j];
}
}
}
}
}
}
void write()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
out<<m[i][j]<<" ";
}
out<<"\n";
}
}
int main()
{
read();
solve();
write();
}