Pagini recente » Cod sursa (job #586735) | Cod sursa (job #805789) | Cod sursa (job #2845950) | Cod sursa (job #1949748) | Cod sursa (job #2213212)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int a[250005][20];
int n,m,mmax;
void Prec()
{
for(int i=1;i<=n;i++)
fin>>a[0][i];
for(int i=1;i<=mmax;i++)
for(int j=1;j<=n;j++)
{
a[i][j]=a[i-1][a[i-1][j]];
}
}
void Query(int q,int p)
{
for(int i=mmax;i>=0;i--)
{
if(p&(1<<i))
{
q=a[i][q];
p=p-(1<<i);
cout<<q<<" "<<p<<"\n";
}
}
cout<<"\n";
fout<<q<<"\n";
}
int main()
{
int p,q;
fin>>n>>m;
mmax=1;
while(n>(1<<mmax))
mmax++;
Prec();
for(int i=1;i<=m;i++)
{
fin>>q>>p;
Query(q,p);
}
return 0;
}