Dashboard - TheForces Round #43 (DIV2-Forces)

TheForces Round #43 (DIV2-Forces)
Finished

→ Virtual participation

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - solve these problems in the archive. If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive. Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

→ Practice?

Want to solve the contest problems after the official contest ends? Just register for practice and you will be able to submit solutions.

Problems

#	Name
A	Mystic Quest standard input/output 1 s, 256 MB	x127
B	Permutation We Stand standard input/output 1 s, 256 MB	x108
C1	Colorful Subarrays (Easy Version) standard input/output 3 s, 256 MB	x52
C2	Colorful Subarrays (Hard Version) standard input/output 3 s, 256 MB	x32
D	Simplest Fractions standard input/output 1 s, 256 MB	x41
E	Empty Tree standard input/output 2 s, 256 MB	x15
F	Equal Node Sum standard input/output 3 s, 512 MB	x6

Complete problemset

Questions about problems

	Question	Answer

The only programming contests Web 2.0 platform

Server time: Oct/28/2026 13:30:13 (g2).

Desktop version, switch to mobile version.

Supported by

Problem:

	Add a copy of announcement for problem Add a copy of announcement for contest

	Fields below will be interpreted as plain text.
English text:

Russian text:

Target user:
	Leave blank if you want to announce all participants

Ask a question

Add announcement

Problem:

Question:
	At most 1000 characters