Skip to content

Commit

Permalink
Add problem description and README
Browse files Browse the repository at this point in the history
  • Loading branch information
Ludwig-Work committed May 12, 2023
1 parent 822e012 commit bd1861b
Show file tree
Hide file tree
Showing 2 changed files with 24 additions and 0 deletions.
Binary file added Lazy-Math-Instructor.pdf
Binary file not shown.
24 changes: 24 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
# Lazy Math Instructor

## Introduction
This is my code for the proseminar [Selected Fun Problems of the ACM Programming Contest](https://db.cs.uni-tuebingen.de/teaching/ss23/acm-programming-contest-proseminar/) at the University of Tübingen, Summer Term 2023.

The problem worked on is the [Lazy Math Instructor](./Lazy-Math-Instructor.pdf): The exercise is to check arbitrary terms for equivalence.
Terms may contain brackets, addition, subtraction and multiplication of integer constants and variables `a` to `z`.

They are evaluated from left to right with no operator precedence.

## Usage of the program

The program is written in C# .NET 7.0 and should run on any supported platform.

Program reads from STDIN:
- 1 line with the number `n` of equivalences to test
- 2`n` lines with a term each.

Program writes to STDOUT:
- `n` lines, reading
- `YES` if the `n`-th pair of terms are equivalent
- `NO` if they aren't.

Verbose mode can be enabled by passing `-v` as a command line argument, in which case the program will print each term after it was parsed, normalized and ordered deterministically.

0 comments on commit bd1861b

Please sign in to comment.