Generate pseudorandom integers

Question:

In this project you will design and implement a class that can generate a sequence of pseudorandom integers, which is a sequence that appears random in many ways. The approach uses the linear congruence method, explained here.
The linear congruence method starts with a number called the seed. In addition to the seed, three other numbers are used in the linear congruence method, called the multiplier, the increment, and the modulus. The formula for generating a sequence of pseudorandom numbers is quite simple. The first number is: $$(multiplier\ast seed+increment)\%modules$$This formula uses the C++ % operator, which computes the remainder from an integer division.
Each time a new random number is computed, the value of the seed is changed to that new number. For example, we could implement a pseudorandom number generator with $multiplier=40$, $increment=725$, and $modules=729$. If we choose the seed to be 1, then the sequence of numbers will proceed as shown here:
$$Firstnumber$$$$=(multiplier\ast seed+increment)\%modulus$$$$=(40\ast 1+725)\%729$$$$=36$$and 36 becomes the new seed.$$Nextnumber$$$$=(multiplier\ast seed+increment)\%modulus$$$$=(40\ast 36+725)\%729$$$$=707$$and 707 becomes the new seed.$$Nextnumber$$$$=(multiplier\ast seed+increment)\%modulus$$$$=(40\ast 707+725)\%729$$$$=574$$and 574 becomes the new seed, and so on.
These particular values for multiplier, increment, and modulus happen to be good choices. The pattern generated will not repeat until 729 different numbers have been produced. Other choices for the constants might not be so good. For this project, design and implement a class that can generate a pseudorandom sequence in the manner described. The initial seed, multiplier, increment, and modulus should all be a member function to permit the seed to be changed, and a member function to generate and return the next number in the pseudorandom sequence.

My answer:

random.h

#ifndef RANDOM_H
#define RANDOM_H

class pseudorandom_generator{
public:
    pseudorandom_generator(int a, int b, int c, int d){
        multiplier = a;
        increment = b;
        modulus = c;
        seed = d;
    };
    void set_parameters(int a, int b, int c, int d);
    int generate_number();
private:
    int multiplier, seed, increment, modulus;
};

#endif

random.cpp

#include "random.h"
#include <iostream>

using namespace std;

void pseudorandom_generator::set_parameters(int a, int b, int c, int d){
    multiplier = a;
    increment = b;
    modulus = c;
    seed = d;
}

int pseudorandom_generator::generate_number(){
    seed = (multiplier*seed + increment)%modulus;
    cout << seed << " ";
    return seed;
}

main.cpp

#include "random.h"
#include <iostream>

using namespace std;

int main(){
    pseudorandom_generator a(40, 725, 729, 1);
    cout << "******start to generate pseudorandom numbers******" << endl;
    int i = 0;
    while(i < 729){
        a.generate_number();
        if((i+1)%20 == 0)
            cout << "\n";
        i++;
    }
    cout << "\n******here should be numbers range from 1 to 729 uniquely******" << endl;
    return 0;
}

结果：

题中的生成伪随机数的方法叫做“线性同余法”。

Reference:

整理自 Data Structures and Other Objects Using C++ ( Fourth Edition ) Michael Main, Walter Savitch. p123