Kattis

FSDM BDSAS 8.0

Welcome to FSDM BDSAS 8.0

This is the contest system for FSDM BDSAS 8.0. The contest has now finished. You can view the final results.

80
Problems

15 / 16
Contestants / Teams

40
Languages

102
Submissions

Start & End Times

Start Time	2019-01-17 18:29 CET
End time	2019-01-24 18:29 CET

Problems

Label	Problem
A	Single source shortest path, non-negative weights
B	Digraphs
C	Coast Length
D	Minimum Spanning Tree
E	Breaking Bad
F	Get Shorty
G	Freckles
H	Shopping Malls
I	Dominoes 2
J	Reactivity Series
K	Torn To Pieces
L	Big Truck
M	Birthday Party
N	Marbles On A Tree
O	Single source shortest path, time table
P	Eulerian Path
Q	Interval Cover
R	Odd Man Out
S	Convex Polygon Area
T	Shuffles
U	Coloring Graphs
V	Tri Tiling
W	Veci
X	Islands in the Data Stream
Y	Odds of Mia
Z	The Easiest Problem Is This One
AA	Debugging
AB	Narrow Art Gallery
AC	Server
AD	The Mailbox Manufacturers Problem
AE	Engineering English
AF	Repeated Substrings
AG	Collecting Beepers
AH	Power Strings
AI	Flying Safely
AJ	Terraces
AK	Flag Quiz
AL	Self-Similar Strings
AM	Exact Change
AN	Restaurant Orders
AO	Spiderman's Workout
AP	Aspen Avenue
AQ	Kleptography
AR	A Rational Sequence (Take 3)
AS	DA-Sort
AT	FBI Universal Control Numbers
AU	Tight-Fit Sudoku
AV	Which Base is it Anyway?
AW	Bipartite Battle
AX	A Different Problem
AY	Harshad Numbers
AZ	Enjoying Elderberries
BA	Coconut Splat
BB	Closest Pair (Uniform)
BC	Grab a Graph
BD	Falling Apart
BE	Irrational Division
BF	Manhattan Mornings
BG	King of the Waves
BH	Erase Securely
BI	Planting Trees
BJ	Boiling Vegetables
BK	Numbers On a Tree
BL	Amanda Lounges
BM	Brexit
BN	Backspace
BO	Elementary Math
BP	Bless You Autocorrect!
BQ	Iron and Coal
BR	A1 Paper
BS	Robotopia
BT	Committee Assignment
BU	Gear Changing
BV	Witchwood
BW	Nested Dolls
BX	Brexit Negotiations
BY	A Feast For Cats
BZ	Fire Station
CA	Integer Estate Agent
CB	Building Fences

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