Pagini recente » Cod sursa (job #3292078) | Cod sursa (job #561443) | Cod sursa (job #268244) | Cod sursa (job #2681038) | Cod sursa (job #1121843)
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
vector<int> v[50001];
int n,m,gr[50001],l=0,q[50001];
ifstream mama("sortaret.in");
ofstream tata("sortaret.out");
void graf()
{
int a,i,k=0;
while(l<n)
{
a=q[++k];
for(i=0;i<v[a].size();i++)
gr[v[a][i]]--;
for(i=1;i<=n;i++)
if(gr[i]==0) {q[++l]=i;tata<<i<<" ";gr[i]=-1;}
}
}
int main()
{
int a,b,i;
mama>>n>>m;
for(i=1;i<=m;i++)
{
mama>>a>>b;
v[a].push_back(b);
gr[b]++;
}
for(i=1;i<=n;i++)
if(gr[i]==0) {q[++l]=i;tata<<i<<" ";gr[i]=-1;}
graf();
return 0;
}