Pagini recente » Cod sursa (job #1524074) | Cod sursa (job #1140285) | Cod sursa (job #1802617) | Cod sursa (job #405010) | Cod sursa (job #867078)
Cod sursa(job #867078)
# include <iostream>
# include <fstream>
using namespace std;
int n, t[250000], a[19][250001], m;
ifstream f1("stramosi.in");
ofstream f2("stramosi.out");
int main ()
{
int i, k, j, x, h, c=1, t;
f1>>n; f1>>m;
for (i=1; i<=n; i++) f1 >>a[1][i];
int m;
for (k=2; k<=n; k++)
{ for (i=1; i<=n; i++) a[k][i]=a[k-1][a[k-1][i]];
}
for (j=1; j<=m; j++)
{ f1>> x>> h;
while (h>0)
{c=1; i=1;
while (c*2<=h) {c=c*2; i++;}
if (c==h) { f2<<a[i][x]; f2<<endl;}
else { x=a[i][x]; }
h=h-c;
}
}
return 0;
}