Pagini recente » Cod sursa (job #2513307) | Cod sursa (job #475438) | Cod sursa (job #1205603) | Cod sursa (job #3166486) | Cod sursa (job #2643298)
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
long long ma[30][250001];
int main()
{
int n,m,p,q,k;
int i,j;
in>>n>>m;
for(i=1; i<=n; i++)
{
in>>ma[0][i];
}
for(i=1; i*2<=n; i++)
{
for(j=1; j<=n; j++)
{
ma[i][j]=ma[i-1][ma[i-1][j]];
}
}
while(m--)
{
in>>q>>p;
int ok=0;
while(p)
{
if(p%2==1)
{
q=ma[ok][q];
}
ok++;
p/=2;
}
out<<q<<'\n';
}
return 0;
}