Pagini recente » Cod sursa (job #683767) | Cod sursa (job #3040865) | Cod sursa (job #90987) | Cod sursa (job #2735738) | Cod sursa (job #3229480)
#include <bits/stdc++.h>
#define N 250005
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n,q,d[19][N];
int main()
{
int i,j,nod,k,sol;
fin>>n>>q;
for(i=1;i<=n;i++) fin>>d[0][i];
for(i=1;i<=18;i++)
for(j=1;j<=n;j++)
d[i][j]=d[i-1][d[i-1][j]];
while(q--)
{
fin>>nod>>k;
sol=0;
while(k)
{
if(k%2==1) nod=d[sol][nod];
sol++;
k/=2;
}
fout<<nod<<"\n";
}
return 0;
}