Description |
Sequential detector is a very important device in Hardware experiments. But it is very difficult for many students such as HeroWei. In nearest days, his teacher Miss Fang let him simulate sequence detector. But there many sequence here, and Miss Fang add the difficulty that when she gave HeroWei a sequence and a string, he must tell her how many strings here in this sequence. But now Miss Fang simplified the problem for HeroWei, she just gave Herowei a sequence and let HeroWei play a game with it. When a character comes, it must compare with the last one of sequence, if it's the same with the last one, the coming one should join into the string and become the last one of the sequence. Otherwise, all the characters in the sequence must change its value, 0 to 1 and 1 to 0, then the coming one add to its right side. Here is an example, if there is a sequence '110' and comes a character 0, the sequence becomes '1100' at last, if comes a character 1, the sequence become '0011' at last. It's very difficult for HeroWei to play the game. Can you help him? |
Input |
Each line contains a composed by a string of 0s and 1s.the input is ended by EOF. |
Output |
For each given sequence you just play with this string as descripted above. Output a line contains two integers, which are the number of 0s and 1s in the sequence after the game. |
Sample Input |
0 110 1111 1010 |
Sample Output |
1 0 3 0 0 4
———————————————————— #include <iostream> |
B.Sequential Game
最新推荐文章于 2023-08-25 12:14:01 发布