1
printf "Hello World!\n"

1
2
3
4
5
6
7
open System
 
let mutable num = System.Console.ReadLine()
while not(System.String.Equals(num, "42", System.StringComparison.CurrentCultureIgnoreCase)) do
    System.Console.Write(num)
    num <- System.Console.ReadLine()
    System.Console.WriteLine()

1
2
3
4
5
6
open System
open System.Linq
let _ = 
    Array.foreach
        (Array.transform ("1 3 2 0".Split [|' '|]) (fun st -> int.Parse st)) 
        (fun n -> Console.WriteLine n);

1
2
3
4
5
6
open System
open Microsoft.FSharp.Collections
let _ = 
    Array.iter
        (Array.transform ("1 3 2 0".Split [|' '|]) (fun st -> int.Parse st)) 
        (fun n -> Console.WriteLine n);

1
2
3
4
5
6
open System
open Microsoft.FSharp.Collections
let _ = 
    Array.foreach 
        (Array.transform ("1 3 2 0".Split [|' '|]) (fun st -> int.Parse st)) 
        (fun n -> Console.WriteLine n);

1
2
3
4
5
6
open System
open Microsoft.FSharp.Collections.Array
let _ = 
    Array.foreach 
        (Array.transform ("1 3 2 0".Split [|' '|]) (fun st -> int.Parse st)) 
        (fun n -> Console.WriteLine n);

1
2
3
4
5
6
open System
open Microsoft.FSharp.Collections
let _ = 
    Array.foreach 
        (Array.transform ("1 3 2 0".Split [|' '|]) (fun st -> int.Parse st)) 
        (fun n -> Console.WriteLine n);

1
2
3
4
5
open System
let _ = 
    Array.foreach 
        (Array.transform ("1 3 2 0".Split [|' '|]) (fun st -> int.Parse st)) 
        (fun n -> Console.WriteLine n);

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> 
                               let lesser  = List.filter ((>=) h) t
                               let greater = List.filter ((< ) h) t
                               qsort lesser @ [h] @ qsort greater 
[<EntryPoint>]
let main args = 
        System.Console.WriteLine(qsort [99..-1..1]) 
        0

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> 
                               let lesser = (List.filter ((>=) h) t)
                               let greater = (List.filter ((<) h) t)
                               qsort lesser @ [h] @ qsort greater 
[<EntryPoint>]
let main args = 
        System.Console.WriteLine(qsort [99..-1..1]) 
        0

1
2
3
4
5
6
7
8
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) h) t)
                                   @ [h] @
                                   qsort (List.filter ((<) h) t)
 
let main args = 
        System.Console.WriteLine(qsort [99..-1..1]) 
        0

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) h) t)
                                   @ [h] @
                                   qsort (List.filter ((<) h) t)
 
 
[<EntryPoint>]
let main args = 
        System.Console.WriteLine(qsort [99..-1..1]) 

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) h) t)
                                   @ [h] @
                                   qsort (List.filter ((<) h) t)
 
 
[<EntryPoint>]
let main args = 
        let sample = "99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0".Split(',')|> Seq.iter(printf "%s;")
 ...

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) h) t)
                                   @ [h] @
                                   qsort (List.filter ((<) h) t)
 
 
[<EntryPoint>]
let main args = 
        let sample = "99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0".Split(',')|> Seq.iter(printf "%d;")
 ...

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) h) t)
                                   @ [h] @
                                   qsort (List.filter ((<) h) t)
 
 
[<EntryPoint>]
let main args = 
        let sample = "99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0".Split(',').iter(printf "%d;")
 ...

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) h) t)
                                   @ [h] @
                                   qsort (List.filter ((<) h) t)
 
 
[<EntryPoint>]
let main args = 
        let sample = "99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0".Split(',').iter(printf "%d;"
 ...

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) h) t)
                                   @ [h] @
                                   qsort (List.filter ((<) h) t)
 
 
[<EntryPoint>]
let main args = 
        let sample = let r = new System.Random() 
 ...

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) h) t)
                                   @ [h] @
                                   qsort (List.filter ((<) h) t)
 
let r = new System.Random()
[<EntryPoint>]
let main args = 
        let sample = List.init 300 (fun _-> r.Next(System.Int32.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) h) t)
                                   @ [h] @
                                   qsort (List.filter ((<) h) t)
 
let r = new System.Random()
[<EntryPoint>]
let main() = 
        let sample = List.init 300 (fun _-> r.Next(System.Int32.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort (List.filter ((>=) t))
                                   @ [h] @
                                   qsort (List.filter ((<) t))
 
let r = new System.Random()
[<EntryPoint>]
let main() = 
        let sample = List.init 300 (fun _-> r.Next(System.Int32.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort [for e in t do if (e <= h) then yield e]
                                   @ [h] @
                                   qsort [for e in t do if (e > h) then yield e]
 
let r = new System.Random()
 
let main() = 
        let sample = List.init 300 (fun _-> r.Next(System.Int32.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort [for e in h do if (e <= h) then yield e]
                                   @ [h] @
                                   qsort [for e in h do if (e > h) then yield e]
 
let r = new System.Random()
 
let main() = 
        let sample = List.init 300 (fun _-> r.Next(System.Int32.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort [for e in h do if (e <= h) then yield e]
                                   @ [h] @
                                   qsort [for e in h do if (e > h) then yield e]
 
let r = new System.Random()
 
let main() = 
        let sample = List.init 300 (fun _-> r.Next(Int32.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort [for e in h do if (e <= h) then yield e]
                                   @ [h] @
                                   qsort [for e in h do if (e > h) then yield e]
 
let r = new System.Random()
 
let main() = 
        let sample = List.init 300 (fun _-> r.Next(int.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort [for e in h do if (e <= h) then yield e]
                                   @ [h] @
                                   qsort [for e in h do if (e > h) then yield e]
 
let r = new System.Randon()
 
let main() = 
        let sample = List.init 300 (fun _-> r.Next(int.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort [for e in h do if (e <= h) then yield e] 
                                   @ [h] @
                                   qsort [for e in h do if (e > h) then yield e] 
 
let r = new System.Randon()
 
let main() = 
        let sample = List.init 300 (fun _-> r.Next(int.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort [for e in h do if (e <= h) then yield e] 
                                   @ [h] @
                                   qsort [for e in h do if (e > h) then yield e] 
 
let r = new System.Randon()
 
let main() = 
        let sample = List.init 300 (fun _-> r.Next(int.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort [for e in h do if (e <= h) yield e] 
                                   @ [h] @
                                   qsort [for e in h do  if (e > h) yield e] 
 
let r = new System.Randon()
 
let main() = 
        let sample = List.init 300 (fun _-> r.Next(int.MaxValue))

1
2
3
4
5
6
7
8
9
let rec qsort = function | []   -> []
                         | h::t -> qsort [for e in h -> if (e <= h) yield e] 
                                   @ [h] @
                                   qsort [for e in h -> if (e > h) yield e] 
 
let r = new System.Randon()
 
let main() = 
        let sample = List.init 300 (fun _-> r.Next(int.MaxValue))

1
2
3
4
5
6
7
8
9
#include<stdio.h>
#define pi 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505823
 
double myPow(double x, int n);
double myfact(int n); 
double mySin(double x);
 
int main()
{
 ...