Pagini recente » Cod sursa (job #131291) | Cod sursa (job #1506965) | Cod sursa (job #756249) | Cod sursa (job #1736085) | Cod sursa (job #1674648)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int N=250001,L=18;
int t[L][N],v[N];
int raspuns(int p,int q)
{
int i=0;
while(q!=0)
{
if(q%2!=0)
p=t[i][p];
i++;
q/=2;
}
return p;
}
int main()
{
int i,j,n,m,x,y;
in>>n>>m;
for(i=1; i<=n; i++)
{
in>>t[0][i];
}
for(i=1; i<L; i++)
{
for(j=1; j<=n; j++)
{
t[i][j]=t[i-1][t[i-1][j]];
}
}
for(i=1; i<=m; i++)
{
in>>x>>y;
out<<raspuns(x,y)<<'\n';
}
return 0;
}