Pagini recente » Cod sursa (job #149264) | Cod sursa (job #2688135) | Cod sursa (job #514166) | Cod sursa (job #1752516) | Cod sursa (job #688898)
Cod sursa(job #688898)
#define nume "sortaret"
#include<cstdio>
#include<iostream>
#include<fstream>
#include<vector>
#include<cstring>
#include<string>
#include<sstream>
#include<iterator>
#include<cstdlib>
#include<queue>
#include<set>
#include<stack>
#include<map>
#include<ctime>
#include<list>
#include<algorithm>
using namespace std;
//#define _PARSARE_
#ifdef _PARSARE_
//////////////////////////////////////////////////////////////
//parsarea citirii
//////////////////////////////////////////////////////////////
#define DIM 8192
char ax[DIM+16];
int idx;
//numere NATURALE:
inline void cit_uint(int &x)
{
x=0;
while(ax[idx]<'0' || ax[idx]>'9')
if(++idx==DIM)fread(ax, 1, DIM, stdin), idx=0;
while(ax[idx]>='0' && ax[idx]<='9') {
x=x*10+ax[idx]-'0';
if(++idx==DIM)fread(ax,1, DIM, stdin),idx=0;
}
}
//numere INTREGI:
inline void cit_int(int &x)
{
x=0;
while((ax[idx]<'0' || ax[idx]>'9') && (ax[idx]!='-'))
if(++idx==DIM)fread(ax, 1, DIM, stdin), idx=0;
int neg=0;
if(ax[idx]=='-') {
neg=1;
if(++idx==DIM)fread(ax, 1, DIM, stdin),idx=0;
}
while(ax[idx]>='0' && ax[idx]<='9') {
x=x*10+ax[idx]-'0';
if(++idx==DIM)fread(ax,1, DIM, stdin),idx=0;
}
if(neg) x=-x;
}
#else
ifstream fin (nume".in");
#endif //_PARSARE_
ofstream fout(nume".out");
//#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
//#endif
#define foreach(V) for(vector<int>::iterator it=V.begin(),stop=V.end();it!=stop;++it)
int n;
int m;
vector<int> G[50000+10];
vector<int> sol;
bool viz[50000+10];
void df(int nod)
{
viz[nod]=true;
foreach(G[nod])
if(!viz[*it])
df(*it);
sol.push_back(nod);
}
int main()
{
#ifdef _PARSARE_
freopen(nume".in","r",stdin);
cit_uint(n);
#else
fin>>n>>m;
#endif
for(int i=0;i<m;++i)
{
int x,y;
fin>>x>>y;
G[x].push_back(y);
}
for(int i=1;i<=n;++i)
if(!viz[i])
df(i);
reverse(sol.begin(),sol.end());
foreach(sol)
fout<<*it<<' ';
fout<<'\n';
fout.close();
return 0;
}