Pagini recente » Cod sursa (job #2987873) | Cod sursa (job #3266219) | Cod sursa (job #1983662) | Borderou de evaluare (job #1572175) | Cod sursa (job #108452)
Cod sursa(job #108452)
#include <fstream.h>
int main()
{ long long n,m,i,p,q,t[250];
ifstream f("stramosi.in");
ofstream g("stramosi.out");
f>>n>>m;
for (i=1;i<=n;i++) f>>t[i];
for (i=1;i<=m;i++)
{ f>>q>>p;
while (p>0&&q>0)
{ if (p>10)
{ q=t[t[t[t[t[t[t[t[t[t[q]]]]]]]]]];
p=p-10;
}
else {
q=t[q];
p--;}
}
g<<q<<'\n';
}
f.close();
g.close();
return 0;
}