Pagini recente » Cod sursa (job #1805890) | Diferente pentru implica-te/arhiva-educationala intre reviziile 27 si 28 | Algoritmul lui Dinic | Cod sursa (job #3284476) | Cod sursa (job #1796252)
#include <stdio.h>
#include <stdlib.h>
int str[250001][17];
inline int put2(int k)
{
int i=1,put=2;
while(k>0)
{
if(k%2==0){
k/=2;
put=put*put;
}
else {
k--;
i=i*put;
}
}
return i;
}
int main()
{
int n,m,j,i,k,st,q;
FILE*fi,*fo;
fi=fopen("stramosi.in","r");
fo=fopen("stramosi.out","w");
fscanf(fi,"%d%d",&n,&m);
for(i=1;i<=n;i++)
{
fscanf(fi,"%d",&str[i][0]);
}
for(i=1;i<=n;i++)
{
for(j=1;j<17;j++)
str[i][j]=str[str[i][j-1]][j-1];
}
for(i=0;i<m;i++)
{
fscanf(fi,"%d%d",&k,&st);
while(st>0)
{
q=17;
while(put2(q)>st)
q--;
st-=put2(q);
k=str[k][q];
if(k==0)
st=0;
}
fprintf(fo,"%d\n",k);
}
fclose(fi);
fclose(fo);
return 0;
}