This repository contains my solutions to CodeChef problems. These solutions are provided "as is" - I give no guarantees that they will work as expected.
You can compile all the problems by issuing the following command:
$ make
If you want to compile only a specific problem, issue the following command, replacing <problem_id> with the section and identifier of the problem you want to compile (see section "Problems Solved" for the list of possible identifiers):
$ make <problem_id>
Running a compiled problem is just a matter of executing a command similar to the next one, replacing <problem_id> with the identifier of the desired problem:
$ ./<problem_id>
Unless stated otherwise, every problem in this repository reads from the standard input and writes to the standard output.
The following is the list of the problems solved. Each problem identifier is specified between round brackets. Problems marked with ✓ are done, while problems with ✗ are not complete or aren't efficient enough for the problem's limits.
- ✓ Chef-Detective (
CHEFDETE) - ✓ Kitchen Timetable (
KTTABLE)
- ✓ Devu and a light discussion (
DEVLDISC) - ✓ Chef and Feedback (
ERROR) - ✓ K-good Words (
KGOOD) - ✓ Better Maximal Sum (
MMSUM) - ✓ Please like me (
PLZLYKME) - ✗ Sereja and Two Lines (
SEATL) - ✓ Chef and Strange Operations (
STROPR)
- ✓ Bytelandian gold coins (
COINS) - ✓ Longest Increasing Subsequences (
MAKELIS) - ✓ Prime Generator (
PRIME1)