Amicable pairs: Difference between revisions

Content deleted Content added
imported>Arakov
imported>Arakov
Line 2,243: Line 2,243:
List<int> divsums := Range.new(0, max + 1).selectBy::(int i => ProperDivisors(i).summarize(0));
List<int> divsums := Range.new(0, max + 1).selectBy::(int i => ProperDivisors(i).summarize(0));
for (int i := 1, i < divsums.Length, i += 1)
for (int i := 1; i < divsums.Length; i += 1)
{
{
int sum := divsums[i];
int sum := divsums[i];
Line 2,258: Line 2,258:
{
{
auto e := new AmicablePairs(Limit);
auto e := new AmicablePairs(Limit);
for(auto pair := e.next(), pair != nil)
for(auto pair := e.next(); pair != nil)
{
{
console.printLine(pair.Item1, " ", pair.Item2)
console.printLine(pair.Item1, " ", pair.Item2)