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.
给定一个二进制字符串 $S$。你可以执行任意次数以下操作：
你能执行的最大操作次数是多少？
一个二进制字符串 $S$ ($1 \le |S| \le 5 \times 10^6$)。
一个整数，即答案。
10100010011001011111
5
0000010101100110101101010110000110100111000010010111111100101101110101000111101111010101010010101010
58
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: