CodeForces 166E Tetrahedron

这题是个规律题，我的好友们有用python跑出来规律的

有用离散数学的关系矩阵计算出来的，与自己看出来的

我用了dp…………

int main() {
    LL ans=0; int n; cin>>n;
    for (int i=2; i<=n; ++i) {
        if (i%2==0) { ans= (ans+1) *3%MOD; }
        else { ans= (ans-1) *3%MOD; }
    }
    cout<<ans<<endl;
    return 0;
}//本题规律

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
const int maxn=1e7+5;
int dp[maxn][5];
int main() {
    int n; scanf ("%d",&n);
    memset (dp,0,sizeof (dp) );
    dp[0][0]=1;
    for (int i=1; i<=n; i++) {//走了i步
        for (int j=0; j<4; j++) {
            for (int k=0; k<4; k++) {//另外3个点
                if (j==k) { continue; }
                dp[i][j]+=dp[i-1][k];
                if (dp[i][j]>=MOD) { dp[i][j]%=MOD; } //累加另外三个点的种数
            }
        }
    }
    cout<<dp[n][0]<<endl;//走n步刚好到0的种数
    return 0;
}