Cod sursa(job #1190885)
Utilizator | Breahna David breahnadavid | Data | 25 mai 2014 20:44:27 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f;
ofstream g;
int i,j,m,n,k,t[1000][1000],a[1000];
void caut(int p)
{
g<<p<<' ';
for(int i=1;i<=n;i++)
if(t[p][i]&&!a[i]){
a[i]=1;
t[p][i]=0;caut(i);
}
}
int main()
{
f.open("sortaret.in");
g.open("sortaret.out");
f>>n;
f>>m;
for(i=0;i<m;i++)
{
f>>k>>j;
t[k][j]=1;
}
k=0;
a[1]=1;
caut(1);
for(i=1;i<=n;i++)if(!a[i])g<<a[i]<<' ';
g.close();
return 0;
}