Pagini recente » Cod sursa (job #1758102) | Cod sursa (job #522668) | Cod sursa (job #2384839) | Cod sursa (job #2177474) | Cod sursa (job #876428)
Cod sursa(job #876428)
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int m, n, x, y;
int di[10000], a[10000][10000];
int neviz, nrniv, nr;
void citire();
void afisare();
void descomp();
int main()
{
citire();
descomp();
return 0;
}
void citire()
{
int i;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
//introduc pe y in lista de adiacenta a lui x
a[x][0]++; a[x][a[x][0]]=y; di[y]++;
}
}
void descomp()
{
int i, j,neviz=n;
while(neviz!=0)
{
for(i=1;i<=n;i++)
if(di[i]==0)
{
di[i]=-1; fout<<i<<' ';
for(j=1;j<=a[i][0];j++)
di[a[i][j]]--; neviz--; break;
}
}
}