Pagini recente » Cod sursa (job #2347896) | Cod sursa (job #7393) | Cod sursa (job #1178065) | Cod sursa (job #1863722) | Cod sursa (job #616653)
Cod sursa(job #616653)
#include<stdio.h>
#define maxn 250010
int tati[maxn];
int n,m;
void dfs(int nod,int cnt,int val)
{
if(cnt==val) {printf("%d\n",nod); return;}
else
{
cnt++;
if(tati[nod]==0) {printf("0\n"); return;}
else
dfs(tati[nod],cnt,val);
}
}
void solve()
{
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
int a,b;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d",&tati[i]);
for(int i=1;i<=m;i++)
{
scanf("%d %d",&a,&b);
dfs(a,0,b);
}
}
int main()
{
solve();
}