Skip to content

Add new problem type: Implementation #7

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -20,6 +20,7 @@ Problem Bank
1. Using Linux to mimic online Judges
1. A.out > input.in
1. C++ - cin/cout v C - printf/scan
1. [Implementation](https://github.com/progteam/problem-bank/blob/master/implementation.md)
1. **Linear Data Structures**
1. Static Arrays
1. When we know max size
Expand Down
15 changes: 15 additions & 0 deletions implementation.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
Implementation
==============
This is a class of problems where the problem-solving strategy is trivial or
given as part of the problem statement. The challenge for the programmers is to
implement the strategy correctly for all cases. Different ways of modeling the
problem or different code structures may affect the complexity: a well-designed
structure not only makes the code more reable but also makes the solution much
shorter (takes less time to type).

### Easy
- [DRM Messages](https://open.kattis.com/problems/drmmessages)


### Solutions
- [DRM Messages](https://github.com/progteam/problem-bank/tree/master/solutions/drmmessages)