Update documentation

Author: ishanpranav

README.md

@@ -3,7 +3,8 @@
 This is a collection of solutions to the
 [Advent of Code 2019](https://adventofcode.com/2019) programming problems
 implemented in the C programming language. I have done my best to minimize time
-complexity and running time.
+complexity and running time. This repository only includes solutions to the
+[Intcode](https://esolangs.org/wiki/Intcode) problems.
 
 Some of the more complex problems were implemented in a
 [higher-level programming language](ref/) before being converted to C. The
@@ -32,22 +33,13 @@ I am working within the following constraints to ensure high code quality.
 - Final solutions must be implemented in the C programming language following
  the C99 standard.
  - Assume signed integer overflow is defined based on two\'s complement.
-- All solutions must be standalone files with no user-defined headers and no
- external dependencies beyond the C standard library (`libc`) and the C
- mathematics library (`libm`). The first and second problems for a given day
- must be implemented separately.
+- All solutions must be standalone files with no external dependencies beyond
+ the C standard library (`libc`) and the C mathematics library (`libm`). The
+ first and second problems for a given day must be implemented separately.
 - Bounds checking is not required for data structures whose capacity is defined
  by a macro.
 - The return values of all C standard library functions must be checked, except
  for those returned from the following:
  - `fprintf`
  - `memcpy`
  - `printf`
-
-## Omissions
-
-- The solution must produce the correct result for the [examples](data/), not
- just the personalized puzzle input. This means that the efficient solutions to
- Day 10(b) and Day 21(b) are unfeasible. I have omitted both.
-- By design, there is no efficient solution to Day 23(a) and (b). I have
- omitted both.