牛客网

最新推荐文章于 2020-09-11 00:36:32 发布

笨鸟1号

最新推荐文章于 2020-09-11 00:36:32 发布

阅读量708

点赞数 1

分类专栏： acm 数论文章标签： acm 牛客网多校联盟签到题

本文链接：https://blog.csdn.net/henu_1710252529/article/details/81590850

版权

acm 同时被 2 个专栏收录

49 篇文章 0 订阅

订阅专栏

数论

3 篇文章 0 订阅

订阅专栏

链接：https://www.nowcoder.com/acm/contest/146/G
来源：牛客网

Niuniu likes mathematics. He also likes drawing pictures. One day, he was trying to draw a regular polygon with n vertices. He connected every pair of the vertices by a straight line as well. He counted the number of regions inside the polygon after he completed his picture. He was wondering how to calculate the number of regions without the picture. Can you calculate the number of regions modulo 1000000007? It is guaranteed that n is odd.

输入描述:

The only line contains one odd number n(3 ≤ n ≤ 1000000000), which is the number of vertices.

输出描述:

Print a single line with one number, which is the answer modulo 1000000007.

#include <iostream>
#define ll long long
using namespace std;
const ll mod=1000000007;
//多边形所有不相邻的角连线之后的区域个数，
ll multi(ll a,ll b)
{
      ll ans=0;
      while(b)
      {
            if(b&1) ans=(ans+a)%mod;
            a=(a+a)%mod;
            b>>=1;
      }
      return ans;
}
ll powq(ll a,ll b)
{
      ll ans=1;
      while(b)
      {
            if(b&1) ans=multi(ans,a)%mod;
            
            a=multi(a,a)%mod;
            b>>=1;
      }
      return ans;
}
int main()
{
    int n;
   while(cin>>n){
         int niyuan=41666667;
         ll x=((24-42*n+23*powq(n,2)-6*powq(n,3)+powq(n,4))*niyuan)%mod;
         cout<<(x+mod)%mod<<endl;
   }

    return 0;
}