CodeForces 166E Tetrahedron

题意：有一个整四面体，从顶点D出发，经过k个点恰好回到D点，求路线数量

链接：http://codeforces.com/problemset/problem/166/E

思路：预处理DP，dp[n][4],第一维表示经过的步数，第二维表示点的序号(1,2,3,4分别对应A,B,C,D)，dp[i+1][k] = dp[i][0] + dp[i][1] + dp[i][2] + dp[i][3] - dp[i][k]，用longlong会MLE，所有用int+for循环处理

注意点：无

以下为AC代码：

#	Author	Problem	Lang	Verdict	Time	Memory	Sent	Judged
10042583	Practice: luminous11	166E - 29	GNU C++11	Accepted	686 ms	156568 KB	2015-02-27 12:40:25	2015-02-27 12:40:25

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
//const double pi = acos(-1);
//Problem B
int dp[10000005][4] = { 0 };
const int MOD = 1000000007;
int main()
{
    clr ( dp, 0 );
    dp[1][0] = dp[1][1] =dp[1][2] = 1;
    for ( int i = 1; i <= 10000005; i ++ ){
        for ( int j = 0; j < 4; j ++ ){
            for ( int k = 0; k < 4; k ++ ){
                if ( j != k ){
                    dp[i][j] += dp[i-1][k];
                    dp[i][j] %= MOD;
                }
            }
        }
    }
    int n;
    while ( cin >> n ){
        cout << dp[n][3] << endl;
    }
    return 0;
}