-
Notifications
You must be signed in to change notification settings - Fork 0
/
Badge.cc
58 lines (54 loc) · 1.19 KB
/
Badge.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(cont) cont.begin(), cont.end()
#define foreach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define fore(i, a, b) for (int i = a, almo5t = b; i < almo5t; ++i)
#define SZ(x) ((int)x.size())
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define FIN \
std::ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef long long int ll;
using namespace std;
int main()
{
FIN;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
int p[n + 1];
int i = 1;
int n2 = n;
while (n2--)
{
int next;
cin >> p[i];
i++;
}
fore(i, 1, n + 1)
{
int cual = 0;
int act = i;
set<int> s;
while (!cual)
{
if (s.find(act) != s.end())
{
cual = act;
}
s.insert(act);
act = p[act];
}
cout << cual << " ";
}
return 0;
}