Mai intai trebuie sa te autentifici.
Cod sursa(job #2943905)
| Utilizator | Data | 21 noiembrie 2022 19:36:25 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("sortaret.in");
ofstream G("sortaret.out");
vector<int> a[50001];
int i,j,n,m;
bool v[50001];
void D(int i)
{
int j,k;
for(k=a[i].size(),v[i]=1,j=0;j<k;++j)
if(!v[a[i][j]])
D(a[i][j]);
G<<i<<' ';
}
int main()
{
for(F>>n>>m;m--;F>>i>>j,a[j].push_back(i));
for(i=1;i<=n;++i)
if(!v[i])
D(i);
return 0;
}
