Pagini recente » Cod sursa (job #2406179) | Cod sursa (job #2524886) | Cod sursa (job #3276279) | Cod sursa (job #563) | Cod sursa (job #1976315)
#include <cstdio>
using namespace std;
int d[100005][20];
int main(){
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d", &d[i][0]);
for (int j = 1; j <= 17; ++j)
for (int i = 1; i <= n; ++i)
d[i][j] = d[d[i][j - 1]][j - 1];
for (int i = 1; i <= m; ++i){
int q, p;
scanf("%d%d", &q, &p);
for (int j = 0; j <= 17; ++j)
if (p & (1 << j))
q = d[q][j];
printf("%d\n", q);
}
return 0;
}