1 条题解
-
0
C :
/* * ===================================================================================== * * Filename: 902-1.c * * Description: hahhahah * * Version: 1.0 * Created: 2013/9/2 21:01:28 * Revision: none * Compiler: gcc * * Author: mdk-vim.cpp-c (mdk), mengdaikun@gmail.com * Company: cjluacm-vim-mdk * * ===================================================================================== */ #include<stdio.h> #include<string.h> #include<stdlib.h> #include<math.h> int numberof1_total(unsigned int n) { unsigned int ret = 0; while(n) { if(n & 1) ret++; n = n >>1; } return ret; } int main() { // freopen("a.in","r",stdin); int n; while(~scanf("%d",&n)) { printf("%d\n",numberof1_total(n)); } return 0; }
C++ :
#include <stdio.h> int NumberOf1_Solution2(int i) { int count = 0; unsigned int flag = 1; while(flag) { if(i & flag) count ++; flag = flag << 1; } return count; } int main() { int n; while(scanf("%d",&n)!=EOF) printf("%d\n",NumberOf1_Solution2(n)); return 0; }
Java :
import java.util.*; import java.io.*; import java.math.*; public class Main{ public static Scanner cin=new Scanner(System.in); public static void main(String []args){ int n; int ans; while(cin.hasNext()){ n=cin.nextInt(); String s=Integer.toBinaryString(n); ans=0; for(int i=0;i<s.length();i++){ if(s.charAt(i)=='1'){ ans++; } } System.out.println(ans); } } }
- 1
信息
- ID
- 1987
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者