Pagini recente » Cod sursa (job #1084634) | Cod sursa (job #1958436) | Cod sursa (job #238018) | Cod sursa (job #2779483) | Cod sursa (job #1068788)
#include <fstream>
#include <math.h>
int a[20][250001];
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int main()
{int n,m,i,l,q,p,j;
f>>n>>m;
for (i=1;i<=n;++i) f>>a[0][i];
for (i=1;(1<<i)<=n;i++)
for (j=1;j<=n;j++) a[i][j]=a[i-1][a[i-1][j]];
for (i=0;i<m;++i)
{ f>>q>>p;
while (p!=0)
if (a[0][q]==0)
{
q=0; break;
}
else
{l=log2(p);
q=a[l][q];
if (q==0)break;
p-=(1<<l);
}
g<<q<<"\n";
}
f.close();
g.close();
return 0;
}