TheForces Round #44 (DIV3.5-Forces)

8 problems from TheForces Round #44 (DIV3.5-Forces) (contest 106049), difficulty -. 5/8 solutions verified against sample I/O.

8 items

TheForces Round #44 (DIV3.5-Forces)

Special | 8 problems | 5/8 verified | Difficulty - | 9m 46s

#	Problem	Time	✓
A	Three Moves Game	23s
B	Kaosar and Segments	42s	✓
C	Alyona Loves Ranges	41s	✓
D	Explosive String	48s	✓
E	Diagonal Modification	23s
F	RBS Game	44s	✓
G	Product Partition	45s	✓
H	Cool Operations	5m 20s

Practice › Codeforces Solutions › TheForces Round #44 (DIV3.5-Forces) ›

CF 106049H - Cool Operations

Codeforces 106049H: Cool Operations

Practice › Codeforces Solutions › TheForces Round #44 (DIV3.5-Forces) ›

CF 106049B - Kaosar and Segments

We have a regular polygon with vertices numbered from 1 to n in clockwise order. A segment may be drawn between vertices i and j only when the vertices are not adjacent on the polygon boundary and gcd(i, j) = 1.

Practice › Codeforces Solutions › TheForces Round #44 (DIV3.5-Forces) ›

CF 106049G - Product Partition

We are given a segment of integers from 1 to n. We are asked to break this segment into contiguous blocks. Each block must have a length within a fixed range, from L to R inclusive.

Practice › Codeforces Solutions › TheForces Round #44 (DIV3.5-Forces) ›

CF 106049F - RBS Game

This game builds a bracket sequence in blocks. Alice controls every odd turn, including the last one, and each of her turns adds exactly a brackets. Bob controls every even turn and adds exactly b brackets.

Practice › Codeforces Solutions › TheForces Round #44 (DIV3.5-Forces) ›

CF 106049D - Explosive String

We are given a binary string where some positions are already fixed as 0 or 1, and the remaining positions are free.

Practice › Codeforces Solutions › TheForces Round #44 (DIV3.5-Forces) ›

CF 106049E - Diagonal Modification

I can write this editorial, but I need one missing piece first: the actual problem statement for Codeforces 106049E - Diagonal Modification is not included in your prompt, and the section labelled “Problem Statement” is empty.

Practice › Codeforces Solutions › TheForces Round #44 (DIV3.5-Forces) ›

CF 106049C - Alyona Loves Ranges

We are given a number n and a range of allowed values [l, r]. We need to find the smallest integer x inside this range such that the greatest common divisor of n and x is also inside the same range. If no such x exists, we print -1.

Practice › Codeforces Solutions › TheForces Round #44 (DIV3.5-Forces) ›

CF 106049A - Three Moves Game

I don’t have enough information to write a correct editorial for this problem yet. The “Problem Statement / Input / Output” sections are empty, and Codeforces problems under Gym IDs like 106049A are not uniquely identifiable without the actual description.