Cod sursa(job #3325359)
| Utilizator | Data | 25 noiembrie 2025 12:59:27 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int inf = 9999999;
int x,cost,y,n,m,d[101][101];
int main() {
f>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
{
f>>d[i][j];
}
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
for(int i=1;i<=n;++i)
{for(int j=1;j<=n;++j)
g<<d[i][j]<<" ";
g<<'\n';
}
return 0;
}
