Pagini recente » Cod sursa (job #2819869) | Cod sursa (job #1531806) | Cod sursa (job #2632162) | Cod sursa (job #678139) | Cod sursa (job #2155996)
#include <bits/stdc++.h>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int N_MAX = 250000, L_MAX = 17;
int n, m, p, q;
int stramosi[L_MAX + 2][N_MAX + 2];
// al (1 << i) - lea stramos al lui j
int main()
{
in >> n >> m;
for(int i = 1; i <= n; i++)
in >> stramosi[0][i];
for(int i = 1; i <= 18; i++)
for(int j = 1; j <= n; j++)
stramosi[i][j] = stramosi[i - 1][stramosi[i - 1][j]];
while(m--)
{
in >> q >> p;
for(int bit = 0; (1 << bit) <= p; bit++)
if(p & (1 << bit))
q = stramosi[bit][q];
out << q << '\n';
}
return 0;
}