Created
November 5, 2015 11:07
-
-
Save anonymous/6f7b23ce23fe05c9772b to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <string.h> | |
#include <stdio.h> | |
using namespace std; | |
#define N 100010 | |
long long mod_pow(int a,int n,int p) | |
{ | |
long long ret=1; | |
long long A=a; | |
while(n) | |
{ | |
if (n & 1) | |
ret=(ret*A)%p; | |
A=(A*A)%p; | |
n>>=1; | |
} | |
return ret; | |
} | |
long long factorial[N]; | |
void init(long long p) | |
{ | |
factorial[0] = 1; | |
for(int i = 1;i <= p;i++) | |
factorial[i] = factorial[i-1]*i%p; | |
//for(int i = 0;i < p;i++) | |
//ni[i] = mod_pow(factorial[i],p-2,p); | |
} | |
long long Lucas(long long a,long long k,long long p) | |
{ | |
long long re = 1; | |
while(a && k) | |
{ | |
long long aa = a%p;long long bb = k%p; | |
if(aa < bb) return 0; | |
re = re*factorial[aa]*mod_pow(factorial[bb]*factorial[aa-bb]%p,p-2,p)%p; | |
a /= p; | |
k /= p; | |
} | |
return re; | |
} | |
int main() | |
{ | |
int t; | |
cin >> t; | |
while(t--) | |
{ | |
long long n,m,p; | |
cin >> n >> m >> p; | |
init(p); | |
cout << Lucas(n+m,m,p) << "\n"; | |
} | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment