| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 41824 | Songgr | 二进制数数 | C++ | Wrong Answer | 1 MS | 248 KB | 279 | 2024-02-23 12:17:56 |
#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; }