小明最近对算法比较感兴趣:他把这样的数字叫做幸运数:十进制的每一位相加的和等于二进制每一位相加的和!
我的做法是这样:package jd2;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int T;
Main m=new Main();
int count,scN,n;
while(sc.hasNextInt())
{
T=sc.nextInt();
n=0;
int[] num=new int[T];
for(int i=0;i<T;i++)
{
num[i]=sc.nextInt();
}
for(int j=0;j<T;j++)
{
scN=num[j];
count=0;
for(int i=1;i<=scN;i++)
{
if(m.f(i)==m.g(i))
count++;
}
num[n]=count;
n++;
if(n>=T)
{for(int i=0;i<T;i++)
System.out.println(num[i]+"\n");
n=0;
}
}
}
}
public int f(int x)
{
int count=0,returnN=0,num;
while(x>0)
{
num=x%10;
returnN+=num;
x=x/10;
}
return returnN;
}
public int g(int x)
{
int count=0;
while(x>0)
{
count++;
x=x&(x-1);
}
return count;
}
}