Codeforces Round 1090 (Div. 4)

Solutions for Codeforces Round 1090 (Div. 4) (contest 2218). 1/4 problems verified against sample I/O. Difficulty range: 800-1800.

4 items

Codeforces Round 1090 (Div. 4)

Type: Div. 4 | Problems: 4 | Verified: 1/4 | Rating range: 800-1800 | Time: 10m 7s

Problem	Name	Rating	Tags	Solve Time	Verified
A	The 67th Integer Problem	800	brute-force, games, implementation	1m 27s	✓
D	The 67th OEIS Problem	1100	constructive-algorithms, greedy, math	2m 4s	✗
F	The 67th Tree Problem	1500	constructive-algorithms, implementation, trees	3m 38s	✗
G	[The 67th Iteration of ](https://codeforces.com/problemset/problem/2218/G)	1800	implementation, math	2m 58s	✗

Practice › Codeforces Solutions › Codeforces Round 1090 (Div. 4) ›

CF 2218D - The 67th OEIS Problem

We are asked to construct sequences of integers of length $n$ such that the greatest common divisor (gcd) of consecutive elements is always distinct. Each test case provides a number $n$, and for each, we must output one valid sequence of length $n$.

Practice › Codeforces Solutions › Codeforces Round 1090 (Div. 4) ›

CF 2218F - The 67th Tree Problem

We are asked to build a rooted tree with exactly $n = x + y$ vertices. The root is fixed to be vertex $1$. For every vertex, consider the size of its rooted subtree.

Practice › Codeforces Solutions › Codeforces Round 1090 (Div. 4) ›

CF 2218A - The 67th Integer Problem

The problem asks us to pick an integer $y$ for a given integer $x$ so that the minimum of $x$ and $y$ is as large as possible. We are given multiple test cases, each consisting of a single integer $x$ between -67 and 67.