Problem 2107 Hua Rong Dao
Accept: 247 Submit: 555
Time Limit: 1000 mSec Memory Limit : 32768 KB
 Problem Description
Cao Cao was hunted down by thousands of enemy soldiers when he escaped from Hua Rong Dao. Assuming Hua Rong Dao is a narrow aisle (one N*4 rectangle), while Cao Cao can be regarded as one 2*2 grid. CrZ喎�"http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vc3MgZ2VuZXJhbCBjYW4gYmUgcmVnYXJkZWQgYXMgb25lIDEqMiBncmlkLlZlcnRpY2FsIGdlbmVyYWwKIGNhbiBiZSByZWdhcmRlZCBhcyBvbmUgMioxIGdyaWQuIFNvbGRpZXJzIGNhbiBiZSByZWdhcmRlZCBhcyBvbmUgMSoxIGdyaWQuIE5vdyBIdWEgUm9uZyBEYW8gaXMgZnVsbCBvZiBwZW9wbGUsIG5vIGdyaWQgaXMgZW1wdHkuPC9wPgo8cD48L3A+CjxwPlRoZXJlIGlzIG9ubHkgb25lIENhbyBDYW8uIFRoZSBudW1iZXIgb2YgQ3Jvc3MgZ2VuZXJhbCwgdmVydGljYWwgZ2VuZXJhbCwgYW5kIHNvbGRpZXIgaXMgbm90IGZpeGVkLiBIb3cgbWFueSB3YXlzIGNhbiBhbGwgdGhlIHBlb3BsZSBzdGFuZD88L3A+Cgo8aDI+PGltZyBzcmM9"http://www.2cto.com/uploadfile/Collfiles/20141206/20141206085529258.gif" alt="\"> Input
There is a single integer T (T≤4) in the first line of the test data indicating that there are T test cases.
Then for each case, only one integer N (1≤N≤4) in a single line indicates the length of Hua Rong Dao.
 Output
For each test case, print the number of ways all the people can stand in a single line.
 Sample Input
212
 Sample Output
018
 Hint
Here are 2 possible ways for the Hua Rong Dao 2*4. 
Source“高教社杯”第三届福建省大学生程序设计竞赛//用搜索来记录来统计有多少种情况
#include
#include
#include
#include
#include
#include
using namespace std;
#define MAXN 6
int vis[MAXN][MAXN];
int n,m;
int flag;
int ans;
bool f(int x,int y){
if(x>=n || x<0 || y>=4 || y<0){
return false;
}
return true;
}
void DFS(int con){
int i,j;
if(flag==1 && con==n*m){
ans++;
//flag = 0;
return ;
}
if(con > n*m){
return ;
}
for(int i=0;i
|
