class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>= 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
};class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>= 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
};
class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>=class Solution {
public:
int lowbit(int n) {
int an = 0;
while(n) {
if((n & 1) == 1) {
an ++;
}
n >>= 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
};1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
};1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
}; 1;
}
return an;
}
vector<int> countBits(int n) {
vector<int> ans;
for(int i = 0; i <= n; i ++) {
ans.push_back(lowbit(i));
}
return ans;
}
};
本文含有隐藏内容，请 开通VIP 后查看