Pagini recente » Cod sursa (job #1365338) | Cod sursa (job #2518810) | Cod sursa (job #1429957) | Cod sursa (job #2599406) | Cod sursa (job #2657818)
//#include <iostream>
#include <fstream>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
bool v[500][500];
int vf[50000];
void dfs(int n,int h)
{
out<<h<<' ';
for(int i=1;i<=n;i++)
if(v[h][i]==1)
{
v[h][i]=0;
dfs(n,i);
}
}
int main()
{
int n,m,mini=50000,i,j,h=1;
in>>n>>m;
while(in>>i)
{
in>>j;
v[i][j]=1;
vf[j]++;
}
for(i=1;i<=n;i++)
if(vf[i]<mini)
mini=vf[i],h=i;
dfs(n,h);
return 0;
}