Misinterpretation

Problem code: MISINTER

All submissions for this problem are available.

Chef's brother likes to put words in Chef's mouth. Chef hates it about him of course. He has decided to become extremely careful about what he speaks. Fortunately, he knows how his brother transforms the words, that Chef uses. He has decided to use only those words which remain the same even after his brother's transformation!

If Chef speaks an N letter word, his brother moves all the letters which are at even positions (assuming, numbering of positions starts from 1), to the beginning of the word; and the rest of the letters follow as they appeared in the word. Eg. abdef becomes beadf; cdcd becomes ddcc.

Chef wants to know how many words can he use, provided that each word is composed of exactly N lowercase letters of the English alphabet. They use an ancient language in Byteland, which allows all possible words within the above definition!

Input format

The first line contains the number T, the number of test cases. In the following lines, T test cases follow. Every test case is a single line, that contains a single positive integer, N, which is the length of the words that Chef wants to use.

Output format

For each test case, print the number of words of length N that Chef can use; that is, number of words, which remain the same after brother's transformation. Since the result can be quite large, output the result modulo 1000000007.

Constraints

1 ? T ? 100
1 ? N ? 100000

Sample input

3
1
14
45

Sample output

26
456976
827063120

Author: gamabunta
Date Added: 13-07-2011
Time Limit: 2 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC


Comments

can somebody give some more

bayer_villager @ 24 Jul 2011 10:42 PM
can somebody give some more test cases??

plz any one can tell me ,how

shriniwas814 @ 24 Jul 2011 10:47 PM
plz any one can tell me ,how can 26 be output for first case......

Chef can only use one letter

shilp_adm @ 24 Jul 2011 10:50 PM
Chef can only use one letter words. Any word he says is transformed according to his brother's algorithm, to what the word originally was. There are 26, one letter words, and Chef can use any of them!

Would anyone explain the

hacker007 @ 24 Jul 2011 11:00 PM
Would anyone explain the second case (if allowed) ?

Explanation of second test

anton_adm @ 24 Jul 2011 11:03 PM
Explanation of second test will give too much hints for the whole solution. So no. It's explanation can't published here.

@bayer_villager OK. I guess

anton_adm @ 24 Jul 2011 11:06 PM
@bayer_villager OK. I guess we can give the answer also for n=2 it is 26 (but again without explanation). Answer for n=3 and others contains some hints for the whole solution. So can't be provided here.

Got it :) Code is easy once

kaustubh.cool @ 24 Jul 2011 11:10 PM
Got it :) Code is easy once you understand the test cases

The contest said 12:30.. now

bhuwan.chopra @ 25 Jul 2011 12:18 AM
The contest said 12:30.. now it is ended after a sudden announcement when 5 mins were left :(

Can't i submit a solution

praveen_hp @ 29 Dec 2011 05:19 PM
Can't i submit a solution now? I've a solution..

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

CodeChef is a global programming communityCodeChef hosts online programming competitions