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
var g:array[0..10,0..10] of byte; used:array[0..10,0..10] of boolean; i,j,n,v1,v2,k:longint; c:char; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[0..10,0..10] of byte; used:array[0..10,0..10] of boolean; i,j,n,v1,v2,k:longint; c:char; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[0..10,0..10] of byte; used:array[0..10,0..10] of boolean; i,j,n,v1,v2,k:longint; c:char; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[0..10,0..10] of byte; used:array[0..10,0..10] of boolean; i,j,n,v1,v2,k:longint; c:char; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[0..10,0..10] of byte; used:array[0..10,0..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[0..10,0..10] of byte; used:array[0..10,0..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[-10..10,1..10] of byte; used:array[-10..10,1..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[-10..10,1..10] of byte; used:array[-10..10,1..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
{$R+} var g:array[-10..10,1..10] of byte; used:array[-10..10,1..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else
...
-
1 2 3 4 5 6 7 8 9
{$R+} var g:array[-10..10,1..10] of byte; used:array[-10..10,1..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[1..10,1..10] of byte; used:array[1..10,1..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[1..10,1..10] of byte; used:array[1..10,1..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[1..10,1..10] of byte; used:array[1..10,1..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[1..10,1..10] of byte; used:array[1..10,1..10] of boolean; i,j,n,v1,v2,k:longint; s:string; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[1..10,1..10] of byte; used:array[1..10,1..10] of boolean; i,j,n,v1,v2,k:longint; c:char; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var g:array[1..10,1..10] of byte; used:array[1..10,1..10] of boolean; i,j,n,v1,v2,k:longint; c:char; procedure find(i,j:longint); begin if not used[i][j] then inc(k); used[i][j]:=true; if (g[i+1][j] = 1) and (not used[i+1][j]) then find(i+1,j) else if (g[i-1][j] = 1) and (not used[i-1][j]) then find(i-1,j) else
...
-
1 2 3 4 5 6 7 8 9
var s:string; a:array[1..26] of byte; i,p:byte; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string; a:array[1..26] of byte; p:byte; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string[201]; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string[201]; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string[201]; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string[201]; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string[200]; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string[200]; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string[200]; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string[200]; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
var s:string[200]; a:array[1..26] of byte; p,i,j:integer; begin while (s[1]<>'*') do begin readln(s);
...
-
1 2 3 4 5 6 7 8 9
function czypierwsza(a:cardinal): boolean; var l1, p1:cardinal; begin l1 := 0; for p1 := 1 to a do if a mod p1 = 0 then l1 := l1 + 1; czypierwsza:= l1 = 2 end;
...


