1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
|
using namespace std; #define ll long long int MOD=1000000007;
int sum[100000005]; int T,n; int tmp=0; ll x; int () { for(long long i=1;i<=100000000;i++) { x+=((i+1)*((i*i)%MOD+1))%MOD; sum[i] =(sum[i-1]+x)%MOD; } cin >> T; while(T--) { scanf("%d",&n); printf("%dn",sum[n]); } return 0; }
|
近期评论