Cod sursa(job #1295509)
Utilizator | Data | 19 decembrie 2014 17:57:28 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,t[101][101],k;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>t[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&t[i][k]!=0&&t[k][j]!=0&&t[i][j]>t[i][k]+t[k][j])
t[i][j]=t[i][k]+t[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<t[i][j]<<" ";
g<<"\n";
}
f.close();
g.close();
return 0;
}