Codeforces Round 174 (Div. 1)

Solutions for Codeforces Round 174 (Div. 1) (contest 283). 2/3 problems verified against sample I/O. Difficulty range: 1600-2400.

3 items

Codeforces Round 174 (Div. 1)

Type: Div. 1 | Problems: 3 | Verified: 2/3 | Rating range: 1600-2400 | Time: 5m 38s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cows and Sequence	1600	constructive-algorithms, data-structures, implementation	1m 35s	✓
C	Coin Troubles	2100	dp	2m 22s	✗
D	Cows and Cool Sequences	2400	dp, math, number-theory	1m 41s	✓

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

CF 283A - Cows and Sequence

We maintain a dynamic sequence of integers. Initially the sequence contains only one value, 0. Each operation changes the sequence in one of three ways. We may add some value x to the first a elements, append a new number to the end, or remove the last element.

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

CF 283C - Coin Troubles

We have n coin types, where coin type i has value a[i]. We want to count how many different multisets of coins sum to exactly t. The twist is that we are also given inequalities between coin counts.

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

CF 283D - Cows and Cool Sequences

We are given an array of positive integers. A pair (x, y) is called cool if x can be written as the sum of y consecutive integers, where the sequence may contain negative numbers and zero. The sequence itself is cool when every adjacent pair satisfies this condition.