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

Code

#!/usr/bin/env python3

import sys
import math
import collections
import itertools

input = sys.stdin.read

# Define input versions
def input_list():
    """Returns a list of integers from a single input line"""
    return list(map(int, input().split()))

def input_int():
    """Returns a single integer from input"""
    return int(input())

def input_str():
    """Returns a single string from input"""
    return input().strip()

def print_output(output):
    """Efficiently prints output"""
    sys.stdout.write(str(output) + "\n")


# Math Util
def is_prime(n):
    """Returns True if n is a prime number, False otherwise"""
    if n < 2:
        return False
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            return False
    return True


# Function to count the number of 1 bits from 1 to n
def count_one_bits(n):
    count = 0
    power_of_2 = 1
    
    # Traverse over each bit position
    while power_of_2 <= n:
        # Count full cycles of '0's and '1's in current bit position
        full_cycles = (n + 1) // (power_of_2 * 2)
        remainder = (n + 1) % (power_of_2 * 2)
        
        # Add number of '1's from full cycles
        count += full_cycles * power_of_2
        
        # Add '1's from the remainder part
        if remainder > power_of_2:
            count += remainder - power_of_2
        
        # Move to the next bit position
        power_of_2 *= 2
    
    return count

def main():
    # Input
    n = int(input().strip())

    # Output the total number of 1 bits from 1 to n
    print(count_one_bits(n))

if __name__ == "__main__":
    main()

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: ACCEPTED

input
303021765044187

correct output
7250167017244884

user output
7250167017244884

Test 12

Verdict: ACCEPTED

input
390977392667778

correct output
9400236781929604

user output
9400236781929604

Test 13

Verdict: ACCEPTED

input
670904313808571

correct output
16399391652009372

user output
16399391652009372

Test 14

Verdict: ACCEPTED

input
704275111916256

correct output
17252936460583174

user output
17252936460583174

Test 15

Verdict: ACCEPTED

input
799807335176164

correct output
19646099779305746

user output
19646099779305746

Test 16

Verdict: ACCEPTED

input
852012055430877

correct output
21005540865890493

user output
21005540865890493

Test 17

Verdict: ACCEPTED

input
901305628563213

correct output
22232965316761961

user output
22232965316761961

Test 18

Verdict: ACCEPTED

input
917427461591619

correct output
22650112032503064

user output
22650112032503064

Test 19

Verdict: ACCEPTED

input
981787468874797

correct output
24322274256024775

user output
24322274256024775

Test 20

Verdict: ACCEPTED

input
1000000000000000

correct output
24784747400675348

user output
24784747400675348

Test 21

Verdict: ACCEPTED

input
989898989898989

correct output
24531282955144033

user output
24531282955144033