@ASCII-only I need to be able to push an (int|bool|float) to lua from the context of a larger templated function. Which means i need to call one of three different lua library functions depending on the type. So with this solution, I can call doStuff<int> and it will do a bunch of stuff including pushing an integer onto lua's stack. If I named the three push functions differently, I'd have to write the 50 line doStuff function three separate times so I can change one line.
Write a program that, in different languages, output a different shuffle(the exact source is counted as one shuffle) of the code.
Proper quine rule apply. Largest (Language count)^6/(Code length) win.
Sample: If your code is AAB and running in several languages return ABA, AAB, AAB, then its sc...
Craptastic Program Search
A certain well-known cable company has a somewhat clumsy 'Search for Program' feature that works through the remote. But it takes a lot of button pushing; so, being a lazy couch-potato, I thought I'd seek out a programmer's help to minimize the number of button-pushes I...
A number theory expression contains:
There exists at least one non-negative integer (written as E, existential quantifier)
All non-negative integers(written as A, universal quantifier)
+ (addition)
* (multiplication)
= (equality)
>, < (comparison operators)
&(and), |(or), !(not)
(, ) (for groupi...
200 rep for an Abstract Rewriting System under 100 points
This will be awarded to the first answer to Abstract Rewriting Challenge (Cops) that scores less than 100 points and doesn't get cracked (or invalidated).
I'm angry at myself right now. I wrote a 27 KB Mornington Crescent solution to Script that outputs a script that prints a given input, but now I've realised that I can use a slightly different approach that will almost surely be shorter
@NewMetaPosts Our last feature request (mathjax) has not been done. I predict this would be postponed until at least next moderator election, by then I should have at least 16384 rep.
@cairdcoinheringaahing Our policy is to give answerers a reasonable amount of time to self-delete. In case they don't, the best way to make sure that we don't forget about the post is to flag it.
Get Rid of GoTo's
My (pseudo) code is full of goto's! What a mess... Let's change it into a more iterative code.
SPECIFICATION
Each input consists of:
<HEADER> {
0: <code>
1: <code> (optional)
2: <code> (optional)
...
99: <code> (optional)
}
where:
<HEADER>: It is the meth...
About the linked SO post, I have completely no idea how that has 2 upvotes.
Useful to other visitors? I'm not sure. Probably. But it's impossible to have 2 such visitors in such a short period of time. "You think it may be useful to future visitors" is too subjective. Effort? 0. Although the picture is nice.
(anyone somewhat familiar with SO explains ^ please?)
(btw can someone rewrite the "ordering rectangles" part, [top coord, left coord, bot coord, right coord] lexicographically order or something)
The 3n+1 problem
The legendary problem in UVa Online Judge, with over 775k submissions and over 85k people who solved it. I, personally, have solved it in many ways, even reaching the best time below 0.01 sec.
Even though the problem is interesting from the algorithmic point of view, insofar as...
50 rep bounty to whoever makes a quine using this language. Not on TIO, doesn't have any real documentation. Ping me if you need any help. Don't post the actual quine, you can choose an answer to be bountied
in particular, recursion theorem says that if you specify f(0) and if you specify f(n+1) from f(n) for every n, then there is indeed a function f
well that sounds very similar to induction theorem, i.e. if you prove f(0) and you prove f(n+1) from f(n) for every n, then there is indeed a proof of f(n)
in Coq's type theory, the type hierarchy has data being Type 0
Wasting Time
Premise
So recently I was about half an hour early to an appointment, and decided to wait outside. I also determined that it would look strange if I just stood motionlessly in front of the house. Therefore, I decided to go on a quick walk, within a limited area. I also concluded ...
Inversion languages
cops-and-robbers language-design
Cops
For this challenge you will design two languages, A and B. Both A and B should be Turing complete. When run in your two languages a program has four options:
It halts in both A and B.
It halts in A but not B.
It halts in B but not A...
Is that clear enough to post? I don't think I am going to post it quite yet but I want to make sure it is clear.
Hey guys, you may have noticed that I have been inactive. I am going to take a break from Codegolf and all of SE for a while to focus on real life like school and a job, I really enjoyed being with you guys and may be back soon. I just don't have time to code as much. Thanks for being helpful and supportive!
looks like people are here so: 1. rate a lisp-based language on a scale of terribleness from 1 to 10 2. would it be worth porting a language to Esoteric IDE
200 rep for an Abstract Rewriting System under 100 points
This will be awarded to the first answer to Abstract Rewriting Challenge (Cops) that scores less than 100 points and doesn't get cracked (or invalidated).
GNU sed (+ wget & ImageMagick), 405 200 bytes
Invocation:
sed -rf <script_file>
Script:
s/^[gpvbcieoy]/6/
s/^s[ae]/6/
s/^th/6/
s/^wa/6/
s/^li/7/
s/^[nar]/7/
s/^[st]i/7/
s/^l/8/
/[678]/!s/.*/9/
s:.*([6-9]).*:wget -O- bit.ly/\1|display:
s/6/w00dK1d/
s/7/t1Nny35/
s/8/PvCk4rz/
s/9/dUn0m4N/
e
T...
Get Rid of GoTo's
My (pseudo) code is full of goto's! What a mess... Let's change it into a more iterative code.
SPECIFICATION
Each input consists of:
<HEADER> {
0: <code>
1: <code> (optional)
2: <code> (optional)
...
99: <code> (optional)
}
where:
<HEADER>: It is the meth...
Input
A list of lists of letters like:
["B", "C", "C", "C", "C", "B", "B", "C", "A", "A"],
["B", "A", "C", "B", "B", "A", "B", "B", "A", "A"],
["B", "C", "B", "C", "A", "A", "A", "B", "C", "B"],
["B", "B", "B", "A", "C", "B", "A", "C", "B", "A"],
["A", "A", "A", "C", "A", "C", "C", "B...
The 3n+1 problem
The legendary problem in UVa Online Judge, with over 775k submissions and over 85k people who solved it. I, personally, have solved it in many ways, even reaching the best time below 0.01 sec.
Even though the problem is interesting from the algorithmic point of view, insofar as...
Wasting Time
Premise
So recently I was about half an hour early to an appointment, and decided to wait outside. I also determined that it would look strange if I just stood motionlessly in front of the house. Therefore, I decided to go on a quick walk, within a limited area. I also concluded ...
Inversion languages
cops-and-robbers language-design
Cops
For this challenge you will design two languages, A and B. Both A and B should be Turing complete. When run in your two languages a program has four options:
It halts in both A and B.
It halts in A but not B.
It halts in B but not A...
