Module 2

Time elapsed

210:00:00

Time Remaining

0:00:00

Starts in

-11 days 12:33:06

Ends in

-2 days 18:33:06

Start

2025-11-24 01:00 CET

End

2025-12-02 19:00 CET

Visit Results

Module 2

Welcome to Module 2

13
Problems

13
Students

55
Languages

240
Submissions

Start & End Times

Start Time	2025-11-24 01:00 CET
End time	2025-12-02 19:00 CET

Problems

Label	Problem
A	Deterministic Finite Automata - Read
B	Deterministic Finite Automata - Complement
C	Deterministic Finite Automata - Union
D	Deterministic Finite Automata - Intersection
E	Deterministic Finite Automata - Difference
F	Deterministic Finite Automata - Symmetric Difference
G	Deterministic Finite Automata - Concatenation
H	Deterministic Finite Automata - Kleene Star
I	Deterministic Finite Automata - Is the Empty Language?
J	Deterministic Finite Automata - Is a Finite Language?
K	Deterministic Finite Automata - Minimum Word Length
L	Deterministic Finite Automata - Maximum Word Length
M	Deterministic Finite Automata - Enumeration

Scoring

Pass/Fail — Ranked

Explanation:
Each problem is pass/fail. Participants are ranked by the number of solved problems, breaking ties by penalty (sum of time + 20 minutes per wrong submission, for all solved problems). Time is rounded to minutes.

Results

Results are shown without limitation.

Languages

Ada Algol 60 Algol 68 APL Bash BCPL BQN C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Fortran 77 Gerbil Go Haskell Icon Java 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 Racket Ruby Rust Scala Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig