Mai intai trebuie sa te autentifici.
Cod sursa(job #980777)
Utilizator | Data | 5 august 2013 16:25:15 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, m, c[110][110], i, j, k;
int main(){
f>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
f>>c[i][j];
f.close();
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(c[i][k]!=0 && c[k][j]!=0)
if(c[i][j]>c[i][k]+c[k][j])
c[i][j]=c[i][k]+c[k][j];
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
g<<c[i][j]<<' ';
g<<"\n";
}
g.close();
return 0;
}