Project Euler Problem 21

problem21.scala

//http://odz.sakura.ne.jp/projecteuler/index.php?cmd=read&page=Problem%2021
//K.A

object problem21 {
    def calcAmicable(acl : Int, xs : List[Int]) : Int = xs match {
        case Nil => acl
        case y :: ys => {
            val divisora = (Range(1,y + 1).toList.filter(y % _ == 0).sum - y)
            calcAmicable(acl + (if (Range(1, divisora + 1).toList.filter(divisora % _ == 0).sum - divisora == y && divisora != y) divisora else 0), ys)
        }
    }
    def problem21(is : Int) : Int = {
        calcAmicable(0, Range(1,is).toList)
    }
    def main(args : Array[String]) {
        val problem21k = problem21 _
        println(problem21k(10000))
    }
}