Anonymous user
Amicable pairs: Difference between revisions
m
→Alternative variant using yield enumerator
imported>Arakov |
imported>Arakov |
||
Line 2,227:
{
Enumerator<int> function(int number)
= Range.new(1, number / 2).filterBy::(int n => number.mod
}
Line 2,241:
yieldable Tuple<int, int> next()
{
List<int> divsums := Range.new(0, max + 1).selectBy::(int i => ProperDivisors(i).summarize(0));
for (int i := 1, i < divsums.Length, i += 1)
| |||