Pagini recente » Cod sursa (job #679121) | Cod sursa (job #2041055) | Cod sursa (job #3238866) | Cod sursa (job #421308) | Cod sursa (job #546168)
Cod sursa(job #546168)
#include<fstream>
using namespace std;
void read();
void solve();
int a[105][105], n;
int main()
{
read();
solve();
return 0;
}
void read()
{
ifstream fin("royfloyd.in");
fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
fin >> a[i][j];
fin.close();
}
void solve()
{
ofstream fout("royfloyd.out");
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if( i != j && a[i][j] > a[i][k] + a[k][j] && a[i][k] && a[k][j] )
a[i][j] = a[i][k] + a[k][j];
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
fout << a[i][j] << " ";
fout <<"\n";
}
fout.close();
}