Pagini recente » Cod sursa (job #79147) | Cod sursa (job #2238256) | Cod sursa (job #2466396) | Cod sursa (job #1745895) | Cod sursa (job #676533)
Cod sursa(job #676533)
#include<iostream.h>
#include<fstream.h>
long n , a[21][250001] , m , q , p;
int main()
{
long i,j;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
f>>n>>m;
for( i = 1 ; i<= n ; i++ )
f>>a[0][i];
for( i = 1 ; i <= 20 ; i++ )
for( j = 1 ; j<= n ; j++ )
a[i][j] = a[i-1][a[i-1][j]];
for( i = 1 ; i<= m ; i++ )
{
f>>q>>p;
int y = 0;
while(p)
{
if(p%2)
{
q = a[y][q];
}
y++;
p=p/2;
}
g<<q<<endl;
}
return 0;
}