 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
怎么计算那么大的数啊?高精度吗,还是另有技巧?如果我没理解错题目的话~~ 应该是算N-1的所有组合数, 然后看是否能整除M. 如果能的话,就是一个答案. 比如题目给的2,3 3-1=2 2的排列数分别为 1,2,1 其中能整除2的就是第二个,对不对啊? 如果这样的话,10 000的排列数难算不说, 还得看是否能整除M.... 高手给点建义.谢谢. Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
