Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

Problem hidden on 2013-07-09 22:55:03 by Mitch Schwartz

BWALL - The Great Wall Of Byteland

no tags 

   

In order to protect the southern border of Bytelandian Empire against intrusions by various nomadic groups, the Emperor of Byteland has decided to build a wall along the southern border. The best architect Johny is recruited for the task.

In order to minimise the cost of raw material, Johny is restricted to use only following two kinds of building blocks:
X     #
XX
The height of the wall is fixed and is 2 units, but the length of the wall varies. As a part of his job Johny needs to find out the number of ways he can construct the wall using above two types of building blocks where the length of the wall is specified. Write a program to help Johny.

Input Format:

The first line contains the number of test cases T followed by T lines. Each of the next lines contains an integer N representing the length of the wall.

Output Format:

Print T lines one for each test case, containing an integer that represents the number of ways of constructing the wall, modulo 1000000007.

Example:

Sample Input:
3
7
2
13

Sample Output: 655 5 272767 Constraints: 1<=T<=1000 1<=N<=10^9 Explanation of 2nd Test Case N=2 The wall can be constructed in following 5 ways: ## ##
X# XX
#X XX
XX X#
XX #X

hide comments
Federico Lebrón: 2013-05-26 02:16:47

No. It Is Better To Delete This Problem.

EDIT: Note the problem setter edited this comment, I did not type the above message.

Last edit: 2013-05-30 10:36:04
Francky: 2013-05-26 02:16:47

psetter(?) is playing with hidding/show messages. Instead of this little game, please do things I've asked. You should be more respectful with solvers of your problems.
(edit)--> I've make all messages visible.

Last edit: 2013-05-20 10:26:46
Federico Lebrón: 2013-05-26 02:16:47

I see you deleted all previous comments, including Francky's... could the test cases be put the way they were, and our solutions rejudged?
--ans(francky)--> Comments are not deleted, just hidden. psetter is unfair ; he saw that, but didn't act :-(

Last edit: 2013-05-19 06:46:18
Francky: 2013-05-26 02:16:47

@psetter : I ask you two things, and please do them correctly.
1) set exactly this problem as it was at start, and rejudge until first AC came back.
2) set a new problem if you have a different task.
--
It will remain hidden until that. Please make more consideration about users. It's not fair to change a problem after publishing : a problem must be ready when put in main problem set. We are not beta testers. Thanks for your comprehension.

Federico Lebrón: 2013-05-26 02:16:47

Um. This problem has absolutely nothing to do with the previous problem. Literally nothing.

Francky: 2013-05-26 02:16:47

@psetter : if you made some changes, you should alert users. It's better to have a good problem at first try. First solvers aren't your beta testers...
Please explain that you did. Problem hidden waiting for your answer.

The question is now change because of some reasons
Last

Last edit: 2013-05-16 23:09:12
Federico Lebrón: 2013-05-26 02:16:47

I had gotten AC yesterday. My bet is the test cases were broken in some way, and then rejudged.

Jacob Plachta: 2013-05-26 02:16:47

Is the data definitely correct? No one's gotten AC, and this probably surely doesn't have any special cases...

Federico Lebrón: 2013-05-26 02:16:47

I had an AC solution yesterday... now it's WA?

Mitch Schwartz: 2013-05-26 02:16:47

1) Why is the source limit 500k bytes instead of 50k bytes? Please change it.
2) In classical section, scoring must be binary. This is because a task with numeric score will count as challenge even if it is in classical section, the way SPOJ is currently set up. This looks like it might use partial scoring; if so, please move this to partial or change the scoring to binary. If HELPER is set up the same way, please also make the appropriate change.


Added by:Shivam Mishra
Date:2013-05-15
Time limit:2s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All