Pagini recente » Cod sursa (job #1944924) | Cod sursa (job #288537) | Cod sursa (job #1605057) | Cod sursa (job #2736046) | Cod sursa (job #1255268)
#include <cstdio>
using namespace std;
int d[20][250005];
int main()
{
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
int n,m,a,b,i,j,num;
scanf("%d%d",&n,&m);
for(i=1; i<=n; ++i)
scanf("%d",&d[0][i]);
for(i=1; i<=17; ++i) /// 2^17<250000 si 2^18>250000
for(j=1; j<=n; ++j)
d[i][j]=d[i-1][d[i-1][j]];
for(i=1; i<=m; ++i)
{
scanf("%d%d",&a,&b);
num=0;
while(b>0)
{
if (b&1)
a=d[num][a];
++num;
b>>=1;
}
printf("%d\n",a);
}
return 0;
}