Pagini recente » Borderou de evaluare (job #204077) | Cod sursa (job #1261416) | Cod sursa (job #608108) | Clasament eusebiu_oji_2012_10 | Cod sursa (job #179522)
Cod sursa(job #179522)
#include <stdio.h>
using namespace std;
int n, p, t, k, i, a[250001], m;
int main()
{
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
scanf("%ld %ld", &n, &m);
for(i=1; i<=n; i++)
scanf("%d", &a[i]);
for(i=1; i<=m; i++)
{
scanf("%ld %ld", &n, &p);
t=a[n];
k=1;
while(k<p && t)
{
t=a[t];
k++;
}
printf("%ld\n", t);
}
return 0;
}