tag

#expression-parsing

34 pages tagged

Practice › Codeforces Solutions › Croc Champ 2012 - Qualification Round ›

CF 172E - BHTML+BCSS

CF 172E - BHTML+BCSS Rating: 2200 Tags: *special, dfs and similar, expression parsing Solve time: 2m 21s Verified: no Solution Problem Understanding We are given a simplified HTML-like document. Every tag is either an opening tag like <a> , a closing tag like </a> , or a self-closing tag like <a/> . The document is guaranteed to be properly nested, so every opening tag has exactly one matching closing tag....
codeforces competitive-programming *special dfs-and-similar expression-parsing May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 123 (Div. 2) ›

CF 195C - Try and Catch

CF 195C - Try and Catch Rating: 1800 Tags: expression parsing, implementation Solve time: 1m 8s Verified: yes Solution Problem Understanding The task is to simulate the exception-handling behavior of a simple programming language. The program consists of three types of statements: try , catch(type, message) , and throw(type) . Each try starts a new exception-handling block, and its corresponding catch closes the most recently opened try that has not...
codeforces competitive-programming expression-parsing implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 138 (Div. 1) ›

CF 223A - Bracket Sequence

CF 223A - Bracket Sequence Rating: 1700 Tags: data structures, expression parsing, implementation Solve time: 1m 41s Verified: yes Solution Problem Understanding We are given a string consisting only of four bracket characters: ( , ) , [ and ] . The string itself is not guaranteed to be balanced. Our task is to find a contiguous substring that forms a valid bracket sequence. Among all valid substrings, we want...
codeforces competitive-programming data-structures expression-parsing implementation May 29, 2026
Practice › Codeforces Solutions ›

Codeforces Round 138 (Div. 1)

Codeforces Round 138 (Div. 1) Type: Div. 1 | Problems: 4 | Verified: 3/4 | Rating range: 1700-3000 | Time: 8m 30s Problem Name Rating Tags Solve Time Verified A Bracket Sequence 1700 data-structures, expression-parsing, implementation 1m 41s ✓ B Two Strings 1900 data-structures, dp, strings 1m 42s ✓ C Partial Sums 1900 combinatorics, math, number-theory 1m 25s ✓ D Spider 3000 geometry, graphs 3m 42s ✗
codeforces competitive-programming data-structures expression-parsing implementation dp strings combinatorics May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 134 (Div. 1) ›

CF 217C - Formurosa

CF 217C - Formurosa Rating: 2600 Tags: divide and conquer, dp, expression parsing Solve time: 1m 20s Verified: yes Solution Problem Understanding We are given a Boolean formula consisting of constants 0 and 1, unknown variables denoted by ? , and the logical operators AND ( & ), OR ( | ), and XOR ( ^ ). Each ? corresponds to one of the n bacterial colonies, and the scientists...
codeforces competitive-programming divide-and-conquer dp expression-parsing May 29, 2026
Practice › Codeforces Solutions ›

Codeforces Round 123 (Div. 2)

Codeforces Round 123 (Div. 2) Type: Div. 2 | Problems: 4 | Verified: 3/4 | Rating range: 1000-2000 | Time: 5m 40s Problem Name Rating Tags Solve Time Verified A Let's Watch Football 1000 binary-search, brute-force, math 1m 24s ✓ C Try and Catch 1800 expression-parsing, implementation 1m 8s ✓ D Analyzing Polyline 1900 geometry, math, sortings 1m 28s ✗ E Building Forest 2000 data-structures, dsu, graphs 1m 40s ✓
codeforces competitive-programming binary-search brute-force math expression-parsing implementation geometry May 29, 2026
Practice › Codeforces Solutions ›

Codeforces Beta Round 34 (Div. 2)

Codeforces Beta Round 34 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2000 | Time: 7m 19s Problem Name Rating Tags Solve Time Verified A Reconnaissance 2 800 implementation 1m 18s ✓ B Sale 900 greedy, sortings 1m 19s ✓ C Page Numbers 1300 expression-parsing, implementation, sortings 1m 7s ✓ D Road Map 1600 dfs-and-similar, graphs 1m 29s ✓ E Collisions 2000 brute-force, implementation,...
codeforces competitive-programming implementation greedy sortings expression-parsing strings dfs-and-similar May 28, 2026
Practice › Codeforces Solutions ›

Codeforces Beta Round 48

Codeforces Beta Round 48 Type: Beta | Problems: 6 | Verified: 4/6 | Rating range: 1300-2800 | Time: 13m 36s Problem Name Rating Tags Solve Time Verified A Cheaterius's Problem 1300 implementation 1m 37s ✓ B bHTML Tables Analisys 1700 expression-parsing 3m 37s ✓ C Three Base Stations 1800 binary-search, greedy 2m 13s ✗ D Geometrical problem 2200 implementation 1m 55s ✓ E Pentagon 2400 combinatorics, graphs, matrices 2m 2s...
codeforces competitive-programming implementation expression-parsing binary-search greedy combinatorics graphs May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 64 ›

