Pagini recente » Cod sursa (job #1462721) | Cod sursa (job #1034270) | Cod sursa (job #1234933) | Istoria paginii runda/6576 | Cod sursa (job #1462176)
#include<fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int d[20][300001];
int n,m,i,k,q,p,sum;
int main(){
fin>>n>>m;
for(i=1;i<=n;i++){
fin>>d[1][i];
}
for(k=2;k<=18;k++){
//d[k][i]= al k -lea stramos al nodului i
sum=0;
for(i=1;i<=n;i++){
d[k][i]=d[k-1][ d[1][i] ];
sum+=d[k][i];
}
if(sum==0) break;
}
for(i=1;i<=m;i++){
fin>>q>>p;
fout<<d[p][q]<<"\n";
}
return 0;
}