1
2
3
4
5
6
7
8
9
import java.util.*;
import java.lang.*;
 
class Main{
        public static void main (String[] args) throws java.lang.Exception{
            System.out.print("Mัy name is Jirawat Boonchana ");
            System.out.print("7/2="+(7%2));
                
        }

1
2
3
4
5
6
7
8
9
import java.util.*;
import java.lang.*;
 
class Main{
        public static void main (String[] args) throws java.lang.Exception{
            System.out.print("My name is Jirawat Boonchana ");
            System.out.print("7/2="+(7/2.0));
                
        }

1
2
3
4
5
6
7
8
9
import java.util.*;
import java.lang.*;
 
class Main{
        public static void main (String[] args) throws java.lang.Exception{
            System.out.print("My name is Jirawat Boonchana ");
            System.out.print("7/2="+(7.0/2));
                
        }

1
2
3
4
5
6
7
8
9
import java.util.*;
import java.lang.*;
 
class Main{
        public static void main (String[] args) throws java.lang.Exception{
            System.out.print("My name is Jirawat Boonchana");
            System.out.print("7/2="+(7/2));
                
        }

1
2
3
4
5
6
7
8
9
import java.util.*;
import java.lang.*;
 
class Main{
        public static void main (String[] args) throws java.lang.Exception{
            System.out.print("My name is Jirawat Boonchana ");
            System.out.print("7/2="+(7/2));
                
        }

1
2
3
4
5
6
7
8
9
import java.util.*;
import java.lang.*;
 
class Main{
        public static void main (String[] args) throws java.lang.Exception{
            System.out.print("My name is Jirawat Boonchana ");
            System.out.print("7+8*2="+(7+8*2));
                
        }

1
2
3
4
5
6
7
8
9
import java.util.*;
import java.lang.*;
 
class Main{
        public static void main (String[] args) throws java.lang.Exception{
            System.out.print("My name is Jirawat Boonchana ");
            System.out.print("7+8*2="+(7+8*2));
                
        }

1
2
3
let rec fib n = fib (n - 1) + fib (n - 2)
 
fib 10

1
2
3
4
5
6
7
8
9
int lim = 0x12345678; int pp = 256;
for (int i = 1; (lim-pp) / ((64 + i) + pp) != 0; i++) {
    if (atan(i - ((i / lim) * lim)) > 1.55) // > ~50
        lim = (lim / 50) * 40;
    int foo = lim; // bar
    for (int j = 0; j < 0x123456; j++)
        foo ^= (j >> 3) | (j << 29); // tidy
    pp &= foo; // in 42-0
    if (lim - ((lim / i) * i) == 0) {
 ...

1
2
3
4
5
6
7
8
9
let getAdditionals positionCount symbols =
    let symbols = Set.empty::(List.map(Set.ofList) symbols)
    let isDiffer symbols =  symbols |> Set.ofList |> Set.count = List.length symbols 
    let rec getNecessaries acc positions symbols = 
        match positions with
        | []   -> acc
        | h::t -> let newsymbols = List.map (fun d -> Set.remove h d) symbols
                  if isDiffer newsymbols then getNecessaries acc t newsymbols 
                  else                        getNecessaries (h::acc) t symbols
 ...

1
2
3
4
5
6
7
8
(define (margreteborg row col)
(cond ((< row col) #f)
((or (= 0 col) (= row col)) 1)
(else (+ (margreteborg (- row 1) col) (margreteborg (- row 1) (- col 1))))))
 
N (margreteborg 2 2)+(margreteborg 3 2)+(margreteborg 11 2)
(margreteborg 6 3)+(margreteborg 3 2)
.(margreteborg 12 5)- (margreteborg 5 3)
 ...

1
2
3
4
5
6
7
8
open System
open LanguagePrimitives
 
module RoundedCalculation =
  [<Measure>]
  type rounded
  type NotRounded = float
  type Rounded = float<rounded>
 ...

1
2
for i in 1..20 do
    printfn "%A" <| System.Random 10000

1
2
for i in 1..20 do
    printfn "%A" (System.Random 10000)

1
2
for i in 1..20 do
    printfn "%A" (System.Math.Random 10000)

1
2
for i in 1..20 do
    System.Console.WriteLine (System.Math.Random 10000)

1
2
for i in 1..20 do
        System.Console.WriteLine (System.Math.Random 10000)

1
System.Console.WriteLine seq{for i in 1..20 -> Math.Random 10000}

1
2
3
4
5
Observable.Range(0, 10001)
|> Observable.map (fun x -> int(x))
|> Observable.filter  (fun x -> (x % 100 = 0))
|> Observable.map (fun x -> x * x)
|> Observable.add (printfn "%d")

1
printf "%A" [|2..2..10|]

1
2
3
4
5
6
7
8
let data = [ 1; 2; 3; 4; 5; 3; 1 ]
let test f =
    for v,evaled in List.zip data (f data) do
        printfn "%d -> %b" v evaled
 
let eval = List.mapi(fun i v -> if i = 0 then v >= 3 else v < 3)
 
test eval

1
2
3
4
5
6
7
8
9
open System
 
let ImageBase        = 0x400000
let SectionAlignment = 4096
let FileAlignment    = 512
 
let Align v a = ((v + a - 1) / a) * a
 
type Section = { Name:string; Size:int }
 ...

1
0><|=02|), )-(4|_||°7574|)7 |)32 3|\|61!5()-(3|\| 624|=5()-(4|=7 0><|=02|)5)-(!23 I33)-(32I33267 3!|\|!63 31!73|_||\|!\/325!7°A°73|\|. |_||\||) |)|_| 63)-(°O°257 4|_|()-( z|_| 3!|\|32 31!73 - |)3|\||\| |)|_| |<4|\||\|57 |)!353|\| 73><7 1353|\| |)32 !|\| 13375|°34|< 635()-(2!3I33|\| !57. \/\/45 ? |)|_| )-(457 \/02)-(32 |\|0()-( |\|!3 \/\/45 |)4\/0|\| 63)-(°O°27 ? 72°O°573 |)!()-( 35 63)-(7 \/!313|\| 50. 3|\|7\/\/3|)32 I3!57 |)|_| °U°I332 |)3|\| )-(!|\|7 )-(!32 )-(32 63|<0/\/\/\/\3|\| 0|)32 |)|_| \/\/4257 5()-(0|\| !/\/\/\/\32 3!|\| \/\/!553|\||)32. 3!|\|3213!, _|37z7 63)-(7 35 4I3 !|\| |)!3 |\|47|_|2. |)3|\| (4()-(3 5|_|()-(3|\|. |_||\||) |)3|\| |=!|\||)357 |)|_| )-(!32: |\|02|) \/!32 4()-(7 624|) |\||_|11 4()-(7 |°|_||\||<7 \/!32 5!3I33|\| |=°U°|\||= 057 |\||_|11 3!|\|5 53()-(5 624|) 3!|\|5 |=°U°|\||= |°|_||\||<7 |\||_|11 |\|3|_||\| |=°U°|\||= \/!31 5|°4ß |_||\||) 32|=016. 

