Pagini recente » Cod sursa (job #2631922) | Cod sursa (job #2128252) | Cod sursa (job #787337) | Cod sursa (job #2807103) | Cod sursa (job #2373547)
#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f1("sortaret.in");
ofstream f2("sortaret.out");
int n,m;
vector<int> legaturi[50005];
bitset<50005> viz;
void dfs(int start){
f2<<start<<" ";
viz[start] = true;
for(auto nod : legaturi[start]){
if(viz[nod] == false)
dfs(nod);
}
}
int main() {
f1>>n>>m;
int x,y;
for(int i=0;i<m;i++){
f1>>x>>y;
legaturi[x].push_back(y);
}
for(int i=1;i<=n;i++){
if(viz[i]==false)
dfs(i);
}
return 0;
}