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 (c) Marshall Clow 2011-2012. 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) */ /// \file is_permutation.hpp /// \brief Is a sequence a permutation of another sequence /// \author Marshall Clow #ifndef BOOST_ALGORITHM_IS_PERMUTATION11_HPP #define BOOST_ALGORITHM_IS_PERMUTATION11_HPP #include // for std::find_if, count_if, mismatch #include // for std::pair #include // for std::equal_to #include #include #include #include #include #include namespace boost { namespace algorithm { /// \cond DOXYGEN_HIDE namespace detail { template struct value_predicate { value_predicate ( Predicate p, Iterator it ) : p_ ( p ), it_ ( it ) {} template bool operator () ( const T1 &t1 ) const { return p_ ( *it_, t1 ); } private: Predicate p_; Iterator it_; }; // Preconditions: // 1. The sequences are the same length // 2. Any common elements on the front have been removed (not necessary for correctness, just for performance) template< class ForwardIterator1, class ForwardIterator2, class BinaryPredicate > bool is_permutation_inner ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate p ) { // for each unique value in the sequence [first1,last1), count how many times // it occurs, and make sure it occurs the same number of times in [first2, last2) for ( ForwardIterator1 iter = first1; iter != last1; ++iter ) { value_predicate pred ( p, iter ); /* For each value we haven't seen yet... */ if ( std::find_if ( first1, iter, pred ) == iter ) { std::size_t dest_count = std::count_if ( first2, last2, pred ); if ( dest_count == 0 || dest_count != (std::size_t) std::count_if ( iter, last1, pred )) return false; } } return true; } template< class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> bool is_permutation_tag ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate p, std::forward_iterator_tag, std::forward_iterator_tag ) { // Skip the common prefix (if any) while ( first1 != last1 && first2 != last2 && p ( *first1, *first2 )) { ++first1; ++first2; } if ( first1 != last1 && first2 != last2 ) return boost::algorithm::detail::is_permutation_inner ( first1, last1, first2, last2, std::equal_to::value_type> ()); return first1 == last1 && first2 == last2; } template bool is_permutation_tag ( RandomAccessIterator1 first1, RandomAccessIterator1 last1, RandomAccessIterator2 first2, RandomAccessIterator2 last2, BinaryPredicate p, std::random_access_iterator_tag, std::random_access_iterator_tag ) { // Cheap check if ( std::distance ( first1, last1 ) != std::distance ( first2, last2 )) return false; // Skip the common prefix (if any) while ( first1 != last1 && first2 != last2 && p ( *first1, *first2 )) { ++first1; ++first2; } if ( first1 != last1 && first2 != last2 ) return is_permutation_inner (first1, last1, first2, last2, p); return first1 == last1 && first2 == last2; } } /// \endcond /// \fn is_permutation ( ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 first2, BinaryPredicate p ) /// \brief Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2 /// /// \param first1 The start of the input sequence /// \param last1 One past the end of the input sequence /// \param first2 The start of the second sequence /// \param p The predicate to compare elements with /// /// \note This function is part of the C++2011 standard library. template< class ForwardIterator1, class ForwardIterator2, class BinaryPredicate > bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, BinaryPredicate p ) { // Skip the common prefix (if any) std::pair eq = std::mismatch (first1, last1, first2, p); first1 = eq.first; first2 = eq.second; if ( first1 != last1 ) { // Create last2 ForwardIterator2 last2 = first2; std::advance ( last2, std::distance (first1, last1)); return boost::algorithm::detail::is_permutation_inner ( first1, last1, first2, last2, p ); } return true; } /// \fn is_permutation ( ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 first2 ) /// \brief Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2 /// /// \param first1 The start of the input sequence /// \param last2 One past the end of the input sequence /// \param first2 The start of the second sequence /// \note This function is part of the C++2011 standard library. template< class ForwardIterator1, class ForwardIterator2 > bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2 ) { // How should I deal with the idea that ForwardIterator1::value_type // and ForwardIterator2::value_type could be different? Define my own comparison predicate? // Skip the common prefix (if any) std::pair eq = std::mismatch (first1, last1, first2 ); first1 = eq.first; first2 = eq.second; if ( first1 != last1 ) { // Create last2 ForwardIterator2 last2 = first2; std::advance ( last2, std::distance (first1, last1)); return boost::algorithm::detail::is_permutation_inner ( first1, last1, first2, last2, std::equal_to::value_type> ()); } return true; } /// \fn is_permutation ( const Range &r, ForwardIterator first2 ) /// \brief Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2 /// /// \param r The input range /// \param first2 The start of the second sequence template bool is_permutation ( const Range &r, ForwardIterator first2 ) { return boost::algorithm::is_permutation (boost::begin (r), boost::end (r), first2 ); } /// \fn is_permutation ( const Range &r, ForwardIterator first2, BinaryPredicate pred ) /// \brief Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2 /// /// \param r The input range /// \param first2 The start of the second sequence /// \param pred The predicate to compare elements with /// // Disable this template when the first two parameters are the same type // That way the non-range version will be chosen. template typename boost::disable_if_c::value, bool>::type is_permutation ( const Range &r, ForwardIterator first2, BinaryPredicate pred ) { return boost::algorithm::is_permutation (boost::begin (r), boost::end (r), first2, pred ); } }} #endif // BOOST_ALGORITHM_IS_PERMUTATION11_HPP