Mai intai trebuie sa te autentifici.
Cod sursa(job #1501540)
| Utilizator | Data | 13 octombrie 2015 16:56:27 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream intrare;
ofstream iesire;
int main()
{
intrare.open("royfloyd.in");
int n, M[100][100];
intrare>> n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++){
intrare>>M[i][j];
if(!M[i][j] && i!=j)
M[i][j]=100000;
}
for (int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(M[i][j]>M[i][k]+M[k][j])
M[i][j]=min(M[i][j], M[i][k]+M[k][j]);
intrare.close();
iesire.open("royfloyd.out");
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
iesire<<M[i][j]<<" ";
iesire<<"\n";
}
iesire.close();
return 0;
} 