-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathproblemset.lisp
2 lines (1 loc) · 7.24 KB
/
problemset.lisp
1
2
((1 "Weird Algorithm") (2 "Missing Number") (3 "Repetitions") (4 "Increasing Array") (5 "Permutations") (6 "Number Spiral") (7 "Two Knights") (8 "Two Sets") (9 "Bit Strings") (10 "Trailing Zeros") (11 "Coin Piles") (12 "Palindrome Reorder") (13 "Gray Code") (14 "Tower of Hanoi") (15 "Creating Strings") (16 "Apple Division") (17 "Chessboard and Queens") (18 "Digit Queries") (19 "Grid Paths") (20 "Distinct Numbers") (21 "Apartments") (22 "Ferris Wheel") (23 "Concert Tickets") (24 "Restaurant Customers") (25 "Movie Festival") (26 "Sum of Two Values") (27 "Maximum Subarray Sum") (28 "Stick Lengths") (29 "Missing Coin Sum") (30 "Collecting Numbers") (31 "Collecting Numbers II") (32 "Playlist") (33 "Towers") (34 "Traffic Lights") (35 "Josephus Problem I") (36 "Josephus Problem II") (37 "Nested Ranges Check") (38 "Nested Ranges Count") (39 "Room Allocation") (40 "Factory Machines") (41 "Tasks and Deadlines") (42 "Reading Books") (43 "Sum of Three Values") (44 "Sum of Four Values") (45 "Nearest Smaller Values") (46 "Subarray Sums I") (47 "Subarray Sums II") (48 "Subarray Divisibility") (49 "Subarray Distinct Values") (50 "Array Division") (51 "Sliding Median") (52 "Sliding Cost") (53 "Movie Festival II") (54 "Maximum Subarray Sum II") (55 "Dice Combinations") (56 "Minimizing Coins") (57 "Coin Combinations I") (58 "Coin Combinations II") (59 "Removing Digits") (60 "Grid Paths") (61 "Book Shop") (62 "Array Description") (63 "Counting Towers") (64 "Edit Distance") (65 "Rectangle Cutting") (66 "Money Sums") (67 "Removal Game") (68 "Two Sets II") (69 "Increasing Subsequence") (70 "Projects") (71 "Elevator Rides") (72 "Counting Tilings") (73 "Counting Numbers") (74 "Counting Rooms") (75 "Labyrinth") (76 "Building Roads") (77 "Message Route") (78 "Building Teams") (79 "Round Trip") (80 "Monsters") (81 "Shortest Routes I") (82 "Shortest Routes II") (83 "High Score") (84 "Flight Discount") (85 "Cycle Finding") (86 "Flight Routes") (87 "Round Trip II") (88 "Course Schedule") (89 "Longest Flight Route") (90 "Game Routes") (91 "Investigation") (92 "Planets Queries I") (93 "Planets Queries II") (94 "Planets Cycles") (95 "Road Reparation") (96 "Road Construction") (97 "Flight Routes Check") (98 "Planets and Kingdoms") (99 "Giant Pizza") (100 "Coin Collector") (101 "Mail Delivery") (102 "De Bruijn Sequence") (103 "Teleporters Path") (104 "Hamiltonian Flights") (105 "Knight's Tour") (106 "Download Speed") (107 "Police Chase") (108 "School Dance") (109 "Distinct Routes") (110 "Static Range Sum Queries") (111 "Static Range Minimum Queries") (112 "Dynamic Range Sum Queries") (113 "Dynamic Range Minimum Queries") (114 "Range Xor Queries") (115 "Range Update Queries") (116 "Forest Queries") (117 "Hotel Queries") (118 "List Removals") (119 "Salary Queries") (120 "Prefix Sum Queries") (121 "Pizzeria Queries") (122 "Subarray Sum Queries") (123 "Distinct Values Queries") (124 "Increasing Array Queries") (125 "Forest Queries II") (126 "Range Updates and Sums") (127 "Polynomial Queries") (128 "Range Queries and Copies") (129 "Subordinates") (130 "Tree Matching") (131 "Tree Diameter") (132 "Tree Distances I") (133 "Tree Distances II") (134 "Company Queries I") (135 "Company Queries II") (136 "Distance Queries") (137 "Counting Paths") (138 "Subtree Queries") (139 "Path Queries") (140 "Path Queries II") (141 "Distinct Colors") (142 "Finding a Centroid") (143 "Fixed-Length Paths I") (144 "Fixed-Length Paths II") (145 "Josephus Queries") (146 "Exponentiation") (147 "Exponentiation II") (148 "Counting Divisors") (149 "Common Divisors") (150 "Sum of Divisors") (151 "Divisor Analysis") (152 "Prime Multiples") (153 "Counting Coprime Pairs") (154 "Binomial Coefficients") (155 "Creating Strings II") (156 "Distributing Apples") (157 "Christmas Party") (158 "Bracket Sequences I") (159 "Bracket Sequences II") (160 "Counting Necklaces") (161 "Counting Grids") (162 "Fibonacci Numbers") (163 "Throwing Dice") (164 "Graph Paths I") (165 "Graph Paths II") (166 "Dice Probability") (167 "Moving Robots") (168 "Candy Lottery") (169 "Inversion Probability") (170 "Stick Game") (171 "Nim Game I") (172 "Nim Game II") (173 "Stair Game") (174 "Grundy's Game") (175 "Another Game") (176 "Word Combinations") (177 "String Matching") (178 "Finding Borders") (179 "Finding Periods") (180 "Minimal Rotation") (181 "Longest Palindrome") (182 "Required Substring") (183 "Palindrome Queries") (184 "Finding Patterns") (185 "Counting Patterns") (186 "Pattern Positions") (187 "Distinct Substrings") (188 "Repeating Substring") (189 "String Functions") (190 "Substring Order I") (191 "Substring Order II") (192 "Substring Distribution") (193 "Point Location Test") (194 "Line Segment Intersection") (195 "Polygon Area") (196 "Point in Polygon") (197 "Polygon Lattice Points") (198 "Minimum Euclidean Distance") (199 "Convex Hull") (200 "Meet in the Middle") (201 "Hamming Distance") (202 "Beautiful Subgrids") (203 "Reachable Nodes") (204 "Reachability Queries") (205 "Cut and Paste") (206 "Substring Reversals") (207 "Reversals and Sums") (208 "Necessary Roads") (209 "Necessary Cities") (210 "Eulerian Subgraphs") (211 "Monster Game I") (212 "Monster Game II") (213 "Subarray Squares") (214 "Houses and Schools") (215 "Knuth Division") (216 "Apples and Bananas") (217 "One Bit Positions") (218 "Signal Processing") (219 "New Roads Queries") (220 "Dynamic Connectivity") (221 "Parcel Delivery") (222 "Task Assignment") (223 "Distinct Routes II") (224 "Shortest Subsequence") (225 "Counting Bits") (226 "Swap Game") (227 "Prüfer Code") (228 "Acyclic Graph Edges") (229 "Strongly Connected Edges") (230 "Even Outdegree Edges") (231 "Multiplication Table") (232 "Advertisement") (233 "Special Substrings") (234 "Permutation Inversions") (235 "Maximum Xor Subarray") (236 "Movie Festival Queries") (237 "Chess Tournament") (238 "Tree Traversals") (239 "Network Renovation") (240 "Graph Girth") (241 "Intersection Points") (242 "Inverse Inversions") (243 "Monotone Subsequences") (244 "String Reorder") (245 "Stack Weights") (246 "Pyramid Array") (247 "Increasing Subsequence II") (248 "String Removals") (249 "Bit Inversions") (250 "Xor Pyramid") (251 "Writing Numbers") (252 "String Transform") (253 "Letter Pair Move Game") (254 "Maximum Building I") (255 "Sorting Methods") (256 "Cyclic Array") (257 "List of Sums") (258 "Increasing Array II") (259 "Food Division") (260 "Bit Problem") (261 "Swap Round Sorting") (262 "Binary Subsequences") (263 "Tree Isomorphism I") (264 "Counting Sequences") (265 "Critical Cities") (266 "School Excursion") (267 "Coin Grid") (268 "Robot Path") (269 "Programmers and Artists") (270 "Course Schedule II") (271 "Removing Digits II") (272 "Coin Arrangement") (273 "Counting Bishops") (274 "Grid Puzzle I") (275 "Grid Puzzle II") (276 "Empty String") (277 "Grid Paths") (278 "Bit Substrings") (279 "Reversal Sorting") (280 "Counting Reorders") (281 "Book Shop II") (282 "Network Breakdown") (283 "Visiting Cities") (284 "Missing Coin Sum Queries") (285 "Number Grid") (286 "Maximum Building II") (287 "Filling Trominos") (288 "Stick Divisions") (289 "Coding Company") (290 "Flight Route Requests") (291 "Two Stacks Sorting") (292 "Tree Isomorphism II") (293 "Forbidden Cities") (294 "Area of Rectangles") (295 "Grid Completion") (296 "Creating Offices") (297 "Permutations II") (298 "Functional Graph Distribution") (299 "New Flight Routes") (300 "Grid Path Construction"))