VK Cup 2019 - Квалификация (Engine)

5 problems from VK Cup 2019 - Квалификация (Engine) (contest 1275), difficulty -. 1/5 solutions verified against sample I/O.

5 items

VK Cup 2019 - Квалификация (Engine)

Special | 5 problems | 1/5 verified | Difficulty - | 15m 17s

#	Problem	Tags	Accepted	Time	✓
A	\u0421\u043a\u0440\u044b\u0442\u044b\u0439 \u0434\u0440\u0443\u0433	*special	891	4m 45s
B	Code Review	*special	844	2m 41s
C	#define \u0417\u0430\u0434\u0430\u0447\u0430 B ...	*special	698	2m 4s	✓
E2	\u041a\u043e\u043d\u0442\u0440\u043e\u043b\u044c\u043d\u0430\u044f \u0441\u0443\u043c\u043c\u0430	*special	138	3m 19s
F	\u0428\u0430\u0440\u0434\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u043f\u043e\u0441\u0442\u043e\u0432	*special, binary-search, interactive	92	2m 28s

Practice › Codeforces Solutions › VK Cup 2019 - Квалификация (Engine) ›

CF 1275A - Скрытый друг

We are given a directed friendship graph of $n$ users, where each user lists some other users as friends. The important detail is that friendship is not guaranteed to be mutual. If user $u$ lists $v$, it does not imply that $v$ lists $u$.

Practice › Codeforces Solutions › VK Cup 2019 - Квалификация (Engine) ›

CF 1275E2 - Контрольная сумма

We are working with a byte array, and a checksum function, CRC32, that compresses the entire array into a single 32-bit value.

Practice › Codeforces Solutions › VK Cup 2019 - Квалификация (Engine) ›

CF 1275F - Шардирование постов

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…

Practice › Codeforces Solutions › VK Cup 2019 - Квалификация (Engine) ›

CF 1275B - Code Review

Practice › Codeforces Solutions › VK Cup 2019 - Квалификация (Engine) ›

CF 1275C - #define Задача B ...

We are asked to simulate a massive array defined recursively using C-style macros. The macros expand in a very structured way: each macro level quadruples the number of elements generated by the previous level, with simple offsets added.