Codeforces Round 698 (Div. 2)

Solutions for Codeforces Round 698 (Div. 2) (contest 1478). 2/3 problems verified against sample I/O. Difficulty range: 800-1700.

3 items

Codeforces Round 698 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 800-1700 | Time: 6m 53s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Nezzar and Colorful Balls	800	brute-force, greedy	1m 57s	✓
B	Nezzar and Lucky Number	1100	brute-force, dp, greedy	1m 57s	✓
C	Nezzar and Symmetric Array	1700	implementation, math, sortings	2m 59s	✗

Practice › Codeforces Solutions › Codeforces Round 698 (Div. 2) ›

CF 1478C - Nezzar and Symmetric Array

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

Practice › Codeforces Solutions › Codeforces Round 698 (Div. 2) ›

CF 1478A - Nezzar and Colorful Balls

Nezzar has a sequence of balls, each labeled with a number from a non-decreasing array. He wants to color the balls using as few colors as possible with the rule that, if we isolate all balls of the same color, their numbers must strictly increase.

Practice › Codeforces Solutions › Codeforces Round 698 (Div. 2) ›

CF 1478B - Nezzar and Lucky Number

We are given a digit $d$ and a collection of queries. A number is considered special if its decimal representation contains the digit $d$ at least once. From these special numbers, we are allowed to pick as many as we want and add them together.