Cod sursa(job #1627310)
Utilizator | Minzat Robert RobertM | Data | 3 martie 2016 16:24:56 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[102][102];
void floyd(){
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if((a[i][k]+a[k][j]<a[i][j] || !a[i][j]) && a[i][k] && a[k][j] && i!=j)
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
int i,j;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
floyd();
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';}
return 0;
}