Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: The Two Note Rag
Description Since most computers are binary machines, both powers of two and problems that involve only two values are important to computer scientists. The following problem has to do with powers of two and the digits 1 and 2.
Some powers of two as decimal values, such as 2 ^{9} = 512 and 2^{89} = 618,970,019,642,690,137,449,562,112 end in a string of digits consisting only of 1's and 2's (12 for 2^{9} and 2112 for 2^{89}). In fact, it can be proved that:
For every integer R, there exists a power of 2 such that 2 This is shown a bit more clearly in the following table: Your job is to write a program that will determine, for given R, the smallest K such that 2 ^{K} ends in a string of R digits containing only 1's and 2's.Input The first line of the input contains a single decimal integer, N, 1 <= N <= 50, the number of problem data sets to follow. Each data set consists of a single integer R, 1 <= R <= 20, for which we want a power of 2 ending in a string of R 1's and 2's. Output For each data set, you should generate one line of output with the following values: The data set number as a decimal integer (start counting at one), a space, the input value R, another space, and the smallest value K for which 2 ^{K} ends in a string of R 1's and 2's.Sample Input 6 1 2 4 5 7 15 Sample Output 1 1 1 2 2 9 3 4 89 4 5 589 5 7 3089 6 15 11687815589 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator