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
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#' c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#' c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 5. c:= 1. k:= 1. count:= (n-2). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#' c:= c + 1]. c:= 1. count:= count - 1. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...
-
1 2 3 4 5 6 7 8 9
| n c k count | n:= 3. c:= 1. k:= 1. count:= (n-1). [k <= n]whileTrue: [ [c <= count]whileTrue:[ Transcript show:'#'. c:= c + 1]. c:= 1. count:= count. [c <= (2 * k - 1 )]whileTrue: [ Transcript show: '*'. c:= c + 1].
...


