National University of Singapore

Increasing CP5 Lower Bound (Day 1)

Welcome to Increasing CP5 Lower Bound (Day 1)

10
Problems

20
Students

45
Languages

23
Submissions

Start & End Times

Start Time	2020-12-07 05:00 CET
End time	2020-12-07 10:00 CET

Problems

Label	Problem
A	Brocard Point of a Triangle
B	Fence Orthogonality
C	ICPC Camp
D	Necklace Decomposition
E	Coin Stacks
F	Cowboy Checkers
G	Divisibility Shortcut
H	Flight Plan Evaluation
I	Hot Dogs in Manhattan
J	Ski Lifts

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

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