Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 2)
2 problems from Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 2) (contest 964), difficulty 800-1300. 2/2 solutions verified against sample I/O.
Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 2)
Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1300 | 2m 48s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Splits | 800 | math | 10,304 | 1m 29s | ✓ |
| B | Messages | 1300 | math | 4,584 | 1m 19s | ✓ |
Practice
›
Codeforces Solutions
›
Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 2)
›
CF 964A - Splits
We are working with ways of writing an integer $n$ as a nonincreasing sequence of positive integers. In other words, we break $n$ into parts that never increase as we move to the right, and all parts must be positive.