Pagini recente » Cod sursa (job #1511746) | Cod sursa (job #1582664) | Cod sursa (job #2186544) | Istoria paginii runda/53543gf | Cod sursa (job #3209853)
#include <bits/stdc++.h>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
int stramos[20][250001];
const int LogMaxN = 19;
int main()
{
int n, m;
in >> n >> m;
for( int i = 1; i <= n; i++ )
in >> stramos[0][i];
for( int i = 1 ; i <= LogMaxN; i++ )
for( int j = 1; j <= n; j++)
stramos[i][j] = stramos[i - 1][stramos[i-1][j]];
while( m-- ){
int a, b;
in >> a >> b;
for( int i = 0; i < LogMaxN; i++ )
if( b & (1 << i) )
a = stramos[i][a] ;
out << a << "\n" ;
}
return 0;
}