Cod sursa(job #2275631)
| Utilizator | Data | 3 noiembrie 2018 12:53:12 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int ns,a[50000],n,m,nr=1,x,y;
bool k[10000][10000],v[50000];
void dfs(int ns)
{
v[ns]=1;
for(int i=1;i<=n;i++)
{
if(k[ns][i]==1&&v[i]==0)
{
dfs(i);
}
}
a[nr]=ns;nr++;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>x>>y;
k[x][y]=1;
}
for(int i=1;i<=n;i++)
{
if(v[i]==0)
dfs(i);
}
for(int i=n;i>0;i--)
{
cout<<a[i]<<" ";
}
}
