.. | ||
.exercism | ||
src | ||
tests | ||
.gitignore | ||
Cargo.toml | ||
HELP.md | ||
README.md |
Sum of Multiples
Welcome to Sum of Multiples on Exercism's Rust Track.
If you need help running the tests or submitting your code, check out HELP.md
.
Instructions
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.
Source
Created by
- @IanWhitney
Contributed to by
- @coriolinus
- @cwhakes
- @eddyp
- @efx
- @ErikSchierboom
- @GoneUp
- @hekrause
- @leoyvens
- @lutostag
- @mkantor
- @nfiles
- @petertseng
- @rofrol
- @sshine
- @stringparser
- @xakon
- @ZapAnton
Based on
A variation on Problem 1 at Project Euler - http://projecteuler.net/problem=1