factor: trim using lists

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

diff --git a/extra/project-euler/072/072.factor b/extra/project-euler/072/072.factor
index de6312f2a7968b4371d7aea127946c7103f615d1..efb1b934475b5f8a9af2331227575c683b7ce972 100644 (file)
--- a/extra/project-euler/072/072.factor
+++ b/extra/project-euler/072/072.factor
@@ -1,7 +1,6 @@
 ! Copyright (c) 2009 Guillaume Nargeot.
 ! See http://factorcode.org/license.txt for BSD license.
-USING: kernel math math.primes.factors math.ranges
-project-euler.common sequences ;
+USING: math.primes.factors project-euler.common ranges sequences ;
 IN: project-euler.072
 
 ! http://projecteuler.net/index.php?section=problems&id=072
@@ -30,7 +29,7 @@ IN: project-euler.072
 ! The answer can be found by adding totient(n) for 2 ≤ n ≤ 1e6
 
 : euler072 ( -- answer )
-    2 1000000 [a,b] [ totient ] [ + ] map-reduce ;
+    2 1000000 [a..b] [ totient ] map-sum ;
 
 ! [ euler072 ] 100 ave-time
 ! 5274 ms ave run time - 102.7 SD (100 trials)