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
program stage25; const a = 4; b = 12; c = 99; d = 2099; var e, f, g, i : integer; h : real;
...
-
1 2 3 4 5 6 7 8 9
program stage25; uses wincrt; const a = 4; b = 12; c = 99; d = 2099; var e, f, g, i : integer;
...
-
1 2 3 4 5 6 7
program participants; var person: Array[1..100,1..100,1..100] of String; begin end.
-
1 2 3
program participants; var person: Array[1..100,1..100,1..100] of String;
-
1 2 3
program participants; var person: Array[1..100,1..100,1..100] of String;
-
1 2 3 4 5 6 7 8 9
program test; var x:byte; begin readln(x); while x<>42 do begin writeln(x);
...
-
1 2 3 4 5 6 7 8 9
type TInt = 1..10; TLong = 1..1000000000; TArray = array[TInt] of longint; TSet = array[TLong] of boolean; var k, t : TInt; max, f, g, i, j : TLong;
...
-
1 2 3 4 5 6 7 8 9
var i, j, n: integer; begin readln(n); for i:=1 to n do begin if ((i=1) or (i=n)) then
...
-
1 2 3 4 5 6 7 8 9
Program Pzim ; Var a: integer; Function fib(x:integer):integer; Begin if x<=1 then fib:=x Else fib:=fib(x-1)+fib(x-2); End;
...
-
1 2 3 4 5 6 7 8 9
Program Pzim ; Var a: integer; Function fib(x:integer):integer; Begin if x<=1 then fib:=x Else fib:=fib(x-1)+fib(x-2); End;
...
-
1 2 3 4 5 6 7 8 9
Program Pzim ; Var a: integer; Function fib(x:integer):integer; Begin if x<=1 then fib:=x Else fib:=fib(x-1)+fib(x-2); End;
...
-
1 2 3 4 5 6 7 8 9
var i, j, n: integer; begin readln(n); for i:=1 to n do begin if ((i=1) or (i=n)) then
...
-
1 2 3 4 5 6 7 8 9
Program Pzim ; Var a: integer; Function fib(x:integer):integer; Begin if x<=1 then fib:=x Else fib:=fib(x-1)+fib(x-2); End;
...
-
1 2 3 4 5 6 7 8 9
Program Pzim ; Var a: integer; Function fib(x:integer):integer; Begin if x<=1 then fib:=x Else fib:=fib(x-1)+fib(x-2); End;
...
-
1 2 3 4 5 6 7 8 9
Program Pzim ; Var a: integer; Function fib(x:integer):integer; Begin if x<=1 then fib:=x Else fib:=fib(x-1)+fib(x-2); End;
...
-
1 2 3 4 5 6 7 8 9
program prime; var t, a, b: integer; n: longint; p : array [1..10000] of boolean; i, j : array [1..10] of longint; procedure sieve(x:longint); var c, d: longint; begin
...
-
1 2 3 4 5 6 7 8 9
program prime; var t, a, b: integer; n: longint; p : array [1..10000] of boolean; i, j : array [1..10] of longint; procedure sieve(x:longint); var c, d: longint; begin
...
-
1 2 3 4 5 6 7 8 9
program Project3out; var p:Array of array of integer; N,R,i,j,k,M,C,NulaX,NulaY,o,count,Res:integer; br,xx:boolean; begin readln(N); for i:=1 to N do begin //1
...
-
1 2 3 4 5 6 7 8 9
program Project3out; var p:Array of array of integer; N,R,i,j,k,M,C,NulaX,NulaY,o,count,Res:integer; br,xx:boolean; begin readln(N); for i:=1 to N do begin //1
...
-
1 2 3 4 5 6 7 8 9
program pr2940; var a,b,c: longint; begin readln(a); readln(b); c:= abs(a*b) mod 109; if a<0 then c:=109 - c; writeln (c); end.
-
1 2 3 4 5 6 7 8 9
program Project2out; type tpoint = record x,y:longint; end; var
...
-
1 2 3 4 5 6 7 8 9
program prime; var t, a, b: integer; n: longint; p : array [1..1000000000] of boolean; i, j : array [1..10] of longint; procedure sieve(x:longint); var c, d: longint; begin
...
-
1 2 3 4 5 6 7 8 9
program prime; var t, a, b: longint; n: longint; p : array [1..1000000000] of boolean; i, j : array [1..10] of longint; procedure sieve(x:longint); var c, d: longint; begin
...
-
1 2 3 4 5 6 7 8 9
{type int64=longint;} var k,i,j,n,l:longint; sum:int64; s:array[1..100000] of int64; x,c,t:array[1..100000] of longint; begin assign(input,'travel.in'); assign(output,'travel.out');
...
-
1 2 3 4 5 6 7 8 9
program prime; var t, a, b: longint; n: longint; p : array [1..1000000000] of boolean; i, j : array [1..10] of longint; procedure sieve(x:longint); var c, d: longint; begin
...
-
1 2 3 4 5 6 7 8 9
program prime; var t, a, b: longint; n: longint; p : array [1..1000000000] of boolean; i, j : array [1..10] of longint; procedure sieve(x:longint); var c, d: longint; begin
...
-
1 2 3 4 5 6 7 8 9
Program RotasiMarix; Var c, z, t, s, i, j, k, l, d, f, n, m : integer; a, b : array[1..100,1..100] of integer; Begin c := 0; z := 0; t := 0; s := 0; read(n, m);
...
-
1 2 3 4 5 6 7 8 9
Program RotasiMarix; Var c, z, t, s, i, j, k, l, d, f, n, m : integer; a, b : array[1..100,1..100] of integer; Begin c := 0; z := 0; t := 0; s := 0; read(n, m);
...
-
1 2 3 4 5 6 7 8 9
var i,sum2,j:longint; a,sum:int64; begin {assign(input, 'sum.in'); reset(input); assign(output, 'sum.out'); rewrite(output);} readln(a); sum:=0; sum2:=0; for i:=1 to a do
...
-
1 2 3 4 5 6 7 8 9
var i,sum,sum2,j:longint; a,sum:int64; begin {assign(input, 'sum.in'); reset(input); assign(output, 'sum.out'); rewrite(output);} readln(a); sum:=0; sum2:=0; for i:=1 to a do
...


