Pagini recente » Cod sursa (job #2348093) | Cod sursa (job #1549188) | Rating Pal Juhasz (bontovicspal) | Cod sursa (job #1290462) | Cod sursa (job #1207704)
#include<fstream>
#include<algorithm>
using namespace std;
int xx,i,j,n,m,x,y,t[21][300005];
int main()
{
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
cin>>n>>m;
for(i=1;i<=n;i++) cin>>t[0][i];
for(i=1;i<=18;i++)
for(j=1;j<=n;j++)
t[i][j]=t[i-1][t[i-1][j]];
while(m--)
{
cin>>x>>y;
xx=0;
while(y!=0)
{
if(y%2==1) x=t[xx][x];
y/=2;
xx++;
}
cout<<x<<'\n';
}
return 0;
}