Pagini recente » Cod sursa (job #2978229) | Cod sursa (job #1270833) | Cod sursa (job #1338828) | Istoria paginii runda/usu10mii | Cod sursa (job #2065716)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int NMax = 1e4 + 2;
int N, M, Stramosi[NMax];
void Read (){
in >> N >> M;
for (int i = 1; i <= N; ++i)
in >> Stramosi[i];
}
void SolveAndPrint (){
int P, Q;
for (int i = 1; i <= M; ++i){
in >> Q >> P;
while (P-- && Q != 0)
Q = Stramosi[Q];
out << Q << '\n';
}
}
int main()
{
Read();
SolveAndPrint();
return 0;
}