【CF 185A】Plant----矩阵快速幂

最新推荐文章于 2023-10-21 08:30:00 发布

原创最新推荐文章于 2023-10-21 08:30:00 发布 · 153 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#【CF 185A】Plant

矩阵快速幂专栏收录该内容

3 篇文章

订阅专栏

本文探讨了一种奇特的三角形植物生长模式，该植物每年分裂为四个子植物，其中三个保持原有方向，一个指向相反方向。文章提供了一个算法解决方案，用于计算n年后指向“向上”的三角形植物数量，并通过模运算优化了大数处理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Plant

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).

Examples
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.

题解：→ 这里

Code:

/*
作者：jialileng
日期：2019年9月29日 
*/
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll mod=1e9+7;
ll n;
ll q(ll a,ll nn)
{
	a=a%mod;
	ll res=1;
	while(nn)
	{
		if(nn&1)res=(res*a)%mod;
		nn>>=1;
		a=a*a%mod;
	}
	return res;
}
int main()
{
	scanf("%lld",&n);
	if(n==0){
		puts("1");
		return 0; 
	}
	ll ans1=q(4,n);
	ll ans2=((q(2,n)-1+mod)%mod*(q(2,n-1)+mod)%mod)%mod;
	ll ans=(ans1%mod-ans2%mod+mod)%mod;
	printf("%lld\n",ans);
	return 0;
 }