Pagini recente » Istoria paginii runda/wellcodesimulareclasa11-12-11martie/clasament | Rotatie lexicografic minima | Rotatie lexicografic minima | Rotatie lexicografic minima | Cod sursa (job #2671343)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define NMAX 50001
ifstream f("sortaret.in");
ofstream g("sortaret.out");
bool viz[NMAX];
int v;
vector<int> graf[NMAX];
void DFS(int x)
{
if (viz[x])
return;
viz[x] = 1;
g << x << " ";
for (auto i : graf[x])
DFS(i);
}
int main()
{
int m, x, y, i;
f >> v >> m;
for (i = 0; i < m; i++)
{
f >> x >> y;
graf[x].push_back(y);
}
for(i = 1; i <= v; i++)
if(!viz[i])
DFS(i);
return 0;
}