Pagini recente » Cod sursa (job #278409) | Cod sursa (job #1069517) | Cod sursa (job #361857) | Cod sursa (job #695117) | Cod sursa (job #3134249)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, m, p, q, i, j;
int stramosi[22][250001];
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; i++)
{
fin >> stramosi[1][i];
}
for (int j = 2; (1 << (j - 1)) <= n; j++)
for (int i = 1; i <= n; i++)
stramosi[j][i] = stramosi[j - 1][stramosi[j - 1][i]];
for(int i = 0; i < m; i++)
{
fin >> q >> p;
for (j = 1; j <= (int)log2(n); j++)
if (p & (1 << (j - 1)))
q = stramosi[j][q];
fout << q << endl;
}
fin.close();
fout.close();
return 0;
}