Pagini recente » Cod sursa (job #536188) | Cod sursa (job #565208) | Cod sursa (job #1872193) | Cod sursa (job #1117016) | Cod sursa (job #2976277)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int NMAX=250005;
int A[NMAX][30];
int tata[NMAX];
int stramos(int nod, int p)
{
int i=0;
while(p!=0)
{
if(p%2==1)
nod=A[nod][i];
i++;
p=p/2;
}
return nod;
}
int main()
{
int n,m;
in>>n>>m;
for(int i=1; i<=n; i++)
in>>tata[i];
for(int i=1; i<=n; i++)
A[i][0]=tata[i];
for(int i=1; i<=n; i++)
for(int j=0; (1<<j)<=n; j++)
if(A[i][j-1])
A[i][j]=A[A[i][j-1]][j-1];
int nod,p;
for(int i=1; i<=m; i++)
{
in>>nod>>p;
out<<stramos(nod,p)<<"\n";
}
return 0;
}