library/random/rng.hpp

• View this file on GitHub
• Last update: 2023-06-27 22:09:28+08:00
• Include: #include "library/random/rng.hpp"
• Link: View error logs on GitHub Actions

Required by

• library/bst/rbst-base.hpp
• library/data-structure/lazy-treap.hpp
• library/data-structure/old-treap.hpp
• library/data-structure/ordered-set.hpp
• treap (library/data-structure/treap.hpp)
• Integer Factorization (Pollard Rho 質因數分解) (library/math/factorize.hpp)

Verified with

• test/data-structure/ordered-set/yosupo-Predecessor-Problem.test.cpp
• test/data-structure/treap/unit-test-treap.test.cpp
• test/data-structure/treap/yosupo-Dynamic-Sequence-Range-Affine-Range-Sum.test.cpp
• test/data-structure/treap/yosupo-Range-Reverse-Range-Sum.test.cpp
• test/math/factorize/aoj-ntl-Prime-Factorize.test.cpp
• test/math/factorize/yosupo-Factorize.test.cpp

Code

#pragma once
#include <chrono>

namespace felix {

inline unsigned long long rng() {
	static unsigned long long SEED = std::chrono::steady_clock::now().time_since_epoch().count();
	SEED ^= SEED << 7;
	SEED ^= SEED >> 9;
	return SEED;
}

} // namespace felix

#line 2 "library/random/rng.hpp"
#include <chrono>

namespace felix {

inline unsigned long long rng() {
	static unsigned long long SEED = std::chrono::steady_clock::now().time_since_epoch().count();
	SEED ^= SEED << 7;
	SEED ^= SEED >> 9;
	return SEED;
}

} // namespace felix

Back to top page