Pagini recente » Cod sursa (job #912156) | Cod sursa (job #834989) | Cod sursa (job #654563) | Cod sursa (job #244280) | Cod sursa (job #1219021)
#include <fstream>
using namespace std;
int a[19][250001];
int main()
{
ifstream fi("stramosi.in");
ofstream fo("stramosi.out");
int n, m, p, q;
fi >> n >> m;
for (int i = 1; i <= n; i++)
fi >> a[0][i];
for (int i = 1; i <= 18; i++)
for (int j = 1; j <= n; j++)
a[i][j] = a[i - 1][a[i - 1][j]];
while (m-- > 0)
{
fi >> q >> p;
for (int k = 0; p; p /= 2, k++)
if (p % 2)
q = a[k][q];
fo << q << '\n';
}
}