All submissions for this problem are available.
Lets define a good binary string. We call a binary string good, if after merging all the consecutive equal characters, the resulting string is palindrome. For example, "00110" is good, because after the merging step it will become "010".
Given a binary string S, you have to find two values:
3 11 1001 1011
1 2 2 4 2 5
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP 6.3, JAVA, PYTH|
Fetching successful submissions
If you are still having problems, see a sample solution here.