Pagini recente » Cod sursa (job #3192626) | Cod sursa (job #1564294) | Cod sursa (job #1349394) | Cod sursa (job #254303) | Cod sursa (job #3136781)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int dp[20][250005];
int str(int nod, int ordin)
{
int i = 0;
while (ordin != 0)
{
if (ordin % 2)
nod = dp[i][nod];
ordin /= 2;
++ i;
}
return nod;
}
int main()
{
int n, m;
fin >> n >> m;
for (int i = 1; i <= n; ++ i)
fin >> dp[0][i];
for (int i = 1; (1 << i) <= n; ++ i)
for (int j = 1; j <= n; ++ j)
if (dp[i - 1][j])
dp[i][j] = dp[i - 1][dp[i - 1][j]];
for (int i = 1; i <= m; ++ i)
{
int q, p;
fin >> q >> p;
fout << str(q, p);
}
return 0;
}