Pagini recente » Cod sursa (job #52373) | Cod sursa (job #3121969) | Cod sursa (job #2920105) | Cod sursa (job #2838479) | Cod sursa (job #53573)
Cod sursa(job #53573)
#include <stdio.h>
#include <iostream>
#include <math.h>
using namespace std;
#define NMAX 250001
int N[NMAX];
FILE *in = fopen("stramosi.in", "r"), *out = fopen("stramosi.out", "w");
int n, m;
int cautarec(int nr, int times)
{
//printf("\n%d %d\n",nr,times);
if (times==1)
{
//printf("\naiaci %d\n",N[nr-1]);
return N[nr-1];
}
else
return cautarec(N[nr-1],times-1);
}
int main ()
{
int temp1, temp2;
fscanf(in, "%d %d", &n, &m);
for ( int i = 0; i != n; ++i )
{
fscanf(in, "%d", &N[i]);
//printf("%d-", N[i]);
}
for ( int i = m-1; i != -1; --i )
{
fscanf(in, "%d %d", &temp1, &temp2);
fprintf(out, "%d\n", cautarec(temp1, temp2));
}
return 0;
}