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 John Maddock 2006. // (C) Copyright Matt Borland 2024. // 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_SF_CBRT_HPP #define BOOST_MATH_SF_CBRT_HPP #ifdef _MSC_VER #pragma once #endif #include #ifndef BOOST_MATH_HAS_NVRTC #include #include #include #include #include #include namespace boost{ namespace math{ namespace detail { struct big_int_type { operator std::uintmax_t() const; }; template struct largest_cbrt_int_type { using type = typename std::conditional< std::is_convertible::value, std::uintmax_t, unsigned int >::type; }; template BOOST_MATH_GPU_ENABLED T cbrt_imp(T z, const Policy& pol) { BOOST_MATH_STD_USING // // cbrt approximation for z in the range [0.5,1] // It's hard to say what number of terms gives the optimum // trade off between precision and performance, this seems // to be about the best for double precision. // // Maximum Deviation Found: 1.231e-006 // Expected Error Term: -1.231e-006 // Maximum Relative Change in Control Points: 5.982e-004 // BOOST_MATH_STATIC const T P[] = { static_cast(0.37568269008611818), static_cast(1.3304968705558024), static_cast(-1.4897101632445036), static_cast(1.2875573098219835), static_cast(-0.6398703759826468), static_cast(0.13584489959258635), }; BOOST_MATH_STATIC const T correction[] = { static_cast(0.62996052494743658238360530363911), // 2^-2/3 static_cast(0.79370052598409973737585281963615), // 2^-1/3 static_cast(1), static_cast(1.2599210498948731647672106072782), // 2^1/3 static_cast(1.5874010519681994747517056392723), // 2^2/3 }; if((boost::math::isinf)(z) || (z == 0)) return z; if(!(boost::math::isfinite)(z)) { return policies::raise_domain_error("boost::math::cbrt<%1%>(%1%)", "Argument to function must be finite but got %1%.", z, pol); } int i_exp, sign(1); if(z < 0) { z = -z; sign = -sign; } T guess = frexp(z, &i_exp); int original_i_exp = i_exp; // save for later guess = tools::evaluate_polynomial(P, guess); int i_exp3 = i_exp / 3; using shift_type = typename largest_cbrt_int_type::type; static_assert( ::std::numeric_limits::radix == 2, "The radix of the type to shift to must be 2."); if(abs(i_exp3) < std::numeric_limits::digits) { if(i_exp3 > 0) guess *= shift_type(1u) << i_exp3; else guess /= shift_type(1u) << -i_exp3; } else { guess = ldexp(guess, i_exp3); } i_exp %= 3; guess *= correction[i_exp + 2]; // // Now inline Halley iteration. // We do this here rather than calling tools::halley_iterate since we can // simplify the expressions algebraically, and don't need most of the error // checking of the boilerplate version as we know in advance that the function // is well behaved... // using prec = typename policies::precision::type; constexpr auto prec3 = prec::value / 3; constexpr auto new_prec = prec3 + 3; using new_policy = typename policies::normalise>::type; // // Epsilon calculation uses compile time arithmetic when it's available for type T, // otherwise uses ldexp to calculate at runtime: // T eps = (new_prec > 3) ? policies::get_epsilon() : ldexp(T(1), -2 - tools::digits() / 3); T diff; if(original_i_exp < std::numeric_limits::max_exponent - 3) { // // Safe from overflow, use the fast method: // do { T g3 = guess * guess * guess; diff = (g3 + z + z) / (g3 + g3 + z); guess *= diff; } while(fabs(1 - diff) > eps); } else { // // Either we're ready to overflow, or we can't tell because numeric_limits isn't // available for type T: // do { T g2 = guess * guess; diff = (g2 - z / guess) / (2 * guess + z / g2); guess -= diff; } while((guess * eps) < fabs(diff)); } return sign * guess; } } // namespace detail template BOOST_MATH_GPU_ENABLED inline typename tools::promote_args::type cbrt(T z, const Policy& pol) { using result_type = typename tools::promote_args::type; using value_type = typename policies::evaluation::type; return static_cast(detail::cbrt_imp(value_type(z), pol)); } template BOOST_MATH_GPU_ENABLED inline typename tools::promote_args::type cbrt(T z) { return cbrt(z, policies::policy<>()); } } // namespace math } // namespace boost #else // Special NVRTC handling namespace boost { namespace math { template BOOST_MATH_GPU_ENABLED double cbrt(T x) { return ::cbrt(x); } BOOST_MATH_GPU_ENABLED inline float cbrt(float x) { return ::cbrtf(x); } template BOOST_MATH_GPU_ENABLED double cbrt(T x, const Policy&) { return ::cbrt(x); } template BOOST_MATH_GPU_ENABLED float cbrt(float x, const Policy&) { return ::cbrtf(x); } } // namespace math } // namespace boost #endif // NVRTC #endif // BOOST_MATH_SF_CBRT_HPP