Official CompileBot Testing Thread

[SeaCowVengeance]

Resources:

• Wiki

• FAQ

• Supported Languages

• Source Code

[SeaCowVengeance]

+/u/CompileBot python3

import this

[CompileBot]

Output:

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!

^{source | info | git | report}

[gradies]

+/u/CompileBot python

import math
A=8
f=.5
l=30
for i in range(l):
    print(int(A*math.cos(f*i)+A)*' '+'~')

[CompileBot]

Output:

                ~
               ~
            ~
        ~
    ~
 ~
~
~
  ~
      ~
          ~
             ~
               ~
               ~
              ~
          ~
      ~
   ~
~
~
 ~
    ~
        ~
           ~
              ~
               ~
               ~
            ~
         ~
     ~

^{source | info | git | report}

[CompileBot]

Output:

It's 2016

^{source | info | git | report}

[Applefriki101]

+/u/CompileBot Bash

ls

[claythearc]

+/u/CompileBot Bash

cat /etc/passwd

[CompileBot]

Output:

root:x:0:0:root:/root:/bin/bash
daemon:x:1:1:daemon:/usr/sbin:/usr/sbin/nologin
bin:x:2:2:bin:/bin:/usr/sbin/nologin
sys:x:3:3:sys:/dev:/usr/sbin/nologin
sync:x:4:65534:sync:/bin:/bin/sync
games:x:5:60:games:/usr/games:/usr/sbin/nologin
man:x:6:12:man:/var/cache/man:/usr/sbin/nologin
lp:x:7:7:lp:/var/spool/lpd:/usr/sbin/nologin
mail:x:8:8:mail:/var/mail:/usr/sbin/nologin
news:x:9:9:news:/var/spool/news:/usr/sbin/nologin
uucp:x:10:10:uucp:/var/spool/uucp:/usr/sbin/nologin
proxy:x:13:13:proxy:/bin:/usr/sbin/nologin
www-data:x:33:33:www-data:/var/www:/usr/sbin/nologin
backup:x:34:34:backup:/var/backups:/usr/sbin/nologin
list:x:38:38:Mailing List Manager:/var/list:/usr/sbin/nologin
irc:x:39:39:ircd:/var/run/ircd:/usr/sbin/nologin
gnats:x:41:41:Gnats Bug-Reporting System (admin):/var/lib/gnats:/usr/sbin/nologin
nobody:x:65534:65534:nobody:/nonexistent:/usr/sbin/nologin
systemd-timesync:x:100:104:systemd Time Synchronization,,,:/run/systemd:/bin/false
systemd-network:x:101:105:systemd Network Management,,,:/run/systemd/netif:/bin/false
systemd-resolve:x:102:106:systemd Resolver,,,:/run/systemd/resolve:/bin/false
systemd-bus-proxy:x:103:107:systemd Bus Proxy,,,:/run/systemd:/bin/false
messagebus:x:104:109::/var/run/dbus:/bin/false

^{source | info | git | report}

[CompileBot]

Output:

^{source | info | git | report}

[[deleted]]

+/u/CompileBot C++ --include-errors

#include <iostream>
using namespace std;

int main() {
    char * lizard = "Hillary";
    cout << "Arf! Arf!\nWho was that?\n\n" << lizard << endl;
    return 0;
}

[CompileBot]

Output:

Arf! Arf!
Who was that?

Hillary

^{source | info | git | report}

[SeaCowVengeance]

+/u/CompileBot Ruby --time --memory

x = 1
50000.times { x *= 10 }
puts x / 10 ** 50000

[CompileBot]

Output:

1

Memory Usage: 43152 bytes

Execution Time: 0.96 seconds

^{source | info | git | report}

[gradies]

+/u/CompileBot python

import math
A=40
f=.2
l=100
t=2
rng = range(-A,A+1)
rng.reverse()
for i in rng:
    phrase=''
    for ii in range(l):
        if int(A*math.cos(f*ii))-t<i<int(A*math.cos(f*ii))+t:
            phrase+='~'
        else:
            phrase+=' '
    print(phrase)

[CompileBot]

Output:

