Cod sursa(job #2209467)
Utilizator | Data | 3 iunie 2018 15:51:58 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101];
int n;
int i,j,k;
int main()
{
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]==0||a[i][j]>a[i][k]+a[k][j])&&i!=j&&a[i][k]!=0&&a[k][j]!=0)
{
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";
}
return 0;
}