pdany

3 ms·

1. 1.▲
   by pdany 16y ago

   I never participated in IOI, but at least in ACM contests I have never seen a problem where suboptimal heuristic search was allowed.
2. 2.▲
   by pdany 16y ago

   Well a lot of prolog implementations also feature finite domain and rational domain solvers, global constrains that I don't think your 15 year old buddies would be able to code in an hour. Having said that, most problems we solve here are N
3. 3.▲
   by pdany 16y ago

   I think you are overestimating the current capabilities of JIT's. Also, unfortunately, current compilers are notoriously bad at generating code with special instructions (vectorized code). So in the end applications that need to be really f