1
2
3
4
USING: formatting io kernel locals math math.functions math.parser ;
 
readln string>number
number sq 3 * number + print

1
2
3
4
5
6
7
8
9
USING: io kernel math math.parser ;
 
readln string>number
 
3
*
*
-
/ 2

1
2
3
4
5
6
USING: io kernel math math.parser ;
 
readln string>number
 
[ dup 0 > ] [ dup 2 mod number>string print drop 2 div ] while drop
 

1
2
3
4
5
6
7
8
9
USING: combinators io io.binary io.encodings.binary
io.streams.byte-array kernel math namespaces
sequences strings math.parser ;
 
IN: factorial-example
 
: modulo ( n -- n! )
 dup
 2
 ...

1
2
3
4
5
6
7
8
USING: io kernel math math.parser formatting sequences prettyprint io.streams.byte-array io.streams.sequence ;
IN: template
:sq(x--y)
dup*;
 
readln string>number
(scratchpad)6 sq
   
 ...

1
2
3
4
5
6
7
8
9
 
USING: io kernel math math.parser ;
 
readln string>number
 
dup ( x -- x x )
dup ( x -- x x )
*
3
 ...

1
2
3
4
5
USING: io kernel math math.parser sequences ;
 
   readln string>number
   [ 3 * ] reduce
   number>string print

1
2
3
4
5
6
7
USING: io kernel math math.parser ;
 
readln string>number n =
n
n
+
number>string print

1
2
3
4
5
6
7
USING: formatting kernel math sequences ;
IN: factorial-example
 
readln string>number
readln string>number
swap
"%d %d" printf

1
2
3
4
5
USING: io kernel math math.parser ;
 
readln string>number
42 = [ "1" print ] when
40 = [ "0" print ] when

1
2
3
4
5
6
7
8
9
USING: io kernel math math.parser formatting sequences prettyprint io.streams.byte-array io.streams.sequence ;
 
IN: template
 
: sum-it ( n -- answer )
   dup 0 =                      ! if
   [ ]                          ! zero in stack
   [   1 -                      ! decrease count by one
       readln string>number     ! read next a_i
 ...

1
2
3
4
5
USING: math.parser splitting ;
: a+b ( -- )
    readln " " split1
    [ string>number ] bi@ +
    number>string print ;

1
2
3
4
5
USING: formatting io kernel locals math math.functions math.parser ;
readln string>number
dup
*
number>string print

1
2
3
4
5
6
7
USING: io kernel math math.parser ;
USING: formatting kernel math ;
IN: sq-example
 
 
: plus-two ( x -- y )
    2 + ;

1
2
3
4
USING: io kernel math math.parser ;
 
readln string>number
42 = [ "1" print ] when

1
2
3
4
5
6
7
USING: io kernel math math.parser ;
 
readln string>number
dup 
*
number>string print
 

1
2
3
4
5
6
7
8
9
USING: io kernel math math.parser ;
 
readln string>number
5 
>
[ "1" ]
[ "0" ]
if
print

1
2
3
4
5
USING: io kernel math math.parser sequences ;
 
   readln string>number
   [ drop 3 * ] reduce
   number>string print

1
2
3
4
5
6
7
8
9
USING: io kernel math math.parser ;
 
IN: factorial-example
 
: modulo ( n -- n! )
 dup
 2
 /
 2
 ...

1
2
3
4
5
6
USING: io kernel math math.parser ;
 
readln string>number
 
3 * * - /
number>string print

1
2
3
4
5
6
USING: io kernel math math.parser ;
 
readln string>number
 
[ dup 0 > ] [ dup 2 / dup number>string print ] while drop
 

1
2
3
4
5
6
7
USING: formatting kernel math sequences ;
IN: factorial-example
 
1
2
swap
"%d %d" printf

1
2
3
4
5
USING: io kernel math math.parser ;
 
readln string>number
dup 5 / swap 25 / +
number>string print

1
2
3
4
5
6
7
8
9
USING: io kernel math math.parser ;
 
readln string>number
5 
>
[ "1" ]
[ "0" ]
if
print

1
2
3
4
5
6
7
8
USING: formatting kernel math sequences ;
IN: factorial-example
 
: factorial ( n -- n! )
    iota 1 [ 1 + * ] reduce ;
 
17 iota
[ dup factorial "%d! = %d\n" printf ] each

1
2
3
4
5
6
7
8
9
USING: io kernel math math.parser ;
 
IN: factorial-example
 
: modulo ( n -- n! )
 dup
 2
 /
 2
 ...

1
2
3
4
5
6
7
8
9
USING: formatting io kernel locals math math.functions math.parser sequences ;
IN: B
 
: toBinary ( n -- )
  dup
  0 >
  [ dup dup 2 / 2 * - "%d" printf 2 / toBinary ]
  [ drop ]
  if ;
 ...

1
2
3
4
5
6
USING: io kernel math math.parser ;
 
readln string>number
 
3 * * - /2
number>string print

1
2
3
4
USING: io kernel math math.parser sequences ;
: n
readln string>number
number>string print ;

1
2
3
4
5
6
7
8
9
 
USING: io kernel math math.parser ;
 
readln string>number
 
dup ( x -- x x )
*
3
*
 ...