Pagini recente » Cod sursa (job #1047589) | Monitorul de evaluare | Istoria paginii runda/simulare_preoli | Cod sursa (job #973383) | Cod sursa (job #1574803)
#include <cstdio>
using namespace std;
const int NMAX = 250000;
const int LOGMAX = 18;
int tata [LOGMAX + 5][NMAX + 5];
int main()
{
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
int n, k, nod, l;
scanf("%d %d", &n, &k);
for (register int i = 1; i <= n; ++i)
scanf("%d", &tata[0][i]);
for (register int i = 1; i <= LOGMAX; ++i)
for (register int j = 1; j <= n; ++j)
tata[i][j] = tata[i - 1][tata[i - 1][j]];
for (register int i = 1; i <= k; ++i)
{
scanf("%d %d", &nod, &l);
for (register int j = 0; l > 0; ++j, l >>= 1)
if ((l & 1) > 0)
nod = tata[j][nod];
printf("%d\n", nod);
}
return 0;
}