1775.md (1644B)
1 Source: https://codeforces.com/blog/entry/111286 2 3 [1775A1 - Gardener and the Capybaras (easy version)](/contest/1775/problem/A1 "Codeforces Round 843 (Div. 2)") 4 5 **Solution** 6 7 Tutorial is loading... 8 9 [1775A2 - Gardener and the Capybaras (hard version)](/contest/1775/problem/A2 "Codeforces Round 843 (Div. 2)") 10 11 **Solution** 12 13 Tutorial is loading... 14 15 [1775B - Gardener and the Array](/contest/1775/problem/B "Codeforces Round 843 (Div. 2)") 16 17 **Solution** 18 19 Tutorial is loading... 20 21 [1775C - Interesting Sequence](/contest/1775/problem/C "Codeforces Round 843 (Div. 2)") 22 23 **Solution** 24 25 Tutorial is loading... 26 27 [1775D - Friendly Spiders](/contest/1775/problem/D "Codeforces Round 843 (Div. 2)") 28 29 **Solution** 30 31 Tutorial is loading... 32 33 [1775E - The Human Equation](/contest/1775/problem/E "Codeforces Round 843 (Div. 2)") 34 35 **Solution** 36 37 Tutorial is loading... 38 39 [1775F - Laboratory on Pluto](/contest/1775/problem/F "Codeforces Round 843 (Div. 2)") 40 41 **Solution** 42 43 Tutorial is loading... 44 45 Now it is time for the bonus task and author solutions! 46 47 **Bonus** 48 49 Problem A can be solved for $O(n)$ even if the alphabet consists of all letters. Think about how this can be done. 50 51 **Bonus answer** 52 53 The size of the second string is $1$. You can just go through it. 54 55 **Code for Problem A (solution for large alphabet)** 56 57 [Link](https://pastebin.com/FgbwFDwH) 58 59 **Code for Problem B** 60 61 [Link](https://pastebin.com/afRvBL6h) 62 63 **Code for Task C** 64 65 [Link](https://pastebin.com/BKe2W3XT) 66 67 **Code for Task D** 68 69 [Link](https://pastebin.com/QbWVMjWm) 70 71 **Code for Task E** 72 73 [Link](https://pastebin.com/7aRpkZNB) 74 75 **Code for Task F** 76 77 [Link](https://pastebin.com/t0xEXsfh)