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
/////////////////////////////////////////////////////////////// // Copyright 2012 John Maddock. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt #ifndef BOOST_MP_MR_HPP #define BOOST_MP_MR_HPP #include #include #include #include #include #include #include namespace boost { namespace multiprecision { namespace detail { template bool check_small_factors(const I& n) { constexpr std::uint32_t small_factors1[] = { 3u, 5u, 7u, 11u, 13u, 17u, 19u, 23u}; constexpr std::uint32_t pp1 = 223092870u; std::uint32_t m1 = integer_modulus(n, pp1); for (std::size_t i = 0; i < sizeof(small_factors1) / sizeof(small_factors1[0]); ++i) { BOOST_MP_ASSERT(pp1 % small_factors1[i] == 0); if (m1 % small_factors1[i] == 0) return false; } constexpr std::uint32_t small_factors2[] = { 29u, 31u, 37u, 41u, 43u, 47u}; constexpr std::uint32_t pp2 = 2756205443u; m1 = integer_modulus(n, pp2); for (std::size_t i = 0; i < sizeof(small_factors2) / sizeof(small_factors2[0]); ++i) { BOOST_MP_ASSERT(pp2 % small_factors2[i] == 0); if (m1 % small_factors2[i] == 0) return false; } constexpr std::uint32_t small_factors3[] = { 53u, 59u, 61u, 67u, 71u}; constexpr std::uint32_t pp3 = 907383479u; m1 = integer_modulus(n, pp3); for (std::size_t i = 0; i < sizeof(small_factors3) / sizeof(small_factors3[0]); ++i) { BOOST_MP_ASSERT(pp3 % small_factors3[i] == 0); if (m1 % small_factors3[i] == 0) return false; } constexpr std::uint32_t small_factors4[] = { 73u, 79u, 83u, 89u, 97u}; constexpr std::uint32_t pp4 = 4132280413u; m1 = integer_modulus(n, pp4); for (std::size_t i = 0; i < sizeof(small_factors4) / sizeof(small_factors4[0]); ++i) { BOOST_MP_ASSERT(pp4 % small_factors4[i] == 0); if (m1 % small_factors4[i] == 0) return false; } constexpr std::uint32_t small_factors5[6][4] = { {101u, 103u, 107u, 109u}, {113u, 127u, 131u, 137u}, {139u, 149u, 151u, 157u}, {163u, 167u, 173u, 179u}, {181u, 191u, 193u, 197u}, {199u, 211u, 223u, 227u}}; constexpr std::uint32_t pp5[6] = { 121330189u, 113u * 127u * 131u * 137u, 139u * 149u * 151u * 157u, 163u * 167u * 173u * 179u, 181u * 191u * 193u * 197u, 199u * 211u * 223u * 227u}; for (std::size_t k = 0; k < sizeof(pp5) / sizeof(*pp5); ++k) { m1 = integer_modulus(n, pp5[k]); for (std::size_t i = 0; i < 4; ++i) { BOOST_MP_ASSERT(pp5[k] % small_factors5[k][i] == 0); if (m1 % small_factors5[k][i] == 0) return false; } } return true; } inline bool is_small_prime(std::size_t n) { constexpr unsigned char p[] = { 3u, 5u, 7u, 11u, 13u, 17u, 19u, 23u, 29u, 31u, 37u, 41u, 43u, 47u, 53u, 59u, 61u, 67u, 71u, 73u, 79u, 83u, 89u, 97u, 101u, 103u, 107u, 109u, 113u, 127u, 131u, 137u, 139u, 149u, 151u, 157u, 163u, 167u, 173u, 179u, 181u, 191u, 193u, 197u, 199u, 211u, 223u, 227u}; for (std::size_t i = 0; i < sizeof(p) / sizeof(*p); ++i) { if (n == p[i]) return true; } return false; } template typename std::enable_if::value, unsigned>::type cast_to_unsigned(const I& val) { return static_cast(val); } template typename std::enable_if::value, unsigned>::type cast_to_unsigned(const I& val) { return val.template convert_to(); } } // namespace detail template typename std::enable_if::value == number_kind_integer, bool>::type miller_rabin_test(const I& n, std::size_t trials, Engine& gen) { using number_type = I; if (n == 2) return true; // Trivial special case. if (bit_test(n, 0) == 0) return false; // n is even if (n <= 227) return detail::is_small_prime(detail::cast_to_unsigned(n)); if (!detail::check_small_factors(n)) return false; number_type nm1 = n - 1; // // Begin with a single Fermat test - it excludes a lot of candidates: // number_type q(228), x, y; // We know n is greater than this, as we've excluded small factors x = powm(q, nm1, n); if (x != 1u) return false; q = n - 1; std::size_t k = lsb(q); q >>= k; // Declare our random number generator: boost::multiprecision::uniform_int_distribution dist(2, n - 2); // // Execute the trials: // for (std::size_t i = 0; i < trials; ++i) { x = dist(gen); y = powm(x, q, n); std::size_t j = 0; while (true) { if (y == nm1) break; if (y == 1) { if (j == 0) break; return false; // test failed } if (++j == k) return false; // failed y = powm(y, 2, n); } } return true; // Yeheh! probably prime. } template typename std::enable_if::value == number_kind_integer, bool>::type miller_rabin_test(const I& x, std::size_t trials) { static std::mt19937 gen; return miller_rabin_test(x, trials, gen); } template bool miller_rabin_test(const detail::expression& n, std::size_t trials, Engine& gen) { using number_type = typename detail::expression::result_type; return miller_rabin_test(number_type(n), trials, gen); } template bool miller_rabin_test(const detail::expression& n, std::size_t trials) { using number_type = typename detail::expression::result_type; return miller_rabin_test(number_type(n), trials); } }} // namespace boost::multiprecision #endif