ABBYY Cup 2.0 - Easy

14 problems from ABBYY Cup 2.0 - Easy (contest 177), difficulty 800-2600. 7/14 solutions verified against sample I/O.

14 items

ABBYY Cup 2.0 - Easy

Special | 14 problems | 7/14 verified | Difficulty 800-2600 | 22m 32s

#	Problem	Rating	Tags	Accepted	Time	✓
A1	Good Matrix Elements	800	implementation	11,501	1m 37s
A2	Good Matrix Elements	800	implementation	8,564	3m 13s	✓
B1	Rectangular Game	1000	number-theory	5,100	4m 29s
B2	Rectangular Game	1200	number-theory	3,361	1m 40s	✓
C1	Party	1500	dfs-and-similar, dsu, graphs	2,997	1m 13s	✓
C2	Party	1500	brute-force, dfs-and-similar, dsu	3,010	1m 14s	✓
D1	Encrypting Messages	1200	brute-force	2,730	26s
D2	Encrypting Messages	1500	data-structures	2,680	29s
E1	Space Voyage	1700	binary-search	712	25s
E2	Space Voyage	1900	binary-search	502	1m 21s	✓
F1	Script Generation	1800		366	1m 16s	✓
F2	Script Generation	2300		242	1m 15s	✓
G1	Fibonacci Strings	2400	strings	226	2m 6s
G2	Fibonacci Strings	2600	matrices, strings	244	1m 48s

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177G2 - Fibonacci Strings

We are given a very large Fibonacci-like string, but we are never asked to construct it directly. Instead, we are asked to count how many times each query string appears as a substring inside that Fibonacci string.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177G1 - Fibonacci Strings

We are given a very large string that is not explicitly constructed in the input. Instead, it is defined recursively in the same way as Fibonacci words: the first string is "a", the second is "b", and every later string is obtained by concatenating the previous string with the…

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177F2 - Script Generation

We are given a bipartite graph between men and women. Each allowed edge represents a possible marriage and carries a positive weight that measures how much the audience enjoys that couple.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177F1 - Script Generation

We are given a bipartite set of characters: $n$ men and $n$ women. Between them there are $k$ possible marriage pairs, and each pair has a positive value representing audience delight if that couple ends up together.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177E2 - Space Voyage

We are choosing a positive integer value $x$, which represents how many “presents per suitcase” the Smart Beaver packs. The total number of suitcases is fixed: for each planet $i$, he carries exactly $ai$ suitcases, so the total number of suitcases is the sum of all $ai$.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177E1 - Space Voyage

The voyage is defined by a fixed sequence of planets. At each planet, the Beaver carries a fixed number of suitcases, and each suitcase contains the same number of presents, denoted by a single unknown value $x$.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177D2 - Encrypting Messages

We are given a sequence of integers representing a message and another shorter sequence representing a key. Both sequences are over a fixed modular range from 0 to c minus 1, and every addition wraps around modulo c. Encryption is defined as a repeated sliding process.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177D1 - Encrypting Messages

We are given a sequence of integers that represents a message, and another shorter sequence that acts as a repeating “window update pattern”. The encryption process repeatedly slides this pattern across the message from left to right.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177C2 - Party

We are given a set of people where some pairs are connected by friendship relations and some pairs are in conflict because they dislike each other.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177C1 - Party

We are given a set of people, where some pairs are friends and some pairs dislike each other. Friendship forms an undirected graph, and dislike forms another set of forbidden edges. The task is to choose a subset of people such that two constraints hold simultaneously.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177B2 - Rectangular Game

We start with n pebbles. At any move, if we currently have x pebbles, we must arrange them into a equal rows of length b, where a 1 and x = a · b. After creating the rows, we keep exactly one row and discard all others. The number of pebbles becomes b.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177B1 - Rectangular Game

The game starts with n pebbles. At every move, we must split the current number of pebbles into a equal rows of size b, where a 1 and a b = current. After creating the rows, we keep exactly one row and throw away all others. That means the next number in the sequence becomes b.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177A1 - Good Matrix Elements

We are given a square matrix of size n × n, where n is guaranteed to be an odd number. Each element of the matrix is a non-negative integer.

Practice › Codeforces Solutions › ABBYY Cup 2.0 - Easy ›

CF 177A2 - Good Matrix Elements

We are given a square matrix of size n×n, where n is guaranteed to be odd. Each cell of the matrix contains a non-negative integer. The task is to sum the "good" elements of this matrix.