factor: trim using lists

[factor.git] / extra / project-euler / 041 / 041.factor

diff --git a/extra/project-euler/041/041.factor b/extra/project-euler/041/041.factor
index d6d428a11f5a191c1440d1e70ad90e51771bebca..6247036def9082335cf7b89fffc0dcd01492e0d7 100644 (file)
--- a/extra/project-euler/041/041.factor
+++ b/extra/project-euler/041/041.factor
@@ -1,6 +1,6 @@
 ! Copyright (c) 2008 Aaron Schaefer.
 ! See http://factorcode.org/license.txt for BSD license.
-USING: kernel math.combinatorics math.parser math.primes sequences ;
+USING: kernel math.combinatorics math.primes sequences project-euler.common ;
 IN: project-euler.041
 
 ! http://projecteuler.net/index.php?section=problems&id=41
@@ -32,9 +32,9 @@ IN: project-euler.041
 
 : euler041 ( -- answer )
     { 7 6 5 4 3 2 1 } all-permutations
-    [ 10 digits>integer ] map [ prime? ] find nip ;
+    [ digits>number ] map [ prime? ] find nip ;
 
 ! [ euler041 ] 100 ave-time
 ! 64 ms ave run time - 4.22 SD (100 trials)
 
-MAIN: euler041
+SOLUTION: euler041