Codeforces Beta Round 75 (Div. 2 Only)

Solutions for Codeforces Beta Round 75 (Div. 2 Only) (contest 92). 2/2 problems verified against sample I/O. Difficulty range: 800-1300.

2 items

Codeforces Beta Round 75 (Div. 2 Only)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1300 | Time: 4m 34s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Chips	800	implementation, math	3m 15s	✓
B	Binary Number	1300	greedy	1m 19s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 75 (Div. 2 Only) ›

CF 92A - Chips

We have n walruses arranged in a circle. The presenter starts with m chips and distributes them in order. Walrus 1 receives 1 chip, walrus 2 receives 2 chips, and so on up to walrus n, after which the cycle repeats again from walrus 1.

Practice › Codeforces Solutions › Codeforces Beta Round 75 (Div. 2 Only) ›

CF 92B - Binary Number

The task is to take a positive integer represented in binary and determine how many steps it takes to reduce it to 1 using a simple iterative process. In each step, if the number is odd, we increment it by 1, and if it is even, we divide it by 2.