Modulus

Краплі дощу
Краплі дощу у треку Java 
import java.math.BigInteger;
import static java.math.BigInteger.valueOf;

class RaindropConverter {

    String convert (int n) {
        return switch ( valueOf(n).modPow( valueOf(12), valueOf(105) ).intValue() ) {
            case 36 -> "Pling";
            case 85 -> "Plang";
            case 91 -> "Plong";
            case 15 -> "PlingPlang";
            case 21 -> "PlingPlong";
            case 70 -> "PlangPlong";
            case  0 -> "PlingPlangPlong";
            default -> String.valueOf(n); // 1
        };
    }

}

We can generalize raindrops to any factors if they are co-prime. In raindrops, the factors 3, 5 and 7 are co-prime (all sets of prime numbers are co-prime), so we can use Euler's totient function to calculate n¹² mod 105, giving us unique values for the various sounds. The math behind how we find the right exponent and modulus is explained in an article on the related problem of Fizz-Buzz.

Translation missing: uk.number.nth.ordinalized Sep 2026 · Це було корисно?

Інші підходи до вправи Краплі дощу у треку Java

Інші способи, якими наша спільнота розвʼязала цю вправу
if (number % 5 == 0) {
    stringBuilder.append("Plang");
}
if (number % 7 == 0) {
    stringBuilder.append("Plong");
}
return stringBuilder.length() != 0 ? stringBuilder.toString() : Integer.toString(number);
if statements

Use if statements to return the result. 

String convert(int number) {
    var output = new StringBuilder("");
    lookup.forEach((divisor, drop) -> {
        if (number % divisor == 0)
            output.append(drop);
    });
    return output.length() != 0 ? output.toString() : Integer.toString(number);
}
Map

Iterate a Map to return the result.