Cod sursa(job #2436582)
| Utilizator | Data | 6 iulie 2019 13:33:57 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include<iostream>
#include<fstream>
using namespace std;
void roy_floyd(int n,int a[101][101])
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
int n,a[101][101],i,j;
ifstream f("royfloyd.in");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
f.close();
roy_floyd(n,a);
ofstream g("royfloyd.out");
for(i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
g<<a[i][j]<<' ';
g<<endl;
}
return 0;
}
