Codeforces Round 722 (Div. 2)

Solutions for Codeforces Round 722 (Div. 2) (contest 1529). 0/2 problems verified against sample I/O. Difficulty range: 800-1100.

2 items

Codeforces Round 722 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 800-1100 | Time: 4m 28s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Eshag Loves Big Arrays	800	constructive-algorithms, greedy, math	2m 31s	✗
B	Sifid and Strange Subsequences	1100	greedy, math, sortings	1m 57s	✗

Practice › Codeforces Solutions › Codeforces Round 722 (Div. 2) ›

CF 1529A - Eshag Loves Big Arrays

Let $U(x)$ and $V(x)$ be polynomials of degree $r$ with integer coefficients, and let $W(x) = U(x)V(x),$ so $W(x)$ has degree at most $2r$. Write $U(x) = sum{i=0}^{r} Ui x^i, qquad V(x) = sum{i=0}^{r} Vi x^i, qquad W(x) = sum{k=0}^{2r} Wk x^k.

Practice › Codeforces Solutions › Codeforces Round 722 (Div. 2) ›

CF 1529B - Sifid and Strange Subsequences

We are given multiple arrays, and for each one we want to select a subsequence that satisfies a very strong internal constraint.