CodeForces 185A Plant
来源:互联网 发布:js如何设置div的高 编辑:程序博客网 时间:2024/05/24 06:48
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.
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 %I64d specifier.
Output
Print a single integer — the remainder of dividing the number of plants that will point “upwards” in n years by 1000000007 (109 + 7).
input
1
output
3
input
2
output
10
#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;long long n,ans,ans1;#define mod 1000000007long long qpow(int k,long long b){ long long p; if(b==0) return 1; else if(b%2==0) { p=qpow(k,b/2)%mod; return p*p%mod; } else if(b%2==1) return k*qpow(k,b-1)%mod;}int main(){ while(scanf("%I64d",&n)!=EOF) { if(n==0)printf("1\n"); else { ans=qpow(2,n-1); ans1=qpow(2,2*n-1); printf("%I64d\n",(ans+ans1)%mod); } } return 0;}
- Codeforces 185A Plant
- codeforces 185A Plant
- CodeForces 185A - Plant
- CodeForces - 185A Plant
- CodeForces 185A Plant
- Codeforces 185 A Plant
- CodeForces Round #118 (185A) - Plant
- 【快速幂】 CodeForces 185A Plant
- CodeForces - 185A Plant 矩阵快速幂
- Codeforces 185A Plant 普通快速幂取模
- codeforces 185A. Plant(规律)
- codeforces 185A Plant(矩阵快速幂)
- codeforces 185A. Plant 矩阵快速幂
- CodeForces 185A. Plant (矩阵快速幂)
- codeforces 185A Plant(矩阵快速幂)
- codeforces #185 A Plant(矩阵快速幂+递推)
- CodeForces 185A. Plant(矩阵快速幂)
- CodeForces 185A. Plant(矩阵快速幂) 构造
- Android 流量优化(一):模块化流量统计
- 【USACO】Milking Cows
- java servlet跳转ftl
- 《程序员的自我修养》之体系结构
- 1068 Bash游戏 V3(每三个一循环NP法)
- CodeForces 185A Plant
- 定积分的技巧
- C#程序设计基础——字符串
- git学习(2)
- 【USACO】Transformations
- Hash函数 纪中3094 数学
- android获得屏幕高度和宽度四种方法
- 优化3——数据库语句分析
- 【UVa】208 - Firetruck