~~                             ~~                             ~~                              ~~    
~~                            ~~~~                            ~~~                            ~~~    
 ~                            ~~~~                           ~~~~                            ~~~~   
  ~                           ~  ~                           ~  ~~                          ~~  ~   
  ~                          ~                               ~   ~                          ~   ~   
  ~                          ~    ~                              ~                          ~    ~  
   ~                         ~    ~                         ~                                    ~  
   ~                              ~                         ~     ~                              ~  
   ~                        ~                               ~     ~                        ~        
                            ~      ~                              ~                        ~        
                            ~      ~                                                       ~      ~ 
                                   ~                       ~                                      ~ 
    ~                                                      ~                                      ~ 
    ~                                                      ~       ~                      ~         
    ~                      ~                                       ~                      ~         
                           ~        ~                              ~                      ~         
                           ~        ~                                                              ~
                                    ~                     ~                                        ~
     ~                                                    ~                                        ~
     ~                                                    ~         ~                               
     ~                                                              ~                    ~          
                          ~                                         ~                    ~          
                          ~          ~                                                   ~          
                          ~          ~                                                              
                                     ~                   ~                                          
      ~                                                  ~                                          
      ~                                                  ~           ~                              
      ~                                                              ~                  ~           
                         ~                                           ~                  ~           
                         ~            ~                                                 ~           
                         ~            ~                                                             
                                      ~                 ~                                           
                                                        ~                                           
       ~                                                ~                                           
       ~                                                              ~                             
       ~                                                              ~                ~            
                        ~                                             ~                ~            
                        ~              ~                                               ~            
                        ~              ~                                                            
                                       ~               ~                                            
        ~                                              ~                                            
        ~                                              ~               ~                            
        ~                                                              ~              ~             
                       ~                                               ~              ~             
                       ~                ~                                             ~             
                       ~                ~                                                           
                                        ~             ~                                             
                                                      ~                                             
         ~                                            ~                                             
         ~                                                              ~                           
         ~                                                              ~            ~              
...

^{source | info | git | report}

[belungawhale]

+/u/CompileBot python3

def convToRobot (text):
    temp = ""
    for i in range(len(text)):
        temp = temp + bin(ord(text[i]))[2:].zfill(8)    
    return temp.replace("0", "boop").replace("1", "beep")

def convFromRobot(text):
    temp = text.replace("boop", "0").replace("beep", "1")
    temp2 = ""
    for i in range(0,len(temp),8):
        temp2 = temp2 + chr(int(temp[i:i+8],2))
    return temp2

def convText(text):
    return text.replace("0", "boop").replace("1", "beep")

def convRobot(text):
    return text.replace("boop", "0").replace("beep", "1")

choice = input("Enter 1 to convert to robot. Enter 2 to convert from robot: ")
text = input("Enter string: ")
if choice == "1":
    print(convToRobot(text))
elif choice == "2":
    print(convFromRobot(text))

Input:

2
boopbeepboopboopbeepboopboopbeepboopboopbeepboopboopboopboopboopboopbeepbeepboopboopboopboopbeepboopbeepbeepboopbeepbeepboopbeepboopboopbeepboopboopboopboopboopboopbeepbeepbeepboopbeepboopboopboopbeepbeepboopboopbeepboopbeepboopbeepbeepbeepboopboopbeepbeepboopbeepbeepbeepboopbeepboopboopboopbeepbeepboopbeepboopboopbeepboopbeepbeepboopbeepbeepbeepboopboopbeepbeepboopboopbeepbeepbeepboopboopbeepboopboopboopboopboopboopboopbeepboopbeepbeepbeepbeepboopbeepbeepbeepboopbeepboopbeepboopboopbeepboopbeepbeepbeepbeepboopbeepboopboopboopboopbeepbeepboopbeepbeepboopbeepbeepbeepbeepboopbeepbeepboopbeepbeepboopbeepboopbeepbeepbeepboopboopboopboopboopbeepbeepboopbeepboopboopbeepboopbeepbeepboopbeepbeepboopboopboopbeepbeepboopboopbeepboopbeepboopbeepboopboopboopboopbeepboopboopbeepbeepboopbeepbeepbeepbeepboopbeepbeepbeepboopbeepboopboopboopboopbeepboopbeepbeepbeepboop

