简单数学训练—C
来源:互联网 发布:什么软件类似象牙社区 编辑:程序博客网 时间:2024/05/17 05:59
Description
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).
Sample Input
1
3
2
10
Hint
The first test sample corresponds to the second triangle on the figure in the statement. The second test sample corresponds to the third one.
规律是(1+2^n)*2^n / 2
快速幂裸题
#include <stdio.h>#include <math.h>long long fast_pow(int a, long long n){ if(n == 0) return 1 % 1000000007; if(n & 1) return a * fast_pow(a, n-1) % 1000000007; long long p = fast_pow(a, n / 2); return p * p % 1000000007;}int main(){ long long n; while(scanf("%lld", &n)!=EOF){ if( n ){ long long mods = 0; mods = (fast_pow(2,2*n-1) + fast_pow(2,n-1))% 1000000007;// mods = ((fast_pow(4,n) + fast_pow(2,n))/ 2) % 1000000007; printf("%lld\n", mods); } else printf("1\n"); }}
- 简单数学训练—C
- 简单数学训练-B
- 简单数学训练-A
- 10.5——10.26 组合数学训练
- 一个简单数学小游戏C语言代码
- Codefroces 32C (简单模拟+数学)
- C语言简单函数应用:数学计算
- 数学专题训练2
- 数学专题训练3
- 数学专题训练4
- 数学训练----数论Sum
- TJU训练赛—C
- 训练指南——数学专题一的总结
- 周六日常训练,背包dp,树形dp,简单dp以及很多数学?
- Objective-C学习笔记(四)——OC实现最简单的数学运算
- 简单数学
- 1154: 【C语言训练】邮票组合问题*__简单题
- HPUoj 题目1019 【C语言训练】尼科彻斯定理(水题,数学)
- nyoj832 合并游戏(状态压缩DP)
- 一个函数指针调用的问题
- 委托和事件的区别
- POJ1364基本的查分约束问题
- 黑马程序员—java基础语言简介
- 简单数学训练—C
- 给JTextArea添加滚动条
- netcdf install document
- c++之继承
- 超市O2O,学会利用APP
- TestFlight被收购了,那我们怎么使用呢?
- 系统分析师上午试题笔记 软件工程一
- poj1509最小表示法
- iOS开发使用半透明模糊效果方法整理