Codeforces Round 117 (Div. 2)

5 problems from Codeforces Round 117 (Div. 2) (contest 182), difficulty 1000-2200. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 117 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1000-2200 | 11m 48s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Battlefield	2200	geometry, graphs, implementation	349	3m 47s	✓
B	Vasya's Calendar	1000	implementation	7,364	3m 18s
C	Optimal Sum	2000	data-structures, greedy	822	1m 50s	✓
D	Common Divisors	1400	brute-force, hashing, implementation	9,237	1m 36s	✓
E	Wooden Fence	1800	dp	1,665	1m 17s	✓

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

CF 182A - Battlefield

We are asked to simulate movement across a 2D plane from a starting point $A$ to a destination $B$ while avoiding a periodic laser. The laser alternates between charging and firing, with durations $a$ and $b$ seconds, respectively.

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

CF 182B - Vasya's Calendar

We are asked to simulate a peculiar kind of calendar. Vasya has a clock that shows days from 1 to d. Each month has a certain number of days, and the clock does not know which month it is.

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

CF 182C - Optimal Sum

We have an array and a fixed window length len. For every subarray of length len, we compute its sum and then take the absolute value. The "optimal sum" of the whole array is the maximum absolute subarray sum among all windows of that fixed length.

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

CF 182D - Common Divisors

We are given two lowercase strings. A string d is called a divisor of another string s if s can be formed by concatenating d several times in a row. For example, "ab" divides "ababab" because repeating "ab" three times gives the full string.

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

CF 182E - Wooden Fence

We are asked to count the number of ways to build a fence of exact length l using boards of n types, where each type is a rectangle of dimensions ai by bi.