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 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)
...
-
1 2 3 4 5 6 7 8 9
procedure bin(a:INTEGER); begin if a<>0 THEN bin(a div 2); if a<>0 THEN write(a mod 2); end; BEGIN bin(13); END.
-
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
#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
1#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
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) + "." + " "); System.out.println(" " + numbers(low, middle_1) + "." + " "); System.out.println(" " + numbers(middle_1 + 1, middle_2) + "." + " ");
...
-
1 2 3 4 5
#include <stdio.h> void main() { printf("Hello World"); }
-
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(a==c)
...
-
1 2 3 4
void main() { printf("Hello World"); }
-
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
procedure bin(a:INTEGER); begin if a<>0 THEN bin(a div 2); write(a mod 2); end; BEGIN bin(13); END.
-
1 2 3 4 5 6 7 8 9
7 #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");
...
-
1 2 3 4
void main() { printf("Hello World"); }
-
1 2 3 4 5 6 7 8 9
procedure bin(a:INTEGER); begin if a<>0 THEN bin(a div 2); writeln(a mod 2); end; BEGIN bin(13); END.
-
1 2 3 4 5 6 7 8 9
procedure bin(a:INTEGER); begin if a<>0 THEN bin(a div 2); writeln(a mod 2); end; BEGIN bin(13; END.
-
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
void main() { printf("Hello World"); getch(); }
-
1 2 3 4 5 6 7 8 9
#include <cstring> #include <cstdio> using namespace std; const int base = 13331, Q1 = 1000000007, Q2 = 1000000009; int hash1[1000001], hash2[1000001], power1[1000001], power2[1000001];
...
-
1 2 3 4 5
void main() { printf("Hello World"); getch(); }
-
1 2 3 4 5 6 7 8 9
procedure bin(a:INTEGER); begin if a<>0 THEN bin(a div 2); writeln(a mod 2); end; BEGIN writeln(bin(13)); END.
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { int intNum = 0; cin >> intNum; while (intNum != 42) {
...
-
1 2 3 4 5 6 7 8 9
#include <algorithm> #include <cstdio> #include <vector> #include <queue> using namespace std; int a[250000], b[250000];
...


