Pagini recente » Cod sursa (job #2229011) | Cod sursa (job #318256) | Cod sursa (job #2748505) | Cei mai harnici utilizatori infoarena | Cod sursa (job #1505822)
#include<stdio.h>
#include<queue>
FILE *in, *out;
int N,M;
#define MAX 250001
int D[18][MAX];
int main()
{
in = fopen("stramosi.in", "r");
out = fopen("stramosi.out", "w");
fscanf(in,"%d", &N);
fscanf(in, "%d", &M);
for (int i = 1;i <= N;++i)
fscanf(in,"%d", &D[0][i]);
int i, j;
for (i = 1;(1 << i) <= N;++i)
for (j = 1;j <= N;++j)
D[i][j] = D[i - 1][D[i - 1][j]];
int P, Q;
for (i = 1;i <= M;++i)
{
fscanf(in, "%d%d", &Q, &P);
for (j = 0;P;P >>= 1, ++j)
if (P & 1)
Q = D[j][Q];
fprintf(out, "%d\n", Q);
}
return 0;
}