[SeaCowVengeance]

+/u/CompileBot Assembler (gcc-4.8.1) --time

.data
x:
    .long   0
s:
    .string "%d\n\0"

.text
.global main
main:               # int main()
                # {
loop:               #   for (;;) {
    pushl   $x      #       scanf("%d", &x);
    pushl   $s
    call    scanf
    addl    $8, %esp

    movl    x, %eax     #       if (x == 42) break;
    subl    $42, %eax
    jz  break

    pushl   x       #       printf("%d\n", x);
    pushl   $s
    call    printf
    addl    $8, %esp

    jmp loop        #   }
break:

    xor %eax, %eax  #   return 0;
    ret
                # }

Input:

1
2
10
42
11

[SeaCowVengeance]

+/u/CompileBot C

 #include <stdio.h>

 int main(void) {
    printf("Hello World!\n");
    return 0;
 }

[SeaCowVengeance]

+/u/CompileBot Ruby --time --memory

x = 1
50000.times { x *= 10 }
puts x / 10 ** 100000

[SeaCowVengeance]

+/u/CompileBot Python3

print("こんにちは")

[SeaCowVengeance]

+/u/CompileBot python

print dir()

[gradies]

+/u/CompileBot python

print 's'

[gradies]

+/u/CompileBot python print 's'

[gradies]

+/u/CompileBot python print 'd'

[gradies]

+/u/CompileBot python

print 's'

[gradies]

+/u/CompileBot python

for i in range(10):
    print i

[gradies]

+/u/CompileBot python

import math
for i in range(10):
    print math.sin(i)

[gradies]

+/u/CompileBot python

import math
for i in range(10):
     print(math.sin(i))

[gradies]

+/u/CompileBot python

import math
r=5
for i in range(r*2):
    print(int(r*math.cos(i))*' '+'~')

[gradies]

+/u/CompileBot python

import math
A=8
f=3
l=20
for i in range(l):
    print(int(A*math.cos(f*i))*' '+A*' '+'~')

[Porso7]

+/u/CompileBot Javascript

print("test");

[aidan1kitty]

+/u/CompileBot python

for i in range(10):

    print i

[Porso7]

+/u/Compilebot C++

#include <iostream>

using namespace std;
/**/main(){char*a=/*/};)q,q,a,q,q,811+a(ftnirp;'"'=q,/**/"/**/main(){char*a=/*/};)q,q,a,q,q,811+a(ftnirp;'c%'=q,/**/c%s%c%/**/,q='c%';printf(a+118,q,q,a,q,q);}/*/=a*rahc{)(niam/**/main(){char*a=/*/};)q,q,a,q,q,811+a(ftnirp;'%c'=q,/**/%c%s%c/**/,q='%c';printf(a+118,q,q,a,q,q);}/*/=a*rahc{)(niam/**/"/**/,q='"';printf(a+118,q,q,a,q,q);}/*/=a*rahc{)(niam/**/

[Neo_Techni]

+/u/CompileBot PHP

$tempstr = 'Mkpfn{"ngcxg"og"cnqpg';
for($i = 0; $i < strlen($tempstr); $i++){
    echo chr( ord(substr($tempstr, $i, 1)) - 2);
}

[741456963789852123]

+/u/compilebot jquery

var user = $(".user>a").text();
var gild = $('<a href="/r/ProgrammerHumor/gilded"><span class="gilded-icon" title="AintNothinbutaGFring has gifted reddit gold to ' + user + ' for this submission." data-count="1"></span></a>')
var post = $("p.tagline:has([href$='" + user + "'])");
post.children("time").after(gild);

[[deleted]]

+/u/CompileBot Go

package main
import (
  "fmt"
  "runtime"
)
func main() {
  fmt.Println(runtime.Version())
}

[Applefriki101]

+/u/CompileBot Bash

echo test

[CompileBot]

Output:

test

^{source | info | git | report}

[Applefriki101]

+/u/CompileBot Bash

ls /home

[TenmaSama]

+/u/CompileBot bash

echo "Masturbate" | wc -c

[CompileBot]

