Cod sursa(job #1147467)
Utilizator | Meriniuc Razvan- Dumitru meriniucr | Data | 19 martie 2014 21:05:46 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
int n,v[101][101];
void roy_floyd()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k] and a[k][j] and (a[i][j] > a[i][k] + a[k][j] or !a[i][j]) and i!=j) a[i][j]=a[i][k]+a[k][j];
}
int main()
{
ifstream mama("royfloyd.in");
ofstream tata("royfloyd.out");
mama>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
mama>>v[i][j];
roy_floyd();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
tata<<v[i][j]<<" ";
tata<<'\n';
}
return 0;
}