F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Sit sit sit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 655    Accepted Submission(s): 336


Problem Description
There are $N$ chairs in a row and and no one on the chairs.Each chair is blue or red.Then comes $N$ students one by one numbered 1,2,3,..,N.For each student, he will find an empty chair to sit on.He wonĄŻt sit on the chair if the chair is satisfied the following three conditions.

1.The chair has both left and right adjacent chairs.
2.The left and right adjacent chairs are not empty.
3.The left and right adjacent chairsĄŻ color are different.
If the current student canĄŻt find a chair to sit on, he will go away.

For each student, he may have many choices of chairs to sit on. Your task is to find the number of distinct situations that all students have sat on a chair. As the answer can be rather large, find remainder after dividing the number by $1000000007({10}^{9}+7)$.
 

Input
There are several test cases.
In each test case:
The first line contains a integer $N(1\leq N\leq 100)$.The second line contains $N$ integers.Each integer is either 0 or 1.Integer 0 means blue and 1 means red.
 

Output
For each test case, output the remainder of division of the resulting number by $1000000007({10}^{9}+7)$.
 

Sample Input
3 1 0 0 4 1 0 0 1
 

Sample Output
4 8
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 10:07:30, Gzip enabled