random/xorshift.hpp

• View this file on GitHub
• Last update: 2020-03-07 22:54:47+09:00
• Include: #include "random/xorshift.hpp"

Required by

• Integer factorization （素因数分解） (number/factorize.hpp)
• Primitive root modulo $n$ （原始根の発見） (number/primitive_root.hpp)

Verified with

• data_structure/test/lazy_rbst.stress.test.cpp
• data_structure/test/link_cut_tree.noncommutative.stress.test.cpp
• data_structure/test/link_cut_tree.noncommutative2.stress.test.cpp
• data_structure/test/link_cut_tree.pathadd.stress.test.cpp
• formal_power_series/test/pow_of_sparse_fps.stress.test.cpp
• graph/test/chromatic_number.test.cpp
• linear_algebra_matrix/test/hessenberg_system.stress.test.cpp
• number/test/factorize_aoj.test.cpp
• number/test/factorize_longlong.test.cpp
• number/test/is_prime.test.cpp
• number/test/miller-rabin-5e7.test.cpp
• number/test/miller-rabin.test.cpp
• number/test/primitive_root.test.cpp
• number/test/primitive_root_1e18.test.cpp
• segmenttree/test/beats_random_test.test.cpp
• set_power_series/test/subset_exp.stress.test.cpp
• set_power_series/test/subset_pow.stress.test.cpp
• tree/test/frequency_table_of_tree_distance.stress.test.cpp

Code

#pragma once
#include <cstdint>

// CUT begin
uint32_t rand_int() // XorShift random integer generator
{
    static uint32_t x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    uint32_t t = x ^ (x << 11);
    x = y;
    y = z;
    z = w;
    return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
double rand_double() { return (double)rand_int() / UINT32_MAX; }

#line 2 "random/xorshift.hpp"
#include <cstdint>

// CUT begin
uint32_t rand_int() // XorShift random integer generator
{
    static uint32_t x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    uint32_t t = x ^ (x << 11);
    x = y;
    y = z;
    z = w;
    return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
double rand_double() { return (double)rand_int() / UINT32_MAX; }

Back to top page