Pagini recente » Cod sursa (job #2448081) | Cod sursa (job #2213977) | Cod sursa (job #2957735) | Cod sursa (job #1421848) | Cod sursa (job #3231263)
#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int main()
{
int n,m;
fin >> n >> m;
vector<vector<int>> v(20, vector<int>(n + 1));
for (int i = 1; i <= n; ++i)
{
fin >> v[0][i];
}
for (int i = 1; i < 20; ++i)
{
for (int j = 1; j <= n; j += 1)
{
v[i][j] = v[i - 1][v[i - 1][j]];
}
}
for (int i = 1; i <= m; ++i)
{
int x, y;
cin >> x >> y;
int exponent = 0;
/// facem descompunerea lui in baza 2 si se calculeaza cel de al 2^exponent stramos
while (y)
{
if (y % 2 == 1)
{
x = v[exponent][x];
}
exponent += 1;
y /= 2;
}
fout << x << '\n';
}
return 0;
}