Pagini recente » Cod sursa (job #2738230) | Cod sursa (job #1584638) | Cod sursa (job #1716663) | Cod sursa (job #1867218) | Cod sursa (job #3183068)
#include <fstream>
int par[18][250001];
int main() {
std::ifstream fin("stramosi.in");
std::ofstream fout("stramosi.out");
int n, m;
fin >> n >> m;
for (int i = 1; i <= n; i++)
fin >> par[0][i];
for (int i = 1; (1 << i) <= n; i++)
for (int j = 1; j <= n; j++) {
int k = par[i - 1][j];
par[i][j] = par[i - 1][k];
}
for (int i = 1; i <= m; i++) {
int q, p;
fin >> q >> p;
int stramos = q;
for (int j = 0; (1 << j) <= p; j++)
if (p & (1 << j))
stramos = par[j][stramos];
fout << stramos << '\n';
}
return 0;
}