Pagini recente » Cod sursa (job #1840387) | Cod sursa (job #1124955) | Cod sursa (job #1094594) | Cod sursa (job #491476) | Cod sursa (job #673175)
Cod sursa(job #673175)
#include<cstdio>
#include<cmath>
using namespace std;
int a[20][250002],b[300002][2];
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=0;i<m;i++) scanf("%d %d",&b[i][0],&b[i][1]);
for (i=1; i<=18; i++)
for (j=1; j<=n; j++)
a[i][j]=a[i-1][a[i-1][j]];
for (i=0; i<m; i++)
{
q=b[i][0]; q=b[i][1];
rasp=q; max=18;
for (j=max; j>=0; j--)
if (p & (1<<j))
rasp=a[j][rasp];
printf("%d\n",rasp);
}
return 0;
}