1149.md (1892B)
1 Source: https://codeforces.com/blog/entry/66783 2 3 This is the preliminary version of editorial. Expect bugs. Some changes might happen! 4 5 --- 6 7 [1150A. Stock Arbitraging](https://codeforces.com/contest/1150/problem/A) 8 9 **Tutorial** 10 11 Tutorial is loading... 12 13 **Code** 14 15 [53560020](https://codeforces.com/problemset/submission/1150/53560020) 16 17 --- 18 19 [1150B. Tiling Challenge](https://codeforces.com/contest/1150/problem/B) 20 21 **Tutorial** 22 23 Tutorial is loading... 24 25 **Code** 26 27 [53560074](https://codeforces.com/problemset/submission/1150/53560074) 28 29 --- 30 31 [1150C](https://codeforces.com/contest/1150/problem/C) / [1149A. Prefix Sum Primes](https://codeforces.com/contest/1149/problem/A) 32 33 **Tutorial** 34 35 Tutorial is loading... 36 37 **Code** 38 39 [53560113](https://codeforces.com/problemset/submission/1150/53560113) 40 41 --- 42 43 [1150D](https://codeforces.com/contest/1150/problem/D) / [1149B. Three Religions](https://codeforces.com/contest/1149/problem/B) 44 45 **Tutorial** 46 47 Tutorial is loading... 48 49 **Code** 50 51 [53560195](https://codeforces.com/problemset/submission/1150/53560195) 52 53 --- 54 55 [1150E](https://codeforces.com/contest/1150/problem/E) / [1149C. Tree Generatorâ„¢](https://codeforces.com/contest/1149/problem/C) 56 57 **Tutorial** 58 59 Tutorial is loading... 60 61 **Code** 62 63 [53560424](https://codeforces.com/problemset/submission/1150/53560424) 64 65 --- 66 67 [1149D. Abandoning Roads](https://codeforces.com/contest/1149/problem/D) 68 69 **Tutorial** 70 71 Tutorial is loading... 72 73 **Code** 74 75 [53560495](https://codeforces.com/problemset/submission/1149/53560495) 76 77 **Challenges** 78 79 * Prove that the (decision version of) the problem is NP-hard. 80 * Solve the problem in $2^{o(n)}$ time (where $o(n)$ is any function growing asymptotically slower than $n$). 81 82 --- 83 84 [1149E. Election Promises](https://codeforces.com/contest/1149/problem/E) 85 86 **Tutorial** 87 88 Tutorial is loading... 89 90 **Code** 91 92 [53560654](https://codeforces.com/problemset/submission/1149/53560654)