Codeforces Round 863 (Div. 3)

Solutions for Codeforces Round 863 (Div. 3) (contest 1811). 4/8 problems verified against sample I/O. Difficulty range: 800-2200.

8 items

Codeforces Round 863 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 4/8 | Rating range: 800-2200 | Time: 16m 1s

Problem Name Rating Tags Solve Time Verified
A Insert Digit 800 greedy, math, strings 1m 31s
B Conveyor Belts 1000 implementation, math 1m 40s
C Restore the Array 1100 constructive-algorithms, greedy 4m 56s
D Umka and a Long Flight 1600 constructive-algorithms, implementation, math 1m 38s
E Living Sequence 1500 binary-search, dp, math 1m 16s
F Is It Flower? 2100 dfs-and-similar, graphs, implementation 1m 46s
G1 Vlad and the Nice Paths (easy version) 2100 combinatorics, dp, math 1m 48s
G2 Vlad and the Nice Paths (hard version) 2200 binary-search, combinatorics, data-structures 1m 26s