An Olympian Math Problem（ACM-ICPC 2018 南京赛区网络预赛）

最新推荐文章于 2021-08-22 07:42:46 发布

luer9

最新推荐文章于 2021-08-22 07:42:46 发布

阅读量341

点赞数

本文链接：https://blog.csdn.net/qq_40046426/article/details/82312886

版权

Alice, a student of grade 66, is thinking about an Olympian Math problem, but she feels so despair that she cries. And her classmate, Bob, has no idea about the problem. Thus he wants you to help him. The problem is:

We denote k!k!:

k! =1×2×⋯×(k−1)×k

We denote SS:

S = 1×1!+2×2!+⋯+ (n - 1) * (n-1)!

Then S module n is ____________

You are given an integer n.

You have to calculate S modulo n.

Input

The first line contains an integer T(T≤1000), denoting the number of test cases.

For each test case, there is a line which has an integer nn.

It is guaranteed that 2≤n≤1e18.

Output

For each test case, print an integer SS modulo nn.

Hint

The first test is: S=1×1!=1, and 1 modulo 2 is 1.

The second test is:S=1×1!+2×2!=5 , and 5 modulo 3 is 2.

样例输入复制

2
2
3

样例输出复制

1
2

题目来源

ACM-ICPC 2018 南京赛区网络预赛

当时不知道打表找规律，学长说直接输出 n-1 ，，当时还有点懵逼

嗯。学长好强啊，我好菜，

ac代码：

#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#define ll long long
using namespace std;
ll n;
/*
ll ac(ll a)
{
    ll sum=1;
    ll ans=0;
    for(int i=1;i<=a;i++)
    {
        sum=sum*i%n;
        ans=(ans%n+sum*i%n)%n;
    }
    return ans;
}
*/
int main()
{
    ios::sync_with_stdio(false);
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        cout<<n-1<<endl;
    }return 0;
}