Pagini recente » Cod sursa (job #574181) | Cod sursa (job #2051726) | Cod sursa (job #2919856) | Cod sursa (job #1193564) | Cod sursa (job #2481129)
#include <iostream>
#include <fstream>
#include <cstring>
#include <queue>
#include <map>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int NMax = 250000;
int n, m;
int tt[NMax + 5];
void read()
{
fin >> n >> m;
for (int i = 1; i <= n; i++)
fin >> tt[i];
}
int getStramos(int q, int p)
{
int membru = q;
for(int i = 0; i < p; i++)
q = tt[q];
return q;
}
int main()
{
read();
int q, p;
for (int i = 0; i < m; i++)
{
fin >> q >> p;
fout << getStramos(q, p) << '\n';
}
}