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
- Java7
- 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
function fib(a:integer):integer; begin if (a=1) or (a=0) THEN fib:=a else fib:=fib(a-1)+fib(a-2); end; BEGIN writeln(fib(600)); END.
-
1 2 3 4 5 6 7 8
IDENTIFICATION DIVISION. PROGRAM-ID. HELLO-WORLD. ENVIRONMENT DIVISION. DATA DIVISION. PROCEDURE DIVISION. PARA-1. DISPLAY "Hello, World!!". STOP RUN.
-
1 2 3 4 5 6 7 8
function fib(a:integer):integer; begin if (a=1) or (a=0) THEN fib:=a else fib:=fib(a-1)+fib(a-2); end; BEGIN writeln(fib(1000)); END.
-
1 2 3 4 5 6 7 8 9
import java.lang.*; /** * Note that Java console applications need to be run through the java runtime * by running "java -jar JarFile.jar" in the command line. * Java console applications can not be previewed in the Compilr IDE, only applets can. */ public class Program {
...
-
1 2 3 4 5 6 7 8
function fib(a:integer):integer; begin if (a=1) or (a=0) THEN fib:=a else fib:=fib(a-1)+fib(a-2); end; BEGIN writeln(fib(10000)); END.
-
1 2 3 4 5 6 7 8
IDENTIFICATION DIVISION. PROGRAM_ID. HELLO_WORLD. ENVIRONMENT DIVISION. DATA DIVISION. PROCEDURE DIVISION. PARA-1. DISPLAY "Hello, World!!". STOP RUN.
-
1 2 3 4 5 6 7 8 9
package bat; class batch { String name int id; Batch(String n,int i) { name=n; id=i;
...
-
1 2 3 4 5 6 7 8 9
class Main { public static void main(String[] args) { System.out.println("Hello World!"); // Display the string. Point p1 = new Point(3, 5); Point p2 = p1; p1 = null; System.out.println(p2.getx()); } }
...
-
1 2 3 4 5 6 7 8 9
import java.util.*; class Statistics { public static double[] bubbleSort(double [] userNums){ double [] sortedNums = (double []) userNums.clone(); for(int i = 0;i < sortedNums.length; i ++){ for(int j = i + 1;j < sortedNums.length;j ++){ if(sortedNums[i] > sortedNums [j]){
...
-
1 2 3 4 5 6 7 8 9
package stud; import bat.batch; class student { String name; int rno; batch b; student(int r,String n) {
...
-
1 2 3 4 5 6 7 8 9
procedure bin(a:INTEGER); begin if a<>0 THEN begin bin(a div 2); write(a mod 2); end; end;
...
-
1 2 3 4 5 6 7 8 9
procedure bin(a:INTEGER); begin if a<>0 THEN begin bin(a div 2); write(a mod 2); end; end;
...
-
1
-
1 2 3 4 5 6 7 8 9
IDENTIFICATION DIVISION. PROGRAM-ID. HELLO-WORLD. * ENVIRONMENT DIVISION. * DATA DIVISION. * PROCEDURE DIVISION. PARA-1.
...
-
1 2 3 4 5 6 7 8 9
public void mergesort(int low, int high); { if (low < high) { int middle_1 = (low + high) / 3 ; int middle_2 = ((low + high) - middle_1) / 3 ; System.out.println("split: " + numbers(low, high) + "." + " ") ;
...
-
1 2 3 4 5 6 7 8 9
abstract class Figure { double dim1; double dim2; Figure(double a, double b) { dim1 = a; dim2 = b; } // area is now an abstract method abstract double area();
...
-
1 2 3 4 5 6 7 8 9
# -*- coding: cp1252 -*- """ Problem SPOJ 1025: Fashion shows: Mix hottest couples (FASHION) """ import sys # import psyco # psyco.full() def init_testcase(): cases = [ '2',
...
-
1 2 3 4 5 6 7 8 9
procedure bin(a:INTEGER); begin if a<>0 THEN begin bin(a div 2); write(a mod 2); end; end;
...
-
1 2 3 4 5 6
public int canIRememberAnything(int a, int b){ for(int i = 1;i > 10;i ++){ a += i; b -= i; } }
-
1 2 3 4 5 6 7 8 9
#include "cliclib.h" using namespace std; bool f[30001][16][11]; int pow3[11]; int main() {
...
-
1 2 3 4 5 6 7 8 9
abstract class Figure { double dim1; double dim2; Figure(double a, double b) { dim1 = a; dim2 = b; } // area is now an abstract method abstract double area();
...
-
1 2 3 4 5 6 7 8 9
def gcd(a,b): if b==0: return a else: return gcd(b,a%b) n=input() i=1
...
-
1 2 3 4 5 6 7 8 9
uses dos; const maska : string = '*.*'; procedure writename(const SR : searchrec); begin with sr do begin write(name:14);
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<stdlib.h> #include<math.h> int main() { int opc,total_horas,faltas_aluno,n1,n2,media; printf("********Menu de Opcoes********\n\n\n"); printf("1- Digitacao de Notas \n"); printf("2- Digitacao de Faltas \n\n\n\n");
...
-
1 2 3 4 5 6 7 8 9
procedure bin(a:INTEGER); begin if a<>0 THEN bin(a div 2) ELSE write(a mod 2); end; BEGIN bin(13); END.
-
1 2 3 4 5 6 7
a = [0, 1, 2] p = 0 for letter in xrange(len(a) - 1): a[letter + 1] = a[letter] print a
-
1 2 3 4 5 6 7 8 9
#include<cstdio> #include<cstdlib> #include<cmath> #include<algorithm> #include<queue> #include<vector> #include<iostream> #define MAXWAV 5
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<stdlib.h> #include<math.h> int main() { int opc,total_horas,faltas_aluno,n1,n2,media; printf("********Menu de Opcoes********\n\n\n"); printf("1- Digitacao de Notas \n"); printf("2- Digitacao de Faltas \n\n\n\n");
...
-
1 2 3 4 5 6 7 8 9
procedure bin(a:INTEGER); begin if a<>0 THEN bin(a div 2); ELSE write(a mod 2); end; BEGIN bin(13); END.
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<math.h> int main(){ long int a,b,c; scanf("%ld %ld %ld",&a,&b,&c); while(a!=0&&b!=0&&c!=0){ int f=0; long int d=sqrt(a*a+b*b); if(d==c)
...


