Cod sursa(job #3004870)
| Utilizator | Data | 16 martie 2023 17:40:25 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("sortaret.in");
ofstream G("sortaret.out");
int n,i,j;
vector<int> v[50001];
bool c[50001];
void A(int i)
{
c[i]=1;
for(auto j:v[i])
if(!c[j])
A(j);
G<<i<<' ';
}
int main()
{
for(F>>n>>i;F>>i>>j;v[j].push_back(i));
for(i=1;i<=n;++i)
if(!c[i])
A(i);
return 0;
}
