CF 1423 J - Bubble Cup hypothesis 思维分析+函数转化

直接上讨论区老哥的解法！

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define re register
#define ls (o<<1)
#define rs (o<<1|1)
//#define m (l+r)/2
#define pb push_back
typedef pair<int,int> pii;
const double PI= acos(-1.0);
const int M = 1e5+7;
/*
int head[M],cnt=1;
void init(int n){cnt=1;for(int i=0;i<=n;i++)head[i]=0;}
struct EDGE{int to,nxt,w;}ee[M*2];
void add(int x,int y,int w){ee[++cnt].nxt=head[x],ee[cnt].w=w,ee[cnt].to=y,head[x]=cnt;}
*/
const int mod =1e9+7;
int main()
{

  	int t;
  	cin>>t;
  	while(t--){
  		ll m;
  		scanf("%lld",&m);
  		ll nm=m/2+1,ans=0;
  		//1,1,2,2,3,3,4,4,5,5
  		//1,2,3,4,5,6,7,8,9,10
  		//m=8,nm=5
  		//m=4,nm=3
		if(nm%2==0){
			ans=(nm/2+1)%mod*(nm/2%mod)%mod;
		}else{
			//cout<<nm<<" - "<<(1+nm/2)*nm/2<<" + "<<(nm+1)/2<<endl;
			ans=(nm/2+1)%mod*(nm/2%mod)%mod+(nm+1)/2%mod;
		}
		printf("%lld\n",ans%mod);
	}
	return 0;
}