Cod sursa(job #2701071)
Utilizator | Data | 29 ianuarie 2021 19:15:54 | |
---|---|---|---|
Problema | Stramosi | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <bits/stdc++.h>
#define MAX 250005
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
int t[MAX], n, m, q, p;
int main(){
in>>n>>m;
for(int i = 1; i <= n; i++)
in>>t[i];
while(m--){
in>>q>>p;
while(p--){
q = t[q];
}
out<<q<<"\n";
}
}