Pagini recente » Cod sursa (job #267812) | Cod sursa (job #2845565) | Cod sursa (job #3292099) | Cod sursa (job #166162) | Cod sursa (job #395151)
Cod sursa(job #395151)
#include <fstream>
using namespace std;
#define nmax 250010
#define pow(y) 1<<y
int A[20][nmax];
int n,m,i,j,k,p,q;
int main()
{
ifstream f("stramosi.in");
ofstream g("stramosi.out");
f>>n>>m;
for(i=1;i<=n;i++) f>>A[0][i];
k=1;
while(pow(k)<=n)
{
for(i=1;i<=n;i++)
A[k][i]=A[k-1][A[k-1][i]];
++k;
}
for(i=1;i<=m;i++)
{
f>>p>>q;
while(p&&q)
{
for(j=k;j>=0;j--)
if(pow(j)<=q)
{
p=A[j][p];
q-=pow(j);
}
g<<p<<endl;
}
}
return 0;
}