Surprise Language Round 6

8 problems from Surprise Language Round 6 (contest 188), difficulty 1100-1800. 8/8 solutions verified against sample I/O.

8 items

Surprise Language Round 6

Special | 8 problems | 8/8 verified | Difficulty 1100-1800 | 11m 8s

# Problem Rating Tags Accepted Time ✓
A Hexagonal Numbers 1100 *special 848 1m 15s ✓
B A + Reverse B 1300 *special, implementation 788 1m 6s ✓
C LCM 1400 *special, implementation, math 502 3m 2s ✓
D Asterisks 1100 *special, implementation 750 57s ✓
E HQ9+ 1400 *special, implementation 556 57s ✓
F Binary Notation 1400 *special, implementation 345 1m ✓
G Array Sorting 1600 *special, implementation 346 1m 10s ✓
H Stack 1800 *special, expression-parsing, implementation 686 1m 41s ✓
Practice › Codeforces Solutions › Surprise Language Round 6 ›

CF 188G - Array Sorting

The task is to sort a list of integers in non-descending order. You are given the size of the list, n, and then n integers, each on a separate line, with values ranging from 1 to 100.
codeforces competitive-programming *special implementation Jun 5, 2026
Practice › Codeforces Solutions › Surprise Language Round 6 ›

CF 188A - Hexagonal Numbers

We are asked to calculate the n-th hexagonal number. Hexagonal numbers represent a figurate number pattern where each number counts the total tiles forming a hexagon with successive layers. The formula for the n-th hexagonal number is given by $Hn = 2n^2 - n$.
codeforces competitive-programming *special Jun 5, 2026
Practice › Codeforces Solutions › Surprise Language Round 6 ›

CF 188H - Stack

The input is a string that describes operations on a stack. Each digit means "push this number onto the stack". Each + or means "take the top two values from the stack, apply the operation, and push the result back".
codeforces competitive-programming *special expression-parsing implementation Jun 4, 2026
Practice › Codeforces Solutions › Surprise Language Round 6 ›

CF 188C - LCM

We are given two positive integers and need to compute their least common multiple. The least common multiple, usually abbreviated as LCM, is the smallest positive integer that is divisible by both numbers without leaving a remainder.
codeforces competitive-programming *special implementation math Jun 4, 2026
Practice › Codeforces Solutions › Surprise Language Round 6 ›

CF 188F - Binary Notation

The task is to take a single positive integer and express it in base 2, meaning we rewrite it using only powers of two with coefficients 0 or 1. Instead of the usual decimal representation, we want the binary string that tells us which powers of two sum up to the number.
codeforces competitive-programming *special implementation Jun 3, 2026
Practice › Codeforces Solutions › Surprise Language Round 6 ›

CF 188E - HQ9+

We are asked to analyze a string representing a program written in HQ9+, a toy language with four instructions: H, Q, 9, and +. Only the first three produce output when executed: H prints "Hello, World!
codeforces competitive-programming *special implementation Jun 3, 2026
Practice › Codeforces Solutions › Surprise Language Round 6 ›

CF 188D - Asterisks

The problem asks us to generate a simple text pattern. We are given a single integer n, which represents the number of lines we need to print. The first line should contain a single asterisk, the second line two asterisks, and so on, until the n-th line contains n asterisks.
codeforces competitive-programming *special implementation Jun 3, 2026
Practice › Codeforces Solutions › Surprise Language Round 6 ›

CF 188B - A + Reverse B

The task is to compute the sum of a number a and the reversed digits of another number b. Reversing a number means writing its digits in opposite order while ignoring any leading zeros that appear after reversal. For example, reversing 230 produces 32, and reversing 0 remains 0.
codeforces competitive-programming *special implementation Jun 3, 2026