Pagini recente » Cod sursa (job #3263585) | Cod sursa (job #1721406) | Cod sursa (job #528758) | Cod sursa (job #579791) | Cod sursa (job #1416016)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin ("stramosi.in");
ofstream fout ("stramosi.out");
const int kMaxN = 250005, kMaxLg = 18;
int N, M;
int str[kMaxLg][kMaxN];
int main()
{
fin >> n >> ;
for (int i = 1; i <= n; i++)
fin >> str[0][i];
for (int i=1;i<kMaxLg;i++)
for (int j=1;j<=n;j++)
str[i][j] = str[i - 1][str[i - 1][j]];
while (m--) {
int nod, w;
fin >> nod >> w;
for (int i = 0; i < kMaxLg; ++i)
if (w & (1 << i))
nod = str[i][nod];
fout << nod << "\n";
}
return 0;
}