Cod sursa(job #3148560)
Utilizator | Data | 2 septembrie 2023 16:39:42 | |
---|---|---|---|
Problema | Stramosi | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int NMAX = 250003;
int tata[NMAX];
int main() {
int n, m;
fin >> n >> m;
for (int i =1 ; i <= n; i++)
fin >> tata[i];
while (m--) {
int q, p;
fin >>q >> p;
while (p--) {
q = tata[q];
}
fout << q << '\n';
}
return 0;
}