Codeforces Round 174 (Div. 1)

5 problems from Codeforces Round 174 (Div. 1) (contest 283), difficulty 1600-2800. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 174 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1600-2800 | 9m 44s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Cows and Sequence	1600	constructive-algorithms, data-structures, implementation	6,871	1m 46s	✓
B	Cow Program	1700	dfs-and-similar, dp, graphs	3,930	1m 36s	✓
C	Coin Troubles	2100	dp	1,566	1m 30s	✓
D	Cows and Cool Sequences	2400	dp, math, number-theory	641	2m 25s
E	Cow Tennis Tournament	2800	combinatorics, data-structures, math	856	2m 27s

Practice › Codeforces Solutions › Codeforces Round 174 (Div. 1) ›

CF 283B - Cow Program

We are given a sequence of positive integers of length n where the first element is initially unknown and the remaining n - 1 elements are provided. The "cow program" defines two integer variables, x and y, starting with x = 1 and y = 0.

Practice › Codeforces Solutions › Codeforces Round 174 (Div. 1) ›

CF 283A - Cows and Sequence

We start with a sequence containing a single element, 0, and perform a sequence of n operations. Operations can modify the sequence in three ways: increasing the first a elements by some value x, appending a new number to the end, or removing the last element.

Practice › Codeforces Solutions › Codeforces Round 174 (Div. 1) ›

CF 283E - Cow Tennis Tournament

Codeforces 283E: Cow Tennis Tournament

Practice › Codeforces Solutions › Codeforces Round 174 (Div. 1) ›

CF 283D - Cows and Cool Sequences

Codeforces 283D: Cows and Cool Sequences

Practice › Codeforces Solutions › Codeforces Round 174 (Div. 1) ›

CF 283C - Coin Troubles

We have n coin types. Coin type i has value a[i], and we may take any nonnegative number of coins of that type. The total value of all chosen coins must be exactly t. In addition, we are given inequality constraints of the form: count[b] count[c] The constraints are special.