Coloring Game (找规律+快速幂)

题目链接
David has a white board with 2×N grids.He decides to paint some grids black with his brush.He always starts at the top left corner and ends at the bottom right corner, where grids should be black ultimately.

Each time he can move his brush up(↑), down(↓), left(←), right(→), left up(↖), left down(↙), right up(↗), right down (↘) to the next grid.

For a grid visited before,the color is still black. Otherwise it changes from white to black.

David wants you to compute the number of different color schemes for a given board. Two color schemes are considered different if and only if the color of at least one corresponding position is different.

Input
One line including an integer n(0<n≤10⁹)

Output
One line including an integer, which represent the answer mod1000000007

样例输入1
2

样例输出1
4

样例解释1

样例输入2
3

样例输出2
12

样例解释2

题解:(如下图所示)

#include<bits/stdc++.h>
using namespace std;
const int N = 1e9 + 7;
int quick_pow(int a,int b){
	int res = 1;
	while(b){
		if(b & 1) res = res * 1ll * a % N;
		b >>= 1;
		a = a * 1ll * a % N;
	}
	return res;
}
int main(){
	ios :: sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	if(n == 1) cout << 1 << endl;
	else cout << 4 * 1ll * quick_pow(3,n - 2) % N << endl;
	return 0;
}