CodeForces - 584B Kolya and Tanya （组合数学）

CodeForces - 584B Kolya and Tanya Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u Submit Status Description Kolya loves putting gnomes at the circle table and giving them coins, and Tanya loves studying triplets of gnomes, sitting in the vertexes of an equilateral triangle. More formally, there are 3n gnomes sitting in a circle. Each gnome can have from 1 to 3 coins. Let's number the places in the order they occur in the circle by numbers from 0 to 3n - 1, let the gnome sitting on the i-th place have ai coins. If there is an integer i (0 ≤ i < n) such that ai + ai + n + ai + 2n ≠ 6, then Tanya is satisfied. Count the number of ways to choose ai so that Tanya is satisfied. As there can be many ways of distributing coins, print the remainder of this number modulo 109 + 7. Two ways, a and b, are considered distinct if there is index i (0 ≤ i < 3n), such that ai ≠ bi (that is, some gnome got different number of coins in these two ways). Input A single line contains number n (1 ≤ n ≤ 105) — the number of the gnomes divided by three. Output Print a single number — the remainder of the number of variants of distributing coins that satisfy Tanya modulo 109 + 7. Sample Input Input 1 Output 20 Input 2 Output 680 Hint 20 ways for n = 1 (gnome with index 0 sits on the top of the triangle, gnome 1 on the right vertex, gnome 2 on the left vertex):  Source Codeforces Round #324 (Div. 2) //题意： 有3*n个人坐在一个圆桌旁边，现在他们每个人都有3个硬币，现在他们各自拿出任意的硬币摆放，要求不能出现 ai + ai + n + ai + 2n = 6,的情况，问总共有几种排法？ //思路： 就是个找规律的题，没什么好说的，规律是pow(3,3*n)-pow(7,n); 说一下7的由来：因为是3个人，所以他们的组合为， 1   2   3 1   3   2 2   1   3 2   3   1 3   1   2 3   2   1 2   2   2 AC代码： #include<cstdio> #include<cstring> #include<algorithm> #include<iostream> #include<cmath> #include<map> #include<queue> #include<stack> #define INF 0x3f3f3f3f #define ull unsigned lonb long #define ll long long #define IN __int64 #define N 10010 #define M 1000000007 using namespace std; ll ks_mod(ll n,ll k) { ll ans=1; while(k) { if(k&1) ans=ans*n%M; n=n*n%M; k>>=1; } return ans%M; } int main() { ll n,m,ans; while(scanf("%lld",&n)!=EOF) { m=3*n; ans=ks_mod(3,m); ans=(ans+M-ks_mod(7,n))%M; printf("%lld\n",ans); } return 0; }