nput
Output
Sample Input
2
Sample Output
2
Data Constraint
解析:这里推荐一个很好的找规律方法:先打一个暴力程序输出多个结果,规律很显而易见,ans=2^(n-1),快速幂可以求出结果
#include <iostream>
using namespace std;
const int N=1e9+7;
long long ksm (long long a,long long b)
{
long long base=a,ans=1;
while (b!=0)
{
if (b&1!=0)
{
ans*=base;
ans%=N;
}
base*=base;
base%=N;
b>>=1;
}
return ans%N;
}
int main()
{
long long n;
cin>>n;
n-=1;
cout<<ksm(2,n);
}