Pagini recente » Cod sursa (job #2520283) | Cod sursa (job #1151110) | Cod sursa (job #3194609) | Cod sursa (job #685758) | Cod sursa (job #3210500)
#include <fstream>
#include <vector>
using namespace std;
const int NMAX=50000;
int n,m;
vector<int>G[NMAX+1],L;
bool viz[NMAX+1];
ifstream f("sortaret.in");
ofstream g("sortaret.out");
void citire()
{
int x,y;
f>>n>>m;
while(m--)
{
f>>x>>y;
G[x].push_back(y);
}
}
void DFS(int x)
{
viz[x]=1;
for(const auto &y:G[x])
if(viz[y]==0)
DFS(y);
L.push_back(x);
}
int main()
{
citire();
for(int i=1;i<=n;i++)
if(viz[i]==0)
DFS(i);
for(int i=L.size()-1;i>=0;i--)
g<<L[i]<<' ';
f.close();
g.close();
return 0;
}