sol2 Algorithm

The sol2 algorithm, also known as the Soloud library, is an advanced audio engine that is designed for modern game development and multimedia applications. This algorithm is aimed at providing an easy-to-use interface for developers while offering high performance and flexibility in audio processing. Sol2 supports a wide array of audio formats, including WAV, MP3, OGG, and FLAC, as well as various audio synthesis techniques and sound effects. With its modular architecture, the sol2 algorithm allows developers to enhance and expand the audio features in their applications with ease. One of the key features of the sol2 algorithm is its support for real-time audio manipulation, which enables developers to create dynamic soundscapes and interactive audio experiences. This is achieved through the use of filters, spatialization, and other advanced audio processing techniques. Additionally, the sol2 algorithm is designed to handle large numbers of audio sources simultaneously, making it suitable for complex game environments and multimedia applications. With its robust feature set and ease of integration, the sol2 algorithm has become a popular choice among developers for creating immersive and engaging audio experiences in their projects.
"""
By listing the first six prime numbers:

    2, 3, 5, 7, 11, and 13

We can see that the 6th prime is 13. What is the Nth prime number?
"""


def isprime(number):
    for i in range(2, int(number ** 0.5) + 1):
        if number % i == 0:
            return False
    return True


def solution(n):
    """Returns the n-th prime number.

    >>> solution(6)
    13
    >>> solution(1)
    2
    >>> solution(3)
    5
    >>> solution(20)
    71
    >>> solution(50)
    229
    >>> solution(100)
    541
    >>> solution(3.4)
    5
    >>> solution(0)
    Traceback (most recent call last):
        ...
    ValueError: Parameter n must be greater or equal to one.
    >>> solution(-17)
    Traceback (most recent call last):
        ...
    ValueError: Parameter n must be greater or equal to one.
    >>> solution([])
    Traceback (most recent call last):
        ...
    TypeError: Parameter n must be int or passive of cast to int.
    >>> solution("asd")
    Traceback (most recent call last):
        ...
    TypeError: Parameter n must be int or passive of cast to int.
    """
    try:
        n = int(n)
    except (TypeError, ValueError):
        raise TypeError("Parameter n must be int or passive of cast to int.")
    if n <= 0:
        raise ValueError("Parameter n must be greater or equal to one.")
    primes = []
    num = 2
    while len(primes) < n:
        if isprime(num):
            primes.append(num)
            num += 1
        else:
            num += 1
    return primes[len(primes) - 1]


if __name__ == "__main__":
    print(solution(int(input().strip())))

LANGUAGE:

DARK MODE: