Pagini recente » Cod sursa (job #1831050) | Cod sursa (job #2907159) | Cod sursa (job #1510735) | Cod sursa (job #137617) | Cod sursa (job #1512157)
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int dad[250000][22],n,i,j,nr,m,jj;
int putere(int n)
{
int nr=-1,i;
for(i = 1; i <= n; i *= 2)
nr++;
jj=i/2;
return nr;
}
void creare()
{
int nn;
for (i = 1; i <= n; i++)
{
f>>dad[0][i];
nn=putere(i);
for(j=1; j<=nn; j++)
dad[j][i]=dad[j-1][dad[j-1][i]];
}
}
void solutie()
{
int x,a,nr;
for(i=1;i<=m;i++)
{
f>>a>>nr;
while(nr)
{
x=putere(nr);
a=dad[x][a];
nr-=jj;
}
g<<a<<"\n";
}
}
int main()
{
f>>n>>m;
creare();
solutie();
return 0;
}