using System;

​

public class Program

{

    public static void Main()

    {

        int seed = 13; // Fixed seed value

        int count = 6; // Number of random numbers to generate

        int min = 1; // Minimum value of the range

        int max = 48; // Maximum value of the range

        int[] randomNumbers = GenerateRandomNumbers(seed, count, min, max);

        // Print the generated random numbers

        Console.WriteLine("Generated Random Numbers:");

        foreach (int num in randomNumbers)

        {

            Console.Write(num + " ");

        }

    }

​

    public static int[] GenerateRandomNumbers(int seed, int count, int min, int max)

    {

        int[] randomNumbers = new int[count];

        for (int i = 0; i < count; i++)

        {

            // Generate pseudo-random number using custom algorithm

            int pseudoRandom = GetPseudoRandom(seed, i);

            randomNumbers[i] = min + Math.Abs(pseudoRandom) % (max - min + 1);

        }

​

        return randomNumbers;

    }

​

    public static int GetPseudoRandom(int seed, int index)

    {

        // Combine seed and index to create input for hash function

        string input = seed.ToString() + index.ToString();

        // Compute hash using MurmurHash3 algorithm

        int hash = MurmurHash3(input);

        // Apply bitwise XOR operation to hash and index

        int pseudoRandom = hash ^ index;

        return pseudoRandom;

    }

​

    public static int MurmurHash3(string input)

    {

        const uint seed = 123; // Seed value

        const uint c1 = 0xcc9e2d51;

        const uint c2 = 0x1b873593;

        const int r1 = 15;

        const int r2 = 13;

        const uint m = 5;

        const uint n = 0xe6546b64;

​

        uint hash = seed;

        uint length = (uint)input.Length;

​

        for (int i = 0; i < input.Length - 3; i += 4)

        {

            uint k = (uint)(input[i] | input[i + 1] << 8 | input[i + 2] << 16 | input[i + 3] << 24);

​

            k *= c1;

            k = RotateLeft(k, r1);

            k *= c2;

​

            hash ^= k;

            hash = RotateLeft(hash, r2);

            hash = hash * m + n;

        }

​

        uint remainingBytes = (uint)(input.Length & 3);

        if (remainingBytes != 0)

        {

            uint k = 0;

​

            for (int i = (int)length - 1; i >= input.Length - remainingBytes; i--)

            {

                k <<= 8;

                k |= input[i];

            }

​

            k *= c1;

            k = RotateLeft(k, r1);

            k *= c2;

​

            hash ^= k;

        }

​

        hash ^= length;

        hash ^= hash >> 16;

        hash *= 0x85ebca6b;

        hash ^= hash >> 13;

        hash *= 0xc2b2ae35;

        hash ^= hash >> 16;

​

        return (int)hash;

    }

​

    public static uint RotateLeft(uint value, int count)

    {

        return (value << count) | (value >> (32 - count));

    }

}

​