Cod sursa(job #3311117)
| Utilizator | Data | 19 septembrie 2025 16:53:47 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> I[50001];
int n, m;
bool T[50001];
void citire()
{
fin>>n>>m;
int x, y, i;
for(i=0; i<m; i++){
fin>>x>>y;
I[y].push_back(x);
}
}
void parc(int i)
{
T[i]=1;
for(auto j:I[i])
if(T[j]==0) parc(j);
fout<<i<<" ";
}
int main()
{
citire();
for(int i=1; i<=n; i++)
if(T[i]==0) parc(i);
}
