Pagini recente » Cod sursa (job #404411) | Cod sursa (job #825111) | Cod sursa (job #277155) | Cod sursa (job #2122137) | Cod sursa (job #2657824)
//#include <iostream>
#include <fstream>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
bool v[500][500];
int vf1[50000],vf2[50000];
void dfs(int n,int h)
{
out<<h<<' ';
for(int i=1;i<=n;i++)
if(v[h][i]==1 && vf2[i]!=0)
{
vf2[i]=0;
dfs(n,i);
}
}
int main()
{
int n,m,i,j;
in>>n>>m;
while(in>>i)
{
in>>j;
v[i][j]=1;
vf1[j]=1;
vf2[j]=1;
}
for(i=1;i<=n;i++)
if(vf1[i]==0)
dfs(n,i);
return 0;
}