Codeforces Round 235 (Div. 2)

Solutions for Codeforces Round 235 (Div. 2) (contest 401). 2/3 problems verified against sample I/O. Difficulty range: 800-2000.

3 items

Codeforces Round 235 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 800-2000 | Time: 6m 53s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Vanya and Cards	800	implementation, math	4m 10s	✗
B	Sereja and Contests	1200	greedy, implementation, math	1m 24s	✓
D	Roman and Numbers	2000	bitmasks, brute-force, combinatorics	1m 19s	✓

Practice › Codeforces Solutions › Codeforces Round 235 (Div. 2) ›

CF 401A - Vanya and Cards

Vanya has discovered a subset of cards from his original infinite collection, where each card carries an integer between -x and x. His goal is to balance the sum of these found cards to zero by potentially adding additional cards from the infinite supply.

Practice › Codeforces Solutions › Codeforces Round 235 (Div. 2) ›

CF 401B - Sereja and Contests

The contest platform numbers every round consecutively by start time. A round can either be a standalone Div2 round, or a pair of simultaneous rounds where Div2 gets identifier i and Div1 gets identifier i + 1. Sereja only participates in Div2 rounds.

Practice › Codeforces Solutions › Codeforces Round 235 (Div. 2) ›

CF 401D - Roman and Numbers

We are asked to count the number of integers that can be formed by permuting the digits of a given number $n$, do not start with zero, and are divisible by a given modulus $m$. The input $n$ can be as large as $10^{18}$, which means up to 18 digits, and $m$ is at most 100.