Pagini recente » Cod sursa (job #2984569) | Cod sursa (job #1898120) | Cod sursa (job #116411) | Cod sursa (job #2370915) | Cod sursa (job #2883002)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int MAX=25e4+5;
const int LOG=20;
int n,m,up[LOG][MAX];
int main()
{
fin >> n >> m;
for(int i=1;i<=n;i++)
fin >> up[0][i];
for(int i=1;(1<<i)<=n;i++)
for(int nod=1;nod<=n;nod++)
up[i][nod]=up[i-1][up[i-1][nod]];
while(m--)
{
int k,nod;
fin >> nod >> k;
for(int i=0;(1<<i)<=k;i++)
if(k&(1<<i))
nod=up[i][nod];
fout << nod << '\n';
}
return 0;
}