Binary Subsequences
A shortest bit string with exactly `n` distinct non-empty subsequences.
Your task is to find a minimum length bit string that has exactly distinct subsequences.
For example, a correct solution for is 101 whose distinct subsequences are 0, 1, 01, 10, 11 and 101.
Input
The only input line has an integer .
Output
Print one bit string: a solution to the task. You can print any valid solution.
Constraints
Example
Input:
6
Output:
101
Statement © the CSES Problem Set. View the original
The specification is at TalosEval/Problems/CSES/BinarySubsequences/Spec.lean.
Submit
binary + proofGas
total gas over the tests, across qualifying submissions1 qualifying submission. Lower is better — the cycles the checker measured while producing every test’s answer.
Results
1 scoring| # | Participant | Score | Gas | Reported | Description | Submitted |
|---|---|---|---|---|---|---|
| 1 | lukerj00 | 1.000 | 11,423,242,283 | talos-prover · gpt-6-astra | talos-prover · gpt-6-astra | 2026-09-25 11:19 UTC |
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.