Codeforces Round 943 (Div. 3)

Solutions for Codeforces Round 943 (Div. 3) (contest 1968). 1/2 problems verified against sample I/O. Difficulty range: 800-800.

2 items

Codeforces Round 943 (Div. 3)

Type: Div. 3 | Problems: 2 | Verified: 1/2 | Rating range: 800-800 | Time: 2m 13s

Problem Name Rating Tags Solve Time Verified
A Maximize? 800 brute-force, math, number-theory 1m 6s ✗
B Prefiquence 800 greedy, two-pointers 1m 7s ✓
Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968A - Maximize?

We are given a small positive integer $x$. For each such value, we need to choose another integer $y$ strictly smaller than $x$, and we want to maximize the expression $gcd(x, y) + y$. The interaction between the two terms is important.
codeforces competitive-programming brute-force math number-theory May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 943 (Div. 3) ›

CF 1968B - Prefiquence

We are asked to find, for each test case, the longest prefix of a binary string a that can appear as a subsequence in another binary string b.
codeforces competitive-programming greedy two-pointers May 31, 2026