Dashboard - Dynamic connectivity contest

Dynamic connectivity contest
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	Connect and Disconnect connect.in / connect.out 3 s, 256 MB	x1390
B	GraphAero bridges.in / bridges.out 2 s, 256 MB	x181
C	Bridges in a Tree bridges2.in / bridges2.out 5 s, 256 MB	x92
D	Bridges: The Final Battle bridges3.in / bridges3.out 2 s, 256 MB	x50
E	Disconnected Graph disconnected.in / disconnected.out 3 s, 256 MB	x267

Complete problemset

Questions about problems

	Question	Answer

The only programming contests Web 2.0 platform

Server time: May/22/2026 15:54:37 (g1).

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