Pagini recente » Cod sursa (job #1258712) | Cod sursa (job #1202217) | Cod sursa (job #1258732) | Cod sursa (job #1258395) | Cod sursa (job #1211233)
#include<fstream>
#include<vector>
#include<bitset>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<int>heap[50002];
int n,m,q[50002];
bitset<50002>ok;
void read(){
int x,y;
f>>n>>m;
for(int i=1;i<=m;i++){
f>>x>>y;
heap[x].push_back(y);
}
}
void solve(int x){
int y;
if(ok[x]==0){
ok[x]=1;
for(int i=0;i<heap[x].size();i++){
y=heap[x][i];
solve(y);
}
q[++q[0]]=x;
}
}
void write(){
for(int i=q[0];i>=1;i--) g<<q[i]<<" ";
}
int main(){
read();
for(int i=1;i<=n;i++)
if(ok[i]==0)
solve(i);
write();
return 0;
}