- 博客(4)
- 收藏
- 关注
RSS订阅原创 SOJ 3137: Simple Computing _容斥原理
Time Limit: 2000 MS Memory Limit: 65536 KDescriptionGiven n integers x1 x2 ... xn, you should count how many intergers from 1 to m that can be divided by at least one of them.InputThe first
2012-02-28 22:11:52
687
原创 HDU 4135：Co-prime 容斥原理求(1,m)中与n互质的数的个数
Co-primeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 121 Accepted Submission(s): 56Problem DescriptionGiven a number N, you ar
2012-02-28 21:28:25
5882
4
转载 容斥原理(转载http://www.cppblog.com/vici/archive/2011/09/05/155103.html)
这篇文章发表于http://e-maxx.ru/algo/inclusion_exclusion_principle，原文是俄语的。由于文章确实很实用，而且鉴于国内俄文资料翻译的匮乏，我下决心将其翻译之。由于俄语对我来说如同乱码，而用Google直接翻译中文的话又变得面目全非，所以只能先用Google翻译成英语，再反复读，慢慢理解英语的意思，实在是弄得我头昏脑胀。因此在理解文章意思然后翻译成中文的
2012-02-28 19:36:09
3084
原创 FZU 1607：Greedy division
Problem 1607 Greedy division Accept: 339 Submit: 1301Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionOaiei has inherited a large sum of wealth recently; this tre
2012-02-27 22:07:32
462
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人