Download White-Box Problems
As of 15.7.2014 the problems 10, 11 and 12 have been replaced due to a generation mistake.
Sorry for the inconvenience.
The bronze, silver and gold problems mark the level of difficulty and define the hardest problem to be solved for the respective achievement in a category. 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.
Alternatively, a tarball containing all White-Box problems (and solutions) is also provided.
Alphabet size: 5, small program, simple
Property File: constraints-5.txt
plain | arithmetic | data structures |
Problem1.java[int only]
Problem1.c solution |
Problem2.java[int only]
Problem2.c solution |
Problem3.java[int only]
Problem3.c solution |
Alphabet size: 10, still small program, simple
Property File: constraints-10.txt
plain | arithmetic | data structures |
Problem4.java[int only]
Problem4.c solution |
Problem5.java[int only]
Problem5.c solution |
Problem6.java[int only]
Problem6.c solution |
Alphabet size: 15, medium program, complicated
Property File: constraints-15.txt
plain | arithmetic | data structures |
Problem7.java[int only]
Problem7.c solution |
Problem8.java[int only]
Problem8.c solution |
Problem9.java[int only]
Problem9.c solution |
Alphabet size: 20, large program, hard
Property File: constraints-20.txt
plain | arithmetic | data structures |
Problem10.java[int only]
Problem10.c solution |
Problem11.java[int only]
Problem11.c solution |
Problem12.java[int only]
Problem12.c solution |