Sha256: 3aa890d4f5f953a66b8dbad1f789efdc6ca60bc93e6f6ab4d5e923d0e00d456f

Contents?: true

Size: 1.96 KB

Versions: 68

Compression:

Stored size: 1.96 KB

Contents

# Sum Of Multiples

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.

## Getting Started

Make sure you have read [the C++ page](http://exercism.io/languages/cpp) on
exercism.io.  This covers the basic information on setting up the development
environment expected by the exercises.

## Passing the Tests

Get the first test compiling, linking and passing by following the [three
rules of test-driven development](http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd).
Create just enough structure by declaring namespaces, functions, classes,
etc., to satisfy any compiler errors and get the test to fail.  Then write
just enough code to get the test to pass.  Once you've done that,
uncomment the next test by moving the following line past the next test.

```C++
#if defined(EXERCISM_RUN_ALL_TESTS)
```

This may result in compile errors as new constructs may be invoked that
you haven't yet declared or defined.  Again, fix the compile errors minimally
to get a failing test, then change the code minimally to pass the test,
refactor your implementation for readability and expressiveness and then
go on to the next test.

Try to use standard C++11 facilities in preference to writing your own
low-level algorithms or facilities by hand.  [CppReference](http://en.cppreference.com/)
is a wiki reference to the C++ language and standard library.  If you
are new to C++, but have programmed in C, beware of
[C traps and pitfalls](http://www.slideshare.net/LegalizeAdulthood/c-traps-and-pitfalls-for-c-programmers).

## Source

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

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

Version data entries

68 entries across 68 versions & 1 rubygems

Version Path
trackler-2.2.1.180 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.179 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.178 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.177 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.176 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.175 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.174 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.173 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.172 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.171 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.170 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.169 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.167 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.166 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.165 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.164 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.163 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.162 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.161 tracks/cpp/exercises/sum-of-multiples/README.md
trackler-2.2.1.160 tracks/cpp/exercises/sum-of-multiples/README.md