#[test]
fn test_1() {
    assert_eq!("1", raindrops::raindrops(1));
}
#[test]
#[ignore]
fn test_3() {
    assert_eq!("Pling", raindrops::raindrops(3));
}
#[test]
#[ignore]
fn test_5() {
    assert_eq!("Plang", raindrops::raindrops(5));
}
#[test]
#[ignore]
fn test_7() {
    assert_eq!("Plong", raindrops::raindrops(7));
}
#[test]
#[ignore]
fn test_6() {
    assert_eq!("Pling", raindrops::raindrops(6));
}
#[test]
#[ignore]
fn test_8() {
    assert_eq!("8", raindrops::raindrops(8));
}
#[test]
#[ignore]
fn test_9() {
    assert_eq!("Pling", raindrops::raindrops(9));
}
#[test]
#[ignore]
fn test_10() {
    assert_eq!("Plang", raindrops::raindrops(10));
}
#[test]
#[ignore]
fn test_14() {
    assert_eq!("Plong", raindrops::raindrops(14));
}
#[test]
#[ignore]
fn test_15() {
    assert_eq!("PlingPlang", raindrops::raindrops(15));
}
#[test]
#[ignore]
fn test_21() {
    assert_eq!("PlingPlong", raindrops::raindrops(21));
}
#[test]
#[ignore]
fn test_25() {
    assert_eq!("Plang", raindrops::raindrops(25));
}
#[test]
#[ignore]
fn test_27() {
    assert_eq!("Pling", raindrops::raindrops(27));
}
#[test]
#[ignore]
fn test_35() {
    assert_eq!("PlangPlong", raindrops::raindrops(35));
}
#[test]
#[ignore]
fn test_49() {
    assert_eq!("Plong", raindrops::raindrops(49));
}
#[test]
#[ignore]
fn test_52() {
    assert_eq!("52", raindrops::raindrops(52));
}
#[test]
#[ignore]
fn test_105() {
    assert_eq!("PlingPlangPlong", raindrops::raindrops(105));
}
#[test]
#[ignore]
fn test_3125() {
    assert_eq!("Plang", raindrops::raindrops(3125));
}
#[test]
#[ignore]
fn test_12121() {
    assert_eq!("12121", raindrops::raindrops(12_121));
}

pub fn raindrops(n: u32) -> String {
    unimplemented!("what sound does Raindrop #{} make?", n)
}

# Raindrops
Your task is to convert a number into a string that contains raindrop sounds corresponding to certain potential factors. A factor is a number that evenly divides into another number, leaving no remainder. The simplest way to test if a one number is a factor of another is to use the [modulo operation](https://en.wikipedia.org/wiki/Modulo_operation).
The rules of `raindrops` are that if a given number:
- has 3 as a factor, add 'Pling' to the result.
- has 5 as a factor, add 'Plang' to the result.
- has 7 as a factor, add 'Plong' to the result.
- _does not_ have any of 3, 5, or 7 as a factor, the result should be the digits of the number.
## Examples
- 28 has 7 as a factor, but not 3 or 5, so the result would be "Plong".
- 30 has both 3 and 5 as factors, but not 7, so the result would be "PlingPlang".
- 34 is not factored by 3, 5, or 7, so the result would be "34".
## Rust Installation
Refer to the [exercism help page][help-page] for Rust installation and learning
resources.
## Writing the Code
Execute the tests with:
```bash
$ 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:
```bash
$ cargo test -- --ignored
```
To run a specific test, for example `some_test`, you can use:
```bash
$ cargo test some_test
```
If the specific test is ignored use:
```bash
$ cargo test some_test -- --ignored
```
To learn more about Rust tests refer to the [online test documentation][rust-tests]
Make sure to read the [Modules][modules] chapter if you
haven't already, it will help you with organizing your files.
## Further improvements
After you have solved the exercise, please consider using the additional utilities, described in the [installation guide](https://exercism.io/tracks/rust/installation), to further refine your final solution.
To format your solution, inside the solution directory use
```bash
cargo fmt
```
To see, if your solution contains some common ineffective use cases, inside the solution directory use
```bash
cargo clippy --all-targets
```
## Submitting the solution
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.
## Feedback, Issues, Pull Requests
The [exercism/rust](https://github.com/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](https://github.com/exercism/docs/blob/main/contributing-to-language-tracks/README.md).
[help-page]: https://exercism.io/tracks/rust/learning
[modules]: https://doc.rust-lang.org/book/ch07-02-defining-modules-to-control-scope-and-privacy.html
[cargo]: https://doc.rust-lang.org/book/ch14-00-more-about-cargo.html
[rust-tests]: https://doc.rust-lang.org/book/ch11-02-running-tests.html
## Source
A variation on FizzBuzz, a famous technical interview question that is intended to weed out potential candidates. That question is itself derived from Fizz Buzz, a popular children's game for teaching division. [https://en.wikipedia.org/wiki/Fizz_buzz](https://en.wikipedia.org/wiki/Fizz_buzz)
## Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.

[package]
edition = "2018"
name = "raindrops"
version = "1.1.0"

# Generated by Cargo
# will have compiled files and executables
/target/
**/*.rs.bk
# Remove Cargo.lock from gitignore if creating an executable, leave it for libraries
# More information here http://doc.crates.io/guide.html#cargotoml-vs-cargolock
Cargo.lock

{"track":"rust","exercise":"raindrops","id":"7a427e15ad8c4443a5131f9eeb8ad51e","url":"https://exercism.io/my/solutions/7a427e15ad8c4443a5131f9eeb8ad51e","handle":"nicoty","is_requester":true,"auto_approve":false}