CSES - Aalto Competitive Programming 2024 - wk5 - Mon - Results
Submission details
Task:Sum of ones
Sender:aalto2024e_006
Submission time:2024-09-30 17:22:49 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11--details
#12--details
#13--details
#14--details
#15--details
#16--details
#17--details
#18--details
#19--details
#20--details
#21--details

Compiler report

input/code.cpp: In function 'long long unsigned int getNextLeftmostBit(long long int, long long int)':
input/code.cpp:27:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
   27 |     while (n < temp) {
      |            ~~^~~~~~

Code

#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <cmath>

using namespace std;




unsigned long long getLeftmostBit(long long n)
{
    long long m = 0;
    while (n > 1) {
        n = n >> 1;
        m++;
    }
    return m;
}


unsigned long long getNextLeftmostBit(long long n, long long m)
{
    unsigned long long temp = 1 << m;
    while (n < temp) {
        temp = temp >> 1;
        m--;
    }
    return m;
}

unsigned long long _countSetBits(unsigned long long n, long long m);


unsigned long long countSetBits(unsigned long long n)
{
   
    long long m = getLeftmostBit(n);


    return _countSetBits(n, m);
}

unsigned long long _countSetBits(unsigned long long n, long long m)
{

    if (n == 0)
        return 0;

    m = getNextLeftmostBit(n, m);

    if (n == ((unsigned long long)1 << (m + 1)) - 1)
        return (unsigned long long)(m + 1) * (1 << m);

    n = n - (1 << m);
    return (n + 1) + countSetBits(n) + m * (1 << (m - 1));
}


int main()
{
    long long x;
    cin >> x;
    cout << countSetBits(x) << endl;
    return 0;
}
 

Test details

Test 1

Verdict: ACCEPTED

input
1

correct output
1

user output
1

Test 2

Verdict: ACCEPTED

input
2

correct output
2

user output
2

Test 3

Verdict: ACCEPTED

input
3

correct output
4

user output
4

Test 4

Verdict: ACCEPTED

input
4

correct output
5

user output
5

Test 5

Verdict: ACCEPTED

input
5

correct output
7

user output
7

Test 6

Verdict: ACCEPTED

input
6

correct output
9

user output
9

Test 7

Verdict: ACCEPTED

input
7

correct output
12

user output
12

Test 8

Verdict: ACCEPTED

input
8

correct output
13

user output
13

Test 9

Verdict: ACCEPTED

input
9

correct output
15

user output
15

Test 10

Verdict: ACCEPTED

input
10

correct output
17

user output
17

Test 11

Verdict:

input
303021765044187

correct output
7250167017244884

user output
(empty)

Test 12

Verdict:

input
390977392667778

correct output
9400236781929604

user output
(empty)

Test 13

Verdict:

input
670904313808571

correct output
16399391652009372

user output
(empty)

Test 14

Verdict:

input
704275111916256

correct output
17252936460583174

user output
(empty)

Test 15

Verdict:

input
799807335176164

correct output
19646099779305746

user output
(empty)

Test 16

Verdict:

input
852012055430877

correct output
21005540865890493

user output
(empty)

Test 17

Verdict:

input
901305628563213

correct output
22232965316761961

user output
(empty)

Test 18

Verdict:

input
917427461591619

correct output
22650112032503064

user output
(empty)

Test 19

Verdict:

input
981787468874797

correct output
24322274256024775

user output
(empty)

Test 20

Verdict:

input
1000000000000000

correct output
24784747400675348

user output
(empty)

Test 21

Verdict:

input
989898989898989

correct output
24531282955144033

user output
(empty)