Pagini recente » Borderou de evaluare (job #2628641) | Borderou de evaluare (job #2738243) | Borderou de evaluare (job #622398) | Problema A | Cod sursa (job #1808385)
#include <iostream>
#include <fstream>
using namespace std;
struct w{
int x;
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[l].a[x[l].x]=j;
}
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<=n;j++){
for(l=1;l<=x[j].x;l++){if (x[j].a[l]==i) {x[j].x--; break;}
}
}
}
}}
return 0;
}