Codeforces Round 705 (Div. 2)

Solutions for Codeforces Round 705 (Div. 2) (contest 1493). 0/6 problems verified against sample I/O. Difficulty range: 800-2600.

6 items

Codeforces Round 705 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 0/6 | Rating range: 800-2600 | Time: 13m 19s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Anti-knapsack	800	constructive-algorithms, greedy	4m 56s	✗
B	Planet Lapituletti	1300	brute-force, implementation	3m	✗
C	K-beautiful Strings	2000	binary-search, brute-force, constructive-algorithms	1m 12s	✗
D	GCD of an Array	2100	brute-force, data-structures, hashing	52s	✗
E	Enormous XOR	2600	bitmasks, constructive-algorithms, greedy	51s	✗
F	Enchanted Matrix	2600	bitmasks, interactive, number-theory	2m 28s	✗

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

CF 1493F - Enchanted Matrix

We are given an unknown $n times m$ matrix. The only information we initially know is its dimensions. The task is to count all pairs $(r, c)$ such that $r$ divides $n$, $c$ divides $m$, and if we partition the matrix into blocks of size $r times c$, all blocks are identical.

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

CF 1493A - Anti-knapsack

We are asked to pick as many numbers as possible from the range 1 to $n$ without creating any subset that sums exactly to $k$. Each test case provides the values $n$ and $k$, and the output requires both the count of selected numbers and the list itself.

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

CF 1493B - Planet Lapituletti

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

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

CF 1493E - Enormous XOR

We are given two non-negative integers, l and r, represented as binary strings of equal length. The task is to consider all contiguous ranges [x, y] where l ≤ x ≤ y ≤ r and compute the bitwise XOR of all integers in that range. Let g(x, y) denote this XOR.

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

CF 1493D - GCD of an Array

We are given an array of integers, and we need to handle a sequence of queries where each query multiplies a specific element of the array by a given factor. After each query, we must compute the greatest common divisor (GCD) of the entire array modulo $10^9+7$.

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

CF 1493C - K-beautiful Strings

We are asked to transform a given string into a "beautiful" string. A beautiful string of length $n$ with respect to a number $k$ is one where the number of occurrences of each letter is divisible by $k$.