Mai intai trebuie sa te autentifici.
Cod sursa(job #937159)
| Utilizator | Data | 9 aprilie 2013 22:40:54 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<iostream>
#include<fstream>
#define Nmax 101
using namespace std;
int A[Nmax][Nmax],n;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>A[i][j];
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][k]+A[k][j] || A[i][j]==0) && i!=j) A[i][j]=A[i][k]+A[k][j];
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
g<<A[i][j]<<" ";
g<<endl;}
f.close();
g.close();
return 0;}