Cod sursa(job #1199218)
Utilizator | Data | 18 iunie 2014 16:29:02 | |
---|---|---|---|
Problema | Stramosi | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#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;
}