您当前位置：首页 > php开源 > 综合技术 > CodeForces 185A. Plant（矩阵快速幂）

CodeForces 185A. Plant（矩阵快速幂）

来源：程序员人生发布时间：2015-04-23 08:04:55 阅读次数：2833次

题目链接：http://codeforces.com/problemset/problem/185/A

Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle plants: three of them will point "upwards" and one will point "downwards". After another year, each triangle plant divides into four triangle plants: three of them will be directed in the same direction as the parent plant, and one of them will be directed in the opposite direction. Then each year the process repeats. The figure below illustrates this process.

$\text{[math]}$

Help the dwarfs find out how many triangle plants that point "upwards" will be in n years.

Input

The first line contains a single integer n (0?≤?n?≤?1018) ― the number of full years when the plant grew.

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64dspecifier.

Output

Print a single integer ― the remainder of dividing the number of plants that will point "upwards" in n years by 1000000007 (109?+?7).

Sample test(s)

input
1

output
3

input
2

output
10

Note

The first test sample corresponds to the second triangle on the figure in the statement. The second test sample corresponds to the third one.

PS:

上3角个数：△-> 3*△ +1*

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 萌凤代码生成器&&解码器 ver.1.3

下一篇 RHEL6安装python包tornado

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点