Pagini recente » Cod sursa (job #803054) | Cod sursa (job #166212) | Istoria paginii runda/newcomers_2 | Cod sursa (job #18265) | Cod sursa (job #445445)
Cod sursa(job #445445)
#include<fstream.h>
#define MAX 501
int n,m,numar[MAX],urm[MAX][MAX],coada[MAX],este[MAX];
int main()
{
ifstream f("sortaret.in");ofstream g("sortaret.out");
int i,x,y;
f>>n>>m;
for(i=1;i<=m;i++){f>>x>>y;este[x]=este[y]=1;numar[y]++;urm[x][++urm[x][0]]=y;}
int p=1,u=0;
for(i=1;i<=n;i++)
if(este[i] && numar[i]==0)coada[++u]=i;
while(p<=u)
{
for(i=1;i<=urm[coada[p]][0];i++)
{
numar[urm[coada[p]][i]]--;
if(numar[urm[coada[p]][i]]==0)coada[++u]=urm[coada[p]][i];
}
p++;
}
for(i=1;i<=u;i++)g<<coada[i]<<' ';
f.close();g.close();
return 0;
}