Pagini recente » Cod sursa (job #2617734) | Cod sursa (job #555405) | Cod sursa (job #2321081) | summer | Cod sursa (job #2837407)
#include <bits/stdc++.h>
using namespace std;
/// d[i][j] - stramosul lui j aflat la distanta 2^i de j
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, q, d[20][250003];
int main()
{
int nod, k, sol;
fin >> n >> q;
for(int i = 1; i <= n; i++)
fin >> d[0][i];
for(int i = 1; i <= 18; i++)
for(int j = 1; j <= n; j++)
d[i][j] = d[i-1][ d[i-1][j] ];
for(int i = 1; i <= q; i++)
{
fin >> nod >> k;
sol = 0;
while(k > 0)
{
if(k % 2 == 1)
nod = d[sol][nod];
sol++;
k /= 2;
}
fout << nod << "\n";
}
return 0;
}