Surprise Language Round 5

5 problems from Surprise Language Round 5 (contest 153), difficulty 1600-2200. 4/5 solutions verified against sample I/O.

5 items

Surprise Language Round 5

Special | 5 problems | 4/5 verified | Difficulty 1600-2200 | 6m 19s

#	Problem	Rating	Tags	Accepted	Time	✓
A	A + B	1600	*special	948	59s	✓
B	Binary notation	1800	*special	166	1m 29s	✓
C	Caesar Cipher	2200	*special	415	1m 2s	✓
D	Date Change	2000	*special	89	1m 16s	✓
E	Euclidean Distance	2100	*special	84	1m 33s

Practice › Codeforces Solutions › Surprise Language Round 5 ›

CF 153A - A + B

We are asked to compute the sum of two integers, but the emphasis is on careful output formatting. Specifically, the input consists of two numbers, each on its own line, and we need to print their sum without any leading zeros.

Practice › Codeforces Solutions › Surprise Language Round 5 ›

CF 153B - Binary notation

We are given a single positive integer and must print its representation in base 2. In other words, we want to express the number as powers of two and output the corresponding sequence of bits.

Practice › Codeforces Solutions › Surprise Language Round 5 ›

CF 153C - Caesar Cipher

We are asked to implement a Caesar cipher on an input string of uppercase Latin letters. Conceptually, this means each letter is shifted forward in the alphabet by a fixed number of positions, denoted by k. If the shift goes past 'Z', it wraps around to 'A'.

Practice › Codeforces Solutions › Surprise Language Round 5 ›

CF 153D - Date Change

We are asked to manipulate dates by adding or subtracting a number of days. The input consists of a date string in the "DD.MM.YYYY" format and an integer representing a shift in days, which can be positive or negative.

Practice › Codeforces Solutions › Surprise Language Round 5 ›

CF 153E - Euclidean Distance

We are given up to 50 points on a 2D plane. Each point has integer coordinates, and some points may coincide. The task is to find the largest Euclidean distance between any pair of points.