Pagini recente » Cod sursa (job #2125529) | Cod sursa (job #1359024) | Cod sursa (job #2621151) | Cod sursa (job #1880847) | Cod sursa (job #1146756)
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int MAX_N = 250000;
int d[18][MAX_N+1], n, m;
int log2(int x)
{
if(x == 1)
{
return 0;
}
int nr = 0;
while(x != 1)
{
x /= 2;
nr++;
}
return nr;
}
int main()
{
int i, j, log;
in >> n >> m;
for(j = 1; j <= n; j++)
{
in >> d[0][j];
}
log = log2(n);
for(i = 1; i <= log; i++)
{
for(j = 1; j <= n; j++)
{
d[i][j] = d[i-1][d[i-1][j]];
}
}
int q, p;
for(j = 1; j <= m; j++)
{
in >> q >> p;
i = 0;
while(p != 0)
{
if(p%2 != 0)
{
q = d[i][q];
}
i++;
p /= 2;
}
out << q << "\n";
}
return 0;
}