Pagini recente » Cod sursa (job #2501168) | Borderou de evaluare (job #2354517) | Borderou de evaluare (job #3256976) | Borderou de evaluare (job #771000) | Cod sursa (job #2502710)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,c[101][100];
void Citire()
{
f>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
f>>c[i][j];
}
void Warshall()
{
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if(c[i][k] && c[k][j])
if(c[i][j] == 0 || c[i][j] > c[i][k] + c[k][j])
c[i][j] = min(c[i][k] + c[k][j],c[i][j]);
}
int main()
{
Citire();
Warshall();
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
if(i != j) g<<c[i][j]<<" ";
else g<<0<<" ";
g<<'\n';
}
return 0;
}