Another Sum Problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1223 Accepted Submission(s): 335
Problem Description
FunnyAC likes mathematics very much. He thinks mathematics is very funny and beautiful.When he solved a math problem he would be very happy just like getting accepted in ACM.Recently, he find a very strange problem.Everyone know that the sum of sequence from 1 to n is n*(n + 1)/2. But now if we create a sequence which consists of the sum of sequence from 1 to n. The new sequence is 1, 1+ 2, 1+2+3, .... 1+2+...+n. Now the problem is that what is the sum of the sequence from1 to 1+2+...+n .Is it very simple? I think you can solve it. Good luck!
Input
The first line contain an integer T .Then T cases followed. Each case contain an integer n (1 <= n <= 10000000).
Output
For each case,output the sum of first n items in the new sequence. Because the sum is very larger, so output sum % 20090524.
Sample Input
3 1 24 56
Sample Output
1 2600 30856
//推导公式的题目
#include<iostream> using namespace std; #define N 20090524 int main() { #ifndef ONLINE_JUDGE freopen("testin.txt","r",stdin); #endif __int64 T,n,s; scanf("%I64d",&T); while(T--) { scanf("%I64d",&n); if(n==1) { printf("1\n"); continue; } n=n%N; s=(n*(n+1))/2%(N*3); s=(s*(n+2))/3%N; printf("%I64d\n",s); } return 0; }