Pagini recente » Istoria paginii utilizator/qqqqq | Cod sursa (job #2107614) | Cod sursa (job #2010950) | Profil MKLOL | Cod sursa (job #2361650)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define NMax 50001
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <unsigned short int> Q;
int M;
unsigned short int N,A[NMax],V[NMax],S[NMax];
void citire()
{
f>>N>>M;
unsigned short int x,y;
for(int i=1;i<=N;i++)
{
A[i]=0;
V[i]=0;
}
for(int i=1;i<=M;i++)
{
f>>x>>y;
A[x]=(A[x]*10)+y;
}
f.close();
}
void parcurgere()
{
V[1]=1;
S[1]=1;
unsigned short int k=1;
while(k>0)
{
if(A[S[k]]!=0 && V[A[S[k]]%10]==0)
{
k++;
S[k]=A[S[k-1]]%10;
V[S[k]]++;
A[S[k-1]]/=10;
}
else if(A[S[k]]!=0 && V[A[S[k]]%10]==1)
A[S[k]]/=10;
else
{
Q.push_back(S[k]);
k--;
}
}
while(!Q.empty())
{
g<<Q.back()<<" ";
Q.pop_back();
}
g.close();
}
int main()
{
citire();
parcurgere();
return 0;
}