Pagini recente » Cod sursa (job #2720292) | Cod sursa (job #302715) | Cod sursa (job #637107) | Cod sursa (job #534333) | Cod sursa (job #38236)
Cod sursa(job #38236)
#include<stdio.h>
#include<math.h>
int a[250001][20],n,i,j,m,q,max;
int main()
{freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%d %d",&n,&m);
for(q=1;q<=n;q++)
scanf("%d",&a[0][q]);
for(i=1;pow(2,i)<=n;i++)
for(j=1;j<=n;j++)
a[i][j]=a[i-1][a[i-1][j]];
max=i-1;
for(;m;m--)
{scanf("%d %d",&q,&n);
i=max;
while(q&&n)
{if(pow(2,i)>n){i--; continue;}
q=a[i][q];
n=n-pow(2,i);}
printf("%d\n",q);}
fclose(stdout);
return 0;}