Kattis

LTH algoworkshop #5 - Dynamisk programmering

Welcome to LTH algoworkshop #5 - Dynamisk programmering

This is the contest system for LTH algoworkshop #5 - Dynamisk programmering. The contest has now finished. You can view the final results.

17
Problems

10
Contestants

40
Languages

158
Submissions

Start & End Times

Start Time	2019-05-21 18:00 CEST
End time	2019-05-28 18:00 CEST

Problems

Label	Problem
A	Generalized Recursive Functions
B	Balanced Diet
C	Canonical Coin Systems
D	Mountain Scenes
E	Muzicari
F	Cent Savings
G	Pebble Solitaire
H	Pebble Solitaire
I	Dice Betting
J	Maximizing (And Minimizing) Your Winnings
K	Train Sorting
L	Safe Passage
M	Debugging
N	Tri Tiling
O	Aspen Avenue
P	Toys
Q	Bitcoin Toss

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.

Standings

Standings are shown without limitation.

Languages

Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal 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 Ruby Rust Simula 67 SNOBOL Swift TypeScript Visual Basic Zig