（南京区域资格赛）A-An Olympian Math Problem

Alice, a student of grade 6, 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! :

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 n.
It is guaranteed that 2≤n≤1018
.
Output
For each test case, print an integer S modulo n.
Sample Input
2
2
3
Sample Output
1
2

数据量这么大直接打表找规律

#include<iostream>
#include<cstdio>
using namespace std;
int main(){
    int T;
    while(~scanf("%d", &T)){
        long long n;
        while(T--){
            scanf("%lld", &n);
            printf("%lld\n", n-1); 
        }
    }
}