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 dyskol(input,output); type list = 0..1000000; var N, i, j, max : list; sum : array[1..10000,1..10000] of integer; a : array[1..1000000] of integer; Begin readln(N); i := 0; while not eoln do begin i := i + 1;
...
-
1 2 3 4 5 6 7 8 9
program duskolo_2 (input, output); var metr, k, i, l, sum, f, n, max : integer; A : array [1..100] of integer; athr : array [1..1000] of integer; begin readln(n); i:=1; while (not eoln) do begin read(A[i]); i:=i+1 end; metr:=1;
...
-
1 2 3 4 5 6 7 8 9
program duskolo_2 (input, output); var metr, k, i, l, sum, f, n, max : integer; A : array [1..100] of integer; athr : array [1..1000] of integer; begin readln(n); i:=1; while (not eoln) do begin read(A[i]); i:=i+1 end; metr:=1;
...
-
1 2 3 4 5 6 7 8 9
program dyskol(input,output); type list = 0..1000000; var N, i, j, max : list; sum : array[1..10000,1..10000] of integer; a : array[1..1000000] of integer; Begin readln(N); i := 0; while not eoln do begin i := i + 1;
...
-
1 2 3 4 5 6 7 8 9
program dyskol(input,output); type list = 0..1000000; var N, i, j, max : list; sum : array[1..10000,1..10000] of integer; a : array[1..1000000] of integer; Begin readln(N); i := 0; while not eoln do begin i := i + 1;
...
-
1 2 3 4 5 6 7 8 9
program duskolo_2 (input, output); var metr, k, i, l, sum, f, n, max : integer; A : array [1..1000000] of integer; athr : array [1..1000000000000] of integer; begin readln(n); i:=1; while (not eoln) do begin read(A[i]); i:=i+1 end; metr:=1;
...
-
1 2 3 4 5 6 7 8 9
program duskolo_2 (input, output); var metr, k, i, l, sum, f, n, max : integer; A : array [1..1000000] of integer; athr : array [1..1000000000000] of integer; begin readln(n); i:=1; while (not eoln) do begin readd(A[i]); i:=i+1 end; metr:=1;
...
-
1 2 3 4 5 6 7 8 9
program dyskol(input,output); type list = 1..1000000; var N, i, j, max : list; sum : array[1..10000,1..10000] of integer; Begin readln(N); i := 0; while not eoln do begin i := i + 1;
...
-
1 2 3 4 5 6 7 8 9
program duskolo_2 (input, output); var metr, k, i, l, sum, f : integer; A : array [1..1000000] of integer; athr : array [1..1000000000000] of integer; begin readln(n); i:=1; while (not eoln) do begin readd(A[i]); i:=i+1 end; metr:=1;
...
-
1 2 3 4 5 6 7 8 9
program dyskol(input,output); type list = 1..1000000; var N, i, j, max : list; sum : array[1..1000000,1..10000] of integer; a : array[1..1000000] of integer; Begin readln(N); i := 0; while not eoln do begin i := i + 1;
...
-
1 2 3 4 5 6 7 8 9
program dyskol(input,output); type list = 1..1000000; var N, i, j, max : list; sum : array[1..1000000,1..1000000] of integer; Begin readln(N); i := 0; while not eoln do begin i := i + 1;
...
-
1 2 3 4 5 6 7 8
program test; var x: integer; begin repeat readln(x); if x<>42 then writeln(x); until x=42 end.
-
1 2 3 4 5 6 7 8
program test; var x: integer; begin repeat readln(x); if x<>42 then writeln(x); until x=42 end.
-
1 2 3 4 5 6 7 8 9
const a = 4; b = 12; c = 99; d = 2099; var e, f, g, i : integer; h : real; begin
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); readln; if a[1]>0 then sum0 := (a[1] + a[2])
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); if a[1]>0 then sum0 := (a[1] + a[2]) else if a[n]<0 then sum0 := ( a[n] + a[n - 1])
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); if a[1]>0 then sum0 := (a[1] + a[2]) else if a[n]<0 then sum0 := ( a[n] + a[n - 1])
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); if a[1]>0 then sum0 := (a[1] + a[2]) else if a[n]<0 then sum0 := ( a[n] + a[n - 1])
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); if a[1]>0 then sum0 := (a[1] + a[2]) else if a[n]<0 then sum0 := ( a[n] + a[n - 1])
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); if a[1]>0 then sum0 := (a[1] + a[2]) else if a[n]<0 then sum0 := ( a[n] + a[n - 1])
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); if a[1]>0 then sum0 := (a[1] + a[2]) else if a[n]<0 then sum0 := ( a[n] + a[n - 1])
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); if a[1]>0 then sum0 := (a[1] + a[2]) else if a[n]<0 then do sum0 := ( a[n] + a[n - 1])
...
-
1 2 3 4 5 6 7 8 9
program lowsum (input, output); var pin : array[1..1000000] of integer; N, i, j, min, sum : integer; zero : boolean; begin readln(N); j := N; for i := 1 to N do read(pin[i]);
...
-
1 2 3 4 5 6 7 8 9
program diafora(input, output); var N, i, j, temp, thesi, min : integer; a : array[1..1000000] of integer; begin readln(N); thesi:= 0; i:= 0; while i < N do
...
-
1 2 3 4 5 6 7 8 9
program lowsum (input, output); var pin : array[1..1000000] of integer; N, i, j, min, sum : integer; zero : boolean; begin readln(N); j := N; for i := 1 to N do read(pin[i]);
...
-
1 2 3 4 5 6 7 8 9
program diafora(input, output); var N, i, j, temp, thesi, min : integer; a : array[1..1000000] of integer; begin readln(N); thesi:= 0; i:= 0; while i < N do
...
-
1 2 3 4 5 6 7 8 9
program lowsum (input, output); var pin : array[1..1000000] of integer; N, i, j, min, sum : integer; zero : boolean; begin readln(N); j := N; for i := 1 to N do read(pin[i]);
...
-
1 2 3 4 5 6 7 8 9
program lowsum (input, output); var pin : array[1..1000000] of integer; N, i, j, min, sum : integer; zero : boolean; begin readln(N); j := N; for i := 1 to N do read(pin[i]);
...
-
1 2 3 4 5 6 7 8 9
program diafora(input, output); var N, i, j, temp, thesi, min : integer; a : array[1..1000000] of integer; begin readln(N); thesi:= 0; i:= 0; while i < N do
...
-
1 2 3 4 5 6 7 8 9
program diafora(input, output); var N, i, j, temp, thesi, min : integer; a : array[1..1000000] of integer; begin readln(N); thesi:= 0; i:= 0; while i < N do
...


