Codeforces Beta Round 88

Solutions for Codeforces Beta Round 88 (contest 117). 5/5 problems verified against sample I/O. Difficulty range: 1300-2900.

5 items

Codeforces Beta Round 88

Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1300-2900 | Time: 13m 35s

Problem Name Rating Tags Solve Time Verified
A Elevator 1300 implementation, math 2m 31s ✓
B Very Interesting Game 1800 brute-force, number-theory 2m 31s ✓
C Cycle 2000 dfs-and-similar, graphs 3m ✓
D Not Quick Transformation 2500 divide-and-conquer, math 2m 20s ✓
E Tree or not Tree 2900 data-structures, divide-and-conquer, graphs 3m 13s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 88 ›

CF 117A - Elevator

The elevator follows a completely deterministic cycle. It starts at floor 1 at time 0, climbs one floor per second until it reaches floor m, then immediately reverses direction and goes back down to floor 1, again moving one floor per second.
codeforces competitive-programming implementation math May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 88 ›

CF 117B - Very Interesting Game

We are asked to simulate a two-player game involving numbers represented as nine-digit strings. The first player selects a string s1 that represents a number not exceeding a given value a. The second player responds with a string s2 representing a number not exceeding b.
codeforces competitive-programming brute-force number-theory May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 88 ›

CF 117C - Cycle

We are given a tournament graph, which is a special type of directed graph where for every pair of distinct vertices, there is exactly one directed edge connecting them.
codeforces competitive-programming dfs-and-similar graphs May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 88 ›

CF 117D - Not Quick Transformation

We start with the array [1, 2, 3, ..., n]. A recursive transformation rearranges it by repeatedly taking all elements at odd positions, transforming that subarray, then taking all elements at even positions and transforming that subarray.
codeforces competitive-programming divide-and-conquer math May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 88 ›

CF 117E - Tree or not Tree

The graph has exactly n vertices and n edges. A connected graph with n vertices and n edges contains exactly one simple cycle. Every other edge belongs to a tree attached to that cycle. Initially every edge is turned off.
codeforces competitive-programming data-structures divide-and-conquer graphs implementation trees May 28, 2026