Pagini recente » Cod sursa (job #226668) | Cod sursa (job #2771771) | Cod sursa (job #1620864) | Cod sursa (job #420595) | Cod sursa (job #3306067)
#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int NMAX = 50000;
vector<int> g[NMAX + 5];
int grad[NMAX + 5];
bitset<50005> viz;
int n, m;
void sortare_t()
{
int cnt = 0;
while(cnt < n)
{
for(int i = 1; i <= n; ++i)
{
if(grad[i] == 0 && viz[i] == 0)
{
out << i << ' ';
for(auto it : g[i])
{
--grad[it];
}
++cnt;
viz[i] = 1;
}
}
}
}
int main()
{
in >> n >> m;
for(int i = 1; i <= m; ++i)
{
int u, v;
in >> u >> v;
g[u].push_back(v);
++grad[v];
}
sortare_t();
}