Kattis

Contests/ KTH CSC Popup 2005_1/ Contest
0:00:00
-1663 days 1:00:06
Contest is over

KTH CSC Popup 2005_1

Time elapsed

161:05:00

Time Remaining

0:00:00

Starts in

-1663 days 1:00:06

Ends in

-1656 days 7:55:06

Start

2020-11-27 07:55 CET

End

2020-12-04 01:00 CET
Visit Scoreboard
Log in

KTH CSC Popup 2005_1

Welcome to KTH CSC Popup 2005_1

This is the contest system for KTH CSC Popup 2005_1. The contest has now finished. You can view the final results.

14
Problems
1
Contestants
47
Languages
3
Submissions

Start & End Times

Start Time 2020-11-27 07:55 CET
End time 2020-12-04 01:00 CET

Problems

Label Problem
A All Pairs Shortest Path
B Calculator
C Catalan Numbers
D Chinese Remainder
E Chinese Remainder Theorem (non-relatively prime moduli)
F Closest Pair
G Closest Pair (Uniform)
H Convex Hull
I Eulerian Path
J Linear Equation Solver
K Line Segment Distance
L Line Segment Intersection
M Maximum Flow
N Maximum Number of Colinear Points

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

Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig