不能用传统的排列,数会很大,
#include<iostream>
#include<cstdio>
using namespace std;
int find(int x)
{
//找x能被2整除的个数
int res = 0;
while(x%2==0){
res++;
x = x/2;
}
return res;
}
int main(){
int n,m;
while(scanf("%d%d",&n,&m)!=EOF){
if(n==0)break;
int sum = 0;
for(int i = n;i>n-m;i--)
{
sum+=find(i);//2的总个数几位后面连续0的个数
}
printf("%d\n",sum);
}
}