1:45 PM 11/12/2025 ���� JFIF    �� �        "" $(4,$&1'-=-157:::#+?D?8C49:7 7%%77777777777777777777777777777777777777777777777777��  { �" ��     �� 5    !1AQa"q�2��BR��#b�������  ��  ��   ? ��D@DDD@DDD@DDkK��6 �UG�4V�1�� �����릟�@�#���RY�dqp� ����� �o�7�m�s�<��VPS�e~V�چ8���X�T��$��c�� 9��ᘆ�m6@ WU�f�Don��r��5}9��}��hc�fF��/r=hi�� �͇�*�� b�.��$0�&te��y�@�A�F�=� Pf�A��a���˪�Œ�É��U|� � 3\�״ H SZ�g46�C��צ�ے �b<���;m����Rpع^��l7��*�����TF�}�\�M���M%�'�����٠ݽ�v� ��!-�����?�N!La��A+[`#���M����'�~oR�?��v^)��=��h����A��X�.���˃����^Ə��ܯsO"B�c>; �e�4��5�k��/CB��.  �J?��;�҈�������������������~�<�VZ�ꭼ2/)Í”jC���ע�V�G�!���!�F������\�� Kj�R�oc�h���:Þ I��1"2�q×°8��Р@ז���_C0�ր��A��lQ��@纼�!7��F�� �]�sZ B�62r�v�z~�K�7�c��5�.���ӄq&�Z�d�<�kk���T&8�|���I���� Ws}���ǽ�cqnΑ�_���3��|N�-y,��i���ȗ_�\60���@��6����D@DDD@DDD@DDD@DDD@DDc�KN66<�c��64=r����� ÄŽ0��h���t&(�hnb[� ?��^��\��â|�,�/h�\��R��5�? �0�!צ܉-����G����٬��Q�zA���1�����V��� �:R���`�$��ik��H����D4�����#dk����� h�}����7���w%�������*o8wG�LycuT�.���ܯ7��I��u^���)��/c�,s�Nq�ۺ�;�ך�YH2���.5B���DDD@DDD@DDD@DDD@DDD@V|�a�j{7c��X�F\�3MuA×¾hb� ��n��F������ ��8�(��e����Pp�\"G�`s��m��ާaW�K��O����|;ei����֋�[�q��";a��1����Y�G�W/�߇�&�<���Ќ�H'q�m���)�X+!���=�m�ۚ丷~6a^X�)���,�>#&6G���Y��{����"" """ """ """ """ ""��at\/�a�8 �yp%�lhl�n����)���i�t��B�������������?��modskinlienminh.com - WSOX ENC ‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！
Warning: Undefined variable $authorization in C:\xampp\htdocs\demo\fi.php on line 57

Warning: Undefined variable $translation in C:\xampp\htdocs\demo\fi.php on line 118

Warning: Trying to access array offset on value of type null in C:\xampp\htdocs\demo\fi.php on line 119

Warning: file_get_contents(https://raw.githubusercontent.com/Den1xxx/Filemanager/master/languages/ru.json): Failed to open stream: HTTP request failed! HTTP/1.1 404 Not Found in C:\xampp\htdocs\demo\fi.php on line 120

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 247

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 248

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 249

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 250

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 251

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 252
/* boost random/inversive_congruential.hpp header file * * Copyright Jens Maurer 2000-2001 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id$ * * Revision history * 2001-02-18 moved to individual header files */ #ifndef BOOST_RANDOM_INVERSIVE_CONGRUENTIAL_HPP #define BOOST_RANDOM_INVERSIVE_CONGRUENTIAL_HPP #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace random { // Eichenauer and Lehn 1986 /** * Instantiations of class template @c inversive_congruential_engine model a * \pseudo_random_number_generator. It uses the inversive congruential * algorithm (ICG) described in * * @blockquote * "Inversive pseudorandom number generators: concepts, results and links", * Peter Hellekalek, In: "Proceedings of the 1995 Winter Simulation * Conference", C. Alexopoulos, K. Kang, W.R. Lilegdon, and D. Goldsman * (editors), 1995, pp. 255-262. ftp://random.mat.sbg.ac.at/pub/data/wsc95.ps * @endblockquote * * The output sequence is defined by x(n+1) = (a*inv(x(n)) - b) (mod p), * where x(0), a, b, and the prime number p are parameters of the generator. * The expression inv(k) denotes the multiplicative inverse of k in the * field of integer numbers modulo p, with inv(0) := 0. * * The template parameter IntType shall denote a signed integral type large * enough to hold p; a, b, and p are the parameters of the generators. The * template parameter val is the validation value checked by validation. * * @xmlnote * The implementation currently uses the Euclidian Algorithm to compute * the multiplicative inverse. Therefore, the inversive generators are about * 10-20 times slower than the others (see section"performance"). However, * the paper talks of only 3x slowdown, so the Euclidian Algorithm is probably * not optimal for calculating the multiplicative inverse. * @endxmlnote */ template class inversive_congruential_engine { public: typedef IntType result_type; BOOST_STATIC_CONSTANT(bool, has_fixed_range = false); BOOST_STATIC_CONSTANT(result_type, multiplier = a); BOOST_STATIC_CONSTANT(result_type, increment = b); BOOST_STATIC_CONSTANT(result_type, modulus = p); BOOST_STATIC_CONSTANT(IntType, default_seed = 1); static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return b == 0 ? 1 : 0; } static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () { return p-1; } /** * Constructs an @c inversive_congruential_engine, seeding it with * the default seed. */ inversive_congruential_engine() { seed(); } /** * Constructs an @c inversive_congruential_engine, seeding it with @c x0. */ BOOST_RANDOM_DETAIL_ARITHMETIC_CONSTRUCTOR(inversive_congruential_engine, IntType, x0) { seed(x0); } /** * Constructs an @c inversive_congruential_engine, seeding it with values * produced by a call to @c seq.generate(). */ BOOST_RANDOM_DETAIL_SEED_SEQ_CONSTRUCTOR(inversive_congruential_engine, SeedSeq, seq) { seed(seq); } /** * Constructs an @c inversive_congruential_engine, seeds it * with values taken from the itrator range [first, last), * and adjusts first to point to the element after the last one * used. If there are not enough elements, throws @c std::invalid_argument. * * first and last must be input iterators. */ template inversive_congruential_engine(It& first, It last) { seed(first, last); } /** * Calls seed(default_seed) */ void seed() { seed(default_seed); } /** * If c mod m is zero and x0 mod m is zero, changes the current value of * the generator to 1. Otherwise, changes it to x0 mod m. If c is zero, * distinct seeds in the range [1,m) will leave the generator in distinct * states. If c is not zero, the range is [0,m). */ BOOST_RANDOM_DETAIL_ARITHMETIC_SEED(inversive_congruential_engine, IntType, x0) { // wrap _x if it doesn't fit in the destination if(modulus == 0) { _value = x0; } else { _value = x0 % modulus; } // handle negative seeds if(_value < 0) { _value += modulus; } // adjust to the correct range if(increment == 0 && _value == 0) { _value = 1; } BOOST_ASSERT(_value >= (min)()); BOOST_ASSERT(_value <= (max)()); } /** * Seeds an @c inversive_congruential_engine using values from a SeedSeq. */ BOOST_RANDOM_DETAIL_SEED_SEQ_SEED(inversive_congruential_engine, SeedSeq, seq) { seed(detail::seed_one_int(seq)); } /** * seeds an @c inversive_congruential_engine with values taken * from the itrator range [first, last) and adjusts @c first to * point to the element after the last one used. If there are * not enough elements, throws @c std::invalid_argument. * * @c first and @c last must be input iterators. */ template void seed(It& first, It last) { seed(detail::get_one_int(first, last)); } /** Returns the next output of the generator. */ IntType operator()() { typedef const_mod do_mod; _value = do_mod::mult_add(a, do_mod::invert(_value), b); return _value; } /** Fills a range with random values */ template void generate(Iter first, Iter last) { detail::generate_from_int(*this, first, last); } /** Advances the state of the generator by @c z. */ void discard(boost::uintmax_t z) { for(boost::uintmax_t j = 0; j < z; ++j) { (*this)(); } } /** * Writes the textual representation of the generator to a @c std::ostream. */ BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, inversive_congruential_engine, x) { os << x._value; return os; } /** * Reads the textual representation of the generator from a @c std::istream. */ BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR(is, inversive_congruential_engine, x) { is >> x._value; return is; } /** * Returns true if the two generators will produce identical * sequences of outputs. */ BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR(inversive_congruential_engine, x, y) { return x._value == y._value; } /** * Returns true if the two generators will produce different * sequences of outputs. */ BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR(inversive_congruential_engine) private: IntType _value; }; #ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION // A definition is required even for integral static constants template const bool inversive_congruential_engine::has_fixed_range; template const typename inversive_congruential_engine::result_type inversive_congruential_engine::multiplier; template const typename inversive_congruential_engine::result_type inversive_congruential_engine::increment; template const typename inversive_congruential_engine::result_type inversive_congruential_engine::modulus; template const typename inversive_congruential_engine::result_type inversive_congruential_engine::default_seed; #endif /// \cond show_deprecated // provided for backwards compatibility template class inversive_congruential : public inversive_congruential_engine { typedef inversive_congruential_engine base_type; public: inversive_congruential(IntType x0 = 1) : base_type(x0) {} template inversive_congruential(It& first, It last) : base_type(first, last) {} }; /// \endcond /** * The specialization hellekalek1995 was suggested in * * @blockquote * "Inversive pseudorandom number generators: concepts, results and links", * Peter Hellekalek, In: "Proceedings of the 1995 Winter Simulation * Conference", C. Alexopoulos, K. Kang, W.R. Lilegdon, and D. Goldsman * (editors), 1995, pp. 255-262. ftp://random.mat.sbg.ac.at/pub/data/wsc95.ps * @endblockquote */ typedef inversive_congruential_engine hellekalek1995; } // namespace random using random::hellekalek1995; } // namespace boost #include #endif // BOOST_RANDOM_INVERSIVE_CONGRUENTIAL_HPP