Mai intai trebuie sa te autentifici.
Cod sursa(job #1347706)
| Utilizator | Data | 19 februarie 2015 09:35:15 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
vector <vector <int> > L;
int main()
{
int n,i,j,k;
fin>>n;
L.resize(n+1);
for(i=0;i<=n;i++)
L[i].resize(n+1);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>L[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(L[i][j]>L[i][k]+L[k][j])
L[i][j]=L[i][k] + L[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<L[i][j]<<" ";
fout<<"\n";
}
}
