poj 3278 Catch That Cow

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int dp[maxn],n,k;
int main()
{
while(scanf("%d%d",&n,&k)!=EOF)
{
for(int i=0;i<=k;i++)
dp[i]=abs(n-i);
for(int i=n+1;i<=k;i++)
dp[i]=min(dp[i],min(dp[i/2+1]+2,min(dp[i-1]+1,dp[i/2]+1+(i&1))));
printf("%d\n",dp[k]);
}
return 0;
}