Pagini recente » Cod sursa (job #615577) | Cod sursa (job #1583646) | Cod sursa (job #1052054) | Cod sursa (job #1668186) | Cod sursa (job #2901459)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, m, a[26][50001], q, p;
int main()
{
fin >> n >> m;
for (int i = 1; i <= n; i++)
{
a[0][i] = i;
fin >> a[1][i];
}
for (int i = 2; i <= 25; i++)
for (int j = 1; j <= n + 1; j++)
a[i][j] = a[i - 1][a[i - 1][j]];
for (int i = 0; i < m; i++)
{
fin >> q >> p;
int nr = 1;
while (p)
{
if (p%2)
q = a[nr][q];
nr++;
p=p/2;
}
fout << q << '\n';
}
return 0;
}