Pagini recente » Cod sursa (job #200587) | Cod sursa (job #2969629) | Cod sursa (job #1073062) | Istoria paginii runda/oji2017 | Cod sursa (job #398813)
Cod sursa(job #398813)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int v[100][100],n;
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>v[i][j];
}
int min(int i,int j)
{
if(i<j)return i;
else return j;
}
void parcurgere()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j&&v[i][k]&&v[k][j])
v[i][j]=min(v[i][j],v[i][k]+v[k][j]);
}
void afisare()
{
for(int i=1;i<=n;i++)
{
g<<"\n";
for(int j=1;j<=n;j++)
g<<v[i][j]<<" ";
}
}
int main()
{
citire();
parcurgere();
afisare();
}