码迷,mamicode.com
首页 > 其他好文 > 详细

Bell(矩阵快速幂+中国剩余定理)

时间:2015-03-20 01:18:14      阅读:241      评论:0      收藏:0      [点我收藏+]

标签:

Bell

Time Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
Appoint description: 

Description

What? MMM is learning Combinatorics!? 
Looks like she is playing with the bell sequence now: 
bell[n] = number of ways to partition of the set {1, 2, 3, ..., n} 

e.g. n = 3: 
{1, 2, 3} 
{1} {2 3} 
{1, 2} {3} 
{1, 3} {2} 
{1} {2} {3} 
so, bell[3] = 5 

MMM wonders how to compute the bell sequence efficiently. 
 

Input

T -- number of cases 
for each case: 
  n (1 <= n < 2^31) 
 

Output

for each case: 
  bell[n] % 95041567 
 

Sample Input

6
1
2
3
4
5
6
 

Sample Output

1
2
5
15
52
203
 
 

 

先留着!

Bell(矩阵快速幂+中国剩余定理)

标签:

原文地址:http://www.cnblogs.com/yuyixingkong/p/4352285.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!