Cod sursa(job #2074435)
Utilizator | Data | 24 noiembrie 2017 16:48:51 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
int n,m,i,j,k,x,y;
int a[101][101];
int main()
{
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>x>>y;
a[x][y]=1;
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(a[i][k]&&a[k][j])
a[i][j]=1;
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<'\n';
}
return 0;
}