Pagini recente » Cod sursa (job #1214872) | Cod sursa (job #292640) | Cod sursa (job #2109718) | Cod sursa (job #2596576) | Cod sursa (job #240914)
Cod sursa(job #240914)
#include <stdio.h>
int a[25][250001];
int n,m,p,q;
void read ()
{
int i,j,nr,ok;
scanf ("%d%d",&n,&m);
for (i=1; i<=n; ++i)
scanf ("%d",&a[0][i]);
for (i=1; ok; ++i)
{
ok=0;
for (j=1; j<=n; ++j)
{
nr=a[i-1][j];
if (nr)
{
ok=1;
a[i][j]=a[i-1][nr];
}
}
}
}
void solve ()
{
int i,ct;
for (i=1; i<=m; ++i)
{
scanf ("%d%d",&q,&p);
ct=0;
while (p && q)
{
if (p&1)
q=a[ct][q];
++ct;
p>>=1;
}
printf ("%d\n",q);
}
}
int main ()
{
freopen ("stramosi.in","r",stdin);
freopen ("stramosi.out","w",stdout);
read ();
solve ();
return 0;
}