I love cube

最新推荐文章于 2022-03-04 09:45:10 发布

Bold!

最新推荐文章于 2022-03-04 09:45:10 发布

阅读量313

点赞数

本文链接：https://blog.csdn.net/srh20/article/details/119006111

版权

I love cube

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 2805 Accepted Submission(s): 770

Problem Description

Give you a cube with a side length of n-1. Find the number of equilateral triangles with three points on the cube point. Each side must be parallel to a certain surface of Oxy, Oxz, Oyz. Now you need to count how many such triangles there are.Each point can only be on the boundary or inner point of the cube, and the three coordinates x, y, and z of each point must be integers.

Input

The first line contains an integer T(T<=1e5) . Then T test cases follow.

Each test case contains a single Integer n(0<=n<=1e18).

If n=0, output 0

Output

For each case, print an integer, which is the answer modulo 109+7

Sample Input

2 1 2

Sample Output

思路：由题意知，要求等边三角形的数量，每个立方体有八个顶点，所以有8个等边三角形。等价于求立方体的数量。

又因为n的范围为0- 1e18

所以需要用到模板：a*b%p

ll mul(ll a,ll b,ll p){
   ll ans=0;
   while(b){
       if(b&1) ans=(ans+a)%p;
       a=a*2%p;
       b>>=1;
   }
   return ans;
}

代码如下：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
ll mul(ll a,ll b){
   ll ans=0;
   while(b){
       if(b&1) ans=(ans+a)%mod;
       a=a*2%mod;
       b>>=1;
   }
   return ans;
}
int main(){
   int t,n;
   cin>>t;
   while(t--){
       cin>>n;
       if(n==0||n==1) cout<<"0"<<endl;//特判
       else{
           n--;
           cout<<mul(n,n)%mod*mul(n+1,n+1)%mod*2%mod<<endl;
       }
   }
   return 0;
}