Pagini recente » Cod sursa (job #98348) | Borderou de evaluare (job #367603) | Cod sursa (job #1344234) | Cod sursa (job #1497998)
#include <fstream>
using namespace std;
ofstream fout("stramosi.out");
ifstream fin("stramosi.in");
const int NMAX = 250005;
int n, m, x, y;
int ST[19][NMAX];
int main()
{
fin >> n >> m;
for(int i=1; i<=n; ++i)
fin >> ST[0][i];
int log = 0, p = 1;
while (p <= n) {
p *= 2;
++log;
}
--log;
for(int j=1; j<=log; ++j)
for(int i=1; i<=n; ++i)
ST[j][i] = ST[j-1][ST[j-1][i]];
for(int i=1; i<=m; ++i) {
fin >> x >> y;
for(int j=20; j>=0; --j)
if(y & (1 << j))
x = ST[j][x];
fout << x << '\n';
}
return 0;
}