Problem Statement

The objective is to write a function that finds the sum of all positive multiples of 3 or 5 below n. Show output for n = 1000. This is is the same as Project Euler problem 1. Extra credit: do this efficiently for n = 1e20 or higher.

Let's start with the solution:

include "NSLog.incl"

_n = 1000

void local fn DoIt
  long i, sum = 0
  
  for i = 0 to _n - 1
    if ( i mod 3 == 0 or i mod 5 == 0 )
      sum += i
    end if
  next
  NSLog(@"%ld",sum)
end fn

fn Doit

HandleEvents