diff options
| author | 冯昶 <fengchang@novel-supertv.com> | 2024-03-04 16:39:31 +0800 |
|---|---|---|
| committer | 冯昶 <fengchang@novel-supertv.com> | 2024-03-04 16:39:31 +0800 |
| commit | 8edd4508d3af07ed272eec6ceeca1a9789b5e68a (patch) | |
| tree | 2db742aea75a7a3005575c04a7e44da6d5c88a1f /challenge-016/archargelod/nim | |
| parent | d64db60d9dcf17d59060a03f5b1fbc5e82fc1953 (diff) | |
| parent | ad381c1123e47114d3d98f1749f9f354eebafcdd (diff) | |
| download | perlweeklychallenge-club-8edd4508d3af07ed272eec6ceeca1a9789b5e68a.tar.gz perlweeklychallenge-club-8edd4508d3af07ed272eec6ceeca1a9789b5e68a.tar.bz2 perlweeklychallenge-club-8edd4508d3af07ed272eec6ceeca1a9789b5e68a.zip | |
Merge remote-tracking branch 'upstream/master'
Diffstat (limited to 'challenge-016/archargelod/nim')
| -rwxr-xr-x | challenge-016/archargelod/nim/ch_1.nim | 21 | ||||
| -rwxr-xr-x | challenge-016/archargelod/nim/ch_2.nim | 49 |
2 files changed, 70 insertions, 0 deletions
diff --git a/challenge-016/archargelod/nim/ch_1.nim b/challenge-016/archargelod/nim/ch_1.nim new file mode 100755 index 0000000000..a5cc61c3f6 --- /dev/null +++ b/challenge-016/archargelod/nim/ch_1.nim @@ -0,0 +1,21 @@ +#!/usr/bin/env -S nim r -d:release --verbosity:0 --hints:off + +proc percent(value: float, pct: 0..100): float = + value / 100'f * pct.float + +proc largestPieceOfPieIndex(): int = + var amount = 1'f + var largest = 0'f + + for i in 1..100: + let piece = amount.percent(i) + if piece <= largest: + return i - 1 + largest = piece + amount -= piece + +when isMainModule: + import std/strformat + + let index = largestPieceOfPieIndex() + echo &"{index}th guest gets the largest piece of pie." diff --git a/challenge-016/archargelod/nim/ch_2.nim b/challenge-016/archargelod/nim/ch_2.nim new file mode 100755 index 0000000000..52f8e2202b --- /dev/null +++ b/challenge-016/archargelod/nim/ch_2.nim @@ -0,0 +1,49 @@ +#!/usr/bin/env -S nim r -d:release --verbosity:0 --hints:off +import std/strutils +import pkg/nimcrypto/sha2 ## `$ nimble install nimcrypto` + +const + DecodedLength = 25 + ChecksumLength = 4 + +func base58Decode(input: string): array[DecodedLength, byte] = + ## Taken from https://rosettacode.org/wiki/Bitcoin/address_validation#Nim + ## Tried to implement this myself, but failed to find easy to understand algorithm. + const Base = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz" + + for c in input: + var n = Base.find(c) + if n < 0: + raise newException(ValueError, "invalid character: " & c) + + for i in countdown(result.high, 0): + n += Base.len * result[i].int + result[i] = byte(n and 255) + n = n div 256 + + if n != 0: + raise newException(ValueError, "decoded address is too long") + +func validBtcChecksum(address: openarray[byte]): bool = + let digest1 = sha256.digest(address.toOpenArray(0, address.high - ChecksumLength)).data + let digest2 = sha256.digest(digest1).data + digest2[0 ..< ChecksumLength] == address[^ChecksumLength ..^ 1] + +func isValidBTCAddress(address: string): bool = + address.len >= 26 and address[0] in {'1', '3'} and + validBtcChecksum(address.base58Decode()) + +when isMainModule: + import std/unittest + + const + Valid = ["1BvBMSEYstWetqTFn5Au4m4GFg7xJaNVN2", "3J98t1WpEZ73CNmQviecrnyiWrnqRhWNLy"] + Invalid = ["3J98t1WpEZ73CNmQviecrnyiWrDEADBEEF"] + + suite "Validate bitcoin address": + test "Example 1": + check isValidBTCAddress Valid[0] + test "Example 2": + check isValidBTCAddress Valid[1] + test "Invalid address": + check not isValidBtcAddress Invalid[0] |
