Pagini recente » Cod sursa (job #104847) | Cod sursa (job #2292220) | Rezultatele filtrării | Cod sursa (job #1177950) | Cod sursa (job #1367261)
#include <stdio.h>
int n,m;
int dp[250001][6];
int p2[31];
int main()
{
freopen ("stramosi.in","r",stdin);
freopen ("stramosi.out","w",stdout);
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&dp[i][0]);
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=5;j++)
{
dp[i][j]=dp[dp[i][j-1]][j-1];
}
}
p2[0]=1;
for(int i=1;i<=19;i++) p2[i]=10*p2[i-1];
int x,y;
for(int i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
for(int j=5;j>=0;j--)
{
if(y>=p2[j])
{
x=dp[x][j];
y-=p2[j];
}
}
while(y!=0)
{
y--;
x=dp[x][0];
}
//printf("\n");
printf("%d\n",x);
}
}