CF 70B - Text Messaging

CF 70B - Text Messaging Rating: 1600 Tags: expression parsing, greedy, strings Solve time: 1m 39s Verified: yes Solution Problem Understanding We are given the maximum length of a single SMS message and one complete text consisting of sentences separated by spaces. A sentence always ends with one of . , ? , or ! . Words contain only letters. The task is to split the text into the minimum...
codeforces competitive-programming expression-parsing greedy strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 67 (Div. 2) ›

CF 75B - Facetook Priority Wall

CF 75B - Facetook Priority Wall Rating: 1500 Tags: expression parsing, implementation, strings Solve time: 2m 14s Verified: no Solution Problem Understanding We are given the name of a user on a social network and a sequence of activity messages between users. Every activity contributes a certain number of points between the two people involved. The three possible activities are: posting on someone's wall, worth 15 points commenting on someone's...
codeforces competitive-programming expression-parsing implementation strings May 28, 2026
Practice › Codeforces Solutions ›

Unknown Language Round 1

Unknown Language Round 1 Type: Special | Problems: 9 | Verified: 9/9 | Rating range: 1300-2400 | Time: 14m 26s Problem Name Rating Tags Solve Time Verified A Factorial 1300 *special, implementation 1m 13s ✓ B Expression 1500 *special, expression-parsing 1m 39s ✓ C Table 1600 *special, greedy, implementation 1m 25s ✓ D Presents 1800 *special, greedy 1m 40s ✓ E Prime Segment 1800 *special, brute-force, math 1m 28s ✓...
codeforces competitive-programming *special implementation expression-parsing greedy math brute-force May 28, 2026
Practice › Codeforces Solutions ›

Codeforces Beta Round 74 (Div. 1 Only)

Codeforces Beta Round 74 (Div. 1 Only) Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1800-2900 | Time: 12m 50s Problem Name Rating Tags Solve Time Verified A Robbery 1800 greedy 1m 54s ✓ B Widget Library 2300 dp, expression-parsing, graphs 2m 3s ✓ C Chip Play 2300 brute-force, data-structures, implementation 2m 14s ✓ D Space mines 2500 geometry 4m 9s ✓ E Fire and Ice...
codeforces competitive-programming greedy dp expression-parsing graphs implementation brute-force May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 74 (Div. 1 Only) ›

CF 89B - Widget Library

CF 89B - Widget Library Rating: 2300 Tags: dp, expression parsing, graphs, implementation Solve time: 2m 3s Verified: yes Solution Problem Understanding We are asked to simulate a tiny GUI layout system. There are three kinds of widgets. A plain Widget has a fixed width and height. HBox and VBox are container widgets that can store other widgets. An HBox places children horizontally, while a VBox places them vertically. Each...
codeforces competitive-programming dp expression-parsing graphs implementation May 28, 2026
Practice › Codeforces Solutions ›

Unknown Language Round 2

Unknown Language Round 2 Type: Special | Problems: 9 | Verified: 8/9 | Rating range: 1000-2300 | Time: 21m 37s Problem Name Rating Tags Solve Time Verified A Goshtasp, Vishtasp and Eidi 1800 *special, greedy, math 1m 18s ✓ B INI-file 2200 *special, implementation 1m 45s ✓ C Extraordinarily Nice Numbers 1200 *special, math 1m 26s ✓ D Perse-script 2300 *special, expression-parsing 1m 55s ✗ E Ali goes shopping 1800...
codeforces competitive-programming *special greedy math implementation expression-parsing brute-force May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 52 (Div. 2) ›

CF 56C - Corporation Mail

CF 56C - Corporation Mail Rating: 1700 Tags: data structures, expression parsing, implementation Solve time: 1m 33s Verified: yes Solution Problem Understanding The problem presents a company hierarchy encoded as a string. Each employee has a name, followed optionally by a colon and a comma-separated list of subordinates, ending with a dot. If an employee has no subordinates, the colon is omitted. Multiple employees can have the same name. The...
codeforces competitive-programming data-structures expression-parsing implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 7 ›

CF 7E - Defining Macros

CF 7E - Defining Macros Rating: 2600 Tags: dp, expression parsing, implementation Solve time: 1m 7s Verified: yes Solution Problem Understanding We are given a set of C-style #define macros and an expression, and we are asked to determine whether the expression becomes "suspicious" after macro substitution. In plain terms, a macro is a named expression, and whenever the name appears, it is replaced by its corresponding value. A suspicious...
codeforces competitive-programming dp expression-parsing implementation May 28, 2026
Practice › Codeforces Solutions ›

