The bronze, silver and gold problems mark the level of difficulty and define the hardest problem to be solved for the respective achievement. For further information please take a look at the rewards and achievements page.

For further information about the code layout please read the Java-code and C-code description. Other useful information can be found on the problem description page. Note that the ProblemXExternal file should not be edited as it will be replaced in 09/05/2015 to create the actual problem.

---

tarball containing all RV problems

plain	arithmetic, medium	data structures, large
solution Problem4 small problem without complicated data structures and obfuscation	solution Problem5 medium-sized problem with arithmetic computations	solution Problem6 large problem with arithmetic computations, array syntax and much code noise
Problem 4: traces and external	Problem 5: traces and external	Problem 6: traces and external

---

Please remember that the ProblemXExternal.c and ProblemXExternal.java files are going to be replaced on 09/01/15, this is also when input sequences for monitoring are going to be provided. C problems can be compiled and run with

    $ gcc -o ProblemX ProblemX.c ProblemXExternal.c 
    $ ./ProblemX
    1                                   
    24                                   
    .
    .
    .

Java problems can be compiled and run with

    $ javac ProblemX.java ProblemXExternal.java
    $ java ProblemX.java
    A                                   
    X                                   
    .
    .
    .