容斥定理和鸽巢原理
1sanguine
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
鸽巢原理 Find a multiple
// Find a multiple The input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers are not necessarily different (so it may...原创 2019-08-15 21:10:35 · 161 阅读 · 0 评论 -
容斥定理 ---Co-prime---How many integers can you find
Co-prime Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N. Two integers are said to be co-prime or relatively prime if they hav...原创 2019-08-15 21:12:45 · 255 阅读 · 0 评论
分享