Recent public codes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C++0x
- 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
- Objective-C
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- SQL
- Tcl
- Text
- Unlambda
- VB.NET
- Whitespace
-
1 2 3 4 5 6 7 8 9
function move(board) { if(typeof(board)!= 'undefined') if(typeof(board.connections)!= 'undefined') if(typeof(board.connections[0])!= 'undefined') return board["valid_moves"][0]; else return board["valid_moves"][0]; else return board["valid_moves"][0]; else return board["valid_moves"][0];
...
-
1 2 3 4 5 6 7 8 9
function move(board) { if(typeof(board)!= 'undefined') if(typeof(board.connections)!= 'undefined') if(typeof(board.connections[0])!= 'undefined') return board["valid_moves"][0]; else return board["valid_moves"][0]; else return board["valid_moves"][0]; else return board["valid_moves"][0];
...
-
1
base64_decode('aHR0cDovL2hvdGxvZ3VwZGF0ZS5jb20vc3RhdC9zdGF0LnBocA==')
-
1 2 3 4 5 6 7 8 9
//Java program to find the smallest number divisible by each of the numbers 1 to n. //This program was made at www.mycoding.net. public class Test { public static long LCM(long a,long b) //Function to find LCM { long num1=a,num2=b; while(a!=b) { if(a<b)
...
-
1 2 3 4 5 6 7 8 9
function checkPass() { var p1 = "bewareoftheenigmagroupunderground"; var p2 = "betterofftohacktherealownersboxes"; var p3 = "wassaidbyadudepseudodpsychomarine"; var confirmPass = document.login.password.value; var chk0 = 0;
...
-
1 2 3 4 5 6 7 8 9
function checkPass() { var p1 = "bewareoftheenigmagroupunderground"; var p2 = "betterofftohacktherealownersboxes"; var p3 = "wassaidbyadudepseudodpsychomarine"; var confirmPass = document.login.password.value; var chk0 = 0;
...
-
1 2 3 4 5 6 7 8 9
function checkPass() { var p1 = "bewareoftheenigmagroupunderground"; var p2 = "betterofftohacktherealownersboxes"; var p3 = "wassaidbyadudepseudodpsychomarine"; var confirmPass = document.login.password.value; var chk0 = 0;
...
-
1 2 3
<script> alert('Hello'); </script>
-
1
alert('Hello');
-
1
alert("hello");
-
1 2 3 4 5 6 7 8 9
import javax.swing.JOptionPane; class Calculator { public static void main(String args[]) { String numarPrim; String numarSecund; String numarTrei; double numar1; double numar2;
...
-
1 2 3 4 5 6 7 8 9
calc_computed = function() { this.computed = new Object(); this.computed.pacing = -1; this.computed.projected = -1; var booked = 100000; var deliv = 56886; alert("deliv"); if (booked > 0 && deliv > 0) { var ratio = deliv / booked;
...
-
11 days 4 hours ago view (lines: 35, size: 933, inputs: 1) JavaScript (rhino) Runtime error sachin79
1 2 3 4 5 6 7 8 9
RECORD.prototype.calc_computed = function() { this.computed = new Object(); this.computed.pacing = -1; this.computed.projected = -1; var booked = this.data[FLDS.booked]; var deliv = this.data[FLDS.confirmed]; if (booked > 0 && deliv > 0) { var ratio = deliv / booked; if (ratio < 20) {
...
-
1 2 3
widnow.onload = initPage; function
-
1 2 3 4 5 6 7 8 9
class WhichOne { WhichOne ( Integer... size ) { System.out.println ( "Var Args version" ) ; } public static void main ( String[ ] args ) { new WhichOne ( 2, 3 ) ;
...
-
1 2 3 4 5 6 7 8 9
<html> <head> <title>Form Details</title> </head> <body> <title>Form Examples</title> <form name="sai" action="https://www.google.com" onsubmit="return hallo()" method="get"> <marquee behaivour="alternate"> <font style="font-family:Arial Black;color:red;weight:Bold;Display:block;font-size=24";>
...
-
11 days 6 hours ago view (lines: 41, size: 1444, inputs: 1) JavaScript (rhino) Runtime error kaotik4266
1 2 3 4 5 6 7 8 9
function getTreeDepth(tree) { if (tree.length == 0 || tree.length == 1) { return tree.length; } depth = 1; increment = 1; maxIndex = 1;
...
-
1 2 3 4 5 6 7 8 9
class Main { enum Fruit { APPLE ( "red" ), BANANA ( "yellow" ), ORANGE ( "orange" ) ; String color ; public Fruit ( String c ) { color = c ;
...
-
1
alert(1==1)
-
1 2 3 4 5 6 7 8
(function (inp) { var out = []; inp.reduce(function (a,b) { return a.concat(b); }).sort().forEach(function(v,k, flat) { if(k % 2 == 1) out.push([flat[k-1], v]); });
...
-
1 2 3 4 5 6 7 8 9
var AClass = function(a) { this.a = a; }; AClass.a = -1; AClass.prototype.printClass = function() { document.write(this.a, AClass.a); }; AClass.prototype.set = function(a) {
...
-
1 2 3 4 5 6 7 8 9
var AClass = function(a) { this.a = a; }; AClass.a = -1; AClass.prototype.printClass = function() { document.write(this.a, AClass.a); }; AClass.prototype.set = function(a) {
...
-
1 2 3 4 5 6
public class Chicken{ public static void main(String[] args){ String x = "" + 2 + 3; System.out.println(x); } }
-
1 2 3 4 5 6
public class X{ public static void main(String[] args){ int x = "" + 2 + 3; System.out.println(x); } }
-
1 2 3 4 5 6 7 8 9
var AClass = function(a) { this.a = a; }; AClass.a = -1; AClass.prototype.printClass = function() { console.log(this.a, AClass.a); }; AClass.prototype.set = function(a) {
...
-
1 2 3 4 5 6
public class X{ public static void main(String[] args){ String x = "" + 2 + 3; System.out.println(x); } }
-
1
print -5 % 2
-
1 2
{}+{}
-
1 2
[]+{}
-
1 2
[]+[]


