Codeforces Round #324 (Div. 2) 584B. Kolya and Tanya 组合数学
来源:互联网 发布:淘宝卖家后台无法登陆 编辑:程序博客网 时间:2024/05/16 18:45
解题报告: Codeforces Round #324 (Div. 2)
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).
A single line contains number n (1 ≤ n ≤ 105) — the number of the gnomes divided by three.
Print a single number — the remainder of the number of variants of distributing coins that satisfy Tanya modulo 109 + 7.
1
20
2
680
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):
题意:3n个人围成一个圈,ai,ai+n,ai+2n的和不能是6有多少种方案,
分析:找规律 组合数学( combinatorics)
总共的情况-不可能的情况=3^(3^n)-7^n;
解题报告: Codeforces Round #324 (Div. 2)
- Codeforces Round #324 (Div. 2) 584B. Kolya and Tanya 组合数学
- Codeforces Round #324 (Div. 2) B. Kolya and Tanya(组合数学)
- Codeforces Round #324 (Div. 2) B. Kolya and Tanya
- Codeforces Round #324 (Div. 2) B. Kolya and Tanya
- Codeforces Round #324 (Div. 2)B. Kolya and Tanya
- Codeforces Round #324 (Div. 2) B. Kolya and Tanya
- Codeforces Round #324 (Div. 2) B. Kolya and Tanya
- Codeforces 584 B. Kolya and Tanya (Codeforces Round #324 (Div. 2))
- Codeforces 584B Kolya and Tanya 【组合数学】
- CodeForces - 584B Kolya and Tanya (组合数学)
- Codeforces Round #324 B Kolya and Tanya
- Codeforces Round #324 (Div. 2)——B. Kolya and Tanya
- Codeforces Round #324 (Div. 2) B. Kolya and Tanya (快速幂)
- Codeforces Round #324 (Div. 2) B. Kolya and Tanya 思维题 数论
- Kolya and Tanya [组合数学]
- codeforces 584B Kolya and Tanya
- cf#324 Div.2 Problem B Kolya and Tanya
- 【Codeforces Round 324 (Div 2)B】【容斥】Kolya and Tanya 环上n个3元组至少有一组和不为6
- linux git branch 与 git format-patch的用法
- 一个=引发的血案
- 使用友盟SDK实现新浪微博登录
- iOS把文字转换成中文拼音
- Codeforces Round #324 (Div. 2) 584C. Marina and Vasya
- Codeforces Round #324 (Div. 2) 584B. Kolya and Tanya 组合数学
- win10 UWP读写文件
- 我的微信开发学习笔记(1):基础知识
- iOS界面编程-UIActionSheet
- list 函数 同时为多个变量赋值
- UINavigationBar美化
- 修改系统鼠标左右按键快速切换
- Python学习笔记<函数式编程>
- JavaScript高级程序设计第24章(最佳实践)