Pagini recente » Cod sursa (job #2906170) | Cod sursa (job #536121) | Cod sursa (job #506988) | Cod sursa (job #932692) | Cod sursa (job #3230834)
#include <fstream>
using namespace std;
int a[20][300000];
int nr,i,j,q,p,n,m;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int main()
{
fin>>n>>m;
for (i=1; i<=n; ++i)
fin>>a[0][i];
nr=1; i=n;
while (i!=0)
{
for (j=1; j<=n; ++j)
a[nr][j]=a[nr-1][a[nr-1][j]];
i=i/2;
nr++;
}
for (i=1; i<=m; ++i) {
nr = 0;
fin >> p >> q;
while (q != 0 && p != 0) {
if (q % 2 == 1)
p = a[nr][p];
nr++;
q = q / 2;
}
fout << p;
}
return 0;
}