Codeforces Beta Round 98 (Div. 2)

5 problems from Codeforces Beta Round 98 (Div. 2) (contest 137), difficulty 900-2000. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 98 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 900-2000 | 7m 45s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Postcards and photos	900	implementation	7,831	1m 28s	✓
B	Permutation	1000	greedy	15,035	1m 13s	✓
C	History	1500	sortings	7,813	1m 36s	✓
D	Palindromes	1900	dp, strings	1,722	2m 9s	✓
E	Last Chance	2000	data-structures, implementation, strings	1,377	1m 19s	✓

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

CF 137B - Permutation

We are given an array of $n$ integers, each between 1 and 5000, and we are asked to transform this array into a permutation of the numbers from 1 to $n$. A permutation is a sequence where each integer from 1 to $n$ appears exactly once.

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

CF 137D - Palindromes

We are given a string and an integer k. We may change any characters we want, and the goal is to transform the string into a concatenation of at most k palindromes while minimizing the number of modified characters. The partition boundaries are not fixed.

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

CF 137A - Postcards and photos

We are given a string made of two characters, C and P. Each character represents one object hanging on the wall. C means postcard, P means photo. Polycarpus removes objects from left to right. He cannot skip positions, and at any moment he may carry only one type of object.

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

CF 137C - History

Each historical event is represented by a time interval [a, b], where a is the starting year and b is the ending year. One event is considered contained inside another if it starts later and ends earlier.

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

CF 137E - Last Chance

We are given a string s consisting of uppercase and lowercase Latin letters, and we are asked to analyze its substrings according to a specific property: a substring is "good" if the number of vowels it contains is at most twice the number of consonants.