Codeforces Beta Round 83 (Div. 2 Only)

2 problems from Codeforces Beta Round 83 (Div. 2 Only) (contest 108), difficulty 1000-1400. 2/2 solutions verified against sample I/O.

2 items

Codeforces Beta Round 83 (Div. 2 Only)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1000-1400 | 9m 3s

# Problem Rating Tags Accepted Time ✓
A Palindromic Times 1000 implementation, strings 10,346 4m 56s ✓
B Datatypes 1400 math, sortings 2,735 4m 7s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 83 (Div. 2 Only) ›

CF 108A - Palindromic Times

The task is to find the next time on a 24-hour digital clock that reads as a palindrome. The input is a string formatted as "HH:MM", representing hours and minutes in 24-hour notation.
codeforces competitive-programming implementation strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 83 (Div. 2 Only) ›

CF 108B - Datatypes

We are given several unsigned integer datatypes, each defined by its bit length. A datatype with a bits can store every integer from 0 up to 2^a - 1. We want to know whether there exists some integer x and two datatypes with sizes a[i] < a[j] such that: 1.
codeforces competitive-programming math sortings May 28, 2026