ðŸŽ‰ Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io ðŸŽ‰

Published at Apr 09 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.

This exercise requires you to process a collection of data. You can simplify your code by using LINQ (Language Integrated Query). For more information, see this page.

To run the tests, run the command `dotnet test`

from within the exercise directory.

Initially, only the first test will be enabled. This is to encourage you to solve the exercise one step at a time.
Once you get the first test passing, remove the `Skip`

property from the next test and work on getting that test passing.
Once none of the tests are skipped and they are all passing, you can submit your solution
using `exercism submit SumOfMultiples.cs`

For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io C# language page.

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

```
// This file was auto-generated based on version 1.5.0 of the canonical data.
using System;
using Xunit;
public class SumOfMultiplesTest
{
[Fact]
public void No_multiples_within_limit()
{
Assert.Equal(0, SumOfMultiples.Sum(new[] { 3, 5 }, 1));
}
[Fact(Skip = "Remove to run test")]
public void One_factor_has_multiples_within_limit()
{
Assert.Equal(3, SumOfMultiples.Sum(new[] { 3, 5 }, 4));
}
[Fact(Skip = "Remove to run test")]
public void More_than_one_multiple_within_limit()
{
Assert.Equal(9, SumOfMultiples.Sum(new[] { 3 }, 7));
}
[Fact(Skip = "Remove to run test")]
public void More_than_one_factor_with_multiples_within_limit()
{
Assert.Equal(23, SumOfMultiples.Sum(new[] { 3, 5 }, 10));
}
[Fact(Skip = "Remove to run test")]
public void Each_multiple_is_only_counted_once()
{
Assert.Equal(2318, SumOfMultiples.Sum(new[] { 3, 5 }, 100));
}
[Fact(Skip = "Remove to run test")]
public void A_much_larger_limit()
{
Assert.Equal(233168, SumOfMultiples.Sum(new[] { 3, 5 }, 1000));
}
[Fact(Skip = "Remove to run test")]
public void Three_factors()
{
Assert.Equal(51, SumOfMultiples.Sum(new[] { 7, 13, 17 }, 20));
}
[Fact(Skip = "Remove to run test")]
public void Factors_not_relatively_prime()
{
Assert.Equal(30, SumOfMultiples.Sum(new[] { 4, 6 }, 15));
}
[Fact(Skip = "Remove to run test")]
public void Some_pairs_of_factors_relatively_prime_and_some_not()
{
Assert.Equal(4419, SumOfMultiples.Sum(new[] { 5, 6, 8 }, 150));
}
[Fact(Skip = "Remove to run test")]
public void One_factor_is_a_multiple_of_another()
{
Assert.Equal(275, SumOfMultiples.Sum(new[] { 5, 25 }, 51));
}
[Fact(Skip = "Remove to run test")]
public void Much_larger_factors()
{
Assert.Equal(2203160, SumOfMultiples.Sum(new[] { 43, 47 }, 10000));
}
[Fact(Skip = "Remove to run test")]
public void All_numbers_are_multiples_of_1()
{
Assert.Equal(4950, SumOfMultiples.Sum(new[] { 1 }, 100));
}
[Fact(Skip = "Remove to run test")]
public void No_factors_means_an_empty_sum()
{
Assert.Equal(0, SumOfMultiples.Sum(Array.Empty<int>(), 10000));
}
[Fact(Skip = "Remove to run test")]
public void The_only_multiple_of_0_is_0()
{
Assert.Equal(0, SumOfMultiples.Sum(new[] { 0 }, 1));
}
[Fact(Skip = "Remove to run test")]
public void The_factor_0_does_not_affect_the_sum_of_multiples_of_other_factors()
{
Assert.Equal(3, SumOfMultiples.Sum(new[] { 3, 0 }, 4));
}
[Fact(Skip = "Remove to run test")]
public void Solutions_using_include_exclude_must_extend_to_cardinality_greater_than_3()
{
Assert.Equal(39614537, SumOfMultiples.Sum(new[] { 2, 3, 5, 7, 11 }, 10000));
}
}
```

```
ï»¿using System;
using System.Linq;
using System.Collections.Generic;
public static class SumOfMultiples
{
public static int Sum(IEnumerable<int> multiples, int max)
{
HashSet<int> numbers = new HashSet<int>();
foreach(int multiple in multiples.Where(x => x != 0))
{
for(int i = 1; i < max; i++)
{
if(i % multiple == 0)
{
numbers.Add(i);
}
}
}
return numbers.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,423 exercises across 52 languages, and insightful discussion with our volunteer team of welcoming mentors.
Exercism is
**100% free forever**.

## Community comments