Pagini recente » concursdeholboca | Cod sursa (job #2711985) | Cod sursa (job #1920468) | Istoria paginii runda/minune2 | Cod sursa (job #1571179)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n, m;
vector <int> stramosi;
vector <int> p, q;
void Citire();
int MostenitorulCerut(int P, int Q);
int main()
{
Citire();
ofstream out("stramosi.out");
for(int i = 0; i < m; i++){
out << MostenitorulCerut(p[i],q[i]) << '\n';
}
return 0;
}
void Citire(){
ifstream in("stramosi.in");
in >> n >> m;
int temp, temp2;
for(int i = 0; i < n; i++)
{
in >> temp;
stramosi.push_back(temp);
}
for(int i = 0; i < m; i++){
in >> temp >> temp2;
p.push_back(temp);
q.push_back(temp2);
}
}
int MostenitorulCerut(int P, int Q){
Q--;
while(Q && stramosi[P-1] != 0){
//cout << P << ' ' << stramosi[P-1] << '\n';
P = stramosi[P-1];
Q--;
}
return stramosi[P-1];
//return P;
}