LanQiaoTestCodes/二进制中1的个数2.java

21 lines
411 B
Java
Raw Normal View History

2023-04-23 12:30:47 +00:00
package LanQiaoOJ;
import java.util.Scanner;
public class <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1<EFBFBD>ĸ<EFBFBD><EFBFBD><EFBFBD>2 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
/*
* <EFBFBD><EFBFBD><EFBFBD>ö<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ʒ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
* 1-BigInteger
* 2-toString<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Сд<EFBFBD><EFBFBD><EFBFBD><EFBFBD>toUpperCase()--<EFBFBD><EFBFBD><EFBFBD>ش<EFBFBD>д
* 3-bitCount
* Integer.person*/
int count=Integer.bitCount(n);
System.out.print(count);
}
}