Cod sursa(job #2865278)
Utilizator | Data | 8 martie 2022 17:58:06 | |
---|---|---|---|
Problema | Stramosi | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int nmax = 25005;
int n, m;
int v[nmax], tata[nmax];
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; i ++)
{
fin >> v[i];
tata[i] = v[i];
}
int p, q;
while(m--)
{
fin >> p >> q;
while(q--)
p = tata[p];
fout << p << '\n';
}
return 0;
}