Pagini recente » Cod sursa (job #1228276) | Cod sursa (job #3316060) | Cod sursa (job #3285899) | Cod sursa (job #230812) | Cod sursa (job #3305913)
#include <iostream>
#include<fstream>
using namespace std;
int n,m,dp[20][250001],p,q,bit,i;
int main()
{ifstream fin("stramosi.in");ofstream fout("stramosi.out");
fin>>n>>m;for(i=1;i<=n;i++)fin>>dp[0][i];
for(p=1;p<18;p++)
for(i=1;i<=n;i++)
dp[p][i]=dp[p-1][dp[p-1][i]];
for(i=1;i<=m;i++){
fin>>q>>p;
for(bit=0;bit<18;bit++)
if((1<<bit)&p)q=dp[bit][q];
fout<<q<<'\n';
}
return 0;
}