Codeforces Round 137 (Div. 2)

5 problems from Codeforces Round 137 (Div. 2) (contest 222), difficulty 1200-1900. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 137 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1200-1900 | 8m 34s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Shooshuns and Sequence	1200	brute-force, implementation	11,760	1m 11s	✓
B	Cosmic Tables	1300	data-structures, implementation	6,564	1m 33s	✓
C	Reducing Fractions	1800	implementation, math, number-theory	2,926	2m 29s
D	Olympiad	1900	binary-search, greedy, sortings	2,341	1m 26s	✓
E	Decoding Genome	1900	dp, matrices	3,567	1m 55s	✓

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

CF 222A - Shooshuns and Sequence

We are given a sequence of integers on a blackboard and a position k. A shooshun can perform one operation that appends the k-th element of the current sequence to the end and removes the first element.

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

CF 222E - Decoding Genome

We have an alphabet of size m, consisting of the first m symbols from the sequence a..zA..Z. Some ordered pairs of symbols are forbidden. If pair (x, y) is forbidden, then symbol y cannot appear immediately after symbol x in the DNA string.

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

CF 222D - Olympiad

We are given two multisets of scores. Array a contains the scores obtained in the first tour, and array b contains the scores obtained in the second tour.

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

CF 222C - Reducing Fractions

The fraction is not given as a single numerator and denominator. Instead, we receive two arrays. The product of all numbers in the first array is the numerator, and the product of all numbers in the second array is the denominator.

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

CF 222B - Cosmic Tables

We have a matrix of integers and three kinds of operations applied to it repeatedly. One operation swaps two rows. Another swaps two columns. The third asks for the value currently visible at a specific row and column.