Pagini recente » Cod sursa (job #685621) | Cod sursa (job #3154397) | Cod sursa (job #120820) | Cod sursa (job #2097206) | Cod sursa (job #1199218)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int N, M, a[250001], Q, P;
int search(int q,int p) {
int val = a[q];
p--;
if(p == 0) {
return val;
} else {
search(val,p);
}
}
int main() {
f >> N >> M;
for(int i = 1; i <= N; i++) {
f>>a[i];
}
for(int i = 1; i <= M; i++) {
f >> Q >> P;
g << search(Q,P) << endl;
}
return 0;
}