Codeforces Beta Round 67 (Div. 2)

Codeforces Beta Round 67 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1000-2400 | Time: 9m 31s Problem Name Rating Tags Solve Time Verified A Life Without Zeros 1000 implementation 1m 34s ✓ B Facetook Priority Wall 1500 expression-parsing, implementation, strings 2m 14s ✗ C Modified GCD 1600 binary-search, number-theory 1m 40s ✓ D Big Maximum Sum 2000 data-structures, dp, greedy 1m 34s ✓...
codeforces competitive-programming implementation expression-parsing strings binary-search number-theory data-structures May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 55 (Div. 2) ›

CF 59C - Title

CF 59C - Title Rating: 1600 Tags: expression parsing Solve time: 1m 53s Verified: yes Solution Problem Understanding We are given a string template consisting of lowercase letters and question marks. The final string must satisfy three conditions simultaneously. First, it must be a palindrome, so characters mirrored around the center must match. Second, it may use only the first k lowercase letters, meaning only characters from 'a' to 'a'...
codeforces competitive-programming expression-parsing May 28, 2026
Practice › Codeforces Solutions ›

Codeforces Beta Round 55 (Div. 2)

Codeforces Beta Round 55 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 800-2000 | Time: 8m 58s Problem Name Rating Tags Solve Time Verified A Word 800 implementation, strings 1m 11s ✓ B Fortune Telling 1200 implementation, number-theory 1m 57s ✗ C Title 1600 expression-parsing 1m 53s ✓ D Team Arrangement 2000 constructive-algorithms, greedy, implementation 2m 39s ✗ E Shortest Path 2000 graphs, shortest-paths...
codeforces competitive-programming implementation strings number-theory expression-parsing constructive-algorithms greedy May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 40 (Div. 2) ›

CF 41C - Email address

CF 41C - Email address Rating: 1300 Tags: expression parsing, implementation Solve time: 1m 41s Verified: no Solution Problem Understanding 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. If there are multiple candidates with the same...
codeforces competitive-programming expression-parsing implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 48 ›

CF 51B - bHTML Tables Analisys

CF 51B - bHTML Tables Analisys Rating: 1700 Tags: expression parsing Solve time: 3m 37s Verified: yes Solution Problem Understanding We are given a string that represents a simplified HTML table language. The language contains only three kinds of tags: <table> , <tr> , and <td> , together with their matching closing tags. A table contains rows, each row contains cells, and a cell is either empty or contains another...
codeforces competitive-programming expression-parsing May 28, 2026
Practice › Codeforces Solutions ›

School Team Contest 1 (Winter Computer School 2010/11)

School Team Contest 1 (Winter Computer School 2010/11) Type: Special | Problems: 11 | Verified: 9/11 | Rating range: 1100-2600 | Time: 23m 20s Problem Name Rating Tags Solve Time Verified A C*++ Calculations 2000 expression-parsing, greedy 2m 42s ✓ B Company Income Growth 1300 greedy 3m 27s ✓ C Moon Craters 2100 dp, sortings 4m 25s ✗ D Cubical Planet 1100 math 1m 27s ✓ E What Has Dirichlet...
codeforces competitive-programming expression-parsing greedy dp sortings math games May 28, 2026
Practice › Codeforces Solutions ›

Codeforces Beta Round 52 (Div. 2)

Codeforces Beta Round 52 (Div. 2) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1000-2200 | Time: 8m 47s Problem Name Rating Tags Solve Time Verified A Bar 1000 implementation 1m 28s ✓ B Spoilt Permutation 1300 implementation 1m 42s ✓ C Corporation Mail 1700 data-structures, expression-parsing, implementation 1m 33s ✓ D Changing a String 2100 dp 2m 12s ✓ E Domino Principle 2200 binary-search, data-structures,...
codeforces competitive-programming implementation data-structures expression-parsing dp binary-search sortings May 28, 2026
Practice › Codeforces Solutions › School Team Contest 1 (Winter Computer School 2010/11) ›

CF 39A - C*++ Calculations

CF 39A - C*++ Calculations Rating: 2000 Tags: expression parsing, greedy Solve time: 2m 42s Verified: yes Solution Problem Understanding We are given an arithmetic expression built from terms involving a single variable a . Every term is one of two forms: k * a++ k * ++a where k is an integer coefficient between 0 and 1000 . If the coefficient is missing, it is treated as 1 ....
codeforces competitive-programming expression-parsing greedy May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 32 (Div. 2, Codeforces format) ›

CF 32B - Borze

CF 32B - Borze Rating: 800 Tags: expression parsing, implementation Solve time: 1m 17s Verified: yes Solution Problem Understanding We are given a string written in the Borze encoding system. Every digit of a ternary number is represented by one of three patterns: "." represents 0 "-." represents 1 "--" represents 2 The task is to decode the entire string and print the resulting ternary number. The key detail is...
codeforces competitive-programming expression-parsing implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 34 (Div. 2) ›

