Cod sursa(job #1627303)
| Utilizator | Data | 3 martie 2016 16:22:13 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[101][101];
int main()
{
int i,j,k,m,p;
f>>n;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
f>>a[i][j];
for(k=0;k<n;k++)
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(a[i][j]>a[i][k]+a[k][j])
{
a[i][j]=a[i][k]+a[k][j];
// pred[i][j]=pred[i][k];
}
for(i=0;i<n;i++){
for(j=0;j<n;j++)
g<<a[i][j]<<" ";
g<<endl;
}
g<<endl;
}
