Codeforces Beta Round 89 (Div. 2)

5 problems from Codeforces Beta Round 89 (Div. 2) (contest 118), difficulty 1000-2000. 4/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 89 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1000-2000 | 10m 4s

#	Problem	Rating	Tags	Accepted	Time	✓
A	String Task	1000	implementation, strings	231,335	1m 38s	✓
B	Present from Lena	1000	constructive-algorithms, implementation	34,569	1m 42s	✓
C	Fancy Number	1900	brute-force, greedy, sortings	2,871	2m 51s	✓
D	Caesar's Legions	1700	dp	20,467	1m 37s	✓
E	Bertown roads	2000	dfs-and-similar, graphs	8,429	2m 16s

Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118A - String Task

We receive a single string containing uppercase and lowercase English letters. The task is to transform this string according to three rules. First, every vowel must be removed. The vowels in this problem are A, O, Y, E, U, I in both uppercase and lowercase forms.

Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118B - Present from Lena

We need to print a symmetric diamond made from numbers. The middle row contains numbers increasing from 0 up to n, then decreasing back to 0. Every row above and below follows the same pattern with a smaller maximum value.

Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118C - Fancy Number

We are given a string of digits representing a car number. The number is considered beautiful if at least k positions contain the same digit. We may change any digit into another digit, and changing digit a into digit b costs The task has two objectives.

Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118D - Caesar's Legions

We are asked to count the number of ways to line up Caesar’s soldiers, consisting of a given number of footmen and horsemen, so that no more than a fixed number of the same type stand consecutively.

Practice › Codeforces Solutions › Codeforces Beta Round 89 (Div. 2) ›

CF 118E - Bertown roads

We are given a connected undirected graph representing the road network of Bertown, where junctions are nodes and roads are edges.