Pagini recente » Cod sursa (job #1193788) | Cod sursa (job #2126902) | Cod sursa (job #2656706) | Cod sursa (job #2696172) | Cod sursa (job #1349713)
#include<fstream>
#include<iostream>
#include<vector>
using namespace std;
/*
void dfs(int nod)
{
vector<int>viz[n+1];
viz[nod]=1;
for(i=0;i<=T[nod].size;i++)
if(viz(T[nod][1]=1))
dfs(T[nod][1]);
}
*/
int main()
{
int n,Q,P,i,m;
ifstream f("stramosi.in");
f>>n>>m;
vector<int>T(n+1);
for(i=1;i<=n;i++)
f>>T[i];
for(i=1;i<=n;i++)
cout<<" "<<T[i];
ofstream g("stramosi.out");
for(i=1;i<=m;i++)
{
f>>Q>>P;
while(P)
{
P--;
Q=T[Q];
}
g<<Q<<endl;
}
f.close();
return 0;
}