#P81. [Sleeping Cup #3] Grammar quiz

[Sleeping Cup #3] Grammar quiz

Person in charge

Attention

Solution submissions are prohibited for this problem.

This problem consists of 5\bm 5 sub-questions, each worth 20\bm{20} points, with a total score of 100\bm{100} points.

Questions

  1. For mt19937 generating pseudo-random numbers, after how many random numbers is a twist operation performed?
  2. What is the period of pseudo-random numbers generated by mt19937?
  3. Since which C++ version has Philox engine been supported for generating pseudo-random numbers?
  4. Which Codeforces problem examines the twist operation of mt19937?
  5. In C++14, how can you use STL and the default random number generator (seeded with time(0)) to shuffle a vector<int> v?

Hints

  1. You need to fill in a positive integer.
  2. You need to fill in a LaTeX inline formula with a dollar sign and no spaces.
  3. You need to fill in a string prefixed with C++, indicating a C++ version.
  4. You need to fill in a string prefixed with CF, representing a Codeforces problem.
  5. You need to fill in a string without std:: or spaces, representing a line of C++ code.

Example Answer Format

  1. 233
  2. $2\times(n-1)^{n+1}$
  3. C++98
  4. CF4A
  5. cout<<v.size()<<endl;

Answer Area

  1. {{ input(1) }}
  2. {{ input(2) }}
  3. {{ input(3) }}
  4. {{ input(4) }}
  5. {{ input(5) }}

Official Solution

link