HDOJ 3398 String -- 组合数学

最新推荐文章于 2020-08-31 12:57:42 发布

randygx

最新推荐文章于 2020-08-31 12:57:42 发布

阅读量572

点赞数

分类专栏： ACM 文章标签：数学组合素数阶乘

ACM 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

http://blog.csdn.net/abcjennifer/article/details/5922270

下面是自己的代码，可以当求组合数的模板用

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
         #include 
         
           #include 
          
            #include 
           
             #include 
            
              #include 
             
               #include 
              
                #include 
               
                 #include 
                
                  #include 
                 
                   #include 
                  
                    #define mp make_pair #define MEMSET(a, b) memset(a, b, sizeof(a)) using namespace std; typedef unsigned int ui; typedef long long ll; typedef unsigned long long ull; typedef pair 
                   
                     pii; typedef vector 
                    
                      vi; typedef vi::iterator vi_it; typedef map 
                     
                       mii; typedef priority_queue 
                      
                        pqi; typedef priority_queue 
                       
                         , greater 
                        
                          > rpqi; const int MAX_N = 2000000; const int MOD = 20100501; int prime[150000]; int factor[150000]; int cnt = 0; bool num[MAX_N >> 1]; void cal_prime() { prime[cnt++] = 2; int k = (int)sqrt(MAX_N) >> 1, i; for (i = 0; i <= k; ++i) { if (!num[i]) { int t = (i << 1) + 3; prime[cnt++] = t; for (int j = (t * t - 3) >> 1; (j << 1) + 3 <= MAX_N; j += t) { num[j] = true; } } } while (i <= ((MAX_N - 3) >> 1)) { if (!num[i]) { prime[cnt++] = (i << 1) + 3; } ++i; } prime[cnt++] = 1000000000; } void cal_factor(int n, int k) { for (int i = 0; prime[i] <= n; ++i) { int tmp = n; while (tmp >= prime[i]) { factor[i] += tmp / prime[i] * k; tmp /= prime[i]; } } } int c_n_m(int n, int m) { int i, j; ll ans = 1; MEMSET(factor, 0); cal_factor(n, 1); cal_factor(m, -1); cal_factor(n - m, -1); for (i = 0; prime[i] <= n; ++i) { for (j = 0; j < factor[i]; ++j) { ans = ans * prime[i] % MOD; } } return (int)ans; } int main(int argc, char *argv[]) { cal_prime(); int t, n, m; cin >> t; while (t--) { cin >> n >> m; cout << (c_n_m(n + m, n) - c_n_m(n + m, n + 1) + MOD) % MOD << endl; } return 0; }