Pagini recente » Cod sursa (job #3139308) | Cod sursa (job #2729102) | Cod sursa (job #2850586) | Cod sursa (job #1978410) | Cod sursa (job #2727141)
#include <iostream>
#include <fstream>
const int NMAX = 25e4;
const int LOG = 17;
int t[1 + NMAX][1 + LOG];
int main() {
std::ifstream in("stramosi.in");
std::ofstream out("stramosi.out");
int n, q;
in >> n >> q;
for (int i = 1; i <= n; ++i)
in >> t[i][0];
for (int i = 1; i <= n; ++i)
for (int e = 1; e <= LOG; ++e)
t[i][e] = t[t[i][e - 1]][e - 1];
while (q--) {
int a, k;
in >> a >> k;
int e = 0;
while (k) {
if (k & 1)
a = t[a][e];
++e;
k >>= 1;
}
out << a << '\n';
}
return 0;
}