Another Implementation of the Solution to Project Euler 12

euler12.wren

class Euler12 {

	construct new(cutoff) {
			_cutoff = cutoff
	}

	find_divisors(n) {
			var nod = 0
			var sqrt = n.sqrt.floor
			
			for (i in 1..sqrt) {
					if (n % i == 0) {
							nod = nod + 2
					}
			}
			if ((sqrt * sqrt) == n) {
					nod = nod - 1
			}

			return nod
	}

	find() {
		var n = 0
		var i = 1
		while (find_divisors(n) < _cutoff) {
				n = n + i
				i = i + 1
		}
		return n
	}
}

System.print(Euler12.new(500).find())