提交时间:2024-02-23 12:17:56

运行 ID: 41824

#include <iostream> #include <bitset> using namespace std; int res; void dfs(int n){ while(n != 0){ if(n % 2){ res ++; } n = n/2; } } int main() { int l, r; cin >> l >> r; for(l; l <= r; l++){ dfs(l); } cout << res+2; return 0; }