TheForces Round #10 (TEN-Forces)

6 problems from TheForces Round #10 (TEN-Forces) (contest 104301), difficulty -. 5/6 solutions verified against sample I/O.

6 items

TheForces Round #10 (TEN-Forces)

Special | 6 problems | 5/6 verified | Difficulty - | 11m 44s

#	Problem	Time	✓
A	Reading Books	4m 41s
B	Two Squares	1m 34s	✓
C	Lucky Numbers	1m 13s	✓
D	Good Sets	1m 14s	✓
E	Again Last Digit	1m 46s	✓
F	OR Pairs	1m 16s	✓

Practice › Codeforces Solutions › TheForces Round #10 (TEN-Forces) ›

CF 104301A - Reading Books

We are given multiple independent scenarios. In each scenario, a reader has a sequence of reading amounts over days and a list of book lengths. Each day contributes a certain number of pages that can be used to progress through books in order.

Practice › Codeforces Solutions › TheForces Round #10 (TEN-Forces) ›

CF 104301F - OR Pairs

We are counting ordered pairs of integers $(a, b)$ where $0 le a le b$, but not all pairs are valid. The restriction comes from a bitwise condition: when we take the bitwise OR of $a$ and $b$, the result must not exceed $n$.

Practice › Codeforces Solutions › TheForces Round #10 (TEN-Forces) ›

CF 104301E - Again Last Digit

We are asked to evaluate a large sum where each term combines Fibonacci numbers and factorial exponents, but we only care about the last digit of the result. For each test case, an integer $n$ is given. We conceptually build the value $$S = f0^{0!} + f1^{1!} + f2^{2!

Practice › Codeforces Solutions › TheForces Round #10 (TEN-Forces) ›

CF 104301D - Good Sets

We are given multiple independent test cases. In each test case, there is an array of integers and a threshold value $k$. We call a set of values “good” if the largest and smallest elements in that set differ by at most $k$.

Practice › Codeforces Solutions › TheForces Round #10 (TEN-Forces) ›

CF 104301B - Two Squares

We are given many independent queries. Each query provides a non-negative integer $n$, and we must count how many integers $x$ in the range from $0$ to $n$ can be written as the sum of two integer squares, meaning $x = a^2 + b^2$ for some integers $a$ and $b$.

Practice › Codeforces Solutions › TheForces Round #10 (TEN-Forces) ›

CF 104301C - Lucky Numbers

We are given a very large integer written in decimal form, and for each such number we need to count how many positive integers not exceeding it consist only of the digits 4 and 7.