Cod sursa(job #3130329)
| Utilizator | Data | 17 mai 2023 16:02:51 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int INF= 1e9;
int n, a[101][101];
void roy_floyd()
{
}
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
in >> a[i][j];
if(a[i][j] == 0 && i != j)
{
a[i][j] = INF;
}
}
}
roy_floyd();
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(a[i][j] == INF)
{
a[i][j] = 0;
}
out << a[i][j] << " ";
}
out << '\n';
}
return 0;
}
