HDU 2576 Another Sum Problem（含除式的同余模）

Another Sum Problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1015    Accepted Submission(s): 261

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

 

思路：由题知通项公式为n(n+1)/2，其前n项和为 Sn = n(n+1)(n+2)/6;

对于(a/b)%c = a % (b*c) / c;

所以Sn可以这样求：s1 = (n(n+1))% (20090524*6);余数里包含6是保证后面的式子可以被6整除。s2 = (s1*(n+2)/6)%20090524;

 

View Code

 1 #include <iostream>
 2 #include <cstdio>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int t;
 9     scanf("%d",&t);
10     while(t--)
11     {
12         __int64 n;
13         scanf("%I64d",&n);
14         if(n == 1)
15         {
16             printf("1\n");
17             continue;
18         }
19         __int64 ans = (n*(n+1))%(20090524*6);
20         ans = (ans*(n+2)/6)%20090524;
21         printf("%I64d\n",ans);
22     }
23     return 0;
24 }