Cod sursa(job #1808385)

Utilizator waren4Marius Radu waren4 Data 17 noiembrie 2016 17:29:33
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#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;
}