Pagini recente » Cod sursa (job #1317221) | Cod sursa (job #2591359) | Cod sursa (job #2576253) | Cod sursa (job #2879161) | Cod sursa (job #3239626)
#include <fstream>
#include <vector>
#include <queue>
const int NMAX=100005;
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
queue <int> c;
vector <int> v[NMAX];
int grad[NMAX];
int n, m;
int main()
{
int i, a, b, p;
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>n>>m;
for(i=1; i<=m; i++)
{
cin>>a>>b;
v[a].push_back(b);
grad[b]++;
}
for(i=1; i<=n; i++)
{
if(grad[i]==0)
c.push(i);
}
while(!c.empty())
{
p=c.front(); c.pop();
cout<<p<<' ';
for(auto i:v[p])
{
grad[i]--;
if(grad[i]==0)
c.push(i);
}
}
return 0;
}