Published at Oct 20 2019
·
0 comments

Instructions

Test suite

Solution

Given a number, find the sum of all the unique multiples of particular numbers up to but not including that number.

If we list all the natural numbers below 20 that are multiples of 3 or 5, we get 3, 5, 6, 9, 10, 12, 15, and 18.

The sum of these multiples is 78.

Refer to the exercism help page for Rust installation and learning resources.

Execute the tests with:

```
$ cargo test
```

All but the first test have been ignored. After you get the first test to
pass, open the tests source file which is located in the `tests`

directory
and remove the `#[ignore]`

flag from the next test and get the tests to pass
again. Each separate test is a function with `#[test]`

flag above it.
Continue, until you pass every test.

If you wish to run all ignored tests without editing the tests source file, use:

```
$ cargo test -- --ignored
```

To run a specific test, for example `some_test`

, you can use:

```
$ cargo test some_test
```

If the specific test is ignored use:

```
$ cargo test some_test -- --ignored
```

To learn more about Rust tests refer to the online test documentation

Make sure to read the Modules chapter if you haven't already, it will help you with organizing your files.

After you have solved the exercise, please consider using the additional utilities, described in the installation guide, to further refine your final solution.

To format your solution, inside the solution directory use

```
cargo fmt
```

To see, if your solution contains some common ineffective use cases, inside the solution directory use

```
cargo clippy --all-targets
```

Generally you should submit all files in which you implemented your solution (`src/lib.rs`

in most cases). If you are using any external crates, please consider submitting the `Cargo.toml`

file. This will make the review process faster and clearer.

The exercism/rust repository on GitHub is the home for all of the Rust exercises. If you have feedback about an exercise, or want to help implement new exercises, head over there and create an issue. Members of the rust track team are happy to help!

If you want to know more about Exercism, take a look at the contribution guide.

A variation on Problem 1 at Project Euler http://projecteuler.net/problem=1

It's possible to submit an incomplete solution so you can see how others have completed the exercise.

```
use sum_of_multiples::*;
#[test]
fn no_multiples_within_limit() {
assert_eq!(0, sum_of_multiples(1, &[3, 5]))
}
#[test]
#[ignore]
fn one_factor_has_multiples_within_limit() {
assert_eq!(3, sum_of_multiples(4, &[3, 5]))
}
#[test]
#[ignore]
fn more_than_one_multiple_within_limit() {
assert_eq!(9, sum_of_multiples(7, &[3]))
}
#[test]
#[ignore]
fn more_than_one_factor_with_multiples_within_limit() {
assert_eq!(23, sum_of_multiples(10, &[3, 5]))
}
#[test]
#[ignore]
fn each_multiple_is_only_counted_once() {
assert_eq!(2318, sum_of_multiples(100, &[3, 5]))
}
#[test]
#[ignore]
fn a_much_larger_limit() {
assert_eq!(233_168, sum_of_multiples(1000, &[3, 5]))
}
#[test]
#[ignore]
fn three_factors() {
assert_eq!(51, sum_of_multiples(20, &[7, 13, 17]))
}
#[test]
#[ignore]
fn factors_not_relatively_prime() {
assert_eq!(30, sum_of_multiples(15, &[4, 6]))
}
#[test]
#[ignore]
fn some_pairs_of_factors_relatively_prime_and_some_not() {
assert_eq!(4419, sum_of_multiples(150, &[5, 6, 8]))
}
#[test]
#[ignore]
fn one_factor_is_a_multiple_of_another() {
assert_eq!(275, sum_of_multiples(51, &[5, 25]))
}
#[test]
#[ignore]
fn much_larger_factors() {
assert_eq!(2_203_160, sum_of_multiples(10_000, &[43, 47]))
}
#[test]
#[ignore]
fn all_numbers_are_multiples_of_1() {
assert_eq!(4950, sum_of_multiples(100, &[1]))
}
#[test]
#[ignore]
fn no_factors_means_an_empty_sum() {
assert_eq!(0, sum_of_multiples(10_000, &[]))
}
#[test]
#[ignore]
fn the_only_multiple_of_0_is_0() {
assert_eq!(0, sum_of_multiples(1, &[0]))
}
#[test]
#[ignore]
fn the_factor_0_does_not_affect_the_sum_of_multiples_of_other_factors() {
assert_eq!(3, sum_of_multiples(4, &[3, 0]))
}
#[test]
#[ignore]
fn solutions_using_include_exclude_must_extend_to_cardinality_greater_than_3() {
assert_eq!(39_614_537, sum_of_multiples(10_000, &[2, 3, 5, 7, 11]))
}
```

```
pub fn sum_of_multiples(limit: u32, factors: &[u32]) -> u32 {
(1..limit).filter(|x| factors.into_iter().any(|y| x.checked_rem(*y)==Some(0) )).sum()
}
```

A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

- What compromises have been made?
- Are there new concepts here that you could read more about to improve your understanding?

Level up your programming skills with 3,092 exercises across 52 languages, and insightful discussion with our volunteer team of welcoming mentors.
Exercism is
**100% free forever**.

## Community comments