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
print "Hello, world!"
-
1
BEGIN { print "Hello, world!" }
-
1
nmc
-
1
-
1 2 3 4 5 6 7 8
FCeea120*1f56dcdCBd*A5e1eA *DEFAfE53*212*51*48deeCeD* baCa49A*Adc5D4*a1DBb8adfeF B0e*212E*acDBa81*CCD208C*E 5bC3C*52*D52*2dc0D9*51*BaF f48*a5A5*182*ebdDEcB4CC8F* 5B*c0baB*40*2EbeSLUdEEAf0B *AAA3bcdefBF*AaAaba2DBFA18
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<math.h> int check(long n) { int s = 1; // si primo – asume si int d; // divisor double r = sqrt(n); // raiz de n (incluir math.h) for (d = 2; s && d <= r; d++)
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<Math.h> int check(long n) { int s = 1; // si primo – asume si int d; // divisor double r = sqrt(n); // raiz de n (incluir math.h) for (d = 2; s && d <= r; d++)
...
-
1 2 3 4 5 6 7 8
#include <ctype.h> #include <iostream> #include <conio.h> #include <math.h> #include <stdlib.h> #include <time.h>
...
-
1 2 3 4 5 6 7 8 9
#include <ctype.h> #include <iostream> #include <conio.h> #include <math.h> #include <stdlib.h> #include <time.h> int const n=8; using namespace std;
...
-
1 2 3 4 5 6 7 8 9
#include <ctype.h> #include <iostream> #include <conio.h> #include <math.h> #include <stdlib.h> #include <time.h> using namespace std;
...
-
1 2 3 4 5 6 7 8 9
#include <string.h> #include <iostream> #include <math.h> #include <stdlib.h> using namespace std; int const n=5; void main(){int i,k,q,j=0; char s[25], d[25]; struct bibl
...
-
1 2 3 4 5 6 7 8 9
#include <string.h> #include <iostream> #include <math.h> #include <stdlib.h> using namespace std; int const n=5; void main(){int i,k,q,j=0; char s[25], d[25]; struct bibl
...
-
1 2 3 4 5
void main() { printf("으악?"); }
-
1 2 3 4 5 6 7 8 9
public class ZeByVysledek { private int a; private int b; private int c; private int d; private int e; public ZeByVysledek(int e, int d, int c, int b, int a) { setA(a);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <algorithm> using namespace std; int main() { char s[1000]; char t[1000];
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <algorithm> using namespace std; int main() { char s[1000]; char t[1000];
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <algorithm> using namespace std; int main() { char s[1000]; char t[1000];
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <algorithm> using namespace std; int main() { char s[1000]; char t[1000];
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <algorithm> using namespace std; int main() { char s[1000]; char t[1000];
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { int i,j,k,A,B,C,D,sum; int matriks1[75][75],matriks[75][75]; cin >> A >> B;
...
-
1 2 3 4 5 6 7 8 9
function ToRowEchelonForm(Matrix M) is nr := number of rows in M nc := number of columns in M for 0 ≤ r < nr do allZeros := true for 0 ≤ c < nc do if M[r, c] != 0 then allZeros := false
...
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1 2
awk '{sub(/^/, " ")};1'
-
1
awk " {print \"$1\"}"
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1 2
BEGIN { print("--- start ---") } /abc/ { print(">>> ",$0) }
-
1
BEGIN { print "Hello world!" }
-
1 2 3 4 5 6
#include <stdio.h> int main() { return(0); }