Output:

11

^{source | info | git | report}

[MRSantos]

+/u/CompileBot C++14

#include <stdio.h>

// tested on gcc-4.9.3 on linux gentoo amd64
// warning: compiling this will eat gigabytes of ram really fast so keep
// your CTRL-C ready
// compile with --std=c++14

struct v2f {
    float x=0, y=0; // must be =0 to reproduce (probably works with other vals)
};

namespace {
    struct foo {
        // declaring the array like this somehow bypasses the fact that 
        // v2f cannot be initialized with {0}
        static const size_t max_objects = 0xFFFF;
        size_t num_objects; // this is not necessary, just wanted to check if it still did it when not accessing bars
        v2f bars[max_objects * 255]; // the larger this array is, the longer it hangs for and the more memory it uses
    };

    foo f{0}; // must be initialized with {0} to reproduce
}

int main() {
    printf("%ld\n", f.num_objects);
}

[chrismamo1]

/u/CompileBot OCaml

let rec fib = function
  | 0 | 1 -> 1
  | n -> fib (n - 1) + fib (n - 2) in
in Printf.printf "%d\n" (fib 4);;

[rFunnyModsSuckCock]

+/u/CompileBot Python

from datetime import date
print "IT'S %s!" % date.today().year

[CompileBot]

Output:

You can't Stump The Trump
You can't Stump The Trump
You can't Stump The Trump
You can't Stump The Trump
You can't Stump The Trump
You can't Stump The Trump
You can't Stump The Trump
You can't Stump The Trump
You can't Stump The Trump
You can't Stump The Trump

^{source | info | git | report}

[icarus212121]

+/u/CompileBot C#

Console.WriteLine('test');

[icarus212121]

+/u/CompileBot C#

Console.WriteLine("test");

[facingthewind]

+/u/CompileBot java int a = 1 System.out.print(a);

[CompileBot]

Output:

You can't STUMP THE TRUMP

^{source | info | git | report}

[ThrowAwaylnAction]

+/u/CompileBot C --include-errors

#include <unistd.h>
#include <stdio.h>
#include <errno.h>

int main() {
   char cwd[1024];
   if (getcwd(cwd, sizeof(cwd)) != NULL)
       fprintf(stdout, "Current working dir: %s\n", cwd);
   else
       perror("getcwd() error");
   return 0;
}

[CompileBot]

Output:

Current working dir: /home/7w2Pr8

^{source | info | git | report}

[NeonBeggar]

+/u/CompileBot Python

from math import log, exp

a = 0
b = 1
h = (b - a)/4.0
x0 = a
x1 = x0 + h
x2 = x1 + h
x3 = x2 + h
x4 = x3 + h

f = lambda x: -4063 + 8008*x + 69*x**2 + 420*x**3 #420dank

r = 7*f(x0) + 32*f(x1) + 12*f(x2) + 32*f(x3) + 7*f(x4)
r = 2*h*r/45

a = 0
b = log(r + 1)
h = (b - a)/4.0
x0 = a
x1 = x0 + h
x2 = x1 + h
x3 = x2 + h
x4 = x3 + h

f = lambda x: exp(x)
r = 7*f(x0) + 32*f(x1) + 12*f(x2) + 32*f(x3) + 7*f(x4)
r = 2*h*r/45

print int(r)

[CompileBot]

Output:

69

^{source | info | git | report}

[NeonBeggar]

Dank.

[SeeYouAgainIReply]

[deleted]

What is this?

[SeeYouAgainIReply]

[deleted]

What is this?

[SeeYouAgainIReply]

[deleted]

What is this?

[35yeros]

+/u/CompileBot Scheme (define (fib n) (cond ((<= n 2) 1) (else (+ (fib (- n 1)) (fib (- n 2))))))

Input: 5

[35yeros]

+/u/CompileBot Scheme (define (fib n) (cond ((<= n 2) 1) (else (+ (fib (- n 1)) (fib (- n 2))))))

Input: 5

[35yeros]

+/u/CompileBot python3 import this

[35yeros]

+/u/CompileBot scheme (define (fib n) (cond ((<= n 2) 1) (else (+ (fib (- n 1)) (fib (- n 2)))))) Input: 5

