blob: 0086ac82c863cbf9a806c98794aa868f7cfff7b8 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
namespace Common
module Util =
open System.Globalization
open FParsec
open FSharpPlus
let parse parser input =
match run parser input with
| Success (result, _, _) -> result
| _ -> failwith "Invalid input format!"
let countDistinct xs = xs |> Set |> Set.count
let countWhere pred = Seq.filter pred >> Seq.length
let charToInt = CharUnicodeInfo.GetDigitValue
let cutInHalf xs =
let half = Seq.length xs / 2
[ Seq.take half xs; Seq.skip half xs ]
let splitStringToTuple sep string =
match Seq.toList <| String.split [ sep ] string with
| [ x; y ] -> x, y
| _ -> failwith "Invalid string format!"
let matrixToString matrix =
matrix
|> Seq.map (Seq.map string >> String.concat "")
|> String.concat "\n"
let mapEachToSeq mapping matrix =
seq {
for row in 0 .. Array2D.length1 matrix - 1 do
for col in 0 .. Array2D.length2 matrix - 1 -> mapping matrix (Vec2(col, row)) matrix[row, col]
}
let mAt matrix (Vec2 (col, row)) = Array2D.get matrix row col
let composition n f = List.replicate n f |> List.reduce (>>)
let rec insertSorted x =
function
| h :: t -> min h x :: (insertSorted (max h x) t)
| [] -> [ x ]
let topN n xs =
Seq.fold
(fun acc x ->
if List.length acc < n then
insertSorted x acc
elif List.head acc < x then
insertSorted x <| List.tail acc
else
acc)
List.empty
xs
|
