HDU 3123 GCC【同余模定理】

Problem Description
The GNU Compiler Collection (usually shortened to GCC) is a compiler system produced by the GNU Project supporting various programming languages. But it doesn’t contains the math operator “!”.
In mathematics the symbol represents the factorial operation. The expression n! means “the product of the integers from 1 to n”. For example, 4! (read four factorial) is 4 × 3 × 2 × 1 = 24. (0! is defined as 1, which is a neutral element in multiplication, not multiplied by anything.)
We want you to help us with this formation: (0! + 1! + 2! + 3! + 4! + … + n!)%m

Input
The first line consists of an integer T, indicating the number of test cases.
Each test on a single consists of two integer n and m.

Output
Output the answer of (0! + 1! + 2! + 3! + 4! + … + n!)%m.

Constrains
0 < T <= 20
0 <= n < 10^100 (without leading zero)
0 < m < 1000000

Sample Input
1
10 861017

Sample Output
593846

Source
2009 Asia Wuhan Regional Contest Online

Recommend
lcy | We have carefully selected several similar problems for you: 3125 3127 3126 3124 3118

至于>m的数字的阶乘，自然不会留下余数。
百万位以上的阶乘不必计算。
至于剩下的，根据同余定理即可得。

#include<iostream>
#include<cstring>
using namespace std;
#define ll long long int
int main()
{
    char n[105];
    ll m;
    int T;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%s%lld", n, &m);
        int len = strlen(n);
        if (len >= 7)
            len = 6;
        ll cnt = 0;
        for (int i = 0; i < len; i++)
        {
            cnt = cnt * 10 + n[i] - '0';
        }
        ll ans = 0, t = 1;
        for (int i = 1; i <= cnt+1; i++)
        {
            ans = (ans + t) % m;
            if (!t)
                break;
            t = t*i%m;
        }
        printf("%lld\n", ans);
    }
    return 0;
}