“红旗杯“第十四届东北地区大学生程序设计竞赛 Color the blocks

找规律
Color the blocks
Problem Description
Given you an N∗N grid graph,you can color any block black or white,but you have to meet the condition:

For each block (x,y),it can’t be the same color as (x−3,y),(x−1,y+2),(x+1,y+2),(x+3,y).

You need to calculate the total number of options for coloring the N∗N grid graph.

Input
There are T test cases in this problem.

The first line has one integer T(1≤T≤105).

For every test case,the first line has one integer N(1≤N≤109).

Output
For every test case, output the answer in a line.

Sample Input
2
1
6

Sample Output
2
4

Source
"红旗杯"第十四届东北地区大学生程序设计竞赛

#include<bits/stdc++.h>

using namespace std;
int main(){
    int n,t;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        if(n==1) printf("2\n");
        if(n==2) printf("16\n");
        if(n==3) printf("32\n");
        if(n>=4) printf("4\n");
    }
    return 0;
}