Codeforces Beta Round 76 (Div. 2 Only)

2 problems from Codeforces Beta Round 76 (Div. 2 Only) (contest 94), difficulty 900-1300. 2/2 solutions verified against sample I/O.

2 items

Codeforces Beta Round 76 (Div. 2 Only)

Div. 2 | 2 problems | 2/2 verified | Difficulty 900-1300 | 3m 35s

# Problem Rating Tags Accepted Time ✓
A Restoring Password 900 implementation, strings 12,262 1m 58s ✓
B Friends 1300 graphs, implementation, math 5,379 1m 37s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 76 (Div. 2 Only) ›

CF 94A - Restoring Password

We are given an encrypted password represented as a binary string of length 80. The original password had exactly 8 decimal digits, and each digit was encoded into a block of 10 binary characters.
codeforces competitive-programming implementation strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 76 (Div. 2 Only) ›

CF 94B - Friends

We have exactly five people. Some pairs of people know each other, and the input lists all such acquaintance relations. The task is to determine whether there exists either: 1. Three people where every pair knows each other. 2. Three people where no pair knows each other.
codeforces competitive-programming graphs implementation math May 28, 2026