30 ms·
In the symbolic case, general functional equivalence is undecidable, see: http://stackoverflow.com/questions/1132051/is-finding-the-equivalence-of-two-functions
by gosub 14y ago
In the symbolic case, general functional equivalence is undecidable, see: http://stackoverflow.com/questions/1132051/is-finding-the-equivalence-of-two-functions-undecidable http://stackoverflow.com/questions/1132051/is-finding-the-eq....
In the numeric case, it should be enough to rewrite the question in a different form until the symbolic checker gives up.
In the practical case, trying to game the system would be more difficult than finding the actual solution.
- thebooktocome 14y agoI recently took Sedgewick's course on algorithms, and you wouldn't believe how hard people on the forums worked to game the grader.
- scarmig 14y agoJust to be clear... that's a good thing, right? =)
- thebooktocome 14y agoNot necessarily. So the grader usually tested how much memory any exercise used over several data sets, and fit it to a quadratic. So one had to use, e.g., less than N^2 + 16N + 64 bytes. One exercise specified that a data structure used ints, but the grader only tested it on values that could be stored in a short. The extra spare memory allowed for an alternate implementation using a more complicated data structure. The point of the exercise was to figure out the somewhat trivial optimization that allowed the simpler data structure to run in roughly the same time, not to learn the more complicated data structure. After the more complicated solution was posted to the forums, there was really no incentive for people to figure out the simpler method.