Cod sursa(job #1803827)
| Utilizator | Data | 11 noiembrie 2016 22:17:05 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | cerculdeinfo-lectia6-arbori | Marime | 0.41 kb |
#include <cstdio>
using namespace std;
int N,M,k[18][250001]={},n,p,a,i,j;
int main(){
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%d%d",&N,&M);
for(i=1;i<=N;i++) scanf("%d",&k[0][i]);
for(i=1;(1<<i)<=N;i++)for(j=1;j<=N;j++)k[i][j]=k[i-1][k[i-1][j]];
for(i=1;i<=M;i++){
scanf("%d%d",&n,&a),p=0;
while(a!=0){
if(a%2)n=k[p][n];
a/=2;p++;}
printf("%d\n",n);}
return 0;}