Pagini recente » Cod sursa (job #475754) | Cod sursa (job #2619395) | Cod sursa (job #1860155) | Cod sursa (job #2974765) | Cod sursa (job #2325553)
#include <bits/stdc++.h>
using namespace std;
int n , m , i , dp[40][250005] , p , t , x ,str;
int main()
{
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
fin >> n >> m;
for(i = 1; i <= n; i++)
{
fin >> dp[0][i];
}
for(p = 1; (1 << p) < 25; p++)
{
for(i = 1; i <= n; i++)
{
dp[p][i] = dp[p-1][dp[p-1][i]];
}
}
for(t = 1; t <= m; t++)
{
fin >> x >> str;
while(str)
{
int lg = log2(str);
x = dp[lg][x];
str = str - (1 << lg);
// cout << str << "\n";
}
fout << x << "\n";
}
return 0;
}