Pagini recente » Cod sursa (job #1846957) | Cod sursa (job #748629) | Cod sursa (job #1021164) | Cod sursa (job #2921644) | Cod sursa (job #303683)
Cod sursa(job #303683)
#include <stdio.h>
long long a[30][300000];
long long nr,i,j,q,p,n,m;
int main()
{
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%lld %lld",&n,&m);
for (i=1; i<=n; ++i)
scanf("%lld",&a[0][i]);
nr=1; i=n;
while (i!=0)
{
for (j=1; j<=n; ++j)
a[nr][j]=a[nr-1][a[nr-1][j]];
i=i/2;
nr++;
}
for (i=1; i<=m; ++i)
{
nr=0;
scanf("%lld %lld",&p,&q);
while (q!=0 && p!=0)
{
if (q%2==1)
p=a[nr][p];
nr++;
q=q/2;
}
printf("%lld\n",p);
}
fclose(stdin); fclose(stdout);
return 0;
}