Educational Codeforces Round 138 (Rated for Div. 2)

D. Counting Arrays

https://codeforces.com/contest/1749/problem/D

- 阅读剩余部分 -

Educational Codeforces Round 137 (Rated for Div. 2)

D. Problem with Random Tests

https://codeforces.com/contest/1743/problem/D

- 阅读剩余部分 -

Codeforces Round #828 (Div. 3)

E1. Divisible Numbers (easy version)

https://codeforces.com/contest/1744/problem/E1

E2. Divisible Numbers (hard version)

https://codeforces.com/contest/1744/problem/E2

- 阅读剩余部分 -

Codeforces Global Round 23

C. Permutation Operations

https://codeforces.com/contest/1746/problem/C

- 阅读剩余部分 -

Codeforces Round #827 (Div. 4)

G. Orray

https://codeforces.com/contest/1742/problem/G

- 阅读剩余部分 -

容斥原理：先不考虑重叠的情况，把包含于某内容中的所有对象的数目先计算出来，然后再把计数时重复计算的数目排斥出去，使得计算的结果既无遗漏又无重复，这种计数的方法称为容斥原理。

- 阅读剩余部分 -