steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

project-euler.*: uses for arg-max and arg-min

factor-shell
Björn Lindqvist 2018-02-08 19:43:44 +01:00
parent 603354a02e
commit 7b2c2a93f5
4 changed files with 14 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
extra/project-euler/039/039.factor
View File

@ -1,7 +1,7 @@
! Copyright (c) 2008 Aaron Schaefer.
! See http://factorcode.org/license.txt for BSD license.
USING: arrays kernel math math.ranges
namespaces project-euler.common sequences ;
USING: arrays kernel math math.ranges namespaces project-euler.common
sequences sequences.extras ;
IN: project-euler.039
! http://projecteuler.net/index.php?section=problems&id=39
@ -56,7 +56,7 @@ PRIVATE>
: euler039 ( -- answer )
[
1000 count-perimeters p-count get [ supremum ] keep index
1000 count-perimeters p-count get arg-max
] with-scope ;
! [ euler039 ] 100 ave-time

6
extra/project-euler/069/069.factor
View File

@ -1,7 +1,7 @@
! Copyright (c) 2009 Aaron Schaefer.
! See http://factorcode.org/license.txt for BSD license.
USING: combinators fry kernel math math.primes math.primes.factors math.ranges
project-euler.common sequences ;
USING: combinators fry kernel math math.primes math.primes.factors
math.ranges project-euler.common sequences sequences.extras ;
IN: project-euler.069
! http://projecteuler.net/index.php?section=problems&id=69
@ -47,7 +47,7 @@ PRIVATE>
: euler069 ( -- answer )
2 1000000 [a,b] [ totient-ratio ] map
[ supremum ] keep index 2 + ;
arg-max 2 + ;
! [ euler069 ] 10 ave-time
! 25210 ms ave run time - 115.37 SD (10 trials)

7
extra/project-euler/070/070.factor
View File

@ -1,8 +1,9 @@
! Copyright (c) 2010 Aaron Schaefer. All rights reserved.
! The contents of this file are licensed under the Simplified BSD License
! A copy of the license is available at http://factorcode.org/license.txt
USING: arrays assocs combinators.short-circuit kernel math math.combinatorics
math.functions math.primes math.ranges project-euler.common sequences ;
USING: arrays combinators.short-circuit kernel math math.combinatorics
math.functions math.primes project-euler.common sequences
sequences.extras ;
FROM: project-euler.common => permutations? ;
IN: project-euler.070
@ -54,7 +55,7 @@ IN: project-euler.070
first2 { [ drop 7 10^ < ] [ permutations? ] } 2&& ;
: minimum-ratio ( seq -- n )
[ [ first2 / ] map [ infimum ] keep index ] keep nth first ;
[ [ first2 / ] map arg-min ] keep nth first ;
PRIVATE>

7
extra/project-euler/099/099.factor
View File

@ -1,7 +1,8 @@
! Copyright (c) 2008 Aaron Schaefer.
! See http://factorcode.org/license.txt for BSD license.
USING: io.encodings.ascii io.files kernel math math.functions math.parser
math.vectors sequences splitting project-euler.common ;
USING: io.encodings.ascii io.files kernel math math.functions
math.parser math.vectors project-euler.common sequences
sequences.extras splitting ;
IN: project-euler.099
! http://projecteuler.net/index.php?section=problems&id=99
@ -39,7 +40,7 @@ IN: project-euler.099
flip first2 swap [ log ] map v* ;
: solve ( seq -- index )
simplify [ supremum ] keep index 1 + ;
simplify arg-max 1 + ;
PRIVATE>