Start & End Times
| Start Time | 2019-10-23 06:00 CEST |
| End time | 2019-11-13 04:59 CET |
Problems
| Label | Problem |
|---|---|
| A | Travelling Salesperson 2D |
| B | Minimum Weighted Vertex Cover |
Scoring
Partial Credit — Ranked (with tiebreaker)
Explanation:
Participants are ranked by the sum of the score of each problem. Ties are broken by the time of the last score-increasing submission
Results
- Results are shown without limitation.
Languages
Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal C with GMP C++ with GMP C with Memory Check C++ with Memory Check Dart F# Fortran Gerbil Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Python 3 with NumPy Ruby Rust Simula 67 SNOBOL Swift TypeScript Visual Basic Zig