Pagini recente » Cod sursa (job #2125762) | Cod sursa (job #1395981) | Cod sursa (job #2607111) | Cod sursa (job #2653404) | Cod sursa (job #673186)
Cod sursa(job #673186)
#include<fstream>
using namespace std;
int a[20][250002];
int main ()
{
int i,n,m,j,p,q,rasp,max,b[300002];
ifstream fi("stramosi.in");
ofstream fo("stramosi.out");
fi>>n>>m;
for (i=1; i<=n; i++)
fi>>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=0; i<m; i++)
{
fi>>q>>p;
rasp=q;
if(p>(1<<9)) max=18; else max=9;
for (j=max; j>=0; j--)
if (p & (1<<j))
rasp=a[j][rasp];
b[i]=rasp;
}
for(i=0;i<m;i++)
fo<<b[i]<<"\n";
return 0;
}