CSES - Aalto Competitive Programming 2024 - wk5 - Mon - Results
Submission details
Task:Sum of ones
Sender:aalto2024e_004
Submission time:2024-09-30 16:31:36 +0300
Language:C++ (C++17)
Status:READY
Result:ACCEPTED
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
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails

Code

// ~/.vim/cpp_template.cpp
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

#define REP(i,a,b) for (int i = a; i < b; i++)

// Type Aliases for 1D and 2D vectors with initialization
#define vi(n, val) vector<int>(n, val) // 1D vector of ints with size n, initialized to val
#define vll(n, val) vector<long long>(n, val) // 1D vector of long longs with size n, initialized to val
#define ll long long
#define vvi(n, m, val) vector<vector<int>>(n, vector<int>(m, val)) // 2D vector of ints (n x m), initialized to val
#define vvll(n, m, val) vector<vector<long long>>(n, vector<long long>(m, val)) // 2D vector of long longs (n x m), initialized to val


using namespace std;

template <typename T>
void pV(const std::vector<T>& vec, const std::string& label = "Vector") {
    std::cout << label << ": [ ";
    for (const auto& elem : vec) {
        std::cout << elem << " ";
    }
    std::cout << "]" << std::endl;
}


using namespace std;


void dfs(int s, vector<bool> *visited, vector<int> (*adj)[]) {
    if ((*visited)[s]) return;
    (*visited)[s] = true;
    // process node s


    for (auto u: (*adj)[s]) {
        dfs(u, visited, adj);
    }
}
/*
vector<int> adj[N];                                                          
vector<bool> visited(N, false);
int u, v;
for(int i = 0; i < M;i++){
    cin >> u >> v;
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
}
*/

long long csb(long long n) {
    long long cnt = 0;
    int k = 0;

    while ((1LL << k) <= n) {
        long long completeBlocks = n / (1LL << (k + 1));
        cnt += completeBlocks * (1LL << k);
        long long remaining = n % (1LL << (k + 1));
        cnt += max(0LL, remaining - (1LL << k) + 1);
        k++;
    }
    return cnt;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    // Your code starts here
    long long n;
    cin >> n;
    cout << csb(n) << 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: 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