C++总是很神奇
2010/04
// 统计1的个数的有意思的方式
int count_bin_one(int x) {
return x? 1 + count_bin_one(x & (x - 1)): 0;
}2011/04
#include <cstdio>
int main () {
int i = 0;
int k = 100;
int a[2] = {1, 2};
int j = 3;
a[2] = 4;
a[3] = 5;
a[4] = 6;
printf("i = > %d\nj => %d\nk => %d\n", i, j, k);
printf("a[0] = > %d\na[1] => %d\n", a[0], a[1]);
printf("i:%u\nj:%u\nk:%u\na:%u\na[1]:%u\n\n", &i, &j, &k, a, &a[1]);
printf("a[2]:%u\na[3]:%u\na[4]:%u\n", &a[2], &a[3], &a[4]);
return 0;
}2011/04
2011/04
2010/05
Last updated
Was this helpful?