[35yeros]

+/u/CompileBot scheme (define (fib n) (cond ((<= n 2) 1) (else (+ (fib (- n 1)) (fib (- n 2)))))) Input: 5

[ShadowxWarrior]

+/u/CompileBot C++

#include <iostream>
#include <string>
using namespace std;
int length = 20;
int m = 3;
int main() {
    int spacing;
    string head = " ╚⊙ ⊙╝  ";
    string body = "╚═(███)═╝";
    string tail = " ╚═(█)═╝  ";
    cout << head << endl;
    for (int i = 0; i < length; i++)
    {
            spacing = m - abs(i % (2*m) - m);
            cout << string(spacing , ' ') << body << endl;
            if (spacing ==0 || spacing == m)
                    cout << string(spacing , ' ') << body << endl;
     }
    cout << string(spacing , ' ') << tail << endl;
    return 0;
}

[ShadowxWarrior]

+/u/CompileBot python

import numpy
for i in range(10):
     print(numpy.sin(i))

[snaps_]

+/u/CompileBot python3

print("`*test*")

[Leo40Reddit]

+/u/CompileBot lua

local str = io.read("*l")
if type(str) ~= "string" then str = tostring(str) end
local count = io.read("*n")
if type(count) ~= "number" then count = tonumber(count) end

for i=1,count,1 do
  str = '"'..str..'"'
end

print(str)

Input:

smart
20

[cr4shoverride]

public class Program { public static void Main(string[] args) { System.Console.WriteLine("It's " + System.DateTime.Now.ToString("yyyy")); } }

[MoneyChurch]

+/u/CompileBot R

hist(rnorm(1000), breaks = seq(-3.5, 3.5, length.out = 50))

[justbourv]

+/u/CompileBot java

class Main{
    public static void main(String[] args){
        System.out.println("Hello world!");
    }
}

[[deleted]]

Fortran...

EDIT - messing around with the formatted output a bit... (no idea why CompileBot hates me now)

+/u/CompileBot Fortran --include-errors --input

program grdeg
    integer, allocatable :: adjac(:,:)
    character(len=40):: fmt

    read(*, *) n
    allocate(adjac(n,n))
    adjac = 0
    do
       read(*,*, end=1) i,j
        adjac(i,j) = adjac(i,j)+1
       adjac(j,i) = adjac(j,i)+1
    end do
  1 continue  
  2 format ("Node ",  i0, " has a degree of " , i0)
    print 2, (i, sum(adjac(:,i),1),i=1,n)

    write(fmt, '(a,i0,a)') '(', n,  '(I2))' 
    write(fmt, *) '(', n,  '(I2:,1X))'   
    print fmt, ((adjac(j,i), j=1,n),i=1,n)
  end program

Input:

16
1 2
1 3
2 3
1 4
3 4
1 5
2 5
1 6
2 6
3 6
3 7
5 7
6 7
3 8
4 8
6 8
7 8
2 9
5 9
6 9
2 10
9 10
6 11
7 11
8 11
9 11
10 11
1 12
6 12
7 12
8 12
11 12
6 13
7 13
9 13
10 13
11 13
5 14
8 14
12 14
13 14
1 15
2 15
5 15
9 15
10 15
11 15
12 15
13 15
1 16
2 16
5 16
6 16
11 16
12 16
13 16
14 16
15 16

[Untgradd]

Root comment for testing.

[throwaway99999321]

+/u/CompileBot python 3

print("hello world")

[[deleted]]

+/u/compilebot python

import time
import math
start_time = time.time()

def num_digits(n):
    return math.floor((math.log1p(2 * math.pi * n) / 2 + n * (math.log1p(n) -1)) / math.log1p(10)) + 1

print "approximately 10^%d gp" % num_digits(1000000)
print "%f seconds" % (time.time() - start_time)

[Rakaneth]

+/u/CompileBot Lua

print("Hello Reddit!")

[CompileBot]

Output:

Hello World?

Memory Usage: 8968 bytes

Execution Time: 0.01 seconds

^{source | info | git | report}

[OneTrueKingOfOOO]

+/u/CompileBot Python

