Pagini recente » Cod sursa (job #2645020) | Cod sursa (job #1894162) | Cod sursa (job #910842) | Cod sursa (job #1043617) | Cod sursa (job #1364347)
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
#define nmax 125
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,nr;
vector<vector<int> > v;
void citire()
{
f>>n;
v.resize(n+1, vector<int> (n+1) );
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
f>>v[i][j];
}
void afisare()
{
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
g<<v[i][j]<<' ';
}
g<<'\n';
}
}
void solve()
{
citire();
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
{
if(i!=j)
{
if(v[i][j]==0||v[i][j]>v[i][k]+v[k][j])
v[i][j]=v[i][k]+v[k][j];
}
nr++;;
}
afisare();
}
int main()
{
solve();
}