Pagini recente » Cod sursa (job #2082964) | Istoria paginii utilizator/nicolaeguta | Cod sursa (job #1750900) | Istoria paginii monthly-2014/runda-1 | Cod sursa (job #2071418)
#include <fstream>
using namespace std;
ifstream fin ("stramosi.in");
ofstream fout ("stramosi.out");
const int Nmax=250000;
int N, M, TT[Nmax+5];
int Stramos(int P, int Q)
{
while (P-- && Q)
{
Q=TT[Q];
}
return Q;
}
void ReadAndSolve()
{
fin >> N >> M;
for (int i=1; i<=N; i++)
fin >> TT[i];
for (int i=1; i<=M; i++)
{
int P, Q;
fin >> Q >> P;
fout << Stramos(P, Q) << "\n";
}
}
int main()
{
ReadAndSolve();
return 0;
}