Cod sursa(job #3348670)
| Utilizator | Data | 23 martie 2026 13:16:55 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k;
int minim[101][101];
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>minim[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
minim[i][j]=min(minim[i][j],minim[i][k]+minim[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<minim[i][j]<<" ";
g<<"\n";
}
f.close();
g.close();
return 0;
}
