Kattis

Contests/ USC ICPC Practice: Exhaustive Search/ Contest
Log in

USC ICPC Practice: Exhaustive Search

Welcome to USC ICPC Practice: Exhaustive Search

This is the contest system for USC ICPC Practice: Exhaustive Search. The contest has now finished. You can view the final results.

8
Problems
0 / 14
Contestants / Teams
46
Languages
0
Submissions

Start & End Times

Start Time 2024-11-07 05:00 CET
End time 2024-11-14 04:59 CET

Problems

Label Problem
A Social Advertising
B Peg Solitaire
C Victory Through Synergy
D Yet Satisfiability Again!
E GREAT + SWERC = PORTO
F Cracker Barrel Game
G Fruit Baskets
H Longest Common Subsequence

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 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig