snowmanonahoe's blog

Solve any programming problem with this one weird trick!
By snowmanonahoe, history, 11 months ago, In English

I have solved competitive programming. With my algorithm, you can solve any programming problem ever!

The reason a general algorithm for all algorithms does not exist is because of the halting problem. If you were to iterate through all programs, it is impossible to determine whether or not a program will halt, so you will hit a program that is an infinite loop with no deterministic way to continue.

But, this is cp, there's a time limit, so we can just cut it off at the time limit. No more halting problem.

The algorithm:

  1. Iterate through every writable ASCII string.

  2. Try to compile it.

  3. If it succeeds, run the sample case on it.

  4. If it gives the right answer, submit it.

  5. Continue until AC.

LGM has never before been so easy.

  • Vote: I like it
  • +13
  • Vote: I do not like it

»
11 months ago, # |
  Vote: I like it +40 Vote: I do not like it

This is just the infinite monkey theory except we would need a lot more of you.

→ Reply
»
11 months ago, # |
  Vote: I like it +5 Vote: I do not like it

Also you can only iterate through compilable strings to speed up the algorithm.

→ Reply
»
11 months ago, # |
← Rev. 3   Vote: I like it +3 Vote: I do not like it

And this is also Asymptotically Optimal!!1.

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Is that even real ? give an example !, really interested?

→ Reply