Pagini recente » Cod sursa (job #1048058) | Cod sursa (job #885752) | Cod sursa (job #1564413) | Cod sursa (job #2307933) | Cod sursa (job #1378540)
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <deque>
#include <vector>
using namespace std;
int viz[50001];
vector <int> solutie;
int n,m,x,y;
deque <int>lista[50001];
void sortaret(int nod){
int i;
viz[nod] = 1;
for(i = 0; i <= lista[nod].size(); i++ )
if(viz[lista[nod][i]] != 0 )
sortaret(lista[nod][i]);
solutie.push_back(nod);
}
int main(int argc, char *argv[])
{
ifstream f("sortaret.in");
ifstream g("sortaret.out");
f>>n>>m;
while(m){
m--;
f>>x>>y ;
lista[x].push_back(y);
}
sortaret(1);
for(int i = 0; i < solutie.size(); i++)
g<<solutie[i];
}