题解 | #排列与二进制#
排列与二进制
https://www.nowcoder.com/practice/647fc23dc4e147328cc484e3aeb6cc2a
#include <bits/stdc++.h>
#define MAX 10000
using namespace std;
int main(){
int res[MAX];
int n,m,k,len,i,sum;
while(cin>>n>>m){
if(!n && !m)
break;
sum = 0;
for(int i = n; i >= n-m+1; i--){
int k = i;
while(k % 2 == 0){
sum++;
k /= 2;
}
}
cout<<sum<<endl;
}
}
投递网易等公司10个岗位 >