Pagini recente » Cod sursa (job #2871222) | Rezultatele filtrării | Rezultatele filtrării | Borderou de evaluare (job #261164) | Cod sursa (job #1808411)
#include <iostream>
#include <fstream>
using namespace std;
struct w{
int x,y;
int a[1000];
bool k;
};
w x[50000];
int main()
{
ifstream f("sortaret.in"); ofstream g("sortaret.out");
int n,m,i,j,l,k;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>j;
f>>l;
x[l].x++;
x[j].y++;
x[j].a[x[j].y]=l;
}
k=n;
while(k>0){
for(i=1;i<=n;i++)
{
if((x[i].x==0) && (x[i].k==0)) {
g<<i<<" ";
x[i].k=1; k--;
for(j=1;j<=x[i].y;j++){ x[x[i].a[j]].x--;}
}
}
}
return 0;
}