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++ 4.3.2
- C++ 4.7.2
- C++11
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- Java7
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Node.js
- Objective-C
- Ocaml
- Octave
- Oz
- PARI/GP
- 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
#include <iostream> int main() { auto a = 11; std::cout << "hello c++" << a << std::endl; return ( 0 ); }
-
1 2 3 4 5 6 7 8 9
#include <iostream.h> using namespace std; int Partition(int a[], int beg, int end) //Function to Find Pivot Point { int p=beg, pivot=a[beg], loc; for(loc=beg+1;loc<=end;loc++) {
...
-
1 2 3 4 5 6 7 8 9
#include <cstdio> int main() { printf("%.2g\n", 186.0); printf("%.2e\n", 186.0); return 0; }
-
1 2 3 4 5 6 7 8 9
#include<conio.h> int Partition(int a[], int beg, int end) //Function to Find Pivot Point { int p=beg, pivot=a[beg], loc; for(loc=beg+1;loc<=end;loc++) {
...
-
1 2 3 4 5 6 7 8 9
#include <cstdio> int main() { printf("%.2g\n", 18614398509481980.0); printf("%.2e\n", 18614398509481980.0); return 0; }
-
1 2 3 4 5 6 7 8 9
#include<iostream.h> #include<conio.h> int Partition(int a[], int beg, int end) //Function to Find Pivot Point { int p=beg, pivot=a[beg], loc; for(loc=beg+1;loc<=end;loc++) {
...
-
1 2 3 4 5 6 7 8 9
#include<iostream.h> #include<conio.h> int Partition(int a[], int beg, int end) //Function to Find Pivot Point { int p=beg, pivot=a[beg], loc; for(loc=beg+1;loc<=end;loc++) {
...
-
1 2 3 4 5 6 7 8 9
#include <cstdio> int main() { printf("%.2g\n", 18014398509481980.0); printf("%.2e\n", 18014398509481980.0); return 0; }
-
1 2 3 4 5 6 7 8
#include <cstdio> int main() { printf("%.2g\n", 18014398509481980.0); return 0; }
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { unsigned char * pt; pt = new unsigned char('x'); cout << *static_cast<uint8_t*>(pt); return 0;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { unsigned char * pt; pt = new char('x'); cout << *static_cast<uint8_t*>(pt); return 0;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { char * pt; pt = new char('x'); cout << *static_cast<uint8_t*>(pt); return 0;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { char * pt; pt = new char('x'); cout << *static_cast<int*>(pt); return 0;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { char * pt; pt = new('x'); cout << *static_cast<int*>(pt); return 0;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { char * pt; *pt = 'x'; cout << *static_cast<int*>(pt); return 0;
...

