Pagini recente » Cod sursa (job #1703481) | Cod sursa (job #555880) | Cod sursa (job #1201212) | Cod sursa (job #960923) | Cod sursa (job #1674625)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int N = 250003;
const int M = 300003;
int n, m, t[20][N];
int raspuns( int p, int q )
{
int i = 0;
while( q != 0 )
{
if ( q % 2 != 0 )
p = t[i][p];
i++;
q/=2;
}
return p;
}
int main()
{
int i, j,p ,q;
in >> n >> m;
for ( i = 1; i <= n; i++ )
in >> t[0][i];
for ( i = 1; (1<<i) <= n; i++ )
{
for ( j = 1; j <= n; j++ )
t[i][j] = t[i-1][ t[i-1][j] ];
}
for ( i = 1; i <= m; i++ )
{
in >> p >> q;
out << raspuns(p, q)<<'\n';
}
return 0;
}