Pagini recente » Cod sursa (job #3270876) | Cod sursa (job #3228339) | Cod sursa (job #1507116) | Cod sursa (job #2577637) | Cod sursa (job #2704609)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, m, p, q;
int d[21][100005];
int Calc(int p, int q)
{
for(int i = 20; i >= 0; --i)
{
if(p & (1 << i))
{
q = d[i][q];
p -= (1 << i);
}
}
return q;
}
int main()
{
int i, x, j;
fin >> n >> m;
for(i = 1; i <= n; ++i)
{
fin >> x;
d[0][i] = x;
}
for(i = 1; i <= 20; ++i)
{
for(j = 1; j <= n; ++j)
d[i][j] = d[i - 1][d[i - 1][j]];
}
for(i = 1; i <= m; ++i)
{
fin >> q >> p;
fout << Calc(p, q) << "\n";
}
fin.close();
fout.close();
return 0;
}