Codeforces Round 246 (Div. 2)

5 problems from Codeforces Round 246 (Div. 2) (contest 432), difficulty 800-2300. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 246 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 800-2300 | 11m 39s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Choosing Teams	800	greedy, implementation, sortings	69,480	1m 21s	✓
B	Football Kit	1200	brute-force, greedy, implementation	12,258	1m 49s	✓
C	Prime Swaps	1800	greedy, sortings	2,679	1m 38s	✓
D	Prefixes and Suffixes	2000	dp, string-suffix-structures, strings	11,937	4m 11s	✓
E	Square Tiling	2300	constructive-algorithms, greedy	799	2m 40s	✓

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

CF 432D - Prefixes and Suffixes

We are given a single string of uppercase letters. Our goal is to identify all prefixes of the string that are identical to some suffix, and for each such prefix, count how many times it occurs anywhere inside the string as a contiguous substring.

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

CF 432C - Prime Swaps

We are given a permutation of integers from 1 to n, which means each integer in that range appears exactly once in the array. The goal is to sort this array in increasing order, but with a special restriction on the swaps we can make.

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

CF 432B - Football Kit

We are asked to simulate a football tournament between n teams, where each team has a home kit and an away kit with distinct colors. Every team plays a home and away game against each other team. By default, the home team wears its home kit and the away team wears its away kit.

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

CF 432A - Choosing Teams

We are given a set of students at a university, each with a record of how many times they have already participated in the ACM ICPC world championship.

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

CF 432E - Square Tiling

We are asked to color an $n times m$ grid such that every contiguous region of the same color forms a square. Each square can be of any size, as long as it is a perfect square in shape and does not overlap another square of the same color.