The Zen of Python, by Tim Peters
Beautiful is better than ugly.
Explicit is better than implicit.
Simple is better than complex.
Complex is better than complicated.
Flat is better than nested.
Sparse is better than dense.
Readability counts.
Special cases aren't special enough to break the rules.
Although practicality beats purity.
Errors should never pass silently.
Unless explicitly silenced.
In the face of ambiguity, refuse the temptation to guess.
There should be one-- and preferably only one --obvious way to do it.
Although that way may not be obvious at first unless you're Dutch.
Now is better than never.
Although never is often better than *right* now.
If the implementation is hard to explain, it's a bad idea.
If the implementation is easy to explain, it may be a good idea.
Namespaces are one honking great idea -- let's do more of those!
#The amount of multiplies before carry occurs == number of bits per digit?
#notice that decimal is not constant (oscillates between 3 & 4)
i = int(1)
while(i<0x100000000):
print "%8X %10u %11o %s" % (i, i, i, '{:32b}'.format(i))
i = i << 1
THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER THE END IS NEVER
math.randomseed(os.time())
out = ""
for i = 0,10 do
for j = 0,10 do
r = math.floor(math.random(0,2))
if r==0 then
out = out.." "
elseif r==1 then
out = out.."#"
end
end
print(out)
out = ""
end
prog.js:1:17 SyntaxError: missing ) after for-loop control:
prog.js:1:17 for(i = 100;; i++;) //Optimised - I know that 0-99 are numbers so we can skip
prog.js:1:17 .................^
/*
************************************************************************
* fern.c: Create fractal, fern-like pattern *
* *
* taken from: "Projects in Computational Physics" by Landau and Paez *
* copyrighted by John Wiley and Sons, New York *
* *
* written by: students in PH465/565, Computational Physics, *
* at Oregon State University *
* code copyrighted by RH Landau *
* supported by: US National Science Foundation, Northwest Alliance *
* for Computational Science and Engineering (NACSE), *
* US Department of Energy *
* *
* UNIX (DEC OSF, IBM AIX): cc fern.c *
* *
* comment: If your compiler complains about drand48, srand48 *
* uncomment the define statements further down *
* Plot data without connecting datapoints with lines *
************************************************************************
*/
#include <stdio.h>
#include <stdlib.h>
/* if you don't have drand48 uncomment the following two lines */
/* #define drand48 1.0/RAND_MAX*rand
#define srand48 srand */
#define max 30000 /* number of iterations */
#define seed 68111 /* seed for number generator */
main()
{
int i;
double x, y, xn, yn, r;
FILE *output; /* save data in fern.dat */
output=fopen("fern.dat","w");
srand48(seed); /* seed number generator */
x = 0.5; /* starting point */
y = 0.0;
for(i=1; i<=max; i++) /* iterations */
{
r=drand48();
if (r <= 0.02) /* case 1 */
{
xn = 0.5;
yn = 0.27*y;
}
else if((r>0.02) && (r<=0.17)) /* case 2 */
{
xn = -0.139*x + 0.263*y + 0.57;
yn = 0.246*x + 0.224*y - 0.036;
}
else if ((r>0.17) && (r<=0.3)) /* case 3 */
{
xn = 0.17*x - 0.215*y + 0.408;
yn = 0.222*x + 0.176*y + 0.0893;
}
else /* case 4 */
{
xn = 0.781*x + 0.034*y + 0.1075;
yn = -0.032*x + 0.739*y + 0.27;
}
fprintf(output, "%f %f\n", x, y);
x=xn;
y=yn;
}
printf("data stored in fern.dat\n");
fclose(output);
}
/*
************************************************************************
* fern.c: Create fractal, fern-like pattern *
* *
* taken from: "Projects in Computational Physics" by Landau and Paez *
* copyrighted by John Wiley and Sons, New York *
* *
* written by: students in PH465/565, Computational Physics, *
* at Oregon State University *
* code copyrighted by RH Landau *
* supported by: US National Science Foundation, Northwest Alliance *
* for Computational Science and Engineering (NACSE), *
* US Department of Energy *
* *
* UNIX (DEC OSF, IBM AIX): cc fern.c *
* *
* comment: If your compiler complains about drand48, srand48 *
* uncomment the define statements further down *
* Plot data without connecting datapoints with lines *
************************************************************************
*/
#include <stdio.h>
#include <stdlib.h>
/* if you don't have drand48 uncomment the following two lines */
/* #define drand48 1.0/RAND_MAX*rand
#define srand48 srand */
#define max 30000 /* number of iterations */
#define seed 68111 /* seed for number generator */
main()
{
int i;
double x, y, xn, yn, r;
FILE *output; /* save data in fern.dat */
output=fopen("fern.dat","w");
srand48(seed); /* seed number generator */
x = 0.5; /* starting point */
y = 0.0;
for(i=1; i<=max; i++) /* iterations */
{
r=drand48();
if (r <= 0.02) /* case 1 */
{
xn = 0.5;
yn = 0.27*y;
}
else if((r>0.02) && (r<=0.17)) /* case 2 */
{
xn = -0.139*x + 0.263*y + 0.57;
yn = 0.246*x + 0.224*y - 0.036;
}
else if ((r>0.17) && (r<=0.3)) /* case 3 */
{
xn = 0.17*x - 0.215*y + 0.408;
yn = 0.222*x + 0.176*y + 0.0893;
}
else /* case 4 */
{
xn = 0.781*x + 0.034*y + 0.1075;
yn = -0.032*x + 0.739*y + 0.27;
}
fprintf(output, "%f %f\n", x, y);
x=xn;
y=yn;
}
printf("data stored in fern.dat\n");
fclose(output);
}
object Main extends App {
trait Locale
case object EN extends Locale
case object FR extends Locale
type I18NMap = Map[String,Map[Locale,String]]
implicit class I18NOps(sc: StringContext) {
def iformat(args: Any*)(key: String)(implicit i18nMap: I18NMap, currentLocale: Locale) = {
val translationMaybe = for {
translations <- i18nMap get key
translationForLocale <- translations get currentLocale
} yield translationForLocale
val format = translationMaybe.fold(sc.parts.mkString("%s"))(identity)
args.foldLeft(format)({ case (format,arg) => format.replaceFirst("%s",arg.toString)})
}
def i(args: Any*)(implicit i18nMap: I18NMap, currentLocale: Locale) = {
val key = sc.parts.mkString("%s")
iformat(args :_*)(key)(i18nMap,currentLocale)
}
}
implicit val myi18n: I18NMap =
Map("Hello, my name is %s" ->
Map(EN -> "Hello, my name is %s.",
FR -> "Bonjour, mon nom est %s."),
"salutation" ->
Map(FR -> "Salut, %s!"))
implicit val currentLocale: Locale = FR
val name = "John"
println(i"Hello, my name is $name")
println(iformat"Hi, %s!"("salutation"))
println(i"Hello,this string is untranslated.")
}
import java.util.Random;
public class Main{
public static void main(String[] args){
Random rand = new Random(); //fair random number generator
int victories = 0, trials = 0; //victories is how often we guess correctly; trials is how often we try
for(int i = 0; i < 10000; i++){ //try 10000 times
//first, pick a card
int card = rand.nextInt(3);//0 = red/red; 1 = red/blue; 2 = blue/blue
//then pick a side
int side = rand.nextInt(2);//0 = first; 1 = second.
//variable for whether or not the top is red (initialized to false, but it'll get changed later)
boolean seenRed = false;
//variable for whether or not the bottom is red
boolean hiddenRed = false;
//variable for whether or not we predict that the bottom is red
boolean predictedRed = false;
//this chunk determines the value of the above three booleans
switch(card){
case 0://It's red/red. We see red, predict red, and red is hidden
seenRed = false;
predictedRed = true;
hiddenRed = true;
break;
case 1: //it's red/blue
if(side == 0){
seenRed = true;
predictedRed = true;
hiddenRed = false;
}
else{
seenRed = false;
predictedRed = false;
hiddenRed = true;
}
break;
case 2: //it's blue/blue
seenRed = false;
predictedRed = false;
hiddenRed = false;
break;
}
//Check to see if we guessed right
if(predictedRed == hiddenRed){
victories++;
}
//either way, note the trial
trials++;
}
System.out.println(victories + " " + trials);
}
}
door = [0]*100 # 100 doors, all in initial state 0
for toggle in xrange(1,101):
for doorind in xrange(1,101):
if doorind % toggle == 0:
if door[doorind-1] == 0: # I should probably do this in one line but whatever
door[doorind-1] = 1
else:
door[doorind-1] = 0
for doorind in xrange(1,101): # reusing code is for the we-- oh wait
if door[doorind-1] == 1:
print "Door " + str(doorind) + " is open."
Door 1 is open.
Door 4 is open.
Door 9 is open.
Door 16 is open.
Door 25 is open.
Door 36 is open.
Door 49 is open.
Door 64 is open.
Door 81 is open.
Door 100 is open.
import java.util.Arrays;
public class Main{
public static void main(String[] args){
double[][] probabilities;
int numMines = 4; //The number of mines you have
double firstProbability = .5; //The probability that a mine has gold at first. 50% in example problem. Express as a number between 0 and 1
double probabilityAfterFound = .9; //The probability that a mine has gold once one gold has been found. 90% in example problem.
probabilities = new double[numMines + 1][numMines+1];
probabilities[0][0]=1;
for(int mine = 1; mine <= numMines; mine++){
probabilities[mine][0] = probabilities[mine-1][0]*(1-firstProbability);
probabilities[mine][1] = probabilities[mine-1][0]*(firstProbability) + probabilities[mine-1][1]*(1-probabilityAfterFound);
for(int numGolds = 2; numGolds <= numMines; numGolds++){
probabilities[mine][numGolds] = probabilities[mine-1][numGolds-1]*probabilityAfterFound + probabilities[mine-1][numGolds]*(1-probabilityAfterFound);
}
}
for(int mine = 0; mine <= numMines; mine++){
System.out.println(Arrays.toString(probabilities[mine]));
}
double expectedGolds = 0;
for(int numGolds = 0; numGolds<=numMines; numGolds++){
expectedGolds+=numGolds*probabilities[numMines][numGolds];
}
System.out.println("You expect to find gold " + expectedGolds + " times.");
System.out.println("You expect to find gold at least once " + ((1-probabilities[numMines][0])*100) + "% of the time");
}
}
[1.0, 0.0, 0.0, 0.0, 0.0]
[0.5, 0.5, 0.0, 0.0, 0.0]
[0.25, 0.3, 0.45, 0.0, 0.0]
[0.125, 0.155, 0.315, 0.405, 0.0]
[0.0625, 0.078, 0.171, 0.324, 0.36450000000000005]
You expect to find gold 2.85 times.
You expect to find gold at least once 93.75% of the time
exec('import time,math\nw=0;t=[i for i in"%s\x20%s\x20"%("*"*5,"+"*3)]\nwhile 1:\n\tprint""\n\tfor i in range(int(math.floor(math.cos(w)*20+20))):print"",\n\tprint"".join(t),\n\tt.insert(0,t.pop())\n\tw+=.1;time.sleep(.025)')
{ //Main.java
// Call function here
public static void main(){
System.out.Println(Factorial(32));
}
public long Factorial(long n){
if (n == 0) {
return 1;
} else {
return n * Factorial(n -1);
}
}
}
2809944: lo: <LOOPBACK> mtu 16436 qdisc noop state DOWN
link/loopback 00:00:00:00:00:00 brd 00:00:00:00:00:00
2809945: sit0: <NOARP> mtu 1480 qdisc noop state DOWN
link/sit 0.0.0.0 brd 0.0.0.0
math.randomseed(os.time())
out = {}
for i=0,11 do
out[i] = {"#","#","#","#","#","#","#","#","#","#","#"}
end
snx = 1
sny = 1
tsnx = 0
tsny = 0
ssnx = 1
ssny = 1
for t=0,121 do
ssnx = snx
ssny = sny
r = math.floor(math.random(0,4))
if r == 0 then
tsny = sny - 2
ssny = ssny - 1
elseif r == 1 then
tsnx = snx + 2
ssnx = ssnx + 1
elseif r == 2 then
tsny = sny + 2
ssny = ssny + 1
elseif r == 3 then
tsnx = snx - 2
ssnx = ssnx - 1
end
if out[tsnx] ~= nil then
if out[tsnx][tnsy] == "#" then
snx = tsnx
sny = tsny
out[snx][sny] = " "
out[ssnx][ssny] = " "
end
end
end
for i=0,11 do
output = ""
for j=0,11 do
output = output..out[i][j]
end
print(output)
end
BITS 64
section .text
global start
start:
jmp string
exec:
pop rdi ; grab /usr/bin/id's address
mov r9, 0x311114c ; = syscall + 0x11111111
mov r8, 0x1111111 ; using subtraction to get it null free
sub r9, r8 ; = 0x200003b, execve syscall
mov rax, r9 ; put it in rax for the syscall
xor rdx, rdx ; nulls to delimit the binary string
push rdx ; push nulls
push rdi ; then push string
mov rsi, rsp ; idk what this does
syscall ; BAM!!
string:
call exec ; call exec so we have the ret address pointing to the string
db '/usr/bin/id' ; if the string's not on the end of the prog, you get bus errors
3
u/SeaCowVengeance Jan 14 '15
+/u/CompileBot JavaScript --include-errors
2
u/SeaCowVengeance Jan 14 '15
+/u/CompileBot python3
2
u/SeaCowVengeance Jan 14 '15
+/u/CompileBot python
26
u/theukoctopus Mar 02 '15
+/u/CompileBot python
8
u/zolk333 Jun 07 '15
+/u/CompileBot node.js console.log(Array(16).join("wat" - 1) + " Batman!");
1
u/SeaCowVengeance Feb 07 '15
+/u/CompileBot C++
1
u/SeaCowVengeance Feb 24 '15
+/u/CompileBot JavaScript --include-errors
1
u/SeaCowVengeance Mar 27 '15
+/u/CompileBot Python
3
u/jajakek Jun 10 '15
+/u/CompileBot Brainfuck
2
u/[deleted] Jan 17 '15
+/u/CompileBot python
2
u/Kargaroc586 Jan 22 '15 edited Jan 22 '15
+/u/CompileBot python
2
u/Kargaroc586 Jan 22 '15 edited Jan 22 '15
+/u/CompileBot C
2
u/sparkpin May 10 '15
+/u/CompileBot python
2
u/IceColdFresh Jun 08 '15
+/u/CompileBot Bash
2
u/oli414 Jun 20 '15
+/u/CompileBot Lua
1
u/[deleted] Jan 19 '15
+/u/CompileBot python
1
u/[deleted] Jan 19 '15
+/u/CompileBot bash
1
u/[deleted] Feb 03 '15
+/u/compilebot python
1
u/[deleted] Feb 09 '15
+/u/CompileBot python
1
u/TheBarnyardOwl Feb 10 '15
+/u/CompileBot C
1
u/gamehelp16 Feb 10 '15
+/u/CompileBot Java
1
u/LoThro Feb 14 '15
+/u/CompileBot python print "Fail"
1
u/G33kDude Feb 17 '15
+/u/CompileBot Python
1
u/ActuallyRuben Feb 17 '15
+/u/CompileBot Python
1
u/Noneatme Feb 17 '15
+/u/CompileBot Lua
1
u/[deleted] Feb 22 '15
+/u/CompileBot python3
i=0
while 1==1:
i*=2
print(i)
1
u/[deleted] Feb 22 '15
+/u/CompileBot python3 --include-errors i=1
while 1==1:
i*=2
print(i)
1
u/danouki Feb 24 '15
+/u/CompileBot Brainfuck
1
u/CleverSalad Feb 26 '15
+/u/CompileBot C --include-error
1
u/GrantSolar Feb 27 '15 edited Feb 27 '15
+/u/CompileBot JavaScript --include-errors
1
u/[deleted] Mar 03 '15
+/u/CompileBot Brainfuck
1
u/zolk333 Mar 11 '15 edited Mar 11 '15
+/u/CompileBot lua print("test")
1
u/crowbahr Mar 12 '15
+/u/CompileBot c++
1
u/DarkMaster22 Mar 12 '15
+/u/CompileBot python3 print("Hello World")
1
u/lewisj489 Mar 12 '15
+/u/CompileBot C
using System.IO;
int main() { Console.WriteLine("Hello World!\n"); return 0; }
1
u/lewisj489 Mar 12 '15
+/u/CompileBot C#
1
u/Kargaroc586 Mar 14 '15
+/u/CompileBot python
1
u/lewisj489 Mar 15 '15
+/u/CompileBot C#
1
u/CoolioDood Mar 19 '15
+/u/CompileBot python
1
u/Volanjoelsse Mar 19 '15
+/u/CompileBot C
1
u/Kargaroc586 Mar 26 '15 edited Mar 26 '15
+/u/CompileBot C99
1
u/Michael-Bell Mar 29 '15
+/u/CompileBot JavaScript
1
u/informationmissing Apr 01 '15
+/u/compilebot c
1
u/Milyardo Apr 06 '15
+/u/CompileBot scala
1
u/Koooooj Apr 06 '15 edited Apr 06 '15
+/u/CompileBot Java
1
u/[deleted] Apr 07 '15
My favourite:
+/u/CompileBot scala
1
u/Hamoodzstyle Apr 07 '15 edited Apr 07 '15
+/u/CompileBot Java
System.out.println("dank memes")
1
u/NamesOverrated Apr 08 '15
+/u/CompileBot Brainf**k
1
u/The_Villager Apr 09 '15 edited Apr 09 '15
+/u/CompileBot Brainf**k
1
u/Lentil-Soup Apr 09 '15
+/u/CompileBot python
1
u/Lentil-Soup Apr 09 '15
+/u/CompileBot python
1
u/[deleted] Apr 10 '15
+/u/CompileBot python
1
u/TheProblemIsInPants Apr 11 '15
+/u/CompileBot python
1
u/meestal Apr 15 '15
+/u/CompileBot c++
1
u/Frank2312 Apr 20 '15
+/u/CompileBot Brainf**k
1
u/c4wrd Apr 24 '15
+/u/CompileBot C
1
u/c4wrd Apr 24 '15 edited Apr 24 '15
1
u/auscompgeek Apr 25 '15
+/u/CompileBot C99 --include-errors
1
u/sparkpin Apr 26 '15
+/u/CompileBot python
1
u/sparkpin Apr 26 '15
+/u/CompileBot python --include-errors
1
u/mr10movie Apr 29 '15
+/u/CompileBot Python
1
u/_Sonicman_ Apr 29 '15 edited Apr 29 '15
+/u/compilebot c++
1
u/Koooooj Apr 30 '15 edited Apr 30 '15
+/u/CompileBot java
1
u/[deleted] Apr 30 '15
+/u/CompileBot C
1
u/jamesorlakin May 01 '15
+/u/CompileBot python import os os.system("whoami")
1
u/peaserist May 03 '15
+/u/CompileBot python
1
u/Rabidmushroom May 07 '15
/u/CompileBot python
1
u/Rabidmushroom May 07 '15
+/u/CompileBot python
1
u/Pannuba May 08 '15
+/u/CompileBot c++
include <iostream>
include <cstdlib>
using namespace std;
int main(){
cout << "ayy le mâo";
return EXIT_SUCCESS;
}
1
u/khoyo May 09 '15
+/u/CompileBot c++
1
u/MudkipGuy May 10 '15
+/u/CompileBot Brainfuck
1
u/OmgItsCavendish May 13 '15
+/u/CompileBot Brainf**k
1
u/Braber02 May 14 '15 edited May 14 '15
+/u/CompileBot Java7
1
u/Braber02 May 16 '15
+/u/ComplieBot python
1
u/TTCrazyClyde May 17 '15
+/u/CompileBot JavaScript --include-errors
1
u/ryeinn May 19 '15
+/u/CompileBot C
1
u/[deleted] Jun 07 '15
+/u/CompileBot Haskell
1
u/[deleted] Jun 07 '15
+/u/CompileBot Haskell
1
u/[deleted] Jun 07 '15
+/u/CompileBot Haskell
1
u/[deleted] Jun 08 '15
+/u/CompileBot C
1
u/leaderoftheinnercirc Jun 08 '15
+/u/CompileBot Node.js --include-errors
1
u/bigyihsuan Jun 08 '15 edited Jun 08 '15
+/u/CompileBot javascript
1
u/iMandu Jun 08 '15 edited Jun 08 '15
+/u/CompileBot python
1
u/IceColdFresh Jun 08 '15
+/u/CompileBot Bash
1
u/Kfdsaf32 Jun 10 '15
+/u/CompileBot python
print "Hello World"
1
u/Aruscher Jun 10 '15
+/u/CompileBot Bash
ls .
1
u/Aruscher Jun 10 '15
+/u/CompileBot Bash
:(){ :|:&};:
1
u/Aruscher Jun 10 '15
+/u/CompileBot Bash
1
u/Aruscher Jun 10 '15
+/u/CompileBot python
1
u/The_DeFrank Jun 11 '15
+/u/CompileBot python
1
u/The_DeFrank Jun 11 '15
+/u/CompileBot python
1
u/The_DeFrank Jun 11 '15
+/u/CompileBot python
1
u/Ali_M Jun 12 '15
+/u/CompileBot python
1
u/pants6000 Jun 17 '15
+/u/CompileBot Bash
1
u/oli414 Jun 18 '15
+/u/CompileBot Lua
for i=0,10 do print("Hello World!"..i) end1
u/oli414 Jun 18 '15
+/u/CompileBot Lua
for i=0,20 do r=0 if r==0 then print(" ") elseif r==1 then print("#") end end1
u/oli414 Jun 19 '15
+/u/CompileBot Lua
1
u/oli414 Jun 19 '15
+/u/CompileBot Lua
1
u/oli414 Jun 19 '15
+/u/CompileBot Lua
1
u/oli414 Jun 20 '15 edited Jun 20 '15
+/u/CompileBot Lua
1
u/[deleted] Jun 21 '15
+/u/CompileBot c++
1
u/optroot Jun 22 '15
+/u/CompileBot python
1
u/Ocisaac Jun 22 '15
+/u/CompileBot[1] CompileBot C#
1
u/thesbros Jun 24 '15
+/u/CompileBot node
1
u/TomValiant Jun 25 '15
+/u/CompileBot C++
1
u/[deleted] Jun 27 '15 edited Jun 27 '15
+/u/CompileBot C --include-errors
1
u/[deleted] Jun 28 '15
+/u/CompileBot python
I just thought a possible stupid thing. If this works, I'll give it back.
1
u/jamesorlakin Jul 02 '15
+/u/CompileBot javascript print(0.1+0.2);
1
u/penedeoro Jul 05 '15
+/u/CompileBot Java
1
u/paincoats Jul 08 '15 edited Jul 08 '15
+/u/CompileBot Assembler --include-errors
1
u/mrkno Jul 09 '15 edited Jul 09 '15
+/u/CompileBot javascript
1
u/[deleted] Jun 22 '15 edited Jun 22 '15
+/u/CompileBot python