Pagini recente » Cod sursa (job #114916) | Cod sursa (job #380981) | Cod sursa (job #76564) | Cod sursa (job #1237122) | Cod sursa (job #304980)
Cod sursa(job #304980)
#include<fstream.h>
#include<math.h>
int main()
{int (*b)[250000]=new int[20][250000],a[250000],k;
int i,j,m,n,p,q;
ofstream g("stramosi.out");
ifstream f("stramosi.in");
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
b[1][i]=a[i];
k=2;
while(pow(2,k)<=n){
for(i=1;i<=n;++i) b[k][i]=a[b[k-1][i]];
++k;
}
for(i=1;i<=m;i++)
{f>>q>>p;
g<<b[p][q]<<'\n'; }
f.close();
g.close();
return 0;
}