Не портите страницы задач, оформляйте правильно

Материал из DISCOPAL
Перейти к: навигация, поиск
 
(не показана одна промежуточная версия этого же участника)
Строка 1: Строка 1:
 
* Изучите как оформлять — [[Практикуемся В Алгоритмах]]
 
* Изучите как оформлять — [[Практикуемся В Алгоритмах]]
 
** Решения только на своих подстраницах, правильно оформленные, с ссылкой на страницу-задачи!
 
** Решения только на своих подстраницах, правильно оформленные, с ссылкой на страницу-задачи!
** Ну вот свежий пример для ленящихся смотреть обьяснение → [[Участник:Taekwandodo/task3]]
+
** Ну вот свежий пример для ленящихся смотреть обьяснение → [[Участник:Taekwandodo/task3]], [[Участник:Taekwandodo/task8]]
 
* не портите страницы задач — вы только тратите мое время на попытки восстановить — [https://discopal.ispras.ru/index.php?title=Leetcode%2Fcheck-if-strings-can-be-made-equal-with-operations-ii&type=revision&diff=29181&oldid=28877], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fdivide-array-into-arrays-with-max-difference&type=revision&diff=29186&oldid=28866], [https://discopal.ispras.ru/index.php?title=Leetcode%2Ffind-the-substring-with-maximum-cost&type=revision&diff=29177&oldid=28606], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fhigh-access-employees&type=revision&diff=29182&oldid=28873], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fcheck-if-strings-can-be-made-equal-with-operations-ii&type=revision&diff=29181&oldid=28877], [https://discopal.ispras.ru/index.php?title=Leetcode%2Flength-of-the-longest-subsequence-that-sums-to-target&type=revision&diff=29176&oldid=28604], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fhigh-access-employees&type=revision&diff=29182&oldid=28873], [https://discopal.ispras.ru/index.php?title=Leetcode%2Flength-of-the-longest-subsequence-that-sums-to-target&type=revision&diff=29176&oldid=28604], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fmake-lexicographically-smallest-array-by-swapping-elements&type=revision&diff=29184&oldid=28871], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fminimum-cost-to-make-array-equalindromic&type=revision&diff=29185&oldid=28869], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fmaximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k&type=revision&diff=29178&oldid=29044], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fminimum-index-of-a-valid-split&type=revision&diff=29180&oldid=28881], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fminimum-number-of-pushes-to-type-word-ii&type=revision&diff=29187&oldid=28863], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fcheck-if-strings-can-be-made-equal-with-operations-ii&type=revision&diff=29181&oldid=28877], [https://discopal.ispras.ru/index.php?title=Leetcode%2Freplace-question-marks-in-string-to-minimize-its-value&type=revision&diff=29190&oldid=28850], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fnumber-of-ways-to-select-buildings&type=revision&diff=29179&oldid=28896], [https://discopal.ispras.ru/index.php?title=Leetcode%2Flength-of-the-longest-subsequence-that-sums-to-target&type=revision&diff=29176&oldid=28604], [https://discopal.ispras.ru/index.php?title=Leetcode%2Flength-of-the-longest-subsequence-that-sums-to-target&type=revision&diff=29176&oldid=28604], [https://discopal.ispras.ru/index.php?title=Leetcode%2Ffind-the-substring-with-maximum-cost&type=revision&diff=29177&oldid=28606], [https://discopal.ispras.ru/index.php?title=Leetcode%2Ffind-the-substring-with-maximum-cost&type=revision&diff=29177&oldid=28606]
 
* не портите страницы задач — вы только тратите мое время на попытки восстановить — [https://discopal.ispras.ru/index.php?title=Leetcode%2Fcheck-if-strings-can-be-made-equal-with-operations-ii&type=revision&diff=29181&oldid=28877], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fdivide-array-into-arrays-with-max-difference&type=revision&diff=29186&oldid=28866], [https://discopal.ispras.ru/index.php?title=Leetcode%2Ffind-the-substring-with-maximum-cost&type=revision&diff=29177&oldid=28606], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fhigh-access-employees&type=revision&diff=29182&oldid=28873], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fcheck-if-strings-can-be-made-equal-with-operations-ii&type=revision&diff=29181&oldid=28877], [https://discopal.ispras.ru/index.php?title=Leetcode%2Flength-of-the-longest-subsequence-that-sums-to-target&type=revision&diff=29176&oldid=28604], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fhigh-access-employees&type=revision&diff=29182&oldid=28873], [https://discopal.ispras.ru/index.php?title=Leetcode%2Flength-of-the-longest-subsequence-that-sums-to-target&type=revision&diff=29176&oldid=28604], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fmake-lexicographically-smallest-array-by-swapping-elements&type=revision&diff=29184&oldid=28871], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fminimum-cost-to-make-array-equalindromic&type=revision&diff=29185&oldid=28869], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fmaximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k&type=revision&diff=29178&oldid=29044], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fminimum-index-of-a-valid-split&type=revision&diff=29180&oldid=28881], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fminimum-number-of-pushes-to-type-word-ii&type=revision&diff=29187&oldid=28863], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fcheck-if-strings-can-be-made-equal-with-operations-ii&type=revision&diff=29181&oldid=28877], [https://discopal.ispras.ru/index.php?title=Leetcode%2Freplace-question-marks-in-string-to-minimize-its-value&type=revision&diff=29190&oldid=28850], [https://discopal.ispras.ru/index.php?title=Leetcode%2Fnumber-of-ways-to-select-buildings&type=revision&diff=29179&oldid=28896], [https://discopal.ispras.ru/index.php?title=Leetcode%2Flength-of-the-longest-subsequence-that-sums-to-target&type=revision&diff=29176&oldid=28604], [https://discopal.ispras.ru/index.php?title=Leetcode%2Flength-of-the-longest-subsequence-that-sums-to-target&type=revision&diff=29176&oldid=28604], [https://discopal.ispras.ru/index.php?title=Leetcode%2Ffind-the-substring-with-maximum-cost&type=revision&diff=29177&oldid=28606], [https://discopal.ispras.ru/index.php?title=Leetcode%2Ffind-the-substring-with-maximum-cost&type=revision&diff=29177&oldid=28606]
 +
* Решите хотя бы 14 задач.
 
{{wl-publish: 2024-05-02 13:30:01 +0000 | StasFomin }}
 
{{wl-publish: 2024-05-02 13:30:01 +0000 | StasFomin }}

Текущая версия на 15:02, 3 мая 2024