Pagini recente » Cod sursa (job #2967307) | Cod sursa (job #2119534) | Cod sursa (job #63520) | Cod sursa (job #2219395) | Cod sursa (job #2286523)
#include <fstream>
#include <cstring>
#include <algorithm>
# define mod 1000000
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int i,n,m,nod,poz,j,p[250001],t[20][250001];
int main(){
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>t[i][0];
for(i=2;i<=n;i++)p[i]=p[i/2]+1;
for(j=1;j<=p[n];j++)
for(i=1;i<=n;i++)
t[i][j]=t[t[i][j-1]][j-1];
for(i=1;i<=m;i++)
{
fin>>nod>>poz;
for(j=0;(1<<j)<=poz;j++)if(poz&(1<<j)) nod=t[nod][j];
fout<<nod<<"\n";
}
return 0;
}