Pagini recente » Cod sursa (job #2552439) | Cod sursa (job #1064926) | Cod sursa (job #79508) | Cod sursa (job #3175451) | Cod sursa (job #1756348)
#include <iostream>
#include <fstream>
#include <vector>
#include <iterator>
#include <limits>
#include <stack>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n,m;
int a[250001];
stack <int>s;
int solve(int x,int k)
{
int curent,times=0;
while(times!=k && x!=0)
{
x=a[x];
times++;
}
return x;
}
int main()
{
int x;
f >> n >> m;
for(int i=1;i<=n;i++)
{
f >> x;
a[i]=x;
}
int k;
for(int i=1;i<=m;i++)
{
f>> x >> k;
g << solve(x,k) << "\n";
}
return 0;
}