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
// (C) Copyright Jeremy William Murphy 2016. // (C) Copyright Matt Borland 2021. // Use, modification and distribution are subject to 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) #ifndef BOOST_MATH_TOOLS_POLYNOMIAL_GCD_HPP #define BOOST_MATH_TOOLS_POLYNOMIAL_GCD_HPP #ifdef _MSC_VER #pragma once #endif #include #include #include #include #ifndef BOOST_MATH_STANDALONE #include #else #include #include #include #include #include namespace boost { namespace integer { namespace gcd_detail { template inline EuclideanDomain Euclid_gcd(EuclideanDomain a, EuclideanDomain b) noexcept(std::is_arithmetic::value) { using std::swap; while (b != EuclideanDomain(0)) { a %= b; swap(a, b); } return a; } enum method_type { method_euclid = 0, method_binary = 1, method_mixed = 2 }; } // gcd_detail template ::value_type> std::pair gcd_range(Iter first, Iter last) noexcept(std::is_arithmetic::value) { BOOST_MATH_ASSERT(first != last); T d = *first; ++first; while (d != T(1) && first != last) { #ifdef BOOST_MATH_HAS_CXX17_NUMERIC d = std::gcd(d, *first); #else d = gcd_detail::Euclid_gcd(d, *first); #endif ++first; } return std::make_pair(d, first); } }} // namespace boost::integer #endif namespace boost{ namespace integer { namespace gcd_detail { template struct gcd_traits; template struct gcd_traits > { inline static const boost::math::tools::polynomial& abs(const boost::math::tools::polynomial& val) { return val; } static const method_type method = method_euclid; }; } } namespace math{ namespace tools{ /* From Knuth, 4.6.1: * * We may write any nonzero polynomial u(x) from R[x] where R is a UFD as * * u(x) = cont(u) . pp(u(x)) * * where cont(u), the content of u, is an element of S, and pp(u(x)), the primitive * part of u(x), is a primitive polynomial over S. * When u(x) = 0, it is convenient to define cont(u) = pp(u(x)) = O. */ template T content(polynomial const &x) { return x ? boost::integer::gcd_range(x.data().begin(), x.data().end()).first : T(0); } // Knuth, 4.6.1 template polynomial primitive_part(polynomial const &x, T const &cont) { return x ? x / cont : polynomial(); } template polynomial primitive_part(polynomial const &x) { return primitive_part(x, content(x)); } // Trivial but useful convenience function referred to simply as l() in Knuth. template T leading_coefficient(polynomial const &x) { return x ? x.data().back() : T(0); } namespace detail { /* Reduce u and v to their primitive parts and return the gcd of their * contents. Used in a couple of gcd algorithms. */ template T reduce_to_primitive(polynomial &u, polynomial &v) { T const u_cont = content(u), v_cont = content(v); u /= u_cont; v /= v_cont; #ifdef BOOST_MATH_HAS_CXX17_NUMERIC return std::gcd(u_cont, v_cont); #else return boost::integer::gcd_detail::Euclid_gcd(u_cont, v_cont); #endif } } /** * Knuth, The Art of Computer Programming: Volume 2, Third edition, 1998 * Algorithm 4.6.1C: Greatest common divisor over a unique factorization domain. * * The subresultant algorithm by George E. Collins [JACM 14 (1967), 128-142], * later improved by W. S. Brown and J. F. Traub [JACM 18 (1971), 505-514]. * * Although step C3 keeps the coefficients to a "reasonable" size, they are * still potentially several binary orders of magnitude larger than the inputs. * Thus, this algorithm should only be used where T is a multi-precision type. * * @tparam T Polynomial coefficient type. * @param u First polynomial. * @param v Second polynomial. * @return Greatest common divisor of polynomials u and v. */ template typename std::enable_if< std::numeric_limits::is_integer, polynomial >::type subresultant_gcd(polynomial u, polynomial v) { using std::swap; BOOST_MATH_ASSERT(u || v); if (!u) return v; if (!v) return u; typedef typename polynomial::size_type N; if (u.degree() < v.degree()) swap(u, v); T const d = detail::reduce_to_primitive(u, v); T g = 1, h = 1; polynomial r; while (true) { BOOST_MATH_ASSERT(u.degree() >= v.degree()); // Pseudo-division. r = u % v; if (!r) return d * primitive_part(v); // Attach the content. if (r.degree() == 0) return d * polynomial(T(1)); // The content is the result. N const delta = u.degree() - v.degree(); // Adjust remainder. u = v; v = r / (g * detail::integer_power(h, delta)); g = leading_coefficient(u); T const tmp = detail::integer_power(g, delta); if (delta <= N(1)) h = tmp * detail::integer_power(h, N(1) - delta); else h = tmp / detail::integer_power(h, delta - N(1)); } } /** * @brief GCD for polynomials with unbounded multi-precision integral coefficients. * * The multi-precision constraint is enforced via numeric_limits. * * Note that intermediate terms in the evaluation can grow arbitrarily large, hence the need for * unbounded integers, otherwise numeric overflow would break the algorithm. * * @tparam T A multi-precision integral type. */ template typename std::enable_if::is_integer && !std::numeric_limits::is_bounded, polynomial >::type gcd(polynomial const &u, polynomial const &v) { return subresultant_gcd(u, v); } // GCD over bounded integers is not currently allowed: template typename std::enable_if::is_integer && std::numeric_limits::is_bounded, polynomial >::type gcd(polynomial const &u, polynomial const &v) { static_assert(sizeof(v) == 0, "GCD on polynomials of bounded integers is disallowed due to the excessive growth in the size of intermediate terms."); return subresultant_gcd(u, v); } // GCD over polynomials of floats can go via the Euclid algorithm: template typename std::enable_if::is_integer && (std::numeric_limits::min_exponent != std::numeric_limits::max_exponent) && !std::numeric_limits::is_exact, polynomial >::type gcd(polynomial const &u, polynomial const &v) { return boost::integer::gcd_detail::Euclid_gcd(u, v); } } // // Using declaration so we overload the default implementation in this namespace: // using boost::math::tools::gcd; } namespace integer { // // Using declaration so we overload the default implementation in this namespace: // using boost::math::tools::gcd; } } // namespace boost::math::tools #endif