Description
Straightforward
Minimum Spanning Tree
Challenge
Landline Telephone Network
Start & End Times
| Start Time | 2025-11-04 20:00 CET |
| End time | 2025-11-12 05:59 CET |
Problems
| Label | Problem |
|---|---|
| A | Minimum Spanning Tree |
| B | Landline Telephone Network |
Scoring
Pass/Fail — Unranked
Explanation:
Each problem is pass/fail. Participants are not ranked
Results
- Results are shown without limitation.
Languages
Ada Algol 60 Algol 68 APL Bash BCPL BQN C C with GMP C with Memory Check C# C++ C++ with GMP C++ with Memory Check COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Fortran 77 Gerbil Go Haskell Icon Java Java with Algs4 JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP PL/I Prolog Python 2 Python 3 Python 3 with NumPy Racket Ruby Rust Scala Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig