Pagini recente » Cod sursa (job #784492) | Cod sursa (job #1483129) | Cod sursa (job #2073084) | Istoria paginii runda/conccsd | Cod sursa (job #2056887)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n, m, d[51][250003], i, j, sol, k, lg[250003];
int main()
{
f>>n>>m;
f>>d[0][1];
for(i=2;i<=n;i++)
{
f>>d[0][i];
lg[i]=lg[i/2]+1; //mai rapid decat log2(i) ???
}
for(k=1;(1<<k)<=n;k++)
for(i=1;i<=n;i++)
d[k][i]=d[k-1][d[k-1][i]];
for(;m;m--)
{
f>>i>>j;
while(j>0)
{
i=d[lg[j]][i];
j=j-(1<<lg[j]);
}
g<<i<<"\n";
}
return 0;
}