Pagini recente » Cod sursa (job #1544800) | Istoria paginii runda/day_4/clasament | Cod sursa (job #2287966) | Istoria paginii runda/kod_tesztel3 | Cod sursa (job #1005094)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<int> a[100005];
int n,m,x,y,use[100005],k=0,o[100005];
void read()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
f>>x>>y;
a[x].push_back(y);
}
}
void DFS(int nod)
{
use[nod]=1;
for(unsigned int i=0;i<a[nod].size();i++)
if(!use[a[nod][i]])
DFS(a[nod][i]);
o[++k]=nod;
}
void write()
{
for(int i=k;i>0;i--)
g<<o[i]<<" ";
}
int main()
{
read();
for(int i=1;i<=n;i++)
if(!use[i])
DFS(i);
write();
return 0;
}