Pagini recente » Cod sursa (job #2819003) | Cod sursa (job #2931237) | Cod sursa (job #1759026) | Cod sursa (job #2634059) | Cod sursa (job #524923)
Cod sursa(job #524923)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,j,k;
int VIZ[50100],D[50100];
vector <int> M[50100];
void citire()
{
int a,b;
f>>n>>m;
for (i=1;i<=m;i++)
{
f>>a>>b;
M[a].push_back(b);
D[b]++;
}
}
void rezolva_si_scrie()
{
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
if (!VIZ[j] && D[j]==0)
{
VIZ[j]=1;
g<<j<<" ";
for (k=0;k<M[j].size();k++)
D[M[j][k]]--;
break;
}
}
}
int main()
{
citire();
rezolva_si_scrie();
f.close();
g.close();
return 0;
}