Pagini recente » Cod sursa (job #1581549) | algoritmiada-2019/runda-preoni/clasament | Cod sursa (job #2707092) | Cod sursa (job #2405868) | Cod sursa (job #276098)
Cod sursa(job #276098)
#include<fstream.h>
long n,m,k=1;
int a[500][500],v[50000];
void citire()
{ long i;
int x,y;
ifstream f("sortaret.in");
f>>n;
f>>m;
for(i=1;i<=m;i++)
{f>>x;
f>>y;
a[x][y]=1;
}
f.close();
}
void scriere()
{
ofstream g("sortaret.out");
for(long i=1;i<=n;i++)
g<<v[i]<<" ";
g.close();
}
void sortaret(long p)
{ long i;
for(i=1;i<=n;i++)
if(a[p][i])
{ k++;
v[k]=i;
sortaret(i);
}
}
int main()
{
citire();
v[1]=1;
sortaret(1);
scriere();
return 0;
}