Kattis

INPT KTH Popup 2005

Welcome to INPT KTH Popup 2005

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

3
Problems

1 / 2
Contestants / Teams

40
Languages

2
Submissions

Start & End Times

Start Time	2017-11-24 18:06 CET
End time	2017-11-24 20:06 CET

Problems

Label	Problem
A	Modular Arithmetic
B	Rational Arithmetic
C	Single source shortest path, time table

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