Pagini recente » Cod sursa (job #2275974) | Cod sursa (job #2289613) | Cod sursa (job #2985566) | Cod sursa (job #2310214) | Cod sursa (job #672331)
Cod sursa(job #672331)
#include<cstdio>
#include<cmath>
using namespace std;
int a[20][250005];
int main ()
{
int i,n,m,j,p,q,rasp,max;
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1; i<=n; i++)
scanf("%d",&a[0][i]);
for (i=1; i<=18; i++)
for (j=1; j<=n; j++)
a[i][j]=a[i-1][a[i-1][j]];
for (i=1; i<=m; i++)
{
scanf("%d%d",&q,&p);
rasp=q; max=log2(p);
for (j=max; j>=0; j--)
if (p & (1<<j))
rasp=a[j][rasp];
printf("%d\n",rasp);
}
return 0;
}