Codeforces Beta Round 40 (Div. 2)

Solutions for Codeforces Beta Round 40 (Div. 2) (contest 41). 3/5 problems verified against sample I/O. Difficulty range: 800-1900.

5 items

Codeforces Beta Round 40 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 800-1900 | Time: 7m 28s

Problem Name Rating Tags Solve Time Verified
A Translation 800 implementation, strings 1m 14s ✓
B Martian Dollar 1400 brute-force 1m 8s ✓
C Email address 1300 expression-parsing, implementation 1m 41s ✗
D Pawn 1900 dp 1m 37s ✓
E 3-cycles 1900 constructive-algorithms, graphs, greedy 1m 48s ✗
Practice › Codeforces Solutions › Codeforces Beta Round 40 (Div. 2) ›

CF 41A - Translation

We are given two lowercase strings. The first string is a word in one language, and the second string is supposed to be its translation into another language where every word is written backwards.
codeforces competitive-programming implementation strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 40 (Div. 2) ›

CF 41B - Martian Dollar

We are asked to maximize the amount of money Vasya can have at the end of _n_ days if he starts with a given sum of bourles and can buy and later sell Martian dollars.
codeforces competitive-programming brute-force May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 40 (Div. 2) ›

CF 41C - Email address

We are given a string representing an email address, but all the . symbols have been spelled out as dot and all the @ symbols as at. Our goal is to reconstruct the original, valid email address in its shortest form.
codeforces competitive-programming expression-parsing implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 40 (Div. 2) ›

CF 41D - Pawn

We have a grid of digits. The pawn starts somewhere on the bottom row and moves upward one row at a time. At each step it may go diagonally left or diagonally right. Every visited cell contributes its digit to the total collected peas.
codeforces competitive-programming dp May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 40 (Div. 2) ›

CF 41E - 3-cycles

We need to build an undirected graph on n cities such that no triangle exists. A triangle means three distinct cities where every pair is directly connected.
codeforces competitive-programming constructive-algorithms graphs greedy May 28, 2026