显示代码纯文本
#include<bits/stdc++.h>
using namespace std;
int n,m,s,a[222],ans[1111];
bool dfs(int s,int p){
if(s>m||p<=0||(p<<(m-s))<n) return 0;
if(p==n) return 1;
a[s]=p;
for(int i=0;i<=s;i++){
if(dfs(s+1,p+a[i])) return 1;
if(dfs(s+1,p-a[i])) return 1;
}
return 0;
}
int main(){
freopen("pow_cal.in","r",stdin);
freopen("pow_cal.out","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);
while(cin>>n){
if(!n) break;
if(ans[n]){
cout<<ans[n]<<endl;
continue;
}
m=0;a[0]=1;
for(;1;m++){
if(dfs(0,1)){
ans[n]=m;
cout<<m<<endl;
break;
}
}
}
return 0;
}