Cod sursa(job #1191510)
Utilizator | Alex Alex patratzel | Data | 27 mai 2014 21:45:40 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.83 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int c[101][101],n;
void citeste()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>c[i][j];
}
void afiseaza()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fout<<c[i][j]<<" ";
fout<<"\n";
}
}
void RoyFloyd()
{
for(int q=1;q<=n;q++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(c[i][q]+c[q][j]<=c[i][j])
{
c[i][j]=c[i][q]+c[q][j];
}
}
int main()
{
fin>>n;
citeste();
RoyFloyd();
afiseaza();
return 0;
}