HAPPY HOLI (SET II)
All submissions for this problem are available.
Leonardo of Pisa goes out on the day "HOLI" wearing a checked shirt. After having a good time he returns with colors all over his shirt. And now he applies the his concept of Fibonacci here as well. You know how Genius men were.
He cuts his shirt int a M*M checks, such that M is of the form 2N. Each check on his shirt has got a single color (Exactly one). The jth check on the ith row has got the same color as the (i+j)th check of the jth row. NOTE : (i+j) is always modulo M
Your task is to determine the maximum possible colors on his shirt.
T, the number of test cases, followed by T lines.
Each line containing the positive integer 0<N<50000
T lines of output, each line contain the positive integer, denoting the count of maximum possible colors on his shirt
Input: 1 1 Output: 2
|Time Limit:||0.696833 sec|
|Source Limit:||5000 Bytes|
|Languages:||C, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS|
Fetching successful submissions