Pagini recente » Cod sursa (job #733328) | Cod sursa (job #1735733) | Cod sursa (job #299121) | Cod sursa (job #1730737) | Cod sursa (job #2938550)
#include<fstream>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<climits>
#include<iomanip>
#include<cstring>
#include<bitset>
#define MAX 250000
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
//ifstream f("in.in");
//ofstream g("out.out");
int t[MAX+5],n,m,q,p;
int tata(int q,int p){
if(p==0){
return q;
}
return tata(t[q],p-1);
}
int main(){
f>>n>>m;
for( int i=1;i<=n;i++){
f>>t[i];
}
for(int i=1;i<=m;i++){
f>>q>>p;
g<<tata(q,p)<<'\n';
}
f.close();
g.close();
return 0;
}