Codeforces Round 116 (Div. 2, ACM-ICPC Rules)

6 problems from Codeforces Round 116 (Div. 2, ACM-ICPC Rules) (contest 180), difficulty 1200-2300. 5/6 solutions verified against sample I/O.

6 items

Codeforces Round 116 (Div. 2, ACM-ICPC Rules)

Div. 2 | 6 problems | 5/6 verified | Difficulty 1200-2300 | 6m 58s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Defragmentation	1800	implementation	594	1m 17s	✓
B	Divisibility Rules	2300	math, number-theory	465	1m 22s	✓
C	Letter	1400	dp	8,559	1m 12s	✓
D	Name	1900	greedy, strings	812	1m 12s	✓
E	Cubes	1800	binary-search, dp, two-pointers	2,067	1m 20s	✓
F	Mathematical Analysis Rocks!	1200	constructive-algorithms, implementation, math	2,839	35s

Practice › Codeforces Solutions › Codeforces Round 116 (Div. 2, ACM-ICPC Rules) ›

CF 180B - Divisibility Rules

We are asked to determine the type of divisibility rule that applies to a given number d in a given base b. The types are categorized as 2-type, 3-type, 11-type, 6-type, or 7-type depending on whether the divisibility can be checked using only the last few digits (2-type), the…

Practice › Codeforces Solutions › Codeforces Round 116 (Div. 2, ACM-ICPC Rules) ›

CF 180A - Defragmentation

The disk is a linear array of fixed-size cells, and each cell either stores a fragment of some file or is empty. Every file is already present on the disk, but its fragments may be scattered across arbitrary positions, while still appearing in the correct internal order for…

Practice › Codeforces Solutions › Codeforces Round 116 (Div. 2, ACM-ICPC Rules) ›

CF 180F - Mathematical Analysis Rocks!

Each student initially owns a single notebook. There is a fixed hidden permutation p over students, meaning every student has exactly one “best friend” and every student is the best friend of exactly one other student.

Practice › Codeforces Solutions › Codeforces Round 116 (Div. 2, ACM-ICPC Rules) ›

CF 180E - Cubes

We have a row of cubes, each painted in one of m colors, and we are allowed to remove up to k cubes to maximize the length of a consecutive segment of cubes all having the same color.

Practice › Codeforces Solutions › Codeforces Round 116 (Div. 2, ACM-ICPC Rules) ›

CF 180D - Name

We are given two strings, s and t. The string s represents a set of letters we are allowed to rearrange freely, and the string t represents a benchmark name.

Practice › Codeforces Solutions › Codeforces Round 116 (Div. 2, ACM-ICPC Rules) ›

CF 180C - Letter

We are given a string consisting of uppercase and lowercase letters. Patrick wants to transform it into a "fancy" string, defined as having all uppercase letters on the left and all lowercase letters on the right. We can change the case of any letter at the cost of one action.