VK Cup 2012 Round 3 (Unofficial Div. 2 Edition)

Solutions for VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) (contest 174). 3/3 problems verified against sample I/O. Difficulty range: 1100-1800.

3 items

VK Cup 2012 Round 3 (Unofficial Div. 2 Edition)

Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 1100-1800 | Time: 6m 56s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Problem About Equation	1100	math	1m 33s	✓
B	File List	1400	dp, greedy, implementation	3m 40s	✓
C	Range Increments	1800	data-structures, greedy	1m 43s	✓

Practice › Codeforces Solutions › VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) ›

CF 174A - Problem About Equation

We have several mugs that already contain different amounts of Ber-Cola. There is also some drink left in the bottle. We must pour the entire remaining amount into the mugs so that every mug ends up with exactly the same volume. If the initial amounts are a1, a2, ...

Practice › Codeforces Solutions › VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) ›

CF 174B - File List

We are given one long string that originally consisted of several file names written back to back with no separators. Every valid file name must look like name.ext. The rules are strict. The part before the dot contains only lowercase letters and has length from 1 to 8.

Practice › Codeforces Solutions › VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) ›

CF 174C - Range Increments

We start with an array of length n filled with zeros. One operation chooses a segment [l, r] and adds 1 to every element inside that segment. The final array is given.