#include<cstdio>
#include<iostream>
#include<algorithm>
#define debu
using namespace std;
const int maxn=1e4+50;
int n;
int a[maxn];
int solve(int dep,int maxd,int now)
{
if(dep>maxd) return 0;
if(now==n)
{
printf("%d\n",dep);
return 1;
}
if((now<<(maxd-dep))<n||now<=0) return 0;
a[dep]=now;
for(int i=0; i<=dep; i++)
{
if(solve(dep+1,maxd,a[dep]+a[i])) return 1;
if(solve(dep+1,maxd,a[dep]-a[i])) return 1;
}
return 0;
}
int main()
{
#ifdef debug
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif // debug
while(scanf("%d",&n)==1&&n)
{
for(int maxd=0;; maxd++)
if(solve(0,maxd,1)) break;
}
return 0;
}
题目地址:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4120
题解:迭代加深。d表示当前深度,maxd表示最大深度,则当前最大的数乘2^(maxd-d)后仍小于n,则剪枝。