Pagini recente » Cod sursa (job #486109) | Cod sursa (job #542741) | Cod sursa (job #1880080) | Monitorul de evaluare | Cod sursa (job #1856775)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f ("stramosi.in");
ofstream g ("stramosi.out");
int r[300000];
int n,m, a[300000][50],q,p;
int main()
{
f>>n>>m;
for (int i=1;i<=n;i++)
f>>a[i][0];
for (int j=1;(1<<j)<=n;j++)
for (int i=1;i<=n;i++)
a[i][j]= a[a[i][j-1]][j-1];
for (int i=1;i<=m;i++)
{
f>>q>>p;
for (int i = 0; (1<<i) <= p; i++)
if ((1<<i) & p)
q = a[q][i];
g<< q<<'\n';
}
return 0;
}