Cod sursa(job #748875)
Utilizator | Adrian Buzea krityx | Data | 15 mai 2012 02:12:56 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int N,A[102][102],i,j,k;
f>>N;
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
f>>A[i][j];
for(k=1;k<=N;k++)
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
if(A[i][j] > A[i][k]+A[k][j]) A[i][j]=A[i][k]+A[k][j];
for(i=1;i<=N;i++)
{
for(j=1;j<=N;j++)
g<<A[i][j]<<" ";
g<<"\n";
}
f.close();
g.close();
return 0;
}