As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
考虑由所有正整数的二进制表示按递增顺序连接而成的无限二进制字符串 $I$：$I = \text{“}11011100 \dots \text{”}$。
给定一个二进制字符串 $A$。你的任务是找到最小的整数 $L$，使得 $A$ 是 $I[1 \dots L]$ 的后缀。
输入仅一行，包含二进制字符串 $A$，满足 $1 \le |A| \le 55$。
输出一行，包含一个整数：数字 $L$。
11
2
011011
42
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: