Computer TransformationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9644 Accepted Submission(s): 3624 Problem DescriptionA sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the computer simultaneously tranforms each digit 0 into the sequence 1 0 and each digit 1 into the sequence 0 1. So, after the first time step, the sequence 0 1 is obtained; after the second, the sequence 1 0 0 1, after the third, the sequence 0 1 1 0 1 0 0 1 and so on. InputEvery input line contains one natural number n (0 < n ≤1000). OutputFor each input n print the number of consecutive zeroes pairs that will appear in the sequence after n steps. Sample Input2 3 Sample Output1 1 SourceAC代码 |
Computer Transformation
猜你喜欢
转载自blog.csdn.net/zfq17796515982/article/details/88541606
今日推荐
周排行