C(n,m)模板

 1 #pragma comment(linker, "/STACK:1024000000,1024000000")
 2 #include <map>
 3 #include <queue>
 4 #include <vector>
 5 #include <string>
 6 #include <cstdio>
 7 #include <cstring>
 8 #include <iostream>
 9 #include <algorithm>
10 using namespace std;
11 #define maxn 105
12 #define mod 1000000007
13 #define ll long long
14 #define INF 0x7fffffff
15 int n, m, s;
16 ll gcd(ll a, ll b){return b ? gcd(b, a%b) : a;}
17 ll C(ll n, ll m)
18 {
19     m = min(m, n - m);
20     ll mul = 1, div = 1;
21     for (int i = 0; i < m; i++)
22     {
23         mul *= (n - i);
24         div *= (i + 1);
25         ll g = gcd(mul, div);
26         mul /= g, div /= g;
27     }
28     return mul / div;
29 }
30 int main(){
31     int cas = 1;
32     int t;
33     scanf("%d", &t);
34     while (t--){
35         scanf("%d", &n));
36 
37     }
38     /*while (~scanf("%d", &n)){
39         printf("%I64d\n", f[n]);
40     }*/
41     return 0;
42 }

View Code 2013-10-25 12:24:31

posted @ 2013-10-25 12:22 HaibaraAi 阅读(117) 评论(0) 收藏举报

刷新页面返回顶部