1
2
3
4
5
6
7
8
9
let MainEval instr =
    let (toflt : string -> float) = System.Convert.ToDouble
    let rec EvalOfStack (str : list<string>) (stack : list<float>) =
        match str with
        | "+" :: xs -> EvalOfStack xs ((stack.Tail.Head + stack.Head) :: stack.Tail.Tail)
        | "-" :: xs -> EvalOfStack xs ((stack.Tail.Head - stack.Head) :: stack.Tail.Tail)
        | "*" :: xs -> EvalOfStack xs ((stack.Tail.Head * stack.Head) :: stack.Tail.Tail)
        | "/" :: xs -> EvalOfStack xs ((stack.Tail.Head / stack.Head) :: stack.Tail.Tail)
        |  x  :: xs -> EvalOfStack xs ((toflt x)::stack)
 ...

1
2
3
4
5
6
7
8
9
let MainEval instr =
    let (toflt : string -> float) = System.Convert.ToDouble
    let rec EvalOfStack (str : list<string>) (stack : list<float>) =
        match str with
        | "+" :: xs -> EvalOfStack xs ((stack.Tail.Head + stack.Head) :: stack.Tail.Tail)
        | "-" :: xs -> EvalOfStack xs ((stack.Tail.Head - stack.Head) :: stack.Tail.Tail)
        | "*" :: xs -> EvalOfStack xs ((stack.Tail.Head * stack.Head) :: stack.Tail.Tail)
        | "/" :: xs -> EvalOfStack xs ((stack.Tail.Head / stack.Head) :: stack.Tail.Tail)
        |  x  :: xs -> EvalOfStack xs ((toflt x)::stack)
 ...

1
2
3
4
5
open System
 
let findModM arr n = seq{ for i in arr do if i%n=0 then yield i}
System.Console.Write(findModM [1..50] 5 |> Seq.head)
 

1
2
3
4
5
open System
 
let findModM arr n = seq{ for i in arr do if i%n=0 then yield i}
System.Console.Write(Seq.head findModM [1..50] 5)
 

1
2
3
4
5
6
7
open System
 
let findModM arr n = 
  let t= seq{ for i in arr do if i%n=0 then yield i}
  Seq.head t
System.Console.Write(findModM [1..50] 5)
 

1
2
3
4
5
6
7
open System
 
let findModM arr n = 
  let t= seq{ for i in arr do if i%n=0 then yield i}
  List.head t
System.Console.Write(findModM [1..50] 5)
 

1
2
3
4
5
6
7
open System
 
let findModM arr n = 
  let t= seq{ for i in arr do if i%n=0 then yield i}
  t.Head
System.Console.Write(findModM [1..50] 5)