Status - 2014 Winter Programming School, Kharkiv, day 7 (S. Kopeliovich)

Problem A4 - Triple-matching (subtask 4)

Contest status

#	When	Who	Problem	Lang	Verdict	Time	Memory
126476805	Aug/19/2021 21:19	Share	A4 - Triple-matching (subtask 4)	C++17 (GCC 9-64)	Accepted	92 ms	4200 KB
39961500	Jul/04/2018 19:36	Radewoosh	A4 - Triple-matching (subtask 4)	C++17 (GCC 7-32)	Accepted	904 ms	100 KB
111513939	Mar/31/2021 02:45	speedermen	A4 - Triple-matching (subtask 4)	GNU C++11	Accepted	684 ms	55300 KB
111513948	Mar/31/2021 02:46	speedermen	A4 - Triple-matching (subtask 4)	GNU C++11	Accepted	530 ms	55300 KB
111514007	Mar/31/2021 02:49	speedermen	A4 - Triple-matching (subtask 4)	GNU C++11	Accepted	466 ms	55300 KB

Sort by:

2014 Winter Programming School, Kharkiv, day 7 (S. Kopeliovich)
Finished

→ About Contest

This contest was held as part of the Winter Programming School (ws.kh.ua),which was carried out in Kharkiv on February 14-24, 2014. The author of the contest is Sergey Kopeliovich, contest subject: Brute-force search and NP-complete problems.

Contest website

→ 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.

→ Status filter

Problem:

The only programming contests Web 2.0 platform

Server time: Apr/30/2026 20:14:11 (g2).

Mobile version, switch to desktop version.

Supported by

Judgement protocol