Pagini recente » Cod sursa (job #1287487) | Cod sursa (job #481212) | Cod sursa (job #1101391) | Cod sursa (job #2152611) | Cod sursa (job #2105101)
#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<vector<int> > a(50000);
int dp[50001],viz[50001];
int n,m;
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x1,x2;
f>>x1>>x2;
a[x1].push_back(x2);
dp[x2]++;
}
for(int i=1;i<=n;i++)
{
int ok=1;
for(int j=1;j<=n;j++)
if(viz[j]==0 && dp[j]==0)
{
viz[j]=1;g<<j<<" ";
for(int y=0;y<a[j].size();y++)
dp[a[j][y]]--;
break;
}
}
return 0;
}