Pagini recente » Arhiva de probleme | Cod sursa (job #1296443) | Cod sursa (job #2013995) | Istoria paginii runda/simulare_oji_hlo_liceu_intermediari/clasament | Cod sursa (job #1648321)
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,v[50003],x,y,u;
int c[100003];
bool a[20003][20003];
void citire()
{
f>>n>>m;
int i;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
v[y]++;
}
}
void init()
{
int i;
for(i=1;i<=n;i++)
if(v[i]==0) {u++; c[u]=i;}
}
void solve()
{
int p,i;
p=1;
while(p<=u)
{
x=c[p];
for(i=1;i<=n;i++)
if(a[x][i]==1) {v[i]--; if(v[i]==0) c[++u]=i;}
p++;
}
}
int main()
{
citire();
init();
solve();
int i;
for(i=1;i<=u;i++) g<<c[i]<<' ';
g<<'\n';
f.close();
g.close();
return 0;
}