Cod sursa(job #2776357)
| Utilizator | Data | 19 septembrie 2021 14:26:05 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream F("sortaret.in");
ofstream G("sortaret.out");
#define N 50001
vector<int> g[N];
int n,m,i,j,k,v[N],u[N];
void D(int i)
{
int j,l;
for(v[i]=1,l=g[i].size(),j=0;j<l;++j)
if(!v[g[i][j]])
D(g[i][j]);
G<<i<<" ";
}
int main()
{
F>>n>>m;
while(m--)
F>>i>>j,g[i].push_back(j);
for(i=1;i<=n;++i)
if(!v[i])
D(i);
return 0;
}
