# New pages

- 01:55, 25 December 2018 Math test (hist) [13 bytes] Kmk21 (talk | contribs) (Created page with "<math> $x=\frac{1+y}{1+2z^2}$</math>")
- 05:23, 5 November 2018 Single Cut of Failure (hist) [1,248 bytes] Kmk21 (talk | contribs) (Created page with "This problems asks us how many lines are needed to intersect all given lines on a rectangle. The first intuition is that you can solve this with at most 2 lines by drawing th...")
- 05:10, 5 November 2018 Go with the Flow (hist) [1,353 bytes] Kmk21 (talk | contribs) (Created page with "This problem asks us to take a string of text, and flow it using some line length to get long vertical sequences of whitespace. The nature of flowing lines means that small c...")
- 19:34, 3 November 2018 Wireless is the New Fiber (hist) [1,439 bytes] Kmk21 (talk | contribs) (Created page with "This problem asks us to construct a tree where the degree of a as many vertices as possible matches some input. It makes sense to break this problem into a few parts: # What...")
- 18:16, 3 November 2018 Comma Sprinkler (hist) [1,616 bytes] Kmk21 (talk | contribs) (Created page with "This problem asks us to add commas to an input string with the rules that if a given word is is pre or succeeded with a comma, then every instance of that word should be as we...")
- 21:19, 2 November 2018 Catch the Plane (hist) [5,194 bytes] Kmk21 (talk | contribs) (Created page with "This problem asks gives us a bus schedule, where each bus has a probability of ACTUALLY running, and then asks us to figure out the max probability we can arrive at a given no...")
- 22:33, 15 October 2018 Das Blinkenlights (hist) [399 bytes] Kmk21 (talk | contribs) (Created page with "This problem gives us two blinking lights that blink at specified intervals, and asks if they will blink at the same time before some end-time. We can either brute force, or...")
- 07:51, 25 September 2018 Upside Down Primes (hist) [1,226 bytes] Kmk21 (talk | contribs) (Created page with "Check whether the number is prime by iterating up to sqrt(n) and seeing if any number %2 == 0. Flip the number by converting to a string, exchanging characters as appropriate,...")
- 07:50, 25 September 2018 Divisions (hist) [2,597 bytes] Kmk21 (talk | contribs) (Created page with "This problem asks us for the number of factors of a number. = Solution 1: brute force and pray = In this solution, we simply iterate up to root(n) and count the factors. We...")
- 07:47, 25 September 2018 Souveniers (hist) [1,160 bytes] Kmk21 (talk | contribs) (Created page with "This problem gives us a set of rules about how individual merchants can make change based on what type of payment we use. The key insights are that we visit the merchants in o...")
- 07:40, 25 September 2018 Milling Machines (hist) [710 bytes] Kmk21 (talk | contribs) (Created page with "This problem gives us a set (10k) of differently sized X by Y grids, and a pattern of (10k) steps of removing various parts of them and asks us to output the final size of eac...")
- 07:30, 25 September 2018 Legacy Code (hist) [625 bytes] Kmk21 (talk | contribs) (Created page with "This problem gives us a list of function names and the functions that CALL those functions and asks, given the top-level set of functions we know are called, how many listed f...")
- 07:24, 25 September 2018 Extreme Sort (hist) [154 bytes] Kmk21 (talk | contribs) (Created page with "Check if the numbers go in order. Category: ICPC Problems Category: gcpc2015 Category: Algorithm Trivial Category: Implementation Trivial")
- 06:24, 25 September 2018 Change of Scenery (hist) [878 bytes] Kmk21 (talk | contribs) (Created page with "This problem, though perhaps a bit confusingly stated, simply asks whether there are at least two shortest paths between two nodes. We can trivially run dijkstra's fast enough...")
- 06:20, 25 September 2018 Stained Glass (hist) [163 bytes] Kmk21 (talk | contribs) (Created page with "Category: ICPC Problems Category: Midatl2011 Category: Algorithm Easy Category: Implemetation Hard Category: Brute Force Category: Bitmask")
- 06:19, 25 September 2018 Carpets (hist) [600 bytes] Kmk21 (talk | contribs) (Created page with "Even though it may seem too big (7 colors * 7 instances of each color), the problem is a brute force. Create a 2d array of each 1x1 square of the room. For the top-left most u...")
- 06:13, 25 September 2018 Cake (hist) [1,208 bytes] Kmk21 (talk | contribs) (Created page with "This problem devises a way of cutting a cake based on a variable 's' and asks us what integral value of 's' yields a value closest to some desired value. From a geometry pers...")
- 06:03, 25 September 2018 Bounty Hunter II (hist) [4,007 bytes] Kmk21 (talk | contribs) (Created page with "This problem asks us the minimum number of "people" required to visit every node in a DAG if they can start and finish at any node, only follow the appropriate edges, and not...")
- 05:35, 25 September 2018 A Journey to Greece (hist) [2,379 bytes] Kmk21 (talk | contribs) (Created page with "This problem gives us a graph and asks us whether we can visit a certain subset of nodes in a given time. The caveats are # there is a given time we will spend at each node #...")
- 14:51, 28 August 2018 Fall18 (hist) [803 bytes] imported>Kmk21 (Created page with "Category:2018 Category:CS309s")