aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

September 2017 Update

Browse source
This commit is contained in:
Ingy döt Net 2017-09-23 10:01:46 +02:00
parent bba7bfd280
commit ba8067c3b7
14570 changed files with 153136 additions and 63871 deletions
Download patch file Download diff file Expand all files Collapse all files

10
Task/Truncatable-primes/Nim/truncatable-primes.nim
View file

@ -1,6 +1,6 @@
import sets, strutils, algorithm
proc primes(n): seq[int64] =
proc primes(n: int64): seq[int64] =
result = @[]
var multiples = initSet[int64]()
for i in 2..n:
@ -9,7 +9,7 @@ proc primes(n): seq[int64] =
for j in countup(i*i, n, i.int):
multiples.incl j
proc truncatablePrime(n): tuple[left: int64, right: int64] =
proc truncatablePrime(n: int64): tuple[left: int64, right: int64] =
var
primelist: seq[string] = @[]
for x in primes(n):
@ -18,14 +18,14 @@ proc truncatablePrime(n): tuple[left: int64, right: int64] =
var primeset = toSet primelist
for n in primelist:
var alltruncs = initSet[string]()
for i in 0..n.len:
alltruncs.incl n[1..n.high]
for i in 0..n.len-1:
alltruncs.incl n[i..n.high]
if alltruncs <= primeset:
result.left = parseInt(n)
break
for n in primelist:
var alltruncs = initSet[string]()
for i in 0..n.len:
for i in 0..n.len-1:
alltruncs.incl n[0..i]
if alltruncs <= primeset:
result.right = parseInt(n)