Cod sursa(job #1898961)
| Utilizator | Data | 2 martie 2017 13:58:19 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
#define nmax 250020
int n,m,nod,niv;
int x[20][nmax];
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>x[0][i];
for(int i=1;(1<<i)<=n; i++)
for(int j=1; j<=n; j++)
x[i][j]=x[i-1][x[i-1][j]];
for(int i=1; i<=m; i++){
fin>>nod>>niv;
for(int p=0;(1<<p)<=niv; p++)
if(niv&(1<<p))
nod=x[p][nod];
fout<<nod<<"\n";}
return 0;
}
