Cod sursa(job #2218441)
Utilizator | Data | 4 iulie 2018 14:55:18 | |
---|---|---|---|
Problema | Stramosi | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
//Problema 10 - Infoarena
#include <iostream>
#include <fstream>
int main()
{
std::ifstream in("stramosi.in");
std::ofstream out("stramosi.out");
long N;
long M;
in >> N >> M;
long membrii[N + 1];
for(int i = 1; i <= N; ++i){
in >> membrii[i];
}
while(M-- > 0){
long P;
long Q;
in >> Q >> P;
while(P-- > 0){
if(membrii[Q]){
Q = membrii[Q];
}
else{
Q = 0;
break;
}
}
out << Q << '\n';
}
return 0;
}