Free Ideone API
try it now!
Your great ideas will be born here
Recent public pastes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- Tcl
- Text
- Unlambda
- Visual Basic .NET
- Whitespace
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4
class Main{ public static void main (String[]args){ System.OUT.println("aa"); }}
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #238 DO ,1 SUB #2 <- #108 DO ,1 SUB #3 <- #112 DO ,1 SUB #4 <- #0 DO ,1 SUB #5 <- #64 DO ,1 SUB #6 <- #194 DO ,1 SUB #7 <- #48 PLEASE DO ,1 SUB #8 <- #22
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1
ff
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1
PLEASE GIVE UP
-
1
PLEASE quit
-
1
printf('Hello, world')
-
1 2 3 4 5 6 7 8 9
class aplicacion { public int[] burbuja (int[] valores) { int aux; for (int i = 0; i < valores.length; i++) { for (int j = 0; j < valores.length - 1; j++) { if (valores[j] > valores[j + 1]) {
...
-
1 2 3 4 5 6 7 8 9
class aplicacion { public int[] burbuja (int[] valores) { int aux; for (int i = 0; i < valores.length; i++) { for (int j = 0; j < valores.length - 1; j++) { if (valores[j] > valores[j + 1]) {
...
-
1 2 3 4 5 6 7 8 9
class aplicacion { public int[] burbuja (int[] valores) { int aux; for (int i = 0; i < valores.length; i++) { for (int j = 0; j < valores.length - 1; j++) { if (valores[j] > valores[j + 1]) {
...
-
1 2 3 4 5 6 7 8 9
class aplicacion { public int[] burbuja (int[] valores) { int aux; for (int i = 0; i < valores.length; i++) { for (int j = 0; j < valores.length - 1; j++) { if (valores[j] > valores[j + 1]) {
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
class Prime_number { public static void main(String[] args) { int num = 11; int i; for (i=2; i < num ;i++ ){ int n = num%i; if (n==0){ System.OUT.println("not Prime!"); break;
...
-
1 2 3 4 5 6 7
import java.lang.String; import java.util.System; void main( int argc, String argv ) { System.OUT.println("Boo!"); }
-
1 2 3 4 5
class demo { public static coid main(String args[]) System.OUT.println("hello world"); }
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1
¸„ħ}ßnïÚæ“‘½–ä´CB»GH¥÷tf…VlÕÄe¢±Îü¨
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
