Pagini recente » Cod sursa (job #799573) | Cod sursa (job #2326723) | Cod sursa (job #818586) | Cod sursa (job #3292120) | Cod sursa (job #1328243)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int d[20][250000],i,j,a,b,n,m;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>d[0][i];
for(i=1;1<<i<=n;i++)
{
for(j=1;j<=n;j++)
d[i][j]=d[i-1][d[i-1][j]];
}
for(i=1;i<=m;i++)
{
fin>>a>>b;
j=0;while((1<<(j+1))<=b)
j++;
while(j>=0)
{
a=d[j][a];
b-=1<<j;
while((1<<j)>b)
j--;
if(b==0)
break;
}
fout<<a<<'\n';
}
return 0;
}