> For the complete documentation index, see [llms.txt](https://solutions.icpc.uclaacm.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://solutions.icpc.uclaacm.com/2021-tryout-solutions/tryout-1/c-bits.md).

# C: Bits

* Firstly, we can keep successively (integer) dividing the number by $$10$$ to obtain the previous states of the calculator.
* Now, for each such number, we need to count the number of ones in the binary representation, and find the maximum value among those counts.
* This is now the classic problem of **converting a number to its binary representation**. 
  * There are builtin functions to do this! `bin(x)` in Python, `Integer.toBinaryString(x)` in Java, and `bitset<32>(x).to_string()` in C++ all give you the binary representation of the number.

{% hint style="info" %}
C++ is amazing: `__builtin_popcount(x)` directly gives you the number of ones in the binary representation of the integer `x`!
{% endhint %}


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://solutions.icpc.uclaacm.com/2021-tryout-solutions/tryout-1/c-bits.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.