Pagini recente » Cod sursa (job #2263709) | Cod sursa (job #185019) | Cod sursa (job #1824074) | Cod sursa (job #294947) | Cod sursa (job #1571862)
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int a[20][250010],q,p,n,m;
int putere(int x)
{
int aux=0;
while(x>1)
{
x/=2;
aux++;
}
return aux;
}
int main()
{
f>>n>>m;
for(int i=1; i<=n; i++)
f>>a[1][i];
for(int i=2; i<=19; i++)
for(int j=1; j<=n; j++)
{
a[i][j]=a[i-1][a[i-1][j]];
}
for(int i=1; i<=n; i++) a[0][i]=i;
for(int i=1; i<=m; i++)
{
f>>q>>p;
while(p)
{
int l;
l=putere(p);
p=p-(1<<l);
//nu merge decat la puterile lui 2, logic
q=a[l+1][q];
}
g<<q;
g<<'\n';
}
return 0;
}