Pagini recente » Cod sursa (job #2512478) | Cod sursa (job #1217441) | Cod sursa (job #1732397) | Cod sursa (job #2372926) | Cod sursa (job #216678)
Cod sursa(job #216678)
#include<stdio.h>
#include<math.h>
long int matrice[20][250001];
int main()
{
long int n,m,i,q,p,k=1,raspuns;
FILE *pFile= fopen ("stramosi.in","r");;
FILE *pFileOut= fopen("stramosi.out","w");;
fscanf(pFile,"%ld %ld",&n,&m);
for(i=1;i<=n;i++)
fscanf(pFile,"%ld",&matrice[1][i]);
do
{k++;
for(i=1;i<=n;i++)
matrice[k][i]=matrice[k-1] [matrice[k-1][i]];
}while((long int)pow(2,k)<=n);
for(i=1;i<=m;i++)
{
fscanf(pFile,"%ld",&q);
fscanf(pFile,"%ld",&p);
k=0;
while((long int) pow(2,k)<=p) ++k;
if((long int) pow(2,k)<=p) --k;
raspuns=matrice[k+1][q];
p=p-pow(2,k);
while(p!=0)
{
k=0;
while((long int) pow(2,k)<=p) ++k;
if((long int) pow(2,k)<=p) --k;
raspuns=matrice[k+1][raspuns];
}
fprintf(pFileOut,"%ld \n",raspuns);
}
fclose(pFile);
fclose(pFileOut);
return 0;
}