Cod sursa(job #910562)
| Utilizator | Data | 10 martie 2013 21:09:57 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
int n,a[100][100],i,j,k;
int main()
{ifstream fin("royfloyd.in");
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>a[i][j];
fin.close();
for(k=1;k<=n;k++)
for(j=1;j<=n;j++)
for(i=1;i<=n;i++)
if(a[j][i]>a[j][k]+a[k][i]&&a[j][k]&&a[k][i]&&i!=j)a[j][i]=a[j][k]+a[k][i];
ofstream fout("royfloyd.out");
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
fout<<a[i][j]<<" ";fout<<"\n";}
fout.close();
return 0;}
