Cod sursa(job #1377767)
Utilizator | Data | 6 martie 2015 01:15:59 | |
---|---|---|---|
Problema | Stramosi | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <fstream>
using namespace std;
int N, M, t[250002], Q, P;
int main()
{
ifstream f("stramosi.in");
ofstream g("stramosi.out");
f >> N >> M;
for (int i = 1; i <= N; i++) {
f >> t[i];
}
for (int i = 1; i <= M; i++) {
f >> Q >> P;
while (P--) {
Q = t[Q];
}
g << Q << '\n';
}
return 0;
}