Codeforces Round 701 (Div. 2)

Solutions for Codeforces Round 701 (Div. 2) (contest 1485). 1/6 problems verified against sample I/O. Difficulty range: 1000-2500.

6 items

Codeforces Round 701 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 1000-2500 | Time: 17m 42s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Add and Divide	1000	brute-force, greedy, math	2m 20s	✓
B	Replace and Keep Sorted	1200	dp, implementation, math	3m 4s	✗
C	Floor and Mod	1700	binary-search, brute-force, math	3m 15s	✗
D	Multiples and Power Differences	2200	constructive-algorithms, graphs, math	2m 42s	✗
E	Move and Swap	2500	dfs-and-similar, dp, greedy	2m 54s	✗
F	Copy or Prefix Sum	2400	combinatorics, data-structures, dp	3m 27s	✗

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

CF 1485F - Copy or Prefix Sum

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 701 (Div. 2) ›

CF 1485E - Move and Swap

We are given a rooted tree where every root-to-leaf path has the same length. Each non-root vertex has a value, while the root has no value attached. Two tokens start together at the root.

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

CF 1485D - Multiples and Power Differences

We are given a two-dimensional grid of positive integers, where each cell contains a small number between 1 and 16.

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

CF 1485C - Floor and Mod

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 701 (Div. 2) ›

CF 1485B - Replace and Keep Sorted

We are given a strictly increasing array a of length n with elements from 1 to k, and multiple queries asking about subarrays. For each query, defined by indices l and r, we need to count how many arrays b exist that are "k-similar" to the subarray a[l..r].

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

CF 1485A - Add and Divide

We are asked to reduce a positive integer a to zero using two operations: divide a by another positive integer b using integer division, or increment b by one. Each operation counts as one step, and the goal is to minimize the total number of steps.