CF 34C - Page Numbers

CF 34C - Page Numbers Rating: 1300 Tags: expression parsing, implementation, sortings, strings Solve time: 1m 7s Verified: yes Solution Problem Understanding We are asked to process a user-entered sequence of page numbers for printing. The input is a single string of positive integers separated by commas, such as 1,2,3,1,1,2,6,6,2 . Some numbers may repeat, possibly non-consecutively. Our goal is to produce a condensed, canonical representation: consecutive numbers are merged...
codeforces competitive-programming expression-parsing implementation sortings strings May 28, 2026
Practice › Codeforces Solutions › Unknown Language Round 1 ›

CF 64F - Domain

CF 64F - Domain Rating: 2000 Tags: *special, expression parsing Solve time: 1m 37s Verified: yes Solution Problem Understanding We need to decide whether a given string can be interpreted as a valid domain name under a simplified set of rules. The string may only contain lowercase English letters, digits, and dots. Dots separate the string into segments. The string cannot start with a dot or end with a dot,...
codeforces competitive-programming *special expression-parsing May 28, 2026
Practice › Codeforces Solutions › Unknown Language Round 1 ›

CF 64B - Expression

CF 64B - Expression Rating: 1500 Tags: *special, expression parsing Solve time: 1m 39s Verified: yes Solution Problem Understanding The input is a tiny arithmetic expression written as a three-character string. The first and third characters are digits from 0 to 9 , and the middle character is either + or - . The task is to evaluate the expression and print the resulting integer. For example, the input 1-5...
codeforces competitive-programming *special expression-parsing May 28, 2026
Practice › Codeforces Solutions › Unknown Language Round 2 ›

CF 72D - Perse-script

CF 72D - Perse-script Rating: 2300 Tags: *special, expression parsing Solve time: 1m 55s Verified: no Solution Problem Understanding We are asked to evaluate a string expression in a small function-based language. Every string literal is enclosed in quotes, and there are only four types of functions: concat , reverse , and substr in two forms. Each function operates only on strings or integers as indices. The input is a...
codeforces competitive-programming *special expression-parsing May 28, 2026
Practice › Codeforces Solutions ›

Codeforces Beta Round 32 (Div. 2, Codeforces format)

Codeforces Beta Round 32 (Div. 2, Codeforces format) Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2400 | Time: 6m 58s Problem Name Rating Tags Solve Time Verified A Reconnaissance 800 brute-force 1m 5s ✓ B Borze 800 expression-parsing, implementation 1m 17s ✓ C Flea 1700 math 1m 12s ✓ D Constellation 1600 implementation 59s ✓ E Hide-and-Seek 2400 geometry, implementation 2m 25s ✓
codeforces competitive-programming brute-force expression-parsing implementation math geometry May 28, 2026
Practice › Codeforces Solutions ›

Codeforces Beta Round 64

Codeforces Beta Round 64 Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1300-2700 | Time: 11m 7s Problem Name Rating Tags Solve Time Verified A Cookies 1300 math 1m 46s ✓ B Text Messaging 1600 expression-parsing, greedy, strings 1m 39s ✓ C Lucky Tickets 2200 binary-search, data-structures, sortings 2m 11s ✓ D Professor's task 2700 data-structures, geometry 2m 2s ✓ E Information Reform 2700 dp, implementation, trees...
codeforces competitive-programming math expression-parsing greedy strings binary-search data-structures May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 87 (Div. 1 Only) ›

CF 115D - Unambiguous Arithmetic Expression

CF 115D - Unambiguous Arithmetic Expression Rating: 2600 Tags: dp, expression parsing Solve time: 2m 6s Verified: yes Solution Problem Understanding We are asked to count the number of ways an arithmetic expression can be made unambiguous with parentheses so that, if all parentheses are removed, the expression is exactly the string given in the input. The input consists of digits and the four operators + , - , *...
codeforces competitive-programming dp expression-parsing May 28, 2026
Practice › Codeforces Solutions ›

Codeforces Beta Round 40 (Div. 2)

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...
codeforces competitive-programming implementation strings brute-force expression-parsing dp constructive-algorithms May 28, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 241: Different Ways to Add Parentheses

Problem Restatement We are given a string expression containing: Non-negative integers Operators: + - * We need to compute all possible results from adding parentheses in every valid way. The answer may contain duplicate values if different parenthesizations produce the same result. LeetCode examples include: Input: expression = "2-1-1" Output: [0,2] and: Input: expression = "2*3-4*5" Output: [-34,-14,-10,-10,10] The expression length is at most 20 . Input and Output Item...
leetcode divide-and-conquer recursion memoization expression-parsing May 10, 2026