TSEC Round 2 (Div. 3)

4 problems from TSEC Round 2 (Div. 3) (contest 105435), difficulty -. 4/4 solutions verified against sample I/O.

4 items

TSEC Round 2 (Div. 3)

Div. 3 | 4 problems | 4/4 verified | Difficulty - | 6m 4s

#	Problem	Time	✓
A	The world of JS (Jagjeet & Sagar)	1m 29s	✓
B	Divisor Query	1m 22s	✓
D	Hard Work	1m 22s	✓
E	Anime Marathon: Vivek vs. Sagar	1m 51s	✓

Practice › Codeforces Solutions › TSEC Round 2 (Div. 3) ›

CF 105435E - Anime Marathon: Vivek vs. Sagar

We are given a sequence of distinct episodes, each assigned an integer enjoyment value. Two players alternate taking episodes from the remaining pool.

Practice › Codeforces Solutions › TSEC Round 2 (Div. 3) ›

CF 105435A - The world of JS (Jagjeet & Sagar)

We are given a schedule describing when Sagar is busy, and we need to decide whether Jagjeet’s chosen moment falls inside any of those busy periods. Sagar’s busy pattern starts at time a. After that, his availability alternates in a structured way: every cycle is based on b.

Practice › Codeforces Solutions › TSEC Round 2 (Div. 3) ›

CF 105435B - Divisor Query

We are given a sequence of queries, each describing a numeric interval $[l, r]$. For every query, we are asked to count how many integers inside that interval have a specific property related to their number of divisors.

Practice › Codeforces Solutions › TSEC Round 2 (Div. 3) ›

CF 105435D - Hard Work

We are given a string for each test case, and we need to locate a contiguous substring that contains a specific multiset of letters. The required letters correspond to the word “hardwork”, but not in the usual frequency pattern of the word itself.