Pagini recente » Cod sursa (job #2754590) | Cod sursa (job #1724946) | Cod sursa (job #1736010) | Cod sursa (job #1909564) | Cod sursa (job #752479)
Cod sursa(job #752479)
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
int d[18][250010];
int main()
{
int i, n, q, nod, pas, j;
in >> n >> q;
for(i = 1; i <= n; i++)
in >> d[0][i];
for(i = 1; (1 << i) <= n; ++i)
for(j = 1; j <= n; ++j)
d[i][j] = d[i - 1][ d[i - 1][j] ];
while(q--){
in >> nod >> pas;
i = 0;
while(pas){
if(pas & 1) nod = d[i][nod];
if(!nod) break;
++i;
pas >>= 1;
}
out << nod << "\n";
}
return 0;
}