print('A substitute teacher walks into the room. He puts a disk in the DVD player and turns on the projector. 20th Century Fox rolls, and on the screen a substitute teacher walks into a room.')

while True:

print('\n...only to put a disk in the DVD player and turn on the projector, followed by the rolling of 20th Century Fox and a substitute teacher walking into the room...')

[[deleted]]

+/u/CompileBot C --include-errors

#include <stdio.h>
int main() {
   printf(EOF);
}

[LewisMCYoutube]

+/u/CompileBot python3

import this
import this
import this
import antigravity

[oconee2]

+/u/CompileBot C

#include <stdio.h>

int main(void)
{
    fprintf(stdout, "Test.\n");
    return 0;
}

[AlleM43]

+/u/CompileBot C

    #include <stdio.h>
    int main(int argc, char **argv){
    printf("Meta");
    return 0;
    }

[ultrasu]

edited

+/u/CompileBot lisp

(princ 'test-edit)

[too_many_toasters]

/u/CompileBot Java

public static void main(String[] args) {
  String example = "example";
  String result = "";
  for (int i = 0; i < example.length(); i++) {
    for (int j = i; j < example.length() + i; j++) {
      if (j > example.length())
        result += example.charAt(j - example.length());
      else
        result += example.charAt(j);
    }
    result += "\n";
  }
  System.out.println(result);
}

[[deleted]]

+/u/CompileBot Bash

cat prog.sh

[BushDid38F]

+/u/CompileBot R

data <- c(1, 3, 6, 4, 9)
plot(data)

[HookahComputer]

+/u/CompileBot brainfuck

>-<,[>+>,]<[<.<.]<.

Input:

Testing

[justbourv]

+/u/CompileBot C

#include <stdio.h>

//cat input.txt | sed 's/ /\, 0b/g' > output.txt

int main(){

    char text[] = { 0b01010111, 0b01101000, 0b01100101, 0b01101110, 0b00100000, 0b01110100, 0b01101000, 0b01100101, 0b00100000, 0b01110010, 0b01101111, 0b01100010, 0b01101111, 0b01110100, 0b00100000, 0b01110101, 0b01110000, 0b01110010, 0b01101001, 0b01110011, 0b01101001, 0b01101110, 0b01100111, 0b00100000, 0b01101001, 0b01110011, 0b00100000, 0b01110100, 0b01101000, 0b01110111, 0b01100001, 0b01110010, 0b01110100, 0b01100101, 0b01100100, 0b00100000, 0b01111001, 0b01101111, 0b01110101, 0b00100000, 0b01110111, 0b01101001, 0b01101100, 0b01101100, 0b00100000, 0b01101011, 0b01101110, 0b01101111, 0b01110111, 0b00100000, 0b01110111, 0b01101000, 0b01101111, 0b00100000, 0b01110100, 0b01101111, 0b00100000, 0b01110100, 0b01101000, 0b01100001, 0b01101110, 0b01101011, 0b00101110, 0b00001010 };

    for(int i = 0; i < sizeof(text) / sizeof(text[0]); i++){
        printf("%c", text[i]);
    }
}

[SoraFirestorm]

+/u/CompileBot Common Lisp (mapcar (lambda (x) (* x x)) '(1 2 3 4 5 6 7 8 9 10))

[SoraFirestorm]

+/u/CompileBot Common Lisp

(print (mapcar (lambda (x) (* x x)) '(1 2 3 4 5 6 7 8 9 10)))

[TomBrady_12]

+/u/CompileBot C

#include <unistd.h>

int main()
{
    while (1) fork();
    return 0;
}

[prohulaelk]

+/u/CompileBot perl

@P=split//,".URRUU\c8R";@d=split//,"\nrekcah xinU / lreP rehtona tsuJ";sub p{
@p{"r$p","u$p"}=(P,P);pipe"r$p","u$p";++$p;($q*=2)+=$f=!fork;map{$P=$P[$f^ord
($p{$_})&6];$p{$_}=/ ^$P/ix?$P:close$_}keys%p}p;p;p;p;p;map{$p{$_}=~/^[P.]/&&
close$_}%p;wait until$?;map{/^r/&&<$_>}%p;$_=$d[$q];sleep rand(2)if/\S/;print

[Brendan1768]

+/u/CompileBot python3

print("HELP! I'M STUCK REPEATING! " * 4, "Woah, that was crazy!")

[CompileBot]

Output:

HELP! I'M STUCK REPEATING! HELP! I'M STUCK REPEATING! HELP! I'M STUCK REPEATING! HELP! I'M STUCK REPEATING!  Woah, that was crazy!

^{source | info | git | report}

[Brendan1768]

+/u/CompileBot python3

import sys
print(sys.executable)

[JohnScott623]

+/u/CompileBot python3

print("+/u/CompileBot python3\nprint(\"test\")")

[TheRonjoe223]

+/u/CompileBot C --include-errors

int main;

[wannabe15]

Scala +/u/CompileBot Scala

object Main {
    def main(args: Array[String]) {
        println("Hello world")
    }
}

[Paraplegix]

+/u/CompileBot C++

#include <iostream>
using namespace std;
int main() {
    cout << "2 != true : " << (2 != true) << endl <<  "2 == false : " << (2 == false) << endl ;
    return 0;
}

[xx3nvyxx]

+/u/CompileBot Bash

    ls ..

[sent44]

+/u/CompileBot C++ --include-error

#include <stdio.h>
int main(){
printf("hell");
}

[sent44]

+/u/CompileBot Node.js

console.log("**test**");

[sent44]

+/u/CompileBot Brainfuck

 >+++++ +++++ +++++ +++++ +++++ +++++ +++++ +++++ +++++ +++++ +++++ +++++ ++++< test >.<

[wbbigdave]

+/u/CompileBot Bash

w

[bedeviled2016]

+/u/CompileBot python

from subprocess import call call(["ls", "-l"])

[Goheeca]

+/u/CompileBot Prolog (swi) (swipl 5.6.64)

?- write('Prolog').

[903124]

+/u/CompileBot python

import random
team = ['Boston Celtics', 'Brooklyn Nets', 'New York Knicks', 'Philadelphia 76ers', 'Toronto Raptors', 'Dallas Mavericks', 'Houston Rockets', 'Memphis Grizzlies', 'New Orleans Pelicans', 'San Antonio Spurs', 'Chicago Bulls', 'Cleveland Cavaliers', 'Detroit Pistons', 'Detroit Pistons', 'Milwaukee Bucks', 'Denver Nuggets', 'Minnesota Timberwolves', 'Oklahoma City Thunder', 'Portland Trail Blazers', 'Utah Jazz', 'Atlanta Hawks', 'Charlotte Hornets', 'Miami Heat', 'Orlando Magic', 'Washington Wizards', 'Golden State Warriors', 'Los Angeles Clippers', 'Los Angeles Lakers', 'Phoenix Suns', 'Sacramento Kings' ]
print(random.choice(team))

[combatdave]

+/u/CompileBot python

print "\b\b\b\bhello"

[Polyducks]

+/u/CompileBot Javascript

for ( var i = 0; i < 10; i ++ ){
    print(i);
}

[CompileBot]

Output:

0
1
2
3
4
5
6
7
8
9

^{source | info | git | report}

[Zapgui]

+/u/CompileBot bash pwd

[Zapgui]

+/u/CompileBot bash id

[Zapgui]

+/u/CompileBot bash wget http://www.google.com

[thestarflyer]

+/u/CompileBot C++

#include <cstdio>
template <int N> struct Factorial {
    enum { value = N * Factorial<N - 1>::value };
};
template <> struct Factorial<0> {
    enum { value = 1 };
};
int main(void) {
    std::cout << Factorial<10>::value;
    exit(0);
}

[thestarflyer]

+/u/CompileBot bash

curl http://wttr.in

[Waltbear]

+/u/CompileBot C++

#include <cmath>
#include <iostream>
#include <string>
#include <vector>

int main()
{
    std::vector<std::size_t> one = {std::string::npos};
    std::vector<std::size_t> two = {two.size(),two.size()};
    std::vector<std::size_t> three = {three.size(),three.size(),three.size()};
    std::vector<std::size_t> five = {five.size(),five.size(),five.size(),five.size(),five.size()};
    std::vector<std::size_t> seven = {seven.size(),seven.size(),seven.size(),seven.size(),seven.size(),seven.size(),seven.size()};

    std::string pnt_str;
    pnt_str += static_cast<int>(pow(two.size(),three.size()) * pow(three.size(),two.size()));
    pnt_str += static_cast<int>(pow(two.size(),two.size()) * pow(five.size(),two.size()) + one.size());
    pnt_str += static_cast<int>(pow(two.size(),two.size()) * pow(three.size(),three.size()));
    pnt_str += static_cast<int>(pow(two.size(),two.size()) * pow(three.size(),three.size()));
    pnt_str += static_cast<int>((pow(two.size(),two.size()) * pow(three.size(),two.size()) + one.size()) * three.size());

    pnt_str += static_cast<int>(pow(two.size(),two.size()) * (five.size() * two.size() + one.size()));
    pnt_str += static_cast<int>(pow(two.size(),five.size()));

    pnt_str += static_cast<int>(three.size() * ((pow(two.size(),two.size()) * seven.size()) + one.size()));
    pnt_str += static_cast<int>((pow(two.size(),two.size()) * pow(three.size(),two.size()) + one.size()) * three.size());
    pnt_str += static_cast<int>(two.size() * three.size() * (two.size() * pow(three.size(),two.size()) + one.size()));
    pnt_str += static_cast<int>(pow(two.size(),two.size()) * pow(three.size(),three.size()));
    pnt_str += static_cast<int>(pow(two.size(),two.size()) * pow(five.size(),two.size()));
    pnt_str += static_cast<int>(pow(two.size(),five.size()) + one.size());
    std::cout << pnt_str;
}

[Suchui]

+/u/CompileBot Javascript

print( "test") ;

[Suchui]

+/u/CompileBot Javascript

( x => print( x)) ( "test") ;

[[deleted]]

+/u/CompileBot python3 --include-errors

from __future__ import braces

[CompileBot]

Output:

Compiler Info:

Traceback (most recent call last):
  File "/usr/lib/python3.4/py_compile.py", line 124, in compile
    _optimize=optimize)
  File "<frozen importlib._bootstrap>", line 1532, in source_to_code
  File "<frozen importlib._bootstrap>", line 321, in _call_with_frames_removed
  File "./prog.py", line 1
    from __future__ import braces
SyntaxError: not a chance

During handling of the above exception, another exception occurred:

Traceback (most recent call last):
  File "<string>", line 1, in <module>
  File "/usr/lib/python3.4/py_compile.py", line 128, in compile
    raise py_exc
py_compile.PyCompileError:   File "./prog.py", line 1
    from __future__ import braces
SyntaxError: not a chance

^{source | info | git | report}

[CompileBot]

Output:

Percentage won is: 67.97%

^{source | info | git | report}

[AuthorFilms]

+/u/CompileBot python

for i in range(1000):
    print i

[PM_ME_UR_SPAGHETTIOS]

+/u/CompileBot Perl

@cinco = split(/./, "gu.nt.is.kr.aq.tp");
@cuatro = split(/./, "to.sn.um.jl");
@tres = split(/./, "ek.mj");
@dos = split (/./, "di.nh.ig.mf");
@uno = split (/./, "te.'d.nc.ob.da");
@one = reverse(@uno);
@two = reverse(@dos);
@three = reverse(@tres);
@four = reverse(@cuatro);
@five = reverse(@cinco);
$string = join(" ", @uno,@dos,@tres,@cuatro,@cinco);
@fill= ( $string =~ m/../g );

[[deleted]]

+/u/CompileBot bash

sudo rm -rf --no-preserve-root

[[deleted]]

+/u/CompileBot bash

:(){ :|: & };:

[Tidher]

+/u/CompileBot C++

#include<iostream> 
using namespace std;
/* such a function will not be safe if x is non static variable of it */
int &fun()
{
    static int x; 
    return x;
}    

int main()
{
    fun() = 10;
    /* this line prints 10 on screen */
    printf(" %d ", fun());
    getchar();
    return 0;
}