[BAILIAN] hihoCoder Challenge 35 register

Ended

Participants:163

Verdict:Accepted
Submitted:2018-08-26 18:31:18

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
#include<iostream>  
using namespace std;  
long long a,t,n;
long long fac(long long);  
int main()  
{  
    cin>>a>>t;
    for(int i=1;i<=a;i++)
    {
        cin>>n; 
        cout<<"Case #"<<i<<": "<<fac(n)<<endl;  
    }
    return 0;  
}  
long long fac(long long x)  
{  
    long long f;  
    if(x==0 || x==1)  
        f=1;  
    else  
        f=fac(x-1)*x%t;  
    return f;  
}  
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX