Update 18.12.2017:
You can now upload your solutions on vmchecker. There will be a bonus for the fastest solutions to the the first problem.
Update 14.12.2017:
I’ve uploaded sample tests for the first and second problem.
========================================================
The second assignment has been published here.
It will be available on vmchecker very soon.
If you choose to implement in Java, the archive must contain:
- Plants.java
- Madripoor.java
- Readme
Important! The java files must not have any package declaration in it. If it has, then remove it before uploading the archive. Otherwise, only if you want to use a different structure, you will need to provide a Makefile.
If you implement in C/C++, you need to provide a Makefile with at least these 3 rules:
- build – a rule to build the binary files
- run-p1 – a rule that runs the binary for the first problem
- run-p2 – a rule that runs the binary for the second problem
Makefile examples:
Remember to describe in the Readme file the algorithm used in your solution, and its complexity.
Coding style suggestions.
The deadline for the assignment is 08.01.2018 23:59. (HARD deadline, no later submissions accepted)
Any questions can be addressed as comments on this post.
Do we have sample tests for the second assigment?
Yes, I will publish a set of sample tests in the next few days.
Is the example for the first problem wrong? In the table for flower nr 3 it appears type B but in the explanation it says flower 3 type A. Also the result should be in ascending order. They don’t appear so in the table. Shouldn’t the result be (in the example) flowers 1,2 and 5?
Yes, sorry, there was a discrepancy in the explanation, which has been fixed now.