Cody

Problem 44696. Sum of unique multiples of 3 and 5

Solution 3909533

Submitted on 29 Nov 2020 by Lee Chih Jung
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
n = 15; sm_correct = 60; assert(isequal(sum3and5muls(n),sm_correct))

arr = 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

2   Pass
n = 18; sm_correct = 78; assert(isequal(sum3and5muls(n),sm_correct))

arr = 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

3   Pass
n = (2^2)-1; sm_correct = 3; assert(isequal(sum3and5muls(n),sm_correct))

arr = 1 2 3

4   Pass
n = randi(25); sm_correct = sum(3:3:n)+sum(5:5:n)-sum(15:15:n); assert(isequal(sum3and5muls(n),sm_correct))

arr = 1 2 3 4 5 6