Pagini recente » Cod sursa (job #2114243) | Cod sursa (job #2631861) | Cod sursa (job #1375534) | Cod sursa (job #1910177) | Cod sursa (job #2531807)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int>l[500001];
bitset<500001>bifa;
int n, m, i, j, suma[500001], pas;
void topSort()
{
while(pas)
{
for(int i = 1; i <= n; i++)
{
if(!suma[i] && !bifa[i])
{
fout << i << ' ';
pas--;
bifa[i] = 1;
for(const int it : l[i])
suma[it]--;
break;
}
}
}
}
int main()
{
fin >> n >> m;
pas = n;
for(int i = 1; i <= m; i++)
{
int x, y;
fin >> x >> y;
l[x].push_back(y);
suma[y]++;
}
topSort();
return 0;
}