1598: TomCat的环（快速幂+染色问题）

1598: TomCat的环
Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 108 Solved: 28
[Submit][Status][Web Board]
Description

TomCat有一个环（如图）有N个单元，并且有4中颜色。他希望把环的每一个单元格都染上颜色，但是相邻的两个单元格颜色不能相同。他想知道一共有几种染色方法

Input

输入单元格数N,N<=100000。

Output

输出染色总数对1000000007取余的结果。

Sample Input

1
2

Sample Output

4
12

HINT

Source
/*
环形，区域数n，颜色种类m,涂色方法总数ans
m = 4;
n = 1, ans= 4 = m
n = 2, ans = 4 * 3 = 12 = m *(m-1)
n = 3,ans = 4 * 3 * 2 = 24
n = 4,ans = 84
//
n = 4,至少可用2种颜色，最多4颜色来图，

1. m = 2,相当于只有两个区域（同色的看成一块区域），C(4,2) * A(2,2) = 6 * 2 = 12
2. m = 3, 2 * C(4,3) * A(3,3) = 8 * 6 = 48
3. m = 4, C(4,4) * A(4,4) = 1 * 24 = 24
   所以n = 4, ans = 12 + 48 + 24 = 84;
   //
   n = 2,ans = 12 = 3^2 + 3
   n = 3,ans = 24 = 3^3 -3
   n = 4,ans = 84 = 3^4 + 3
   …
   推出，对于n > 1,
   n为奇数，ans = (m-1)^n - (m-1)
   n为偶数，ans = (m-1)^n + (m-1)

*/
Ac_code:

#include <stdio.h>
#define LL long long
const LL mod = 1e9 + 7;
LL quickPow(LL a,LL b)
{
    LL ans = 1;
    while(b)
    {
        if(b&1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}
int main()
{
    LL N;
    while(~scanf("%lld",&N))
    {
        LL res;
        if(N == 1)
            res = 4;
        else 
        {
            if(N % 2 == 0)
                res = (quickPow(3,N) + 3) % mod;
            else
                res = (quickPow(3,N) - 3) % mod;
        }
        printf("%lld\n",res);
    }
    return 0;
}