Innopolis Open 2019-2020, qualification, contest 2

5 problems from Innopolis Open 2019-2020, qualification, contest 2 (contest 102461), difficulty -. 5/5 solutions verified against sample I/O.

5 items

Innopolis Open 2019-2020, qualification, contest 2

Special | 5 problems | 5/5 verified | Difficulty - | 25m 37s

#	Problem	Time	✓
A	Expression Formatting	2m 9s	✓
B	Contest Rescheduling	10m 56s	✓
C	Advertisement Profit	7m 33s	✓
D	RSA factoring	2m 5s	✓
E	Black Friday	2m 54s	✓

Practice › Codeforces Solutions › Innopolis Open 2019-2020, qualification, contest 2 ›

CF 102461C - Advertisement Profit

We start with exactly 10,000 subscribers. There are two kinds of videos. A regular video increases the subscriber count by its ai and gives no direct revenue.

Practice › Codeforces Solutions › Innopolis Open 2019-2020, qualification, contest 2 ›

CF 102461A - Expression Formatting

The input is a valid arithmetic expression written without spaces. Its operands are single lowercase letters, and the expression may contain the binary operators +, -, , / together with parentheses.

Practice › Codeforces Solutions › Innopolis Open 2019-2020, qualification, contest 2 ›

CF 102461D - RSA factoring

The number (n) is deliberately generated from unusually close prime factors. For (k=2), there are two distinct (b)-bit primes (p1,p2), where (p2) is the prime immediately after (p1), and (n=p1p2). For (k=4), there are two independent such pairs, so [ n=p1p2q1q2.

Practice › Codeforces Solutions › Innopolis Open 2019-2020, qualification, contest 2 ›

CF 102461E - Black Friday

We have n different video card types. For type i, buying that type at the discounted price is allowed only if we buy either nothing or an integer number of cards between li and ri. Misha can carry at most s cards in total, and the goal is to maximize that total.

Practice › Codeforces Solutions › Innopolis Open 2019-2020, qualification, contest 2 ›

CF 102461B - Contest Rescheduling

Each contest has a fixed duration, so the only decision is when it starts. For contest 1, a start time c1 is valid exactly when l1 <= c1 <= r1 - d1. Similarly, contest 2 can start at any integer time in l2 <= c2 <= r2 - d2. The two contests must not overlap.