Cod sursa(job #3162446)
| Utilizator | Data | 29 octombrie 2023 11:45:45 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
#define NN 105
using namespace std;
int n, m, a, b;
int v[NN][NN];
int main()
{
cin >> n >> m;
for(int i = 1 ; i <= m ; i++)
{
cin >> a >> b;
v[a][b] = 1;
}
for(int k = 1 ; k <= n ; k++)
{
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= n ; j++)
{
if(v[i][j] == 0)
v[i][j] = v[i][k] * v[k][j];
}
}
}
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= n ; j++)
cout << v[i][j] << " ";
cout << '\n';
}
return 0;
}
