{"source":"https://youkn0wwho.academy/topic-list","repository":"https://github.com/ShahjalalShohag/the-ultimate-topic-list","total":3887,"topics":{"programming":{"title":"What is Programming?","category":"Basics","subCategory":"Intro to Programming","difficulty":0,"importance":3,"order":0},"intro_to_cpp":{"title":"Intro to C++ and Setting up the Environment","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":1},"variables_and_data_types":{"title":"Data Types, Variables and Input Output","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":2},"operators":{"title":"Operators","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":3},"conditional_statements":{"title":"Conditional Statements","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":4},"loops":{"title":"Loops","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":5},"functions":{"title":"Functions","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":6},"arrays":{"title":"Arrays","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":7},"strings":{"title":"Strings","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":8},"pointers":{"title":"Pointers and References","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":9},"structures":{"title":"Structures","category":"Basics","subCategory":"Learn a Language","difficulty":0,"importance":3,"order":10},"competitive_programming":{"title":"What is Competitive Programming?","category":"Basics","subCategory":"Intro to Competitive Programming","difficulty":0,"importance":3,"order":11},"bitwise_operations":{"title":"Bitwise Operations and Bitmasks","category":"Basics","subCategory":"Bitwise Thinking","difficulty":0,"importance":3,"order":12},"complexity_analysis":{"title":"Big O Notation and Time and Space Complexity Analysis","category":"Basics","subCategory":"Complexity Analysis","difficulty":0,"importance":3,"order":13},"fast_input_output":{"title":"Fast Input Output","category":"Basics","subCategory":"Complexity Analysis","difficulty":0,"importance":3,"order":14},"recursion":{"title":"Recursion","category":"Basics","subCategory":"Recursion","difficulty":0,"importance":3,"order":15},"divisors":{"title":"Divisors","category":"Basics","subCategory":"Very Basic Math","difficulty":0,"importance":3,"order":16},"gcd_and_lcm":{"title":"GCD and LCM","category":"Basics","subCategory":"Very Basic Math","difficulty":0,"importance":3,"order":17},"harmonic_series":{"title":"Harmonic Number","category":"Basics","subCategory":"Very Basic Math","difficulty":0,"importance":3,"order":18},"prefix_sum":{"title":"Prefix Sum","category":"Basics","subCategory":"Range Queries Without Updates","difficulty":0,"importance":3,"order":19},"prefix_xor":{"title":"Prefix XOR","category":"Basics","subCategory":"Range Queries Without Updates","difficulty":0,"importance":3,"order":20},"stl_intro":{"title":"Intro to STL, Containers and Iterators","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":21},"pairs_and_tuples":{"title":"Pairs and Tuples","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":22},"vector":{"title":"Vector","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":23},"stack":{"title":"Stack","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":24},"queue":{"title":"Queue","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":25},"priority_queue":{"title":"Priority Queue","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":26},"deque":{"title":"Deque","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":27},"set":{"title":"Set, Unordered Set and Multiset","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":28},"map":{"title":"Map and Unordered Map","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":29},"bitset":{"title":"Bitset","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":3,"order":30},"list":{"title":"List / Linked List","category":"Basics","subCategory":"Standard Template Library (STL)","difficulty":0,"importance":2,"order":31},"binary_search":{"title":"Binary Search","category":"Basics","subCategory":"Leveraging Monotonicity","difficulty":0,"importance":3,"order":32},"two_pointers":{"title":"Two Pointers","category":"Basics","subCategory":"Leveraging Monotonicity","difficulty":0,"importance":3,"order":33},"bubble_sort":{"title":"Bubble Sort","category":"Basics","subCategory":"Basic Sorting Algorithms","difficulty":0,"importance":3,"order":34},"selection_sort":{"title":"Selection Sort","category":"Basics","subCategory":"Basic Sorting Algorithms","difficulty":0,"importance":3,"order":35},"insertion_sort":{"title":"Insertion Sort","category":"Basics","subCategory":"Basic Sorting Algorithms","difficulty":0,"importance":3,"order":36},"counting_sort":{"title":"Counting Sort","category":"Basics","subCategory":"Basic Sorting Algorithms","difficulty":0,"importance":3,"order":37},"merge_sort":{"title":"Merge Sort","category":"Basics","subCategory":"Basic Sorting Algorithms","difficulty":0,"importance":3,"order":38},"quick_sort":{"title":"Quick Sort","category":"Basics","subCategory":"Basic Sorting Algorithms","difficulty":0,"importance":2,"order":39},"radix_sort":{"title":"Radix Sort","category":"Basics","subCategory":"Basic Sorting Algorithms","difficulty":0,"importance":1,"order":40},"stl_sort":{"title":"C++ STL Sort and Custom Comparator","category":"Basics","subCategory":"Basic Sorting Algorithms","difficulty":0,"importance":3,"order":41},"divide_and_conquer":{"title":"Divide and Conquer","category":"Basics","subCategory":"Divide and Conquer","difficulty":0,"importance":3,"order":42},"greedy_algorithms":{"title":"Basic Greedy Algorithms","category":"Basics","subCategory":"Greedy and Constructive","difficulty":0,"importance":3,"order":43},"constructive_algorithms":{"title":"Basic Constructive Algorithms","category":"Basics","subCategory":"Greedy and Constructive","difficulty":0,"importance":3,"order":44},"2d_prefix_sum":{"title":"2D Prefix Sum","category":"Basics","subCategory":"2D Prefix Sum","difficulty":0,"importance":3,"order":45},"difference_array":{"title":"Difference Array","category":"Basics","subCategory":"More Techniques","difficulty":0,"importance":3,"order":46},"sliding_window_technique":{"title":"Sliding Window Technique","category":"Basics","subCategory":"More Techniques","difficulty":0,"importance":3,"order":47},"bit_manipulation":{"title":"Bit Manipulation","category":"Basics","subCategory":"Bit Manipulation","difficulty":0,"importance":3,"order":48},"the_xor_trick":{"title":"The XOR Trick","category":"Basics","subCategory":"Bit Manipulation","difficulty":0,"importance":3,"order":49},"binary_exponentiation":{"title":"Binary Exponentiation and Basic Modular Arithmetic","category":"Basics","subCategory":"Basic Modular Arithmetic","difficulty":0,"importance":3,"order":50},"fermats_little_theorem":{"title":"Fermat's Little Theorem and Modular Inverse","category":"Basics","subCategory":"Basic Modular Arithmetic","difficulty":0,"importance":3,"order":51},"permutations_and_combinations":{"title":"Permutations, Combinations and Basic Counting Problems","category":"Basics","subCategory":"Basic Counting","difficulty":0,"importance":3,"order":52},"stars_and_bars":{"title":"Stars and Bars","category":"Basics","subCategory":"Basic Counting","difficulty":0,"importance":3,"order":53},"pigeonhole_principle":{"title":"Pigeonhole Principle","category":"Basics","subCategory":"Basic Counting","difficulty":0,"importance":2,"order":54},"graph_representations":{"title":"Introduction to Graphs | Definitions and Representations","category":"Basics","subCategory":"Very Basic Graphs","difficulty":0,"importance":3,"order":55},"segment_tree":{"title":"Segment Tree (Point Update Range Query)","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":1,"importance":3,"order":56},"segment_tree_with_lazy_propagation":{"title":"Segment Tree with Lazy Propagation","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":1,"importance":3,"order":57},"persistent_segment_tree":{"title":"Persistent Segment Tree","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":2,"importance":3,"order":58},"persistent_segment_tree_with_lazy_propagation":{"title":"Persistent Segment Tree with Lazy Propagation","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":2,"importance":1,"order":59},"2d_segment_tree":{"title":"2D Segment Tree","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":2,"importance":1,"order":60},"dynamic_segment_tree":{"title":"Dynamic Segment Tree","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":2,"importance":2,"order":61},"2d_dynamic_segment_tree":{"title":"2D Dynamic Segment Tree","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":3,"importance":1,"order":62},"merge_sort_tree":{"title":"Merge Sort Tree","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":1,"importance":2,"order":63},"iterative_segment_tree":{"title":"Iterative Segment Tree","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":2,"importance":1,"order":64},"segment_tree_merging":{"title":"Segment Tree Merging","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":2,"importance":1,"order":65},"segment_tree_beats":{"title":"Segment Tree Beats","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":3,"importance":2,"order":66},"xor_segment_tree":{"title":"XOR Segment Tree","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":2,"importance":1,"order":67},"historic_information_on_segment_trees":{"title":"Historic Information on Segment Trees","category":"Data Structures (DS)","subCategory":"Segment Tree","difficulty":3,"importance":1,"order":68},"bit":{"title":"BIT / Fenwick Tree","category":"Data Structures (DS)","subCategory":"Binary Indexed Tree (BIT)","difficulty":1,"importance":3,"order":69},"lower_bound_on_bit":{"title":"Lower bound on BIT","category":"Data Structures (DS)","subCategory":"Binary Indexed Tree (BIT)","difficulty":1,"importance":2,"order":70},"bit_with_range_update_and_range_query":{"title":"BIT with Range Update and Range Query","category":"Data Structures (DS)","subCategory":"Binary Indexed Tree (BIT)","difficulty":2,"importance":2,"order":71},"2d_bit":{"title":"2D BIT","category":"Data Structures (DS)","subCategory":"Binary Indexed Tree (BIT)","difficulty":2,"importance":2,"order":72},"2d_bit_with_range_update_and_range_query":{"title":"2D BIT with Range Update and Range Query","category":"Data Structures (DS)","subCategory":"Binary Indexed Tree (BIT)","difficulty":3,"importance":1,"order":73},"sparse_table":{"title":"Sparse Table","category":"Data Structures (DS)","subCategory":"Sparse Table","difficulty":1,"importance":3,"order":74},"sparse_table_2d":{"title":"Sparse Table 2D","category":"Data Structures (DS)","subCategory":"Sparse Table","difficulty":2,"importance":2,"order":75},"disjoint_sparse_table":{"title":"Disjoint Sparse Table","category":"Data Structures (DS)","subCategory":"Sparse Table","difficulty":3,"importance":1,"order":76},"trie":{"title":"Trie on Strings and Bits","category":"Data Structures (DS)","subCategory":"Trie","difficulty":1,"importance":3,"order":77},"persistent_trie":{"title":"Persistent Trie","category":"Data Structures (DS)","subCategory":"Trie","difficulty":2,"importance":1,"order":78},"dsu":{"title":"DSU / Union Find","category":"Data Structures (DS)","subCategory":"Disjoint Set Union (DSU)","difficulty":1,"importance":3,"order":79},"dsu_with_rollbacks":{"title":"DSU with Rollbacks","category":"Data Structures (DS)","subCategory":"Disjoint Set Union (DSU)","difficulty":1,"importance":2,"order":80},"reachability_tree":{"title":"Reachability Tree / DSU Tree / Kruskal Reconstruction Tree (KRT)","category":"Data Structures (DS)","subCategory":"Disjoint Set Union (DSU)","difficulty":2,"importance":2,"order":81},"partially_persistent_dsu":{"title":"Partially Persistent DSU","category":"Data Structures (DS)","subCategory":"Disjoint Set Union (DSU)","difficulty":2,"importance":1,"order":82},"persistent_dsu":{"title":"Persistent DSU","category":"Data Structures (DS)","subCategory":"Disjoint Set Union (DSU)","difficulty":2,"importance":1,"order":83},"augmented_dsu":{"title":"Augmented DSU / Weighted DSU","category":"Data Structures (DS)","subCategory":"Disjoint Set Union (DSU)","difficulty":2,"importance":2,"order":84},"dsu_on_tree":{"title":"DSU on Tree and Small to Large Merging","category":"Data Structures (DS)","subCategory":"Disjoint Set Union (DSU)","difficulty":2,"importance":3,"order":85},"maintaining_log_n_dsu":{"title":"[Trick] Maintaining Log N DSU / Range Parallel DSU","category":"Data Structures (DS)","subCategory":"Disjoint Set Union (DSU)","difficulty":2,"importance":1,"order":86},"sqrt_decomposition":{"title":"Basic SQRT Decomposition","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":1,"importance":3,"order":87},"splitting_objects_into_light_and_heavy":{"title":"Splitting Objects into Light and Heavy / Case Processing","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":1,"importance":3,"order":88},"batch_processing":{"title":"Batch Processing / SQRT Decomposition on Queries","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":2,"importance":2,"order":89},"sqrt_decomposition_split_and_build_technique":{"title":"SQRT Decomposition Split and Build Technique","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":3,"importance":1,"order":90},"sqrt_fragmented_tree":{"title":"SQRT Fragmented Tree / Block Tree / SQRT Decomposition on Trees","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":3,"importance":1,"order":91},"mos_algorithm":{"title":"Mo's Algorithm","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":1,"importance":3,"order":92},"mos_with_dsu":{"title":"Rollback Mo and Mo's with DSU","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":2,"importance":2,"order":93},"mos_on_tree":{"title":"Mo's on Tree","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":2,"importance":1,"order":94},"sweepline_mo":{"title":"Sweepline Mo","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":3,"importance":1,"order":95},"mos_with_update":{"title":"Mo's with Update / 3D Mo (Offline)","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":3,"importance":1,"order":96},"mos_online":{"title":"Mo's with Update / 3D Mo (Online)","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":3,"importance":1,"order":97},"4d_mo":{"title":"4D Mo","category":"Data Structures (DS)","subCategory":"Square Root Decomposition","difficulty":3,"importance":1,"order":98},"hld":{"title":"Heavy Light Decomposition (HLD) ft Subtrees and Path Query","category":"Data Structures (DS)","subCategory":"Heavy Light Decomposition (HLD)","difficulty":2,"importance":3,"order":99},"centroid_decomposition":{"title":"Centroid Decomposition","category":"Data Structures (DS)","subCategory":"Centroid Decomposition","difficulty":2,"importance":3,"order":100},"persistent_centroid_decomposition":{"title":"Persistent Centroid Decomposition","category":"Data Structures (DS)","subCategory":"Centroid Decomposition","difficulty":3,"importance":1,"order":101},"long_path_decomposition":{"title":"Long Path Decomposition","category":"Data Structures (DS)","subCategory":"Long Path Decomposition","difficulty":3,"importance":1,"order":102},"bst":{"title":"Binary Search Tree (BST)","category":"Data Structures (DS)","subCategory":"BST","difficulty":1,"importance":3,"order":103},"treap":{"title":"Treap","category":"Data Structures (DS)","subCategory":"Balanced Binary Search Tree (BBST)","difficulty":2,"importance":3,"order":104},"implicit_treap":{"title":"Implicit Treap","category":"Data Structures (DS)","subCategory":"Balanced Binary Search Tree (BBST)","difficulty":2,"importance":3,"order":105},"persistent_treap":{"title":"Persistent Treap","category":"Data Structures (DS)","subCategory":"Balanced Binary Search Tree (BBST)","difficulty":3,"importance":1,"order":106},"rope":{"title":"Rope","category":"Data Structures (DS)","subCategory":"Balanced Binary Search Tree (BBST)","difficulty":2,"importance":1,"order":107},"splay_tree":{"title":"Splay Tree","category":"Data Structures (DS)","subCategory":"Balanced Binary Search Tree (BBST)","difficulty":3,"importance":1,"order":108},"lct":{"title":"Link Cut Tree (LCT)","category":"Data Structures (DS)","subCategory":"Link Cut Tree (LCT)","difficulty":3,"importance":3,"order":109},"ett":{"title":"Euler Tour Tree (ETT)","category":"Data Structures (DS)","subCategory":"Link Cut Tree (LCT)","difficulty":3,"importance":1,"order":110},"top_tree":{"title":"Top Tree / AAA Tree","category":"Data Structures (DS)","subCategory":"Link Cut Tree (LCT)","difficulty":4,"importance":1,"order":111},"link_cut_cactus":{"title":"Link Cut Cactus","category":"Data Structures (DS)","subCategory":"Link Cut Tree (LCT)","difficulty":4,"importance":1,"order":112},"ordered_set":{"title":"Ordered Set","category":"Data Structures (DS)","subCategory":"Policy Based Data Structures","difficulty":1,"importance":3,"order":113},"gp_hash_table":{"title":"GP Hash Table","category":"Data Structures (DS)","subCategory":"Policy Based Data Structures","difficulty":1,"importance":3,"order":114},"wavelet_tree":{"title":"Wavelet Tree","category":"Data Structures (DS)","subCategory":"More Tree Data Structures","difficulty":2,"importance":3,"order":115},"cartesian_tree":{"title":"Cartesian Tree","category":"Data Structures (DS)","subCategory":"More Tree Data Structures","difficulty":2,"importance":2,"order":116},"kd_tree":{"title":"K-Dimensional Tree (KD Tree)","category":"Data Structures (DS)","subCategory":"More Tree Data Structures","difficulty":3,"importance":2,"order":117},"sqrt_tree":{"title":"SQRT Tree","category":"Data Structures (DS)","subCategory":"More Tree Data Structures","difficulty":3,"importance":1,"order":118},"permutation_tree":{"title":"Permutation Tree","category":"Data Structures (DS)","subCategory":"More Tree Data Structures","difficulty":3,"importance":2,"order":119},"pq_tree":{"title":"PQ Tree","category":"Data Structures (DS)","subCategory":"More Tree Data Structures","difficulty":4,"importance":1,"order":120},"dynamic_connectivity_problem":{"title":"Dynamic Connectivity Problem (Offline)","category":"Data Structures (DS)","subCategory":"Dynamic Connectivity","difficulty":2,"importance":3,"order":121},"online_dynamic_connectivity_problem":{"title":"Dynamic Connectivity Problem (Online) / HDLT Algorithm","category":"Data Structures (DS)","subCategory":"Dynamic Connectivity","difficulty":4,"importance":1,"order":122},"all_subarray_maximum_minimum":{"title":"Monotonic Stack: All Nearest Smaller Values and All Subarray Maximum/Minimum","category":"Data Structures (DS)","subCategory":"Monotonic Data Structures","difficulty":1,"importance":3,"order":123},"monotonous_queue":{"title":"Monotonic Queue","category":"Data Structures (DS)","subCategory":"Monotonic Data Structures","difficulty":1,"importance":3,"order":124},"monotonous_queue_2d":{"title":"Monotonic Queue 2D","category":"Data Structures (DS)","subCategory":"Monotonic Data Structures","difficulty":1,"importance":2,"order":125},"monotonic_deque":{"title":"Monotonic Deque","category":"Data Structures (DS)","subCategory":"Monotonic Data Structures","difficulty":2,"importance":1,"order":126},"interval_set":{"title":"Interval Set","category":"Data Structures (DS)","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":127},"persistent_array":{"title":"Persistent Array","category":"Data Structures (DS)","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":128},"persistent_queue":{"title":"Persistent Queue","category":"Data Structures (DS)","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":129},"persistent_heap":{"title":"Persistent Meldable Heap / Leftist Heap","category":"Data Structures (DS)","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":130},"venice_technique":{"title":"Venice Technique","category":"Data Structures (DS)","subCategory":"Techniques","difficulty":1,"importance":2,"order":131},"offline_queries":{"title":"Offline Queries","category":"Data Structures (DS)","subCategory":"Techniques","difficulty":2,"importance":3,"order":132},"static_to_dynamic_trick":{"title":"Static to Dynamic Trick / Log Decomposition","category":"Data Structures (DS)","subCategory":"Techniques","difficulty":2,"importance":2,"order":133},"divide_and_conquer_on_queries":{"title":"Divide and Conquer on Queries","category":"Data Structures (DS)","subCategory":"Techniques","difficulty":2,"importance":3,"order":134},"cdq_divide_and_conquer":{"title":"CDQ Divide and Conquer","category":"Data Structures (DS)","subCategory":"Techniques","difficulty":2,"importance":2,"order":135},"queue_undo_trick":{"title":"Queue Undo Trick","category":"Data Structures (DS)","subCategory":"Techniques","difficulty":3,"importance":2,"order":136},"priority_queue_undo_trick":{"title":"Priority Queue Undo Trick","category":"Data Structures (DS)","subCategory":"Techniques","difficulty":3,"importance":1,"order":137},"dfs":{"title":"Depth First Search (DFS)","category":"Graph Theory","subCategory":"Graph Traversal","difficulty":1,"importance":3,"order":138},"bfs":{"title":"Breadth First Search (BFS)","category":"Graph Theory","subCategory":"Graph Traversal","difficulty":1,"importance":3,"order":139},"dfs_tree":{"title":"DFS Tree","category":"Graph Theory","subCategory":"Graph Traversal","difficulty":1,"importance":3,"order":140},"topological_sorting":{"title":"Topological Sorting","category":"Graph Theory","subCategory":"Graph Traversal","difficulty":1,"importance":3,"order":141},"tree_diameter":{"title":"Tree Diameter","category":"Graph Theory","subCategory":"Graph Traversal","difficulty":1,"importance":3,"order":142},"euler_tour_technique":{"title":"Euler Tour Technique","category":"Graph Theory","subCategory":"Graph Traversal","difficulty":1,"importance":3,"order":143},"inverse_graph":{"title":"Inverse Graph","category":"Graph Theory","subCategory":"Graph Traversal","difficulty":2,"importance":2,"order":144},"binary_lifting_and_lca":{"title":"Binary Lifting and LCA","category":"Graph Theory","subCategory":"Lowest Common Ancestor (LCA)","difficulty":1,"importance":3,"order":145},"lca_in_o1":{"title":"LCA in O(1)","category":"Graph Theory","subCategory":"Lowest Common Ancestor (LCA)","difficulty":2,"importance":1,"order":146},"scc":{"title":"Strongly Connected Components (SCC)","category":"Graph Theory","subCategory":"Graph Connectivity","difficulty":1,"importance":3,"order":147},"incremental_scc":{"title":"Incremental SCC","category":"Graph Theory","subCategory":"Graph Connectivity","difficulty":4,"importance":1,"order":148},"articulation_bridges_and_bridge_tree":{"title":"Articulation Bridges and Bridge Tree","category":"Graph Theory","subCategory":"Graph Connectivity","difficulty":1,"importance":3,"order":149},"online_articulation_bridges":{"title":"Online Articulation Bridges","category":"Graph Theory","subCategory":"Graph Connectivity","difficulty":3,"importance":1,"order":150},"articulation_points":{"title":"Articulation Points and Block Cut Tree","category":"Graph Theory","subCategory":"Graph Connectivity","difficulty":1,"importance":3,"order":151},"three_edge_connectivity":{"title":"Three Edge Connectivity","category":"Graph Theory","subCategory":"Graph Connectivity","difficulty":4,"importance":1,"order":152},"four_edge_connectivity":{"title":"Four Edge Connectivity","category":"Graph Theory","subCategory":"Graph Connectivity","difficulty":4,"importance":1,"order":153},"dynamic_k_connectivity":{"title":"Dynamic K-Connectivity","category":"Graph Theory","subCategory":"Graph Connectivity","difficulty":4,"importance":1,"order":154},"ear_decomposition":{"title":"Ear Decomposition","category":"Graph Theory","subCategory":"Graph Connectivity","difficulty":3,"importance":1,"order":155},"strong_orientation":{"title":"Strong Orientation","category":"Graph Theory","subCategory":"Orientation","difficulty":1,"importance":2,"order":156},"st_numbering":{"title":"ST-numbering / Bipolar Orientation","category":"Graph Theory","subCategory":"Orientation","difficulty":3,"importance":1,"order":157},"mst":{"title":"Minimum Spanning Tree (Prim's and Kruskal's)","category":"Graph Theory","subCategory":"Minimum Spanning Tree (MST)","difficulty":1,"importance":3,"order":158},"steiner_tree_problem":{"title":"Steiner Tree Problem","category":"Graph Theory","subCategory":"Minimum Spanning Tree (MST)","difficulty":2,"importance":2,"order":159},"boruvkas_algorithm":{"title":"Boruvka's Algorithm","category":"Graph Theory","subCategory":"Minimum Spanning Tree (MST)","difficulty":2,"importance":2,"order":160},"minimum_diameter_spanning_tree":{"title":"Minimum Diameter Spanning Tree","category":"Graph Theory","subCategory":"Minimum Spanning Tree (MST)","difficulty":3,"importance":1,"order":161},"manhattan_mst":{"title":"Manhattan MST","category":"Graph Theory","subCategory":"Minimum Spanning Tree (MST)","difficulty":2,"importance":1,"order":162},"euclidean_mst":{"title":"Euclidean MST","category":"Graph Theory","subCategory":"Minimum Spanning Tree (MST)","difficulty":3,"importance":1,"order":163},"directed_mst":{"title":"Directed MST","category":"Graph Theory","subCategory":"Minimum Spanning Tree (MST)","difficulty":3,"importance":2,"order":164},"dynamic_mst":{"title":"Dynamic MST","category":"Graph Theory","subCategory":"Minimum Spanning Tree (MST)","difficulty":3,"importance":1,"order":165},"kirchoffs_theorem_ft_number_of_msts":{"title":"Kirchoffs Theorem ft Number of MSTs","category":"Graph Theory","subCategory":"Minimum Spanning Tree (MST)","difficulty":2,"importance":2,"order":166},"dijkstras_algorithm":{"title":"Dijkstra's Algorithm","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":1,"importance":3,"order":167},"dijkstra_on_segment_tree":{"title":"[Trick] Dijkstra on Segment Tree","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":2,"importance":2,"order":168},"floyd_warshall":{"title":"Floyd Warshall","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":1,"importance":3,"order":169},"bellman_ford":{"title":"Bellman Ford","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":1,"importance":3,"order":170},"spfa":{"title":"Shortest Path Faster Algorithm (SPFA)","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":2,"importance":1,"order":171},"johnsons_algorithm":{"title":"Johnson's Alogrithm","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":2,"importance":1,"order":172},"0_1_bfs":{"title":"0/1 BFS","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":1,"importance":2,"order":173},"dials_algorithm":{"title":"Dial's algorithm","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":2,"importance":1,"order":174},"eppsteins_algorithm":{"title":"Eppsteins Algorithm","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":4,"importance":1,"order":175},"suurballes_algorithm":{"title":"Suurballe's Algorithm","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":3,"importance":1,"order":176},"a_star_algorithm":{"title":"A* Algorithm","category":"Graph Theory","subCategory":"Shortest Paths","difficulty":2,"importance":2,"order":177},"cycle_detection":{"title":"Cycle Detection","category":"Graph Theory","subCategory":"Cycles","difficulty":1,"importance":3,"order":178},"minimum_weight_cycle_for_each_vertex":{"title":"[Problem] Minimum Weight Cycle For Each Vertex","category":"Graph Theory","subCategory":"Cycles","difficulty":2,"importance":2,"order":179},"minimum_weight_cycle_for_each_edge":{"title":"[Problem] Minimum Weight Cycle For Each Edge","category":"Graph Theory","subCategory":"Cycles","difficulty":2,"importance":2,"order":180},"minimum_mean_weight_cycle":{"title":"Minimum Mean Weight Cycle","category":"Graph Theory","subCategory":"Cycles","difficulty":2,"importance":1,"order":181},"number_of_3_and_4_length_cycles":{"title":"Number of 3 and 4 length Cycles","category":"Graph Theory","subCategory":"Cycles","difficulty":3,"importance":2,"order":182},"virtual_tree":{"title":"Virtual Tree / Auxiliary Tree","category":"Graph Theory","subCategory":"More Tree Stuff","difficulty":2,"importance":3,"order":183},"rerooting_technique":{"title":"Rerooting Technique","category":"Graph Theory","subCategory":"More Tree Stuff","difficulty":2,"importance":3,"order":184},"path_union":{"title":"Union of Two Paths on a Tree","category":"Graph Theory","subCategory":"More Tree Stuff","difficulty":2,"importance":2,"order":185},"path_intersection":{"title":"Intersection of Two Paths on a Tree","category":"Graph Theory","subCategory":"More Tree Stuff","difficulty":2,"importance":2,"order":186},"number_of_paths_of_each_length_in_a_tree":{"title":"[Problem] Number of Paths of Each Length in a Tree","category":"Graph Theory","subCategory":"More Tree Stuff","difficulty":2,"importance":2,"order":187},"dynamic_diameter_online":{"title":"Dynamic Online Tree Diameter","category":"Graph Theory","subCategory":"More Tree Stuff","difficulty":2,"importance":1,"order":188},"tree_orientation_to_maximize_pairs_of_reachable_nodes":{"title":"[Problem] Tree Orientation to Maximize Pairs of Reachable Nodes","category":"Graph Theory","subCategory":"More Tree Stuff","difficulty":3,"importance":1,"order":189},"2_sat":{"title":"2 SAT","category":"Graph Theory","subCategory":"Satisfiability","difficulty":1,"importance":3,"order":190},"3_sat":{"title":"3 SAT","category":"Graph Theory","subCategory":"Satisfiability","difficulty":4,"importance":1,"order":191},"system_of_difference_constraints":{"title":"System Of Difference Constraints","category":"Graph Theory","subCategory":"Satisfiability","difficulty":2,"importance":2,"order":192},"eulerian_path_and_cycle":{"title":"Eulerian Path and Cycle","category":"Graph Theory","subCategory":"Eulerian Path","difficulty":1,"importance":3,"order":193},"hamiltonian_path_and_cycle":{"title":"Hamiltonian Path and Cycle","category":"Graph Theory","subCategory":"Hamiltonian Path","difficulty":1,"importance":2,"order":194},"hamiltonian_path_heuristic_algorithm":{"title":"Hamiltonian Path Heuristic Algorithm","category":"Graph Theory","subCategory":"Hamiltonian Path","difficulty":4,"importance":1,"order":195},"maximum_clique":{"title":"Maximum Clique","category":"Graph Theory","subCategory":"Cliques and Independent Sets","difficulty":2,"importance":3,"order":196},"maximum_independent_set":{"title":"Maximum Independent Set (MIS)","category":"Graph Theory","subCategory":"Cliques and Independent Sets","difficulty":2,"importance":3,"order":197},"chromatic_number":{"title":"Chromatic Number","category":"Graph Theory","subCategory":"Graph Coloring","difficulty":2,"importance":2,"order":198},"welsh_powell_algorithm":{"title":"Welsh-Powell Algorithm","category":"Graph Theory","subCategory":"Graph Coloring","difficulty":2,"importance":1,"order":199},"chromatic_polynomial_ft_number_of_dags":{"title":"Chromatic Polynomial ft Number of DAGs","category":"Graph Theory","subCategory":"Graph Coloring","difficulty":4,"importance":1,"order":200},"edge_coloring_of_simple_graph":{"title":"Edge Coloring of Simple Graph","category":"Graph Theory","subCategory":"Graph Coloring","difficulty":3,"importance":1,"order":201},"edge_coloring_of_bipartite_graph":{"title":"Edge Coloring of Bipartite Graph","category":"Graph Theory","subCategory":"Graph Coloring","difficulty":3,"importance":1,"order":202},"counting_labeled_graphs":{"title":"Counting Labeled Graphs","category":"Graph Theory","subCategory":"Graph Counting","difficulty":2,"importance":1,"order":203},"prufer_code":{"title":"Prufer Code","category":"Graph Theory","subCategory":"Graph Counting","difficulty":2,"importance":3,"order":204},"number_of_arborescences_with_n_nodes":{"title":"[Problem] Number of Arborescences with n Nodes","category":"Graph Theory","subCategory":"Graph Counting","difficulty":3,"importance":1,"order":205},"tuttes_theorem_ft_arborescences_in_a_graph":{"title":"Tuttes Theorem ft Arborescences in a Graph","category":"Graph Theory","subCategory":"Graph Counting","difficulty":3,"importance":1,"order":206},"best_theorem":{"title":"BEST Theorem","category":"Graph Theory","subCategory":"Graph Counting","difficulty":3,"importance":1,"order":207},"dag_reachability":{"title":"DAG Reachability","category":"Graph Theory","subCategory":"Dynamic Acyclic Graphs (DAG)","difficulty":2,"importance":2,"order":208},"dynamic_dag_reachability":{"title":"Incremental DAG Reachability","category":"Graph Theory","subCategory":"Dynamic Acyclic Graphs (DAG)","difficulty":3,"importance":1,"order":209},"dominator_tree":{"title":"Dominator Tree","category":"Graph Theory","subCategory":"Dominators","difficulty":3,"importance":2,"order":210},"cactus_graph":{"title":"Cactus Graph","category":"Graph Theory","subCategory":"Special Graphs","difficulty":2,"importance":2,"order":211},"tournament_graph":{"title":"Tournament Graph","category":"Graph Theory","subCategory":"Special Graphs","difficulty":2,"importance":2,"order":212},"chordal_graph":{"title":"Chordal Graph","category":"Graph Theory","subCategory":"Special Graphs","difficulty":3,"importance":1,"order":213},"max_flow":{"title":"Maximum Flow / Minimum Cut","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":2,"importance":3,"order":214},"min_cost_max_flow":{"title":"Min Cost Max Flow (MCMF)","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":2,"importance":3,"order":215},"min_cost_max_flow_with_negative_cycles":{"title":"Min Cost Max Flow with Negative Cycles","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":3,"importance":1,"order":216},"maximum_closure_problem":{"title":"Maximum Closure Problem","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":2,"importance":2,"order":217},"l_r_flow":{"title":"L-R Flow","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":3,"importance":2,"order":218},"gomory_hu_tree":{"title":"Gomory-Hu Tree","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":3,"importance":1,"order":219},"gomory_hu_tree_of_a_planar_graph":{"title":"Gomory-Hu Tree of a Planar Graph","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":4,"importance":1,"order":220},"stoer_wagner_algorithm":{"title":"Stoer Wagner Algorithm","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":3,"importance":2,"order":221},"chinese_postman_problem":{"title":"Chinese Postman Problem","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":2,"importance":2,"order":222},"unique_min_cut":{"title":"Uniqueness of Min Cut","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":2,"importance":1,"order":223},"maximum_density_subgraph":{"title":"Maximum Density Subgraph","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":3,"importance":1,"order":224},"min_cut_in_a_planar_graph":{"title":"Min Cut in a Planar Graph","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":3,"importance":2,"order":225},"max_cut_in_a_planar_graph":{"title":"Max Cut in a Planar Graph","category":"Graph Theory","subCategory":"Flow and Min Cut","difficulty":4,"importance":1,"order":226},"bipartite_matching":{"title":"Bipartite Matching (HopCroft Karp Algorithm and Kuhn's Algorithm)","category":"Graph Theory","subCategory":"Matching","difficulty":2,"importance":3,"order":227},"hungarian_algorithm":{"title":"Hungarian Algorithm / Bipartite Weighted Matching","category":"Graph Theory","subCategory":"Matching","difficulty":2,"importance":3,"order":228},"blossom_algorithm_unweighted":{"title":"Blossom Algorithm Unweighted / General Matching / Randomized General Matching","category":"Graph Theory","subCategory":"Matching","difficulty":3,"importance":2,"order":229},"blossom_algorithm_weighted":{"title":"Blossom Algorithm Weighted / General Weighted Matching","category":"Graph Theory","subCategory":"Matching","difficulty":4,"importance":1,"order":230},"stable_marriage_problem":{"title":"Stable Marriage Problem","category":"Graph Theory","subCategory":"Matching","difficulty":2,"importance":1,"order":231},"maximum_independent_set_in_bipartite_graphs":{"title":"Konig's Theorem and Maximum Independent Set in Bipartite Graphs","category":"Graph Theory","subCategory":"Matching","difficulty":2,"importance":2,"order":232},"halls_theorem":{"title":"Halls Theorem","category":"Graph Theory","subCategory":"Matching","difficulty":2,"importance":2,"order":233},"matching_using_determinants":{"title":"Matching using Determinants","category":"Graph Theory","subCategory":"Matching","difficulty":3,"importance":1,"order":234},"poset_ft_dilworths_and_mirskys_theorem":{"title":"POSET ft Dilworth's and Mirsky's Theorem","category":"Graph Theory","subCategory":"Partially Ordered Set (POSET)","difficulty":2,"importance":3,"order":235},"functional_graphs":{"title":"Functional Graphs","category":"Graph Theory","subCategory":"Miscellaneous","difficulty":1,"importance":2,"order":236},"degree_sequences":{"title":"Degree Sequences","category":"Graph Theory","subCategory":"Miscellaneous","difficulty":2,"importance":2,"order":237},"tree_isomorphism":{"title":"Tree Isomorphism","category":"Graph Theory","subCategory":"Miscellaneous","difficulty":2,"importance":2,"order":238},"binarizing_a_tree":{"title":"Binarizing a Tree","category":"Graph Theory","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":239},"planarity_check":{"title":"Planarity Check","category":"Graph Theory","subCategory":"Miscellaneous","difficulty":4,"importance":1,"order":240},"sieve":{"title":"Sieve, Prime Factorization and Divisors","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":1,"importance":3,"order":241},"linear_sieve":{"title":"Linear Sieve","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":1,"importance":2,"order":242},"segmented_sieve":{"title":"Segmented Sieve","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":1,"importance":2,"order":243},"sieve_upto_1e9":{"title":"Sieve upto 1e9","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":3,"importance":1,"order":244},"miller_rabin_primality_test":{"title":"Miller-Rabin Primality Test","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":2,"importance":2,"order":245},"pollard_rho":{"title":"Pollard Rho","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":2,"importance":2,"order":246},"prime_counting_function":{"title":"Prime Counting Function","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":2,"importance":2,"order":247},"k_divisors":{"title":"[Problem] Counting Numbers Having Exactly K Divisors","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":2,"importance":1,"order":248},"smallest_number_having_exactly_k_divisors":{"title":"[Problem] Smallest Number Having Exactly K Divisors","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":2,"importance":1,"order":249},"sum_of_the_number_of_divisors_in_cbrt_n":{"title":"Sum of The Number of Divisors in cbrt(n)","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":4,"importance":1,"order":250},"wilsons_theorem":{"title":"Wilson's Theorem","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":2,"importance":2,"order":251},"implicit_prime_factorization":{"title":"Implicit Prime Factorization","category":"Number Theory","subCategory":"Primes and Divisors","difficulty":3,"importance":1,"order":252},"sigma_function":{"title":"Number of Divisors / Sum of Divisors / Sigma Function","category":"Number Theory","subCategory":"Multiplicative Functions","difficulty":1,"importance":3,"order":253},"eulers_totient_function":{"title":"Euler's Totient Function / Phi Function","category":"Number Theory","subCategory":"Multiplicative Functions","difficulty":1,"importance":3,"order":254},"power_tower":{"title":"Power Tower /  Generalized Euler theorem","category":"Number Theory","subCategory":"Multiplicative Functions","difficulty":2,"importance":2,"order":255},"mobius_function":{"title":"Mobius Function and Mobius Inversion","category":"Number Theory","subCategory":"Multiplicative Functions","difficulty":2,"importance":3,"order":256},"dirichlet_convolution":{"title":"Dirichlet convolution","category":"Number Theory","subCategory":"Multiplicative Functions","difficulty":2,"importance":2,"order":257},"min_25_sieve":{"title":"Min_25 Sieve","category":"Number Theory","subCategory":"Multiplicative Functions","difficulty":3,"importance":1,"order":258},"powerful_number_sieve":{"title":"Powerful Number Sieve / PN Sieve","category":"Number Theory","subCategory":"Multiplicative Functions","difficulty":3,"importance":1,"order":259},"euclidean_algorithm":{"title":"Euclidean Algorithm","category":"Number Theory","subCategory":"Euclidean Algorithm","difficulty":1,"importance":3,"order":260},"extended_euclid":{"title":"Extended Euclid","category":"Number Theory","subCategory":"Euclidean Algorithm","difficulty":1,"importance":3,"order":261},"bezouts_identity":{"title":"Bezout's Identity","category":"Number Theory","subCategory":"Euclidean Algorithm","difficulty":1,"importance":3,"order":262},"chicken_mcnugget_theorem":{"title":"Chicken McNugget Theorem","category":"Number Theory","subCategory":"Euclidean Algorithm","difficulty":1,"importance":2,"order":263},"linear_congruence_equation":{"title":"Linear Congruence Equation","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":1,"importance":2,"order":264},"crt":{"title":"Chinese Remainder Theorem (CRT)","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":1,"importance":3,"order":265},"primitive_root":{"title":"Primitive Root","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":2,"importance":2,"order":266},"multiplicative_order":{"title":"Multiplicative Order and Carmichael's Lambda Function","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":2,"importance":2,"order":267},"discrete_log":{"title":"Discrete Log / Baby Step Giant Step","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":2,"importance":3,"order":268},"discrete_root":{"title":"Discrete Root","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":2,"importance":2,"order":269},"discrete_root_in_o_p_1_4":{"title":"Discrete Root in O(P^(1/4))","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":4,"importance":1,"order":270},"tonelli_shanks_algorithm":{"title":"Discrete Square Root, Tonelli Shanks Algorithm, Cipolla's Algorithm","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":3,"importance":1,"order":271},"number_of_distinct_kth_powers_modulo_n":{"title":"Number of Distinct Kth Powers Modulo N","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":3,"importance":1,"order":272},"number_of_solutions_to_x_2_1_mod_m":{"title":"Number of Solutions to X^2 = 1 mod M","category":"Number Theory","subCategory":"Modular Arithmetic","difficulty":2,"importance":1,"order":273},"linear_diophantine_equation_with_two_variables":{"title":"Linear Diophantine Equation with Two Variables","category":"Number Theory","subCategory":"Linear Diophantine Equations","difficulty":1,"importance":3,"order":274},"linear_diophantine_equation_with_n_variables":{"title":"Linear Diophantine Equation with N Variables","category":"Number Theory","subCategory":"Linear Diophantine Equations","difficulty":2,"importance":2,"order":275},"trivariable_linear_diophantine_equation_with_nonnegative_solutions":{"title":"Trivariable Linear Diophantine Equation with Nonnegative Solutions","category":"Number Theory","subCategory":"Linear Diophantine Equations","difficulty":4,"importance":1,"order":276},"multivariable_linear_diophantine_equation_with_nonnegative_solutions":{"title":"Multivariable Linear Diophantine Equation with Nonnegative Solutions","category":"Number Theory","subCategory":"Linear Diophantine Equations","difficulty":2,"importance":2,"order":277},"linear_diophantine_with_n_unknowns_and_two_equations":{"title":"Linear Diophantine With N Unknowns and Two Equations","category":"Number Theory","subCategory":"Linear Diophantine Equations","difficulty":2,"importance":1,"order":278},"number_of_solutions_to_a_basic_linear_algebraic_equation":{"title":"Number of Solutions to a Basic Linear Algebraic Equation","category":"Number Theory","subCategory":"Solutions to Equations","difficulty":1,"importance":3,"order":279},"number_of_solutions_to_a_basic_linear_algebraic_equation_with_variable_upper_bound_constraints":{"title":"Number of Solutions to a Basic Linear Algebraic Equation using Meet in the Middle","category":"Number Theory","subCategory":"Solutions to Equations","difficulty":3,"importance":1,"order":280},"number_of_nonnegative_integer_solutions_to_ax_by_c":{"title":"Number of Nonnegative Integer Solutions to ax + by ≤ c","category":"Number Theory","subCategory":"Solutions to Equations","difficulty":3,"importance":2,"order":281},"number_of_integer_solutions_to_1_x_1_y_1_k":{"title":"Number of Integer Solutions to 1/x + 1/y = 1/k","category":"Number Theory","subCategory":"Solutions to Equations","difficulty":2,"importance":1,"order":282},"two_squares_theorem":{"title":"Two / Three / Four Squares Theorem","category":"Number Theory","subCategory":"Solutions to Equations","difficulty":3,"importance":1,"order":283},"pells_equation":{"title":"Pell's Equation","category":"Number Theory","subCategory":"Solutions to Equations","difficulty":3,"importance":1,"order":284},"sum_of_floors":{"title":"Sum of Floors","category":"Number Theory","subCategory":"Floor Sum","difficulty":1,"importance":3,"order":285},"floor_sum_of_arithmetic_progression":{"title":"Floor Sum and Mod Sum of Arithmetic Progression","category":"Number Theory","subCategory":"Floor Sum","difficulty":2,"importance":2,"order":286},"generalized_floor_sum_of_arithmetic_progression":{"title":"Generalized Floor Sum of Arithmetic Progression","category":"Number Theory","subCategory":"Floor Sum","difficulty":4,"importance":1,"order":287},"fibonacci_numbers":{"title":"Fibonacci Numbers","category":"Number Theory","subCategory":"Fibonacci Numbers","difficulty":1,"importance":3,"order":288},"lcm_of_fibonacci_numbers":{"title":"[Problem] LCM of Fibonacci Numbers","category":"Number Theory","subCategory":"Fibonacci Numbers","difficulty":2,"importance":1,"order":289},"pisano_period":{"title":"Pisano Period","category":"Number Theory","subCategory":"Fibonacci Numbers","difficulty":3,"importance":1,"order":290},"phi_field":{"title":"Phi Field","category":"Number Theory","subCategory":"Fibonacci Numbers","difficulty":2,"importance":2,"order":291},"pythagorean_triplets":{"title":"Pythagorean Triplets","category":"Number Theory","subCategory":"Miscellaneous","difficulty":2,"importance":2,"order":292},"min_of_mod_of_arithmetic_progression":{"title":"Min of Mod of Arithmetic Progression","category":"Number Theory","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":293},"factoradic_number_system":{"title":"Factorial Number System","category":"Number Theory","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":294},"rational_approximation_stern_brocot_tree":{"title":"Stern-Brocot Tree and Rational Approximation","category":"Number Theory","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":295},"number_of_ax_mod_p_in_a_range":{"title":"[Problem] Number of a * x mod p in a Range","category":"Number Theory","subCategory":"Miscellaneous","difficulty":3,"importance":2,"order":296},"smallest_nonnegative_integer_x_s_t_l_ax_mod_p_r":{"title":"[Problem] Smallest Nonnegative Integer x s.t. l ≤ a * x mod p ≤ r","category":"Number Theory","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":297},"contribution_technique":{"title":"Contribution Technique","category":"Combinatorics","subCategory":"Techniques","difficulty":1,"importance":3,"order":298},"catalan_numbers":{"title":"Catalan Numbers","category":"Combinatorics","subCategory":"Catalan","difficulty":1,"importance":3,"order":299},"catalan_convolution":{"title":"Catalan Convolution","category":"Combinatorics","subCategory":"Catalan","difficulty":2,"importance":2,"order":300},"principle_of_inclusion_and_exclusion":{"title":"Principle of Inclusion and Exclusion (PIE)","category":"Combinatorics","subCategory":"Inclusion Exclusion","difficulty":1,"importance":3,"order":301},"derangements":{"title":"Derangements","category":"Combinatorics","subCategory":"Inclusion Exclusion","difficulty":1,"importance":3,"order":302},"inclusion_and_exclusion_on_multiples":{"title":"Inclusion Exclusion on Multiples","category":"Combinatorics","subCategory":"Inclusion Exclusion","difficulty":1,"importance":3,"order":303},"lucas_theorem":{"title":"Lucas Theorem","category":"Combinatorics","subCategory":"Factorials and Binomial Coefficients (nCr)","difficulty":1,"importance":3,"order":304},"ncr_modulo_any_mod":{"title":"nCr Modulo Any Mod","category":"Combinatorics","subCategory":"Factorials and Binomial Coefficients (nCr)","difficulty":2,"importance":2,"order":305},"large_factorials":{"title":"Large Factorials and Binomial Coefficients","category":"Combinatorics","subCategory":"Factorials and Binomial Coefficients (nCr)","difficulty":3,"importance":2,"order":306},"legendres_formula":{"title":"Legendre's Formula","category":"Combinatorics","subCategory":"Factorials and Binomial Coefficients (nCr)","difficulty":1,"importance":2,"order":307},"prefix_sum_queries_of_nci":{"title":"Prefix Sum Queries of Binomial Coefficients","category":"Combinatorics","subCategory":"Factorials and Binomial Coefficients (nCr)","difficulty":2,"importance":2,"order":308},"sum_of_nci_for_a_fixed_large_n":{"title":"Prefix Sum of Binomial Coefficients for a Fixed Large N","category":"Combinatorics","subCategory":"Factorials and Binomial Coefficients (nCr)","difficulty":3,"importance":1,"order":309},"sum_of_ncr_over_a_fixed_congruence_class":{"title":"Sum of nCr Over a Fixed Congruence Class","category":"Combinatorics","subCategory":"Factorials and Binomial Coefficients (nCr)","difficulty":2,"importance":2,"order":310},"sum_of_ncr_a_i_k_for_each_k_from_1_to_n":{"title":"[Problem] Sum of nCr(a[i], K) for each K from 1 to N","category":"Combinatorics","subCategory":"Factorials and Binomial Coefficients (nCr)","difficulty":2,"importance":2,"order":311},"stirling_numbers":{"title":"Stirling Numbers (Basic)","category":"Combinatorics","subCategory":"Stirling Numbers","difficulty":1,"importance":3,"order":312},"stirling_number_of_the_first_kind_for_fixed_n":{"title":"Stirling Number of the First Kind for Fixed N","category":"Combinatorics","subCategory":"Stirling Numbers","difficulty":2,"importance":2,"order":313},"stirling_number_of_the_first_kind_for_fixed_k":{"title":"Stirling Number of the First Kind for Fixed K","category":"Combinatorics","subCategory":"Stirling Numbers","difficulty":3,"importance":1,"order":314},"stirling_number_of_the_second_kind_for_fixed_n":{"title":"Stirling Number of the Second Kind for Fixed N","category":"Combinatorics","subCategory":"Stirling Numbers","difficulty":2,"importance":2,"order":315},"stirling_number_of_the_second_kind_for_fixed_k":{"title":"Stirling Number of the Second Kind for Fixed K","category":"Combinatorics","subCategory":"Stirling Numbers","difficulty":3,"importance":1,"order":316},"partition_function":{"title":"Partitions of an Integer, Partition Function and Pentagonal Number Theorem","category":"Combinatorics","subCategory":"Partitions","difficulty":3,"importance":2,"order":317},"bell_number":{"title":"Partitions of a Set / Bell Number","category":"Combinatorics","subCategory":"Partitions","difficulty":3,"importance":2,"order":318},"burnside_lemma":{"title":"Burnside's Lemma / Polya Enumeration Theorem","category":"Combinatorics","subCategory":"Miscellaneous","difficulty":2,"importance":2,"order":319},"bertrands_ballot_theorem":{"title":"Bertrand's Ballot Theorem","category":"Combinatorics","subCategory":"Miscellaneous","difficulty":1,"importance":2,"order":320},"young_tableaus":{"title":"Young Tableaus and the Hook Length Formula","category":"Combinatorics","subCategory":"Miscellaneous","difficulty":4,"importance":1,"order":321},"fft":{"title":"Fast Fourier Transform (FFT)","category":"Math","subCategory":"Convolution","difficulty":2,"importance":3,"order":322},"ntt":{"title":"Number Theoretic Transform (NTT)","category":"Math","subCategory":"Convolution","difficulty":2,"importance":3,"order":323},"2d_fft_ntt":{"title":"2D FFT / NTT","category":"Math","subCategory":"Convolution","difficulty":2,"importance":2,"order":324},"online_ntt":{"title":"Online FFT / NTT","category":"Math","subCategory":"Convolution","difficulty":3,"importance":2,"order":325},"fwht":{"title":"Fast Walsh Hadamard Transform (FWHT) and its Variations","category":"Math","subCategory":"Convolution","difficulty":2,"importance":3,"order":326},"gcd_convolution":{"title":"GCD Convolution","category":"Math","subCategory":"Convolution","difficulty":2,"importance":2,"order":327},"lcm_convolution":{"title":"LCM Convolution","category":"Math","subCategory":"Convolution","difficulty":2,"importance":2,"order":328},"generating_functions":{"title":"Generating Functions","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":3,"order":329},"polynomial_inverse":{"title":"Polynomial Inverse","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":330},"polynomial_exp":{"title":"Polynomial Exp","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":331},"polynomial_log":{"title":"Polynomial Log","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":332},"polynomial_pow":{"title":"Polynomial Pow","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":3,"order":333},"polynomial_sqrt":{"title":"Polynomial Sqrt","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":334},"polynomial_composition":{"title":"Polynomial Composition","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":1,"order":335},"multipoint_evaluation":{"title":"Multipoint Evaluation","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":336},"chirp_z_transform":{"title":"Chirp Z Transform","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":337},"polynomial_interpolation":{"title":"Polynomial Interpolation","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":338},"polynomial_shift":{"title":"Polynomial Shift","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":339},"polynomial_shift_sampling_points":{"title":"Shift of Sampling Points of Polynomial","category":"Math","subCategory":"Polynomial","difficulty":4,"importance":1,"order":340},"polynomial_division_and_remainder":{"title":"Polyomial Division and Remainder","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":341},"polynomial_roots_under_modulo":{"title":"Polynomial Roots Under a Modulo","category":"Math","subCategory":"Polynomial","difficulty":4,"importance":1,"order":342},"resultant_of_two_polynomials":{"title":"Resultant of Two Polynomials and Half-GCD Algorithm","category":"Math","subCategory":"Polynomial","difficulty":4,"importance":1,"order":343},"lagrange_interpolation":{"title":"Lagrange Interpolation","category":"Math","subCategory":"Polynomial","difficulty":2,"importance":3,"order":344},"polynomial_sum":{"title":"[Problem] Sum of r^i * poly(i)","category":"Math","subCategory":"Polynomial","difficulty":4,"importance":1,"order":345},"polynomial_with_binomial_coefficients":{"title":"Polynomial with Binomial Coefficients","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":1,"order":346},"subset_sum_problem_using_generating_functions":{"title":"Subset Sum Problem using Generating Functions","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":2,"order":347},"polynomial_factorization_of_xn_minus_1":{"title":"Polynomial Factorization of (x^n - 1) and Cyclotomic Polynomials","category":"Math","subCategory":"Polynomial","difficulty":4,"importance":1,"order":348},"schwartz_zippel_lemma":{"title":"Schwartz–Zippel Lemma","category":"Math","subCategory":"Polynomial","difficulty":3,"importance":1,"order":349},"lagrange_inversion_theorem":{"title":"Lagrange Inversion Theorem","category":"Math","subCategory":"Polynomial","difficulty":4,"importance":1,"order":350},"matrix_exponentiation":{"title":"Matrix Exponentiation","category":"Math","subCategory":"Matrices","difficulty":1,"importance":3,"order":351},"permanent_of_a_matrix":{"title":"Permanent of a Matrix","category":"Math","subCategory":"Matrices","difficulty":2,"importance":2,"order":352},"freivalds_algorithm":{"title":"Freivald's Algorithm","category":"Math","subCategory":"Matrices","difficulty":2,"importance":1,"order":353},"vandermonde_matrix":{"title":"Vandermonde Matrix","category":"Math","subCategory":"Matrices","difficulty":3,"importance":1,"order":354},"hafnian_of_a_matrix":{"title":"Hafnian of a Matrix / Number of Perfect Matchings in a Graph","category":"Math","subCategory":"Matrices","difficulty":4,"importance":1,"order":355},"frobenius_form_of_a_matrix":{"title":"Frobenius Form of a Matrix and Fast Matrix Power","category":"Math","subCategory":"Matrices","difficulty":4,"importance":1,"order":356},"linear_recurrence_relations":{"title":"Linear Recurrence Relations","category":"Math","subCategory":"Linear Recurrence","difficulty":2,"importance":2,"order":357},"linear_recurrence_using_cayley_hamilton_theorem":{"title":"Linear Recurrence using Cayley-Hamilton Theorem in O(N^2 log K)","category":"Math","subCategory":"Linear Recurrence","difficulty":2,"importance":3,"order":358},"linear_recurrence_using_generating_functions":{"title":"Linear Recurrence using Generating Functions in O(N log N log K)","category":"Math","subCategory":"Linear Recurrence","difficulty":3,"importance":2,"order":359},"linear_recurrence_with_polynomial_coefficients":{"title":"Linear Recurrence with Polynomial Coefficients","category":"Math","subCategory":"Linear Recurrence","difficulty":4,"importance":1,"order":360},"linear_recurrence_on_matrices":{"title":"Linear Recurrence on Matrices","category":"Math","subCategory":"Linear Recurrence","difficulty":3,"importance":1,"order":361},"generating_function_of_a_linear_recurrence":{"title":"Generating Function of a Linear Recurrence","category":"Math","subCategory":"Linear Recurrence","difficulty":3,"importance":1,"order":362},"berlekamp_messey":{"title":"Berlekamp Massey","category":"Math","subCategory":"Linear Recurrence","difficulty":3,"importance":3,"order":363},"reeds_sloane_algorithm":{"title":"Reeds-Sloane Algorithm","category":"Math","subCategory":"Linear Recurrence","difficulty":4,"importance":1,"order":364},"gaussian_elimination":{"title":"Gaussian Elimination","category":"Math","subCategory":"Linear Algebra","difficulty":2,"importance":3,"order":365},"gaussian_elimination_modulo_2":{"title":"Gaussian Elimination Modulo 2","category":"Math","subCategory":"Linear Algebra","difficulty":2,"importance":2,"order":366},"determinant_under_prime_modulo":{"title":"Determinant of a Matrix","category":"Math","subCategory":"Linear Algebra","difficulty":2,"importance":2,"order":367},"determinant_under_composite_modulo":{"title":"Determinant under Composite Modulo","category":"Math","subCategory":"Linear Algebra","difficulty":3,"importance":1,"order":368},"characteristic_polynomial":{"title":"Characteristic Polynomial and Hesserberg Matrix","category":"Math","subCategory":"Linear Algebra","difficulty":3,"importance":1,"order":369},"determinant_of_product_matrix":{"title":"[Problem] Determinant of Product Matrix","category":"Math","subCategory":"Linear Algebra","difficulty":3,"importance":1,"order":370},"determinant_of_sparse_matrix":{"title":"Determinant of Sparse Matrix and Black Box Linear Algebra","category":"Math","subCategory":"Linear Algebra","difficulty":4,"importance":1,"order":371},"determinant_of_permutant_matrix":{"title":"[Problem] Determinant of Permutant and Circulant Matrix","category":"Math","subCategory":"Linear Algebra","difficulty":4,"importance":1,"order":372},"gcd_determinant":{"title":"GCD Determinant / Smith's Determinant","category":"Math","subCategory":"Linear Algebra","difficulty":3,"importance":1,"order":373},"cauchy_binet_formula":{"title":"Cauchy–Binet formula","category":"Math","subCategory":"Linear Algebra","difficulty":3,"importance":1,"order":374},"inverse_of_a_matrix":{"title":"Inverse of a Matrix","category":"Math","subCategory":"Linear Algebra","difficulty":3,"importance":2,"order":375},"inverse_of_a_matrix_modulo_2":{"title":"Inverse of a Matrix modulo 2","category":"Math","subCategory":"Linear Algebra","difficulty":3,"importance":1,"order":376},"thomas_algorithm":{"title":"Thomas Algorithm","category":"Math","subCategory":"Linear Algebra","difficulty":3,"importance":1,"order":377},"basis_vector":{"title":"Vector Space and XOR Basis","category":"Math","subCategory":"Linear Algebra","difficulty":2,"importance":3,"order":378},"basis_vector_reduced_row_echelon_form":{"title":"[Technique] XOR Basis ft Reduced Row Echelon Form","category":"Math","subCategory":"Linear Algebra","difficulty":2,"importance":2,"order":379},"basis_vector_ft_lexicographically_largest_basis":{"title":"[Technique] XOR Basis ft Lexicographically Largest Basis","category":"Math","subCategory":"Linear Algebra","difficulty":2,"importance":2,"order":380},"basis_vector_with_deletions":{"title":"XOR Basis with Deletions (Online)","category":"Math","subCategory":"Linear Algebra","difficulty":3,"importance":1,"order":381},"q_binomial":{"title":"q Binomial","category":"Math","subCategory":"Linear Algebra","difficulty":4,"importance":2,"order":382},"gausss_eureka_theorem":{"title":"Gauss's Eureka Theorem","category":"Math","subCategory":"Formulas","difficulty":1,"importance":2,"order":383},"titus_lemma":{"title":"Titu's Lemma","category":"Math","subCategory":"Formulas","difficulty":2,"importance":2,"order":384},"lte_lemma":{"title":"Lifting-the-exponent(LTE) Lemma","category":"Math","subCategory":"Formulas","difficulty":2,"importance":1,"order":385},"faulhabers_formula":{"title":"Faulhaber's Formula and Bernoulli Numbers","category":"Math","subCategory":"Formulas","difficulty":3,"importance":2,"order":386},"integration":{"title":"Differentiation and Integration","category":"Math","subCategory":"Calculus","difficulty":2,"importance":2,"order":387},"line_integral":{"title":"Line Integral","category":"Math","subCategory":"Calculus","difficulty":2,"importance":1,"order":388},"probabilities_and_expected_values":{"title":"Probabilities and Expected Values","category":"Math","subCategory":"Probabilities and Expected Values","difficulty":1,"importance":3,"order":389},"expected_value_powers_technique":{"title":"Expected Value Powers Technique","category":"Math","subCategory":"Probabilities and Expected Values","difficulty":2,"importance":3,"order":390},"the_slime_trick":{"title":"The Slime Trick","category":"Math","subCategory":"Probabilities and Expected Values","difficulty":3,"importance":1,"order":391},"expected_occurrence_time_as_substring":{"title":"Expected Occurrence Time as Substring","category":"Math","subCategory":"Probabilities and Expected Values","difficulty":3,"importance":1,"order":392},"gamblers_ruin":{"title":"Gambler's Ruin","category":"Math","subCategory":"Probabilities and Expected Values","difficulty":3,"importance":1,"order":393},"martingale":{"title":"Martingale","category":"Math","subCategory":"Probabilities and Expected Values","difficulty":4,"importance":1,"order":394},"lagrange_multiplier":{"title":"Lagrange Multiplier","category":"Math","subCategory":"Mathematical Optimization","difficulty":2,"importance":2,"order":395},"simplex_algorithm":{"title":"Linear Programming / Simplex Algorithm","category":"Math","subCategory":"Mathematical Optimization","difficulty":3,"importance":2,"order":396},"duality_in_linear_programming":{"title":"Duality in Linear Programming (LP <> Flow)","category":"Math","subCategory":"Mathematical Optimization","difficulty":4,"importance":1,"order":397},"continued_fractions":{"title":"Continued Fractions","category":"Math","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":398},"polynomial_root_finding":{"title":"Polynomial Real Roots","category":"Math","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":399},"finite_field_arithmetic_binary":{"title":"Finite Field Arithmetic Binary","category":"Math","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":400},"kmp":{"title":"Knuth Morris Pratt (KMP) and Prefix Automaton","category":"Strings","subCategory":"String Matching","difficulty":1,"importance":3,"order":401},"z_algorithm":{"title":"Z algorithm","category":"Strings","subCategory":"String Matching","difficulty":1,"importance":3,"order":402},"string_matching_using_bitsets":{"title":"String Matching using Bitsets","category":"Strings","subCategory":"String Matching","difficulty":2,"importance":2,"order":403},"string_matching_with_fft":{"title":"String Matching with FFT ft Wildcard Matching","category":"Strings","subCategory":"String Matching","difficulty":2,"importance":2,"order":404},"string_hashing":{"title":"String Hashing","category":"Strings","subCategory":"Hashing","difficulty":1,"importance":3,"order":405},"2d_string_hashing":{"title":"2D String Hashing","category":"Strings","subCategory":"Hashing","difficulty":2,"importance":2,"order":406},"xor_hashing":{"title":"XOR Hashing","category":"Strings","subCategory":"Hashing","difficulty":2,"importance":3,"order":407},"multiset_hashing":{"title":"Multiset Hashing","category":"Strings","subCategory":"Hashing","difficulty":2,"importance":3,"order":408},"aho_corasick":{"title":"Aho Corasick","category":"Strings","subCategory":"Aho Corasick","difficulty":1,"importance":3,"order":409},"dynamic_aho_corasick":{"title":"Dynamic Aho Corasick","category":"Strings","subCategory":"Aho Corasick","difficulty":2,"importance":2,"order":410},"suffix_array":{"title":"Suffix Array","category":"Strings","subCategory":"Suffix Structures","difficulty":2,"importance":3,"order":411},"isomorphic_suffix_array":{"title":"Isomorphic Suffix Array","category":"Strings","subCategory":"Suffix Structures","difficulty":3,"importance":1,"order":412},"dynamic_suffix_array":{"title":"Dynamic Suffix Array","category":"Strings","subCategory":"Suffix Structures","difficulty":4,"importance":1,"order":413},"suffix_automaton":{"title":"Suffix Automaton","category":"Strings","subCategory":"Suffix Structures","difficulty":2,"importance":3,"order":414},"suffix_automaton_ft_distinct_substring_queries_in_range":{"title":"[Problem] Distinct Substring Queries in Range","category":"Strings","subCategory":"Suffix Structures","difficulty":3,"importance":1,"order":415},"suffix_tree":{"title":"Suffix Tree","category":"Strings","subCategory":"Suffix Structures","difficulty":3,"importance":1,"order":416},"palindromic_tree":{"title":"Palindromic Tree","category":"Strings","subCategory":"Palindromes","difficulty":2,"importance":3,"order":417},"persistent_palindromic_tree":{"title":"Persistent Palindromic Tree","category":"Strings","subCategory":"Palindromes","difficulty":3,"importance":1,"order":418},"manachers_algorithm":{"title":"Manachers Algorithm","category":"Strings","subCategory":"Palindromes","difficulty":2,"importance":3,"order":419},"minimum_palindrome_factorization":{"title":"[Problem] Minimum Palindrome Factorization","category":"Strings","subCategory":"Palindromes","difficulty":3,"importance":1,"order":420},"number_of_palindromes_in_range":{"title":"[Problem] Number of Palindromes in Range","category":"Strings","subCategory":"Palindromes","difficulty":2,"importance":2,"order":421},"lcs":{"title":"Longest Common Subsequence (LCS)","category":"Strings","subCategory":"Longest Common Subsequence (LCS)","difficulty":1,"importance":3,"order":422},"all_substring_longest_common_subsequence":{"title":"All Substring Longest Common Subsequence","category":"Strings","subCategory":"Longest Common Subsequence (LCS)","difficulty":4,"importance":1,"order":423},"bit_lcs":{"title":"Bit LCS","category":"Strings","subCategory":"Longest Common Subsequence (LCS)","difficulty":4,"importance":1,"order":424},"cyclic_lcs":{"title":"Cyclic LCS","category":"Strings","subCategory":"Longest Common Subsequence (LCS)","difficulty":4,"importance":1,"order":425},"lcs_on_rle_compressed_string":{"title":"LCS on RLE compressed string","category":"Strings","subCategory":"Longest Common Subsequence (LCS)","difficulty":4,"importance":1,"order":426},"balanced_brackets":{"title":"Balanced Brackets","category":"Strings","subCategory":"Miscellaneous","difficulty":1,"importance":3,"order":427},"expression_parsing":{"title":"Expression Parsing","category":"Strings","subCategory":"Miscellaneous","difficulty":1,"importance":1,"order":428},"lyndon_factorization":{"title":"Lyndon Factorization / Duval Algorithm","category":"Strings","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":429},"main_lorentz_algorithm":{"title":"Finding Repetitions / Main-Lorentz Algorithm","category":"Strings","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":430},"de_bruijn_sequence":{"title":"De Bruijn Sequence","category":"Strings","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":431},"knapsack":{"title":"Knapsack and Basic Dynamic Programming","category":"Dynamic Programming (DP)","subCategory":"Intro to DP","difficulty":1,"importance":3,"order":432},"subset_sum_in_sqrt":{"title":"Knapsack and Subset Sum Optimizations","category":"Dynamic Programming (DP)","subCategory":"Intro to DP","difficulty":1,"importance":3,"order":433},"digit_dp":{"title":"Digit DP","category":"Dynamic Programming (DP)","subCategory":"Digit DP","difficulty":1,"importance":3,"order":434},"divide_and_conquer_optimization":{"title":"Divide and Conquer Optimization","category":"Dynamic Programming (DP)","subCategory":"DP Optimizations","difficulty":2,"importance":3,"order":435},"knuth_optimization":{"title":"Knuth Optimization","category":"Dynamic Programming (DP)","subCategory":"DP Optimizations","difficulty":2,"importance":3,"order":436},"aliens_trick":{"title":"Aliens Trick / WQS Binary Search","category":"Dynamic Programming (DP)","subCategory":"DP Optimizations","difficulty":3,"importance":2,"order":437},"1d1d_dp_optimization":{"title":"1D1D DP Optimization","category":"Dynamic Programming (DP)","subCategory":"DP Optimizations","difficulty":3,"importance":2,"order":438},"dp_optimization_using_data_structures":{"title":"DP Optimization using Data Structures [Some Practice Problems]","category":"Dynamic Programming (DP)","subCategory":"DP Optimizations","difficulty":2,"importance":3,"order":439},"cht":{"title":"Convex Hull Trick (CHT) and Dynamic CHT","category":"Dynamic Programming (DP)","subCategory":"Convex Hull Trick (CHT)","difficulty":2,"importance":3,"order":440},"persistent_cht":{"title":"Persistent CHT","category":"Dynamic Programming (DP)","subCategory":"Convex Hull Trick (CHT)","difficulty":3,"importance":1,"order":441},"li_chao_tree":{"title":"Li Chao Tree","category":"Dynamic Programming (DP)","subCategory":"Li Chao Tree","difficulty":2,"importance":2,"order":442},"persistent_li_chao_tree":{"title":"Persistent Li Chao Tree","category":"Dynamic Programming (DP)","subCategory":"Li Chao Tree","difficulty":2,"importance":1,"order":443},"extended_li_chao_tree":{"title":"Extended Li Chao tree","category":"Dynamic Programming (DP)","subCategory":"Li Chao Tree","difficulty":3,"importance":1,"order":444},"bitmask_dp":{"title":"Bitmask DP","category":"Dynamic Programming (DP)","subCategory":"Bit Related DP","difficulty":1,"importance":3,"order":445},"sos_dp":{"title":"Sum Over Subsets DP (SOS DP)","category":"Dynamic Programming (DP)","subCategory":"Bit Related DP","difficulty":1,"importance":3,"order":446},"subset_union_of_bitsets":{"title":"[Problem] Subset Union of Bitsets","category":"Dynamic Programming (DP)","subCategory":"Bit Related DP","difficulty":2,"importance":1,"order":447},"subset_convolution":{"title":"Subset Convolution","category":"Dynamic Programming (DP)","subCategory":"Bit Related DP","difficulty":2,"importance":2,"order":448},"dynamic_submask_count":{"title":"[Trick] Dynamic Submask Count","category":"Dynamic Programming (DP)","subCategory":"Bit Related DP","difficulty":2,"importance":2,"order":449},"xor_equation":{"title":"[Problem] XOR Equation","category":"Dynamic Programming (DP)","subCategory":"Bit Related DP","difficulty":2,"importance":1,"order":450},"open_and_close_interval_trick":{"title":"Open and Close Interval Trick","category":"Dynamic Programming (DP)","subCategory":"More Tricks","difficulty":1,"importance":2,"order":451},"slope_trick":{"title":"Slope Trick","category":"Dynamic Programming (DP)","subCategory":"More Tricks","difficulty":2,"importance":2,"order":452},"x2_plus_1_trick":{"title":"x2 +1 Trick","category":"Dynamic Programming (DP)","subCategory":"More Tricks","difficulty":1,"importance":2,"order":453},"combining_subtrees_technique":{"title":"Combining Subtrees Technique","category":"Dynamic Programming (DP)","subCategory":"More Tricks","difficulty":2,"importance":3,"order":454},"lis":{"title":"Longest Increasing Subsequence (LIS)","category":"Dynamic Programming (DP)","subCategory":"Classic DP","difficulty":1,"importance":3,"order":455},"mcm":{"title":"Interval DP / Range DP / Matrix Chain Multiplication (MCM)","category":"Dynamic Programming (DP)","subCategory":"Classic DP","difficulty":1,"importance":3,"order":456},"edit_distance":{"title":"Edit Distance","category":"Dynamic Programming (DP)","subCategory":"Classic DP","difficulty":1,"importance":3,"order":457},"dp_on_trees_and_dags":{"title":"DP on Trees and DAGs","category":"Dynamic Programming (DP)","subCategory":"Dp on Different Structures","difficulty":1,"importance":3,"order":458},"dp_over_divisors":{"title":"DP over Divisors","category":"Dynamic Programming (DP)","subCategory":"Dp on Different Structures","difficulty":2,"importance":3,"order":459},"substring_dp":{"title":"Substring DP","category":"Dynamic Programming (DP)","subCategory":"Dp on Different Structures","difficulty":1,"importance":3,"order":460},"dp_on_convex_hulls":{"title":"DP on Convex Hulls","category":"Dynamic Programming (DP)","subCategory":"Dp on Different Structures","difficulty":2,"importance":2,"order":461},"connected_component_dp":{"title":"Connected Component DP","category":"Dynamic Programming (DP)","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":462},"broken_profile_dp":{"title":"Broken Profile DP / Plug DP","category":"Dynamic Programming (DP)","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":463},"hirschbergs_algorithm":{"title":"Hirschberg's Algorithm","category":"Dynamic Programming (DP)","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":464},"number_of_subsequences_having_product_at_least_k":{"title":"[Problem] Number of Subsequences Having Product at least K","category":"Dynamic Programming (DP)","subCategory":"Miscellaneous","difficulty":2,"importance":2,"order":465},"lis_range_query":{"title":"[Problem] Range LIS Query","category":"Dynamic Programming (DP)","subCategory":"Miscellaneous","difficulty":4,"importance":1,"order":466},"grundy_number":{"title":"Grundy Number and Basic Game Theory","category":"Game Theory","subCategory":"Grundy Number / Nim","difficulty":1,"importance":3,"order":467},"nimber":{"title":"Nimber","category":"Game Theory","subCategory":"Grundy Number / Nim","difficulty":4,"importance":1,"order":468},"green_hackenbush_on_trees_and_graphs":{"title":"Green Hackenbush on Trees and Graphs","category":"Game Theory","subCategory":"Hackenbush","difficulty":2,"importance":2,"order":469},"blue_red_hackenbush":{"title":"Blue Red HackenBush","category":"Game Theory","subCategory":"Hackenbush","difficulty":4,"importance":1,"order":470},"games_on_arbitrary_graphs":{"title":"Games on Arbitrary Graphs","category":"Game Theory","subCategory":"Graph Games","difficulty":2,"importance":1,"order":471},"matching_game_on_a_graph":{"title":"[Problem] Matching Game On A Graph","category":"Game Theory","subCategory":"Graph Games","difficulty":3,"importance":1,"order":472},"alpha_beta_pruning":{"title":"Alpha Beta Pruning","category":"Game Theory","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":473},"euclidean_geometry":{"title":"Euclidean Geometry","category":"Geometry","subCategory":"Euclidean Geometry","difficulty":1,"importance":3,"order":474},"points_and_vectors_2d":{"title":"Points, Vectors, Transformations, Dot Products, Cross Products, Precision Issues and Polar Sort(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":1,"importance":3,"order":475},"lines_and_segments_2d":{"title":"Lines, Segments, Rays, Distance and Relation Between Two Structures, Projections and Reflections(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":1,"importance":3,"order":476},"circles_2d":{"title":"Circles, Circle Relations, Intersections, Inscribed Circles and Circumcircles(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":1,"importance":3,"order":477},"tangent_2d":{"title":"Tangents(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":1,"importance":2,"order":478},"circles_of_apollonius_2d":{"title":"Circles of Apollonius(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":1,"importance":1,"order":479},"circle_union_2d":{"title":"Circle Union(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":3,"importance":1,"order":480},"polygons_2d":{"title":"Polygons(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":1,"importance":3,"order":481},"centroid_of_a_polygon_2d":{"title":"Centroid of a Polygon(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":1,"importance":1,"order":482},"geometric_median_2d":{"title":"Geometric Median(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":2,"order":483},"convex_hull_2d":{"title":"Convex Hull(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":1,"importance":3,"order":484},"check_if_point_is_in_convex_2d":{"title":"Point in Convex Polygon in log(N)(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":3,"order":485},"winding_number_2d":{"title":"Winding Number and Point in Simple Polygon(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":1,"order":486},"extreme_vertex_2d":{"title":"Extreme Vertex(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":2,"order":487},"rotating_calipers":{"title":"Rotating Calipers ft Diameter and Width of a Convex Polygon and Minimum Enclosing Rectangle(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":3,"order":488},"minimum_enclosing_circle_2d":{"title":"Minimum Enclosing Circle(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":3,"order":489},"polygon_line_intersection_2d":{"title":"Polygon Line and Convex Line Intersection, and Polygon Cutting(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":3,"importance":1,"order":490},"tangents_from_point_to_polygon_2d":{"title":"Tangents from Point to Convex and Convex to Convex(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":2,"order":491},"dist_from_point_to_polygon_2d":{"title":"Distance from Point to Convex, Convex to Line and Convex to Convex(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":2,"order":492},"maximum_dist_from_polygon_to_polygon_2d":{"title":"Maximum Distance from Convex to Convex(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":1,"order":493},"polygon_union_2d":{"title":"Polygon Union(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":3,"importance":1,"order":494},"triangulation_2d":{"title":"Polygon Triangulation(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":2,"order":495},"maximum_circle_cover_2d":{"title":"Maximum Circle Cover(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":2,"importance":2,"order":496},"maximum_inscribed_circle_2d":{"title":"Maximum Inscribed Circle in a Convex(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":3,"importance":1,"order":497},"polygon_circle_intersection_2d":{"title":"Triangle Circle and Polygon Circle Intersection(2D)","category":"Geometry","subCategory":"Geometry 2D","difficulty":3,"importance":1,"order":498},"points_and_vectors_3d":{"title":"Points, Vectors, Dot Products, Cross Products and Mixed Products(3D)","category":"Geometry","subCategory":"Geometry 3D","difficulty":2,"importance":2,"order":499},"planes_3d":{"title":"Planes(3D)","category":"Geometry","subCategory":"Geometry 3D","difficulty":2,"importance":2,"order":500},"plane_based_coordinate_system_3d":{"title":"Plane Based Coordinate System(3D)","category":"Geometry","subCategory":"Geometry 3D","difficulty":2,"importance":2,"order":501},"lines_3d":{"title":"Lines, Segments, and Distances, Angles and Intersections Between Lines and Planes(3D)","category":"Geometry","subCategory":"Geometry 3D","difficulty":2,"importance":2,"order":502},"distance_from_triangle_to_triangle_3d":{"title":"Triangles and Distance from Triangle to Triangle(3D)","category":"Geometry","subCategory":"Geometry 3D","difficulty":2,"importance":2,"order":503},"spheres_3d":{"title":"Spherical Geometry and Winding Number(3D)","category":"Geometry","subCategory":"Geometry 3D","difficulty":3,"importance":1,"order":504},"minimum_enclosing_sphere_3d":{"title":"Minimum Enclosing Sphere(3D)","category":"Geometry","subCategory":"Geometry 3D","difficulty":2,"importance":2,"order":505},"polyhedron_3d":{"title":"Polyhedron, Pyramid, Cone and Cylinder(3D)","category":"Geometry","subCategory":"Geometry 3D","difficulty":3,"importance":2,"order":506},"convex_hull_3d":{"title":"Convex Hull(3D)","category":"Geometry","subCategory":"Geometry 3D","difficulty":3,"importance":2,"order":507},"delaunay_triangulation":{"title":"Delaunay Triangulation and Voronoi Diagram","category":"Geometry","subCategory":"Delaunay","difficulty":4,"importance":2,"order":508},"half_plane_intersection":{"title":"Half Plane Intersection","category":"Geometry","subCategory":"Half Plane","difficulty":3,"importance":3,"order":509},"dynamic_half_plane_intersection":{"title":"Dynamic Half Plane Intersection","category":"Geometry","subCategory":"Half Plane","difficulty":4,"importance":1,"order":510},"minkowski_sum":{"title":"Minkowski Sum","category":"Geometry","subCategory":"Convex Polygon","difficulty":2,"importance":3,"order":511},"dynamic_convex_hull":{"title":"Dynamic Convex Hull","category":"Geometry","subCategory":"Convex Polygon","difficulty":4,"importance":1,"order":512},"onion_decomposition":{"title":"Onion Decomposition","category":"Geometry","subCategory":"Convex Polygon","difficulty":4,"importance":1,"order":513},"picks_theorem":{"title":"Picks Theorem","category":"Geometry","subCategory":"Lattice Points","difficulty":1,"importance":3,"order":514},"lattice_points_inside_a_non_lattice_polygon":{"title":"Lattice Points inside a Non-Lattice Polygon","category":"Geometry","subCategory":"Lattice Points","difficulty":3,"importance":1,"order":515},"sweep_line_algorithm":{"title":"Sweep Line Algorithm and Radial Sweep","category":"Geometry","subCategory":"Sweep Line","difficulty":1,"importance":3,"order":516},"closest_pair_of_points":{"title":"Closest Pair of Points","category":"Geometry","subCategory":"Sweep Line","difficulty":1,"importance":2,"order":517},"rectangle_union":{"title":"Rectangle Union","category":"Geometry","subCategory":"Sweep Line","difficulty":1,"importance":2,"order":518},"all_pair_segment_intersection":{"title":"All Pair Segment Intersection.","category":"Geometry","subCategory":"Sweep Line","difficulty":3,"importance":1,"order":519},"vertical_decomposition":{"title":"Vertical decomposition","category":"Geometry","subCategory":"Sweep Line","difficulty":3,"importance":1,"order":520},"planar_graph_faces":{"title":"Faces in Planar Graph","category":"Geometry","subCategory":"Planar Geometry","difficulty":3,"importance":1,"order":521},"point_location":{"title":"Point Location","category":"Geometry","subCategory":"Planar Geometry","difficulty":4,"importance":1,"order":522},"hill_climbing":{"title":"Hill Climbing and Simulated Annealing","category":"Geometry","subCategory":"Miscellaneous","difficulty":2,"importance":2,"order":523},"linear_combination_of_vectors":{"title":"[Trick] Linear Combination of Vectors","category":"Geometry","subCategory":"Miscellaneous","difficulty":2,"importance":2,"order":524},"reflections_on_a_rectangle":{"title":"Reflections on a Rectangle","category":"Geometry","subCategory":"Miscellaneous","difficulty":2,"importance":1,"order":525},"maximum_area_of_a_triangle_from_given_lengths":{"title":"[Problem] Maximum Area of a Triangle from Given Lengths","category":"Geometry","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":526},"maximum_area_of_a_polygon_using_given_lengths_in_ccw_order":{"title":"[Problem] Maximum Area of a Polygon using Given Lengths in CCW Order","category":"Geometry","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":527},"circle_inclusion_hierarchy":{"title":"[Problem] Circle/Polygon Inclusion Tree","category":"Geometry","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":528},"activity_selection_problem":{"title":"Activity Selection Problem","category":"Miscellaneous","subCategory":"Greedy Algorithms","difficulty":1,"importance":3,"order":529},"fractional_knapsack_problem":{"title":"Fractional Knapsack Problem","category":"Miscellaneous","subCategory":"Greedy Algorithms","difficulty":1,"importance":2,"order":530},"huffman_coding":{"title":"Huffman Coding","category":"Miscellaneous","subCategory":"Greedy Algorithms","difficulty":1,"importance":1,"order":531},"exchange_arguments":{"title":"Exchange Arguments","category":"Miscellaneous","subCategory":"Greedy Algorithms","difficulty":1,"importance":3,"order":532},"ternary_search":{"title":"Ternary Search","category":"Miscellaneous","subCategory":"Search Techniques","difficulty":1,"importance":3,"order":533},"parallel_binary_search":{"title":"Parallel Binary Search","category":"Miscellaneous","subCategory":"Search Techniques","difficulty":2,"importance":2,"order":534},"fraction_binary_search":{"title":"Fraction Binary Search","category":"Miscellaneous","subCategory":"Search Techniques","difficulty":3,"importance":1,"order":535},"fracturing_search":{"title":"Fracturing Search","category":"Miscellaneous","subCategory":"Search Techniques","difficulty":2,"importance":2,"order":536},"interactive_problems":{"title":"Interactive Problems","category":"Miscellaneous","subCategory":"Interactive Problems","difficulty":1,"importance":3,"order":537},"interactive_problems_on_centroids":{"title":"Interactive Problems on Centroids","category":"Miscellaneous","subCategory":"Interactive Problems","difficulty":2,"importance":2,"order":538},"permutation_cycles":{"title":"Permutations and Permutation Cycles","category":"Miscellaneous","subCategory":"Permutations","difficulty":1,"importance":3,"order":539},"kth_root_of_a_permutation":{"title":"[Problem] K-th Root of a Permutation","category":"Miscellaneous","subCategory":"Permutations","difficulty":3,"importance":1,"order":540},"schreier_sims_algorithm":{"title":"Schreier–Sims Algorithm","category":"Miscellaneous","subCategory":"Permutations","difficulty":4,"importance":1,"order":541},"matroid_intersection":{"title":"Matroid Intersection","category":"Miscellaneous","subCategory":"Matroids","difficulty":4,"importance":2,"order":542},"knight_moves_in_infinity_grid":{"title":"[Problem] Knight Moves in Infinity Grid","category":"Miscellaneous","subCategory":"Chess","difficulty":2,"importance":1,"order":543},"knights_tour_problem":{"title":"[Problem] Knight's Tour Problem","category":"Miscellaneous","subCategory":"Chess","difficulty":2,"importance":1,"order":544},"bishop_placement":{"title":"[Problem] Bishop Placement","category":"Miscellaneous","subCategory":"Chess","difficulty":2,"importance":1,"order":545},"coordinate_compression":{"title":"Coordinate Compression","category":"Miscellaneous","subCategory":"Techniques","difficulty":1,"importance":3,"order":546},"direction_array":{"title":"Direction Array","category":"Miscellaneous","subCategory":"Techniques","difficulty":1,"importance":3,"order":547},"meet_in_the_middle":{"title":"Meet in the Middle","category":"Miscellaneous","subCategory":"Techniques","difficulty":1,"importance":3,"order":548},"invariants_and_monovariants":{"title":"Invariants and Monovariants","category":"Miscellaneous","subCategory":"Techniques","difficulty":1,"importance":3,"order":549},"manhattan_chebyshev":{"title":"Manhattan <> Chebyshev","category":"Miscellaneous","subCategory":"Techniques","difficulty":2,"importance":2,"order":550},"lcm_or_technique":{"title":"LCM OR Technique","category":"Miscellaneous","subCategory":"Techniques","difficulty":2,"importance":2,"order":551},"logarithmic_bruteforce":{"title":"[Trick] Logarithmic Subarray Aggregator (LSA Trick)","category":"Miscellaneous","subCategory":"Techniques","difficulty":2,"importance":3,"order":552},"bitwise_disjoint_partitioning":{"title":"Bitwise Disjoint Partitioning","category":"Miscellaneous","subCategory":"Techniques","difficulty":2,"importance":2,"order":553},"sqrt_n_sequence_recovery":{"title":"[Trick] Efficient Non-Increasing Sequence Recovery of Length n with a[i] <= n/i","category":"Miscellaneous","subCategory":"Techniques","difficulty":2,"importance":1,"order":554},"min_plus_convolution_convex_and_convex":{"title":"Min Plus Convolution (Convex and Convex)","category":"Miscellaneous","subCategory":"Min Plus Convolution","difficulty":2,"importance":2,"order":555},"min_plus_convolution_convex_and_arbitrary":{"title":"SMAWK Algorithm and Min Plus Convolution (Convex and Arbitrary)","category":"Miscellaneous","subCategory":"Min Plus Convolution","difficulty":4,"importance":1,"order":556},"randomized_algorithms":{"title":"Randomized Algorithms","category":"Miscellaneous","subCategory":"Randomized","difficulty":2,"importance":3,"order":557},"birthday_paradox":{"title":"Birthday Paradox","category":"Miscellaneous","subCategory":"Randomized","difficulty":2,"importance":1,"order":558},"bigint":{"title":"Big Integers","category":"Miscellaneous","subCategory":"Bigint","difficulty":2,"importance":2,"order":559},"trygub_numbers":{"title":"Trygub Numbers","category":"Miscellaneous","subCategory":"Bigint","difficulty":3,"importance":1,"order":560},"inversions":{"title":"Inversions","category":"Miscellaneous","subCategory":"Miscellaneous","difficulty":1,"importance":3,"order":561},"josephus_problem":{"title":"Josephus Problem","category":"Miscellaneous","subCategory":"Miscellaneous","difficulty":1,"importance":1,"order":562},"gray_code":{"title":"Gray Code","category":"Miscellaneous","subCategory":"Miscellaneous","difficulty":1,"importance":1,"order":563},"backtracking":{"title":"Backtracking","category":"Miscellaneous","subCategory":"Miscellaneous","difficulty":1,"importance":3,"order":564},"mex_of_all_subarrays":{"title":"[Problem] MEX of all Subarrays","category":"Miscellaneous","subCategory":"Miscellaneous","difficulty":3,"importance":2,"order":565},"lindstrom_gessel_viennot_lemma":{"title":"Lindstrom Gessel Viennot(LGV) Lemma","category":"Miscellaneous","subCategory":"Miscellaneous","difficulty":3,"importance":1,"order":566},"dynamic_bitsets":{"title":"Dynamic Bitsets","category":"Miscellaneous","subCategory":"Miscellaneous","difficulty":2,"importance":2,"order":567},"pragmas":{"title":"Pragmas","category":"Miscellaneous","subCategory":"Miscellaneous","difficulty":2,"importance":2,"order":568},"boyer_moore_voting_algorithm_and_misra_gries_algorithm":{"title":"Boyer–Moore Voting Algorithm and Misra–Gries Algorithm","category":"Miscellaneous","subCategory":"Miscellaneous","difficulty":1,"importance":1,"order":569},"uncategorized":{"title":"Uncategorized","category":"Other","subCategory":"Other","difficulty":null,"importance":null,"order":570}},"problems":[{"id":"aizu_itp1_1_a","judge":"Aizu","title":"Hello World","url":"https://vjudge.net/problem/Aizu-ITP1_1_A","difficulty":1,"starred":true,"topic":"intro_to_cpp","topics":["intro_to_cpp"],"solved":false},{"id":"gym_287306b","judge":"CF Gym","title":"Basic Data Types","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/B","difficulty":1,"starred":true,"topic":"variables_and_data_types","topics":["variables_and_data_types"],"solved":false},{"id":"gym_287306c","judge":"CF Gym","title":"Simple Calculator","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/C","difficulty":1,"starred":true,"topic":"operators","topics":["operators"],"solved":false},{"id":"gym_287306d","judge":"CF Gym","title":"Difference","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/D","difficulty":1,"starred":true,"topic":"operators","topics":["operators"],"solved":false},{"id":"gym_367756e","judge":"CF Gym","title":"Area of a Circle","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/E","difficulty":1,"starred":true,"topic":"operators","topics":["operators"],"solved":false},{"id":"gym_287306q","judge":"CF Gym","title":"Age in Days","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/R","difficulty":1,"starred":true,"topic":"operators","topics":["operators"],"solved":false},{"id":"gym_287306f","judge":"CF Gym","title":"Summation from 1 to N","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/G","difficulty":2,"starred":true,"topic":"operators","topics":["operators"],"solved":false},{"id":"gym_287306x","judge":"CF Gym","title":"The last 2 digits","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/Y","difficulty":2,"starred":true,"topic":"operators","topics":["operators"],"solved":false},{"id":"gym_287306l","judge":"CF Gym","title":"Capital or Small or Digit","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/M","difficulty":1,"starred":true,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306m","judge":"CF Gym","title":"Char","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/N","difficulty":1,"starred":false,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306u","judge":"CF Gym","title":"Comparison","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/V","difficulty":1,"starred":false,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306t","judge":"CF Gym","title":"Float or int","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/U","difficulty":1,"starred":false,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306r","judge":"CF Gym","title":"Interval","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/S","difficulty":1,"starred":false,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306i","judge":"CF Gym","title":"Multiples","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/J","difficulty":1,"starred":true,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306h","judge":"CF Gym","title":"Welcome for you with Conditions","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/I","difficulty":1,"starred":true,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306v","judge":"CF Gym","title":"Mathematical Expression","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/W","difficulty":2,"starred":true,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306j","judge":"CF Gym","title":"Max and Min","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/K","difficulty":2,"starred":true,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306s","judge":"CF Gym","title":"Sort Numbers","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/T","difficulty":2,"starred":true,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287306p","judge":"CF Gym","title":"Coordinates of a Point","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/Q","difficulty":3,"starred":true,"topic":"conditional_statements","topics":["conditional_statements"],"solved":false},{"id":"gym_287309a","judge":"CF Gym","title":"1 to N","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/A","difficulty":1,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309k","judge":"CF Gym","title":"Divisors","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/K","difficulty":1,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309b","judge":"CF Gym","title":"Even Numbers","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/B","difficulty":1,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309c","judge":"CF Gym","title":"Even, Odd, Positive and Negative","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/C","difficulty":1,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309g","judge":"CF Gym","title":"Factorial","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/G","difficulty":1,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309d","judge":"CF Gym","title":"Fixed Password","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/D","difficulty":1,"starred":false,"topic":"loops","topics":["loops"],"solved":false},{"id":"cf_group_219432e","judge":"Codeforces","title":"Max","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/E","difficulty":1,"starred":false,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309f","judge":"CF Gym","title":"Multiplication table","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/F","difficulty":1,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309n","judge":"CF Gym","title":"Numbers Histogram","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/N","difficulty":1,"starred":false,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309h","judge":"CF Gym","title":"One Prime","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/H","difficulty":1,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309o","judge":"CF Gym","title":"Pyramid","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/O","difficulty":1,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309p","judge":"CF Gym","title":"Shape1","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/P","difficulty":1,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309q","judge":"CF Gym","title":"Digits","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/Q","difficulty":2,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309r","judge":"CF Gym","title":"Sequence of Numbers and Sum","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/R","difficulty":2,"starred":false,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309t","judge":"CF Gym","title":"Shape2","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/T","difficulty":2,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309s","judge":"CF Gym","title":"Sum of Consecutive Odd Numbers","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/S","difficulty":2,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309x","judge":"CF Gym","title":"Convert To Decimal 2","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/X","difficulty":3,"starred":false,"topic":"loops","topics":["loops"],"solved":false},{"id":"gym_287309w","judge":"CF Gym","title":"Shape3","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/W","difficulty":3,"starred":true,"topic":"loops","topics":["loops"],"solved":false},{"id":"cf_group_223205a","judge":"Codeforces","title":"Add","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223205/problem/A","difficulty":1,"starred":false,"topic":"functions","topics":["functions"],"solved":false},{"id":"gym_287306g","judge":"CF Gym","title":"Two numbers","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/H","difficulty":1,"starred":true,"topic":"functions","topics":["functions"],"solved":false},{"id":"cf_group_223205e","judge":"Codeforces","title":"Swap","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223205/problem/E","difficulty":1,"starred":true,"topic":"functions","topics":["functions"],"solved":false},{"id":"gym_287309l","judge":"CF Gym","title":"GCD","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/L","difficulty":1,"starred":true,"topic":"functions","topics":["functions"],"solved":false},{"id":"cf_group_223205c","judge":"Codeforces","title":"Wonderful Number","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223205/problem/C","difficulty":1,"starred":true,"topic":"functions","topics":["functions"],"solved":false},{"id":"gym_287309j","judge":"CF Gym","title":"Primes from 1 to n","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/J","difficulty":1,"starred":true,"topic":"functions","topics":["functions"],"solved":false},{"id":"gym_287309m","judge":"CF Gym","title":"Lucky Numbers","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/M","difficulty":2,"starred":true,"topic":"functions","topics":["functions"],"solved":false},{"id":"gym_287309u","judge":"CF Gym","title":"Some Sums","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/U","difficulty":2,"starred":true,"topic":"functions","topics":["functions"],"solved":false},{"id":"cf_group_223205f","judge":"Codeforces","title":"Equation","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223205/problem/F","difficulty":2,"starred":false,"topic":"functions","topics":["functions"],"solved":false},{"id":"gym_287306y","judge":"CF Gym","title":"Hard Compare","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/Z","difficulty":3,"starred":true,"topic":"functions","topics":["functions"],"solved":false},{"id":"gym_287310a","judge":"CF Gym","title":"Summation","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/A","difficulty":1,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310b","judge":"CF Gym","title":"Searching","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/B","difficulty":1,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310c","judge":"CF Gym","title":"Replacement","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/C","difficulty":1,"starred":false,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287309e","judge":"CF Gym","title":"Max","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/E","difficulty":1,"starred":false,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310e","judge":"CF Gym","title":"Lowest Number","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/E","difficulty":1,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287309y","judge":"CF Gym","title":"Easy Fibonacci","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219432/problem/Y","difficulty":1,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310f","judge":"CF Gym","title":"Reversing","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/F","difficulty":2,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310g","judge":"CF Gym","title":"Palindrome Array","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/G","difficulty":2,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310h","judge":"CF Gym","title":"Sorting","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/H","difficulty":2,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310i","judge":"CF Gym","title":"Smallest Pair","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/I","difficulty":2,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310l","judge":"CF Gym","title":"Max Subarray","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/L","difficulty":2,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310m","judge":"CF Gym","title":"Replace MinMax","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/M","difficulty":2,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310p","judge":"CF Gym","title":"Minimize Number","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/P","difficulty":2,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310q","judge":"CF Gym","title":"Count Subarrays","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/Q","difficulty":2,"starred":false,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310r","judge":"CF Gym","title":"Permutation with arrays","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/R","difficulty":2,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310v","judge":"CF Gym","title":"Frequency Array","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/V","difficulty":3,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310u","judge":"CF Gym","title":"Is B a subsequence of A ?","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/U","difficulty":3,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310s","judge":"CF Gym","title":"Search In Matrix","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/S","difficulty":3,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310t","judge":"CF Gym","title":"Matrix","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/T","difficulty":3,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287310w","judge":"CF Gym","title":"Mirror Array","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/W","difficulty":3,"starred":false,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"hackerrank_2d_array","judge":"HackerRank","title":"2D Array - DS","url":"https://vjudge.net/problem/HackerRank-2d-array","difficulty":3,"starred":true,"topic":"arrays","topics":["arrays"],"solved":false},{"id":"gym_287306a","judge":"CF Gym","title":"Say Hello With C++","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/A","difficulty":1,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843a","judge":"CF Gym","title":"Create A New String","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/A","difficulty":1,"starred":false,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843b","judge":"CF Gym","title":"Let's use Getline","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/B","difficulty":1,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_287306k","judge":"CF Gym","title":"The Brothers","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/L","difficulty":2,"starred":false,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843f","judge":"CF Gym","title":"Way Too Long Words","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/F","difficulty":1,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_287306o","judge":"CF Gym","title":"First digit !","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/P","difficulty":1,"starred":false,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_287310k","judge":"CF Gym","title":"Sum Digits","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/K","difficulty":1,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_287306n","judge":"CF Gym","title":"Calculator","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219158/problem/O","difficulty":2,"starred":false,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843g","judge":"CF Gym","title":"Conversion","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/G","difficulty":1,"starred":false,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843c","judge":"CF Gym","title":"Compare","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/C","difficulty":2,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843d","judge":"CF Gym","title":"Strings","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/D","difficulty":2,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843h","judge":"CF Gym","title":"Good or Bad","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/H","difficulty":2,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843i","judge":"CF Gym","title":"Palindrome","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/I","difficulty":2,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843j","judge":"CF Gym","title":"Count Letters","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/J","difficulty":2,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_293843k","judge":"CF Gym","title":"I Love strings","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/K","difficulty":2,"starred":false,"topic":"strings","topics":["strings"],"solved":false},{"id":"gym_287310x","judge":"CF Gym","title":"8 Neighbors","url":"https://codeforces.com/group/MWSDmqGsZm/contest/219774/problem/X","difficulty":3,"starred":true,"topic":"strings","topics":["strings"],"solved":false},{"id":"hackerrank_c_tutorial_pointer","judge":"HackerRank","title":"Pointer","url":"https://vjudge.net/problem/HackerRank-c-tutorial-pointer","difficulty":1,"starred":true,"topic":"pointers","topics":["pointers"],"solved":false},{"id":"atcoder_abc169_a","judge":"AtCoder","title":"Multiplication 1","url":"https://vjudge.net/problem/AtCoder-abc169_a","difficulty":1,"starred":true,"topic":"competitive_programming","topics":["competitive_programming"],"solved":true},{"id":"codeforces_630a","judge":"Codeforces","title":"Again Twenty Five!","url":"https://codeforces.com/problemset/problem/630/A","difficulty":1,"starred":true,"topic":"competitive_programming","topics":["complexity_analysis","competitive_programming"],"solved":true},{"id":"atcoder_abc209_a","judge":"AtCoder","title":"Counting","url":"https://vjudge.net/problem/AtCoder-abc209_a","difficulty":1,"starred":true,"topic":"competitive_programming","topics":["competitive_programming"],"solved":true},{"id":"atcoder_abc124_a","judge":"AtCoder","title":"Buttons","url":"https://vjudge.net/problem/AtCoder-abc124_a","difficulty":1,"starred":false,"topic":"competitive_programming","topics":["competitive_programming"],"solved":true},{"id":"atcoder_abc226_a","judge":"AtCoder","title":"Round decimals","url":"https://vjudge.net/problem/AtCoder-abc226_a","difficulty":1,"starred":false,"topic":"competitive_programming","topics":["competitive_programming"],"solved":true},{"id":"atcoder_abc222_a","judge":"AtCoder","title":"Four Digits","url":"https://vjudge.net/problem/AtCoder-abc222_a","difficulty":1,"starred":true,"topic":"competitive_programming","topics":["competitive_programming"],"solved":true},{"id":"atcoder_abc125_a","judge":"AtCoder","title":"Biscuit Generator","url":"https://vjudge.net/problem/AtCoder-abc125_a","difficulty":1,"starred":false,"topic":"competitive_programming","topics":["competitive_programming"],"solved":true},{"id":"atcoder_abc220_a","judge":"AtCoder","title":"Find Multiple","url":"https://vjudge.net/problem/AtCoder-abc220_a","difficulty":1,"starred":false,"topic":"competitive_programming","topics":["competitive_programming"],"solved":true},{"id":"codeforces_633a","judge":"Codeforces","title":"Ebony and Ivory","url":"https://vjudge.net/problem/CodeForces-633A","difficulty":1,"starred":true,"topic":"competitive_programming","topics":["linear_diophantine_equation_with_two_variables","competitive_programming"],"solved":true},{"id":"atcoder_abc199_a","judge":"AtCoder","title":"Square Inequality","url":"https://vjudge.net/problem/AtCoder-abc199_a","difficulty":1,"starred":false,"topic":"competitive_programming","topics":["competitive_programming"],"solved":false},{"id":"atcoder_abc193_a","judge":"AtCoder","title":"Discount","url":"https://vjudge.net/problem/AtCoder-abc193_a","difficulty":1,"starred":false,"topic":"competitive_programming","topics":["competitive_programming"],"solved":false},{"id":"atcoder_abc152_a","judge":"AtCoder","title":"AC or WA","url":"https://vjudge.net/problem/AtCoder-abc152_a","difficulty":1,"starred":false,"topic":"competitive_programming","topics":["competitive_programming"],"solved":false},{"id":"codeforces_598a","judge":"Codeforces","title":"Tricky Sum","url":"https://codeforces.com/problemset/problem/598/A","difficulty":1,"starred":true,"topic":"competitive_programming","topics":["complexity_analysis","competitive_programming"],"solved":true},{"id":"atcoder_abc214_b","judge":"AtCoder","title":"How many?","url":"https://vjudge.net/problem/AtCoder-abc214_b","difficulty":2,"starred":true,"topic":"competitive_programming","topics":["competitive_programming"],"solved":false},{"id":"codeforces_271a","judge":"Codeforces","title":"Beautiful Year","url":"https://vjudge.net/problem/CodeForces-271A","difficulty":2,"starred":true,"topic":"competitive_programming","topics":["competitive_programming"],"solved":true},{"id":"codeforces_26a","judge":"Codeforces","title":"Almost Prime","url":"https://vjudge.net/problem/CodeForces-26A","difficulty":1,"starred":true,"topic":"competitive_programming","topics":["sieve","competitive_programming"],"solved":true},{"id":"atcoder_abc051_b","judge":"AtCoder","title":"Sum of Three Integers","url":"https://atcoder.jp/contests/abc051/tasks/abc051_b","difficulty":2,"starred":true,"topic":"competitive_programming","topics":["complexity_analysis","competitive_programming"],"solved":false},{"id":"codeforces_102b","judge":"Codeforces","title":"Sum of Digits","url":"https://vjudge.net/problem/CodeForces-102B","difficulty":3,"starred":true,"topic":"competitive_programming","topics":["competitive_programming"],"solved":true},{"id":"hackerrank_bitwise_operators_in_c","judge":"HackerRank","title":"Bitwise Operators","url":"https://vjudge.net/problem/HackerRank-bitwise-operators-in-c","difficulty":1,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"hackerrank_maximizing_xor","judge":"HackerRank","title":"Maximizing XOR","url":"https://vjudge.net/problem/HackerRank-maximizing-xor","difficulty":1,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"hackerrank_30_bitwise_and","judge":"HackerRank","title":"Day 29: Bitwise AND","url":"https://vjudge.net/problem/HackerRank-30-bitwise-and","difficulty":1,"starred":false,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"hackerrank_si_basic_check_bit","judge":"HackerRank","title":"Check bit","url":"https://vjudge.net/problem/HackerRank-si-basic-check-bit","difficulty":1,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"hackerrank_flipping_bits","judge":"HackerRank","title":"Flipping bits","url":"https://vjudge.net/problem/HackerRank-flipping-bits","difficulty":1,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"hackerrank_si_swap_bits","judge":"HackerRank","title":"Swap Bits","url":"https://vjudge.net/problem/HackerRank-si-swap-bits","difficulty":1,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"hackerrank_si_reverse_bits","judge":"HackerRank","title":"Reverse Bits","url":"https://vjudge.net/problem/HackerRank-si-reverse-bits","difficulty":1,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"codeforces_579a","judge":"Codeforces","title":"Raising Bacteria","url":"https://codeforces.com/problemset/problem/579/A","difficulty":1,"starred":false,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":true},{"id":"cses_1617","judge":"CSES","title":"Bit Strings","url":"https://cses.fi/problemset/task/1617","difficulty":1,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations","permutations_and_combinations"],"solved":true},{"id":"codeforces_1097b","judge":"Codeforces","title":"Petr and a Combination Lock","url":"https://codeforces.com/problemset/problem/1097/B","difficulty":2,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":true},{"id":"codeforces_550b","judge":"Codeforces","title":"Preparing Olympiad","url":"https://codeforces.com/problemset/problem/550/B","difficulty":2,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":true},{"id":"uva_12455","judge":"UVa","title":"Bars","url":"https://vjudge.net/problem/UVA-12455","difficulty":2,"starred":false,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"codeforces_258a","judge":"Codeforces","title":"Little Elephant and Bits","url":"https://vjudge.net/problem/CodeForces-258A","difficulty":2,"starred":false,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":true},{"id":"codeforces_96b","judge":"Codeforces","title":"Lucky Numbers (easy)","url":"https://codeforces.com/problemset/problem/96/B","difficulty":2,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":true},{"id":"atcoder_arc061_a","judge":"AtCoder","title":"Many Formulas","url":"https://vjudge.net/problem/AtCoder-arc061_a","difficulty":2,"starred":false,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"cses_1623","judge":"CSES","title":"Apple Division","url":"https://cses.fi/problemset/task/1623","difficulty":2,"starred":true,"topic":"bitwise_operations","topics":["recursion","bitwise_operations"],"solved":true},{"id":"codeforces_1646c","judge":"Codeforces","title":"Factorials and Powers of Two","url":"https://codeforces.com/contest/1646/problem/C","difficulty":2,"starred":true,"topic":"bitwise_operations","topics":["bitwise_operations"],"solved":false},{"id":"cf_group_223339u","judge":"Codeforces","title":"Knapsack","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/U","difficulty":3,"starred":true,"topic":"bitwise_operations","topics":["recursion","bitwise_operations"],"solved":false},{"id":"codeforces_486a","judge":"Codeforces","title":"Calculating Function","url":"https://codeforces.com/problemset/problem/486/A","difficulty":1,"starred":true,"topic":"complexity_analysis","topics":["complexity_analysis"],"solved":true},{"id":"codeforces_1328a","judge":"Codeforces","title":"Divisibility Problem","url":"https://codeforces.com/problemset/problem/1328/A","difficulty":1,"starred":true,"topic":"complexity_analysis","topics":["complexity_analysis"],"solved":true},{"id":"cses_1069","judge":"CSES","title":"Repetitions","url":"https://cses.fi/problemset/task/1069","difficulty":2,"starred":false,"topic":"complexity_analysis","topics":["complexity_analysis"],"solved":true},{"id":"spoj_inoutest","judge":"SPOJ","title":"Enormous Input and Output Test","url":"https://vjudge.net/problem/SPOJ-INOUTEST","difficulty":1,"starred":true,"topic":"fast_input_output","topics":["fast_input_output"],"solved":false},{"id":"cf_group_223339a","judge":"Codeforces","title":"Print Recursion","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/A","difficulty":1,"starred":true,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"cf_group_223339b","judge":"Codeforces","title":"Print from 1 to N","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/B","difficulty":1,"starred":true,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"cf_group_223339c","judge":"Codeforces","title":"Print from N to 1","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/C","difficulty":1,"starred":false,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"cf_group_223339j","judge":"Codeforces","title":"Factorial","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/J","difficulty":1,"starred":true,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"cf_group_223339o","judge":"Codeforces","title":"Fibonacci","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/O","difficulty":1,"starred":true,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"cf_group_223339f","judge":"Codeforces","title":"Print Even Indices","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/F","difficulty":1,"starred":false,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"spoj_hrecurs","judge":"SPOJ","title":"Hello Recursion","url":"https://vjudge.net/problem/SPOJ-HRECURS","difficulty":1,"starred":true,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"cses_1068","judge":"CSES","title":"Weird Algorithm","url":"https://cses.fi/problemset/task/1068","difficulty":1,"starred":true,"topic":"recursion","topics":["recursion"],"solved":true},{"id":"cf_group_223339r","judge":"Codeforces","title":"Palindrome Array","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/R","difficulty":1,"starred":false,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"cses_2165","judge":"CSES","title":"Tower of Hanoi","url":"https://vjudge.net/problem/CSES-2165","difficulty":1,"starred":true,"topic":"recursion","topics":["backtracking","recursion"],"solved":false},{"id":"cf_group_223339y","judge":"Codeforces","title":"Number of Ways","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/Y","difficulty":2,"starred":true,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"cf_group_223339w","judge":"Codeforces","title":"Reach Value","url":"https://codeforces.com/group/MWSDmqGsZm/contest/223339/problem/W","difficulty":3,"starred":true,"topic":"recursion","topics":["recursion"],"solved":false},{"id":"gym_405759k","judge":"CF Gym","title":"Divisors","url":"https://vjudge.net/problem/Gym-405759K","difficulty":1,"starred":true,"topic":"divisors","topics":["divisors"],"solved":false},{"id":"aizu_itp1_3_d","judge":"Aizu","title":"How Many Divisors?","url":"https://vjudge.net/problem/Aizu-ITP1_3_D","difficulty":1,"starred":false,"topic":"divisors","topics":["divisors"],"solved":false},{"id":"codeforces_762a","judge":"Codeforces","title":"k-th divisor","url":"https://vjudge.net/problem/CodeForces-762A","difficulty":1,"starred":true,"topic":"divisors","topics":["divisors"],"solved":true},{"id":"cses_1713","judge":"CSES","title":"Counting Divisors","url":"https://cses.fi/problemset/task/1713","difficulty":1,"starred":true,"topic":"divisors","topics":["divisors","sieve","sigma_function","harmonic_series"],"solved":true},{"id":"codeforces_1294c","judge":"Codeforces","title":"Product of Three Numbers","url":"https://codeforces.com/problemset/problem/1294/C","difficulty":2,"starred":true,"topic":"divisors","topics":["divisors"],"solved":true},{"id":"csacademy_gcd","judge":"CS Academy","title":"Greatest Common Divisor","url":"https://csacademy.com/contest/archive/task/gcd/","difficulty":1,"starred":true,"topic":"gcd_and_lcm","topics":["euclidean_algorithm","gcd_and_lcm"],"solved":false},{"id":"hackerrank_si_lcm_and_hcf","judge":"HackerRank","title":"LCM and HCF","url":"https://vjudge.net/problem/HackerRank-si-lcm-and-hcf","difficulty":1,"starred":true,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":false},{"id":"codeforces_1203c","judge":"Codeforces","title":"Common Divisors","url":"https://vjudge.net/problem/CodeForces-1203C","difficulty":1,"starred":true,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":true},{"id":"codeforces_1765m","judge":"Codeforces","title":"Minimum LCM","url":"https://vjudge.net/problem/CodeForces-1765M","difficulty":3,"starred":true,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":false},{"id":"codeforces_1285c","judge":"Codeforces","title":"Fadi and LCM","url":"https://vjudge.net/problem/CodeForces-1285C","difficulty":3,"starred":true,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":true},{"id":"codeforces_1536c","judge":"Codeforces","title":"Diluc and Kaeya","url":"https://codeforces.com/contest/1536/problem/C","difficulty":3,"starred":true,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":false},{"id":"codeforces_2007c","judge":"Codeforces","title":"Dora and C++","url":"https://codeforces.com/contest/2007/problem/C","difficulty":1,"starred":false,"topic":"gcd_and_lcm","topics":["bezouts_identity","gcd_and_lcm"],"solved":false},{"id":"codeforces_1916b","judge":"Codeforces","title":"Two Divisors","url":"https://codeforces.com/contest/1916/problem/B","difficulty":1,"starred":false,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":true},{"id":"codeforces_1732a","judge":"Codeforces","title":"Bestie","url":"https://codeforces.com/problemset/problem/1732/A","difficulty":2,"starred":false,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":false},{"id":"codeforces_1543a","judge":"Codeforces","title":"Exciting Bets","url":"https://codeforces.com/problemset/problem/1543/A","difficulty":2,"starred":false,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":false},{"id":"kattis_gcds","judge":"Kattis","title":"GCDs","url":"https://vjudge.net/problem/Kattis-gcds","difficulty":2,"starred":false,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":false},{"id":"codeforces_1389a","judge":"Codeforces","title":"LCM Problem","url":"https://codeforces.com/problemset/problem/1389/A","difficulty":2,"starred":false,"topic":"gcd_and_lcm","topics":["gcd_and_lcm","constructive_algorithms"],"solved":true},{"id":"atcoder_arc181_b","judge":"AtCoder","title":"Annoying String Problem","url":"https://atcoder.jp/contests/arc181/tasks/arc181_b","difficulty":3,"starred":false,"topic":"gcd_and_lcm","topics":["gcd_and_lcm"],"solved":false},{"id":"spoj_divsum","judge":"SPOJ","title":"Divisor Summation","url":"https://www.spoj.com/problems/DIVSUM/","difficulty":1,"starred":true,"topic":"harmonic_series","topics":["sieve","sigma_function","harmonic_series"],"solved":false},{"id":"codeforces_1850f","judge":"Codeforces","title":"We Were Both Children","url":"https://codeforces.com/problemset/problem/1850/F","difficulty":1,"starred":true,"topic":"harmonic_series","topics":["harmonic_series"],"solved":false},{"id":"spoj_comdiv","judge":"SPOJ","title":"Number of common divisors","url":"https://www.spoj.com/problems/COMDIV/","difficulty":1,"starred":false,"topic":"harmonic_series","topics":["sieve","sigma_function","harmonic_series"],"solved":true},{"id":"cf_gym_103373b","judge":"CF Gym","title":"Aliquot Sum","url":"https://codeforces.com/gym/103373/problem/B","difficulty":1,"starred":true,"topic":"harmonic_series","topics":["sigma_function","harmonic_series"],"solved":false},{"id":"codeforces_1594c","judge":"Codeforces","title":"Make Them Equal","url":"https://codeforces.com/contest/1594/problem/C","difficulty":1,"starred":false,"topic":"harmonic_series","topics":["harmonic_series"],"solved":false},{"id":"codeforces_1734c","judge":"Codeforces","title":"Removing Smallest Multiples","url":"https://codeforces.com/contest/1734/problem/C","difficulty":1,"starred":false,"topic":"harmonic_series","topics":["harmonic_series"],"solved":false},{"id":"codeforces_1350b","judge":"Codeforces","title":"Orac and Models","url":"https://codeforces.com/contest/1350/problem/B","difficulty":2,"starred":false,"topic":"harmonic_series","topics":["harmonic_series"],"solved":false},{"id":"codechef_super_hero","judge":"CodeChef","title":"Super Hero","url":"https://www.codechef.com/START159B/problems/SUPER_HERO","difficulty":2,"starred":false,"topic":"harmonic_series","topics":["harmonic_series"],"solved":false},{"id":"codeforces_2048d","judge":"Codeforces","title":"Kevin and Competition Memories","url":"https://codeforces.com/contest/2048/problem/D","difficulty":3,"starred":false,"topic":"harmonic_series","topics":["harmonic_series"],"solved":false},{"id":"cses_1646","judge":"CSES","title":"Static Range Sum Queries","url":"https://cses.fi/problemset/task/1646","difficulty":1,"starred":true,"topic":"prefix_sum","topics":["prefix_sum"],"solved":true},{"id":"yosupo_static_range_sum","judge":"Library Checker","title":"Static Range Sum","url":"https://judge.yosupo.jp/problem/static_range_sum","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"cf_group_262795h","judge":"Codeforces","title":"count a's","url":"https://codeforces.com/group/c3FDl9EUi9/contest/262795/problem/H","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_363b","judge":"Codeforces","title":"Fence","url":"https://codeforces.com/problemset/problem/363/B","difficulty":2,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1807d","judge":"Codeforces","title":"Odd Queries","url":"https://codeforces.com/contest/1807/problem/D","difficulty":1,"starred":true,"topic":"prefix_sum","topics":["prefix_sum"],"solved":true},{"id":"usaco_572","judge":"USACO","title":"Breed Counting","url":"https://vjudge.net/problem/USACO-572","difficulty":1,"starred":true,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_433b","judge":"Codeforces","title":"Kuriyama Mirai's Stones","url":"https://codeforces.com/contest/433/problem/B","difficulty":1,"starred":true,"topic":"prefix_sum","topics":["prefix_sum"],"solved":true},{"id":"usaco_595","judge":"USACO","title":"Subsequences Summing to Sevens","url":"https://usaco.org/index.php?page=viewproblem2&cpid=595","difficulty":2,"starred":true,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1738b","judge":"Codeforces","title":"Prefix Sum Addicts","url":"https://codeforces.com/problemset/problem/1738/B","difficulty":2,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"cses_1661","judge":"CSES","title":"Subarray Sums II","url":"https://cses.fi/problemset/task/1661","difficulty":2,"starred":true,"topic":"prefix_sum","topics":["map","prefix_sum"],"solved":false},{"id":"cses_1662","judge":"CSES","title":"Subarray Divisibility","url":"https://cses.fi/problemset/task/1662","difficulty":2,"starred":true,"topic":"prefix_sum","topics":["prefix_sum","map"],"solved":true},{"id":"codeforces_1692e","judge":"Codeforces","title":"Binary Deque","url":"https://codeforces.com/problemset/problem/1692/E","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1690d","judge":"Codeforces","title":"Black and White Stripe","url":"https://codeforces.com/contest/1690/problem/D","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1922c","judge":"Codeforces","title":"Closest Cities","url":"https://codeforces.com/contest/1922/problem/C","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codechef_chefsum","judge":"CodeChef","title":"Little Chef and Sums","url":"https://www.codechef.com/problems/CHEFSUM","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1832b","judge":"Codeforces","title":"Maximum Sum","url":"https://codeforces.com/contest/1832/problem/B","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1742e","judge":"Codeforces","title":"Scuza","url":"https://codeforces.com/problemset/problem/1742/E","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1926c","judge":"Codeforces","title":"Vlad and a Sum of Sum of Digits","url":"https://codeforces.com/problemset/problem/1926/C","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_474b","judge":"Codeforces","title":"Worms","url":"https://codeforces.com/problemset/problem/474/B","difficulty":1,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_2149d","judge":"Codeforces","title":"A and B","url":"https://codeforces.com/problemset/problem/2149/D","difficulty":2,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1945c","judge":"Codeforces","title":"Left and Right Houses","url":"https://codeforces.com/problemset/problem/1945/C","difficulty":2,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1808b","judge":"Codeforces","title":"Playing in a Casino","url":"https://codeforces.com/problemset/problem/1808/B","difficulty":2,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codechef_volcano","judge":"CodeChef","title":"Volcanic Eruption","url":"https://www.codechef.com/problems/VOLCANO?tab=statement","difficulty":2,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_2107c","judge":"Codeforces","title":"Maximum Subarray Sum","url":"https://codeforces.com/contest/2107/problem/C","difficulty":3,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_1915e","judge":"Codeforces","title":"Romantic Glasses","url":"https://codeforces.com/problemset/problem/1915/E","difficulty":3,"starred":true,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"atcoder_abc423_e","judge":"AtCoder","title":"Sum of Subarrays","url":"https://atcoder.jp/contests/abc423/tasks/abc423_e","difficulty":4,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"codeforces_2026d","judge":"Codeforces","title":"Sums of Segments","url":"https://codeforces.com/contest/2026/problem/D","difficulty":4,"starred":false,"topic":"prefix_sum","topics":["prefix_sum"],"solved":false},{"id":"cses_1650","judge":"CSES","title":"Range Xor Queries","url":"https://cses.fi/problemset/task/1650","difficulty":1,"starred":true,"topic":"prefix_xor","topics":["prefix_xor"],"solved":true},{"id":"codeforces_1970a1","judge":"Codeforces","title":"A1. Balanced Shuffle (Easy)","url":"https://codeforces.com/problemset/problem/1970/A1","difficulty":1,"starred":true,"topic":"pairs_and_tuples","topics":["pairs_and_tuples"],"solved":false},{"id":"codeforces_44a","judge":"Codeforces","title":"Indian Summer","url":"https://codeforces.com/contest/44/problem/A","difficulty":1,"starred":true,"topic":"pairs_and_tuples","topics":["pairs_and_tuples","stl_sort"],"solved":true},{"id":"aizu_itp2_1_a","judge":"Aizu","title":"Vector","url":"https://vjudge.net/problem/Aizu-ITP2_1_A","difficulty":1,"starred":true,"topic":"vector","topics":["vector"],"solved":false},{"id":"hackerrank_vector_sort","judge":"HackerRank","title":"Vector-Sort","url":"https://vjudge.net/problem/HackerRank-vector-sort","difficulty":1,"starred":true,"topic":"vector","topics":["vector"],"solved":false},{"id":"hackerrank_vector_erase","judge":"HackerRank","title":"Vector-Erase","url":"https://vjudge.net/problem/HackerRank-vector-erase","difficulty":1,"starred":true,"topic":"vector","topics":["vector"],"solved":false},{"id":"aizu_itp2_1_d","judge":"Aizu","title":"Vector II","url":"https://vjudge.net/problem/Aizu-ITP2_1_D","difficulty":1,"starred":true,"topic":"vector","topics":["vector","list"],"solved":false},{"id":"atcoder_arc087_a","judge":"AtCoder","title":"Good Sequence","url":"https://vjudge.net/problem/AtCoder-arc087_a","difficulty":1,"starred":false,"topic":"vector","topics":["vector"],"solved":false},{"id":"hackerrank_cpp_lower_bound","judge":"HackerRank","title":"Lower Bound-STL","url":"https://vjudge.net/problem/HackerRank-cpp-lower-bound","difficulty":2,"starred":true,"topic":"vector","topics":["vector"],"solved":false},{"id":"codeforces_704a","judge":"Codeforces","title":"Thor","url":"https://vjudge.net/problem/CodeForces-704A","difficulty":2,"starred":false,"topic":"vector","topics":["vector"],"solved":false},{"id":"eolymp_6122","judge":"Eolymp","title":"Simple Stack","url":"https://vjudge.net/problem/EOlymp-6122","difficulty":1,"starred":true,"topic":"stack","topics":["stack"],"solved":false},{"id":"leetcode_valid_parentheses","judge":"LeetCode","title":"Valid Parentheses","url":"https://leetcode.com/problems/valid-parentheses/","difficulty":1,"starred":true,"topic":"stack","topics":["balanced_brackets","stack"],"solved":true},{"id":"hackerrank_ctci_balanced_brackets","judge":"HackerRank","title":"Stacks: Balanced Brackets","url":"https://vjudge.net/problem/HackerRank-ctci-balanced-brackets","difficulty":1,"starred":true,"topic":"stack","topics":["stack"],"solved":false},{"id":"cses_1645","judge":"CSES","title":"Nearest Smaller Values","url":"https://cses.fi/problemset/task/1645","difficulty":1,"starred":true,"topic":"stack","topics":["all_subarray_maximum_minimum","stack"],"solved":true},{"id":"codeforces_5c","judge":"Codeforces","title":"Longest Regular Bracket Sequence","url":"https://codeforces.com/problemset/problem/5/C","difficulty":2,"starred":true,"topic":"stack","topics":["balanced_brackets","stack"],"solved":false},{"id":"codeforces_1997c","judge":"Codeforces","title":"Even Positions","url":"https://codeforces.com/problemset/problem/1997/C","difficulty":1,"starred":false,"topic":"stack","topics":["stack"],"solved":false},{"id":"atcoder_abc283_d","judge":"AtCoder","title":"Scope","url":"https://atcoder.jp/contests/abc283/tasks/abc283_d","difficulty":2,"starred":false,"topic":"stack","topics":["stack"],"solved":false},{"id":"spoj_queueez","judge":"SPOJ","title":"Easy Queue","url":"https://vjudge.net/problem/SPOJ-QUEUEEZ","difficulty":1,"starred":true,"topic":"queue","topics":["queue"],"solved":false},{"id":"aizu_alds1_3_b","judge":"Aizu","title":"Queue","url":"https://vjudge.net/problem/Aizu-ALDS1_3_B","difficulty":1,"starred":true,"topic":"queue","topics":["queue"],"solved":false},{"id":"uva_540","judge":"UVa","title":"Team Queue","url":"https://vjudge.net/problem/UVA-540","difficulty":2,"starred":true,"topic":"queue","topics":["queue"],"solved":false},{"id":"codeforces_450a","judge":"Codeforces","title":"Jzzhu and Children","url":"https://codeforces.com/contest/450/problem/A","difficulty":2,"starred":false,"topic":"queue","topics":["queue"],"solved":false},{"id":"codechef_ccop8","judge":"CodeChef","title":"8 Use Priority Queue Please","url":"https://vjudge.net/problem/CodeChef-CCOP8","difficulty":1,"starred":true,"topic":"priority_queue","topics":["priority_queue"],"solved":false},{"id":"hackerrank_hinata_priority_queue","judge":"HackerRank","title":"Hinata & Priority Queue","url":"https://vjudge.net/problem/HackerRank-hinata-priority-queue","difficulty":1,"starred":false,"topic":"priority_queue","topics":["priority_queue"],"solved":false},{"id":"codeforces_1800c2","judge":"Codeforces","title":"Powering the Hero (hard version)","url":"https://codeforces.com/contest/1800/problem/C2","difficulty":1,"starred":false,"topic":"priority_queue","topics":["priority_queue"],"solved":false},{"id":"aizu_alds1_9_c","judge":"Aizu","title":"Priority Queue","url":"https://vjudge.net/problem/Aizu-ALDS1_9_C","difficulty":1,"starred":true,"topic":"priority_queue","topics":["priority_queue"],"solved":false},{"id":"aizu_itp2_2_c","judge":"Aizu","title":"Priority Queue 2","url":"https://vjudge.net/problem/Aizu-ITP2_2_C","difficulty":1,"starred":true,"topic":"priority_queue","topics":["priority_queue"],"solved":false},{"id":"gym_381668c","judge":"CF Gym","title":"priority queue minimum","url":"https://vjudge.net/problem/Gym-381668C","difficulty":1,"starred":true,"topic":"priority_queue","topics":["priority_queue"],"solved":false},{"id":"codeforces_1526c2","judge":"Codeforces","title":"Potions (Hard Version)","url":"https://codeforces.com/contest/1526/problem/C2","difficulty":2,"starred":false,"topic":"priority_queue","topics":["priority_queue"],"solved":false},{"id":"cses_1164","judge":"CSES","title":"Room Allocation","url":"https://cses.fi/problemset/task/1164","difficulty":2,"starred":false,"topic":"priority_queue","topics":["priority_queue"],"solved":true},{"id":"leetcode_task_scheduler","judge":"LeetCode","title":"Task Scheduler","url":"https://leetcode.com/problems/task-scheduler/","difficulty":2,"starred":false,"topic":"priority_queue","topics":["priority_queue"],"solved":true},{"id":"hackerrank_si_implement_deque","judge":"HackerRank","title":"Implement DeQue","url":"https://vjudge.net/problem/HackerRank-si-implement-deque","difficulty":1,"starred":true,"topic":"deque","topics":["deque"],"solved":false},{"id":"simple deque","judge":"Eolymp","title":"Simple deque","url":"https://vjudge.net/problem/EOlymp-6128","difficulty":1,"starred":false,"topic":"deque","topics":["deque"],"solved":false},{"id":"aizu_itp2_1_b","judge":"Aizu","title":"Deque","url":"https://vjudge.net/problem/Aizu-ITP2_1_B","difficulty":1,"starred":false,"topic":"deque","topics":["deque"],"solved":false},{"id":"spoj_adaqueue","judge":"SPOJ","title":"Ada and Queue","url":"https://vjudge.net/problem/SPOJ-ADAQUEUE","difficulty":1,"starred":true,"topic":"deque","topics":["deque"],"solved":false},{"id":"codeforces_546c","judge":"Codeforces","title":"Soldier and Cards","url":"https://vjudge.net/problem/CodeForces-546C","difficulty":1,"starred":true,"topic":"deque","topics":["deque"],"solved":true},{"id":"codeforces_1179a","judge":"Codeforces","title":"Valeriy and Deque","url":"https://vjudge.net/problem/CodeForces-1179A","difficulty":3,"starred":true,"topic":"deque","topics":["deque"],"solved":false},{"id":"codeforces_1579e1","judge":"Codeforces","title":"E1. Permutation Minimization by Deque","url":"https://codeforces.com/problemset/problem/1579/E1","difficulty":1,"starred":false,"topic":"deque","topics":["deque"],"solved":false},{"id":"codeforces_1234b2","judge":"Codeforces","title":"Social Network (hard version)","url":"https://codeforces.com/contest/1234/problem/B2","difficulty":1,"starred":false,"topic":"deque","topics":["deque"],"solved":false},{"id":"codeforces_2094g","judge":"Codeforces","title":"Chimpanzini Bananini","url":"https://codeforces.com/contest/2094/problem/G","difficulty":2,"starred":false,"topic":"deque","topics":["deque"],"solved":false},{"id":"hackerrank_cpp_sets","judge":"HackerRank","title":"Sets-STL","url":"https://vjudge.net/problem/HackerRank-cpp-sets","difficulty":1,"starred":true,"topic":"set","topics":["set"],"solved":false},{"id":"cses_1621","judge":"CSES","title":"Distinct Numbers","url":"https://cses.fi/problemset/task/1621","difficulty":1,"starred":true,"topic":"set","topics":["set"],"solved":true},{"id":"yosupo_double_ended_priority_queue","judge":"Library Checker","title":"Double-Ended Priority Queue","url":"https://vjudge.net/problem/Yosupo-double_ended_priority_queue","difficulty":1,"starred":true,"topic":"set","topics":["set"],"solved":false},{"id":"cses_1091","judge":"CSES","title":"Concert Tickets","url":"https://cses.fi/problemset/task/1091","difficulty":1,"starred":true,"topic":"set","topics":["set"],"solved":true},{"id":"cses_2216","judge":"CSES","title":"Collecting Numbers","url":"https://cses.fi/problemset/task/2216","difficulty":2,"starred":true,"topic":"set","topics":["set"],"solved":true},{"id":"cses_1073","judge":"CSES","title":"Towers","url":"https://cses.fi/problemset/task/1073","difficulty":2,"starred":true,"topic":"set","topics":["set","greedy_algorithms"],"solved":true},{"id":"atcoder_abc193_c","judge":"AtCoder","title":"Unexpressed","url":"https://atcoder.jp/contests/abc193/tasks/abc193_c","difficulty":1,"starred":false,"topic":"set","topics":["set"],"solved":false},{"id":"hackerrank_cpp_maps","judge":"HackerRank","title":"Maps-STL","url":"https://vjudge.net/problem/HackerRank-cpp-maps","difficulty":1,"starred":true,"topic":"map","topics":["map"],"solved":false},{"id":"spoj_acmceg2b","judge":"SPOJ","title":"FIGUREFUL","url":"https://vjudge.net/problem/SPOJ-ACMCEG2B","difficulty":1,"starred":true,"topic":"map","topics":["map"],"solved":false},{"id":"gym_381668d","judge":"CF Gym","title":"Frinds and money","url":"https://vjudge.net/problem/Gym-381668D","difficulty":1,"starred":true,"topic":"map","topics":["map"],"solved":false},{"id":"uva_10295","judge":"UVa","title":"Hay Points","url":"https://vjudge.net/problem/UVA-10295","difficulty":1,"starred":true,"topic":"map","topics":["map"],"solved":false},{"id":"codeforces_855a","judge":"Codeforces","title":"Tom Riddle's Diary","url":"https://vjudge.net/problem/CodeForces-855A","difficulty":1,"starred":true,"topic":"map","topics":["map"],"solved":true},{"id":"codeforces_4c","judge":"Codeforces","title":"Registration System","url":"https://vjudge.net/problem/CodeForces-4C","difficulty":1,"starred":true,"topic":"map","topics":["map"],"solved":true},{"id":"uva_484","judge":"UVa","title":"The Department of Redundancy Department","url":"https://vjudge.net/problem/UVA-484","difficulty":1,"starred":true,"topic":"map","topics":["map"],"solved":false},{"id":"uva_10282","judge":"UVa","title":"Babelfish","url":"https://vjudge.net/problem/UVA-10282","difficulty":1,"starred":true,"topic":"map","topics":["map"],"solved":false},{"id":"cses_1640","judge":"CSES","title":"Sum of Two Values","url":"https://cses.fi/problemset/task/1640","difficulty":1,"starred":true,"topic":"map","topics":["gp_hash_table","map","two_pointers"],"solved":true},{"id":"cses_1641","judge":"CSES","title":"Sum of Three Values","url":"https://cses.fi/problemset/task/1641","difficulty":1,"starred":true,"topic":"map","topics":["map","two_pointers"],"solved":true},{"id":"codeforces_903c","judge":"Codeforces","title":"Boxes Packing","url":"https://vjudge.net/problem/CodeForces-903C","difficulty":1,"starred":false,"topic":"map","topics":["map"],"solved":false},{"id":"cses_1642","judge":"CSES","title":"Sum of Four Values","url":"https://cses.fi/problemset/task/1642","difficulty":1,"starred":true,"topic":"map","topics":["meet_in_the_middle","two_pointers","map","gp_hash_table"],"solved":true},{"id":"cses_1619","judge":"CSES","title":"Restaurant Customers","url":"https://cses.fi/problemset/task/1619","difficulty":1,"starred":true,"topic":"map","topics":["coordinate_compression","map","difference_array","stl_sort"],"solved":true},{"id":"spoj_homo","judge":"SPOJ","title":"Homo or Hetero","url":"https://vjudge.net/problem/SPOJ-HOMO","difficulty":2,"starred":true,"topic":"map","topics":["map"],"solved":false},{"id":"codechef_cvote","judge":"CodeChef","title":"Chef of the Year","url":"https://vjudge.net/problem/CodeChef-CVOTE","difficulty":2,"starred":false,"topic":"map","topics":["map"],"solved":false},{"id":"codeforces_554b","judge":"Codeforces","title":"Ohana Cleans Up","url":"https://codeforces.com/contest/554/problem/B","difficulty":1,"starred":false,"topic":"map","topics":["map"],"solved":false},{"id":"spoj_adafurow","judge":"SPOJ","title":"Ada and Furrows","url":"https://vjudge.net/problem/SPOJ-ADAFUROW","difficulty":1,"starred":true,"topic":"bitset","topics":["bitset"],"solved":false},{"id":"poj_2443","judge":"POJ","title":"Set Operation","url":"https://vjudge.net/problem/POJ-2443","difficulty":1,"starred":true,"topic":"bitset","topics":["bitset"],"solved":false},{"id":"atcoder_abc348_f","judge":"AtCoder","title":"Oddly Similar","url":"https://atcoder.jp/contests/abc348/tasks/abc348_f","difficulty":3,"starred":false,"topic":"bitset","topics":["bitset"],"solved":false},{"id":"aizu_alds1_3_c","judge":"Aizu","title":"Doubly Linked List","url":"https://vjudge.net/problem/Aizu-ALDS1_3_C","difficulty":1,"starred":true,"topic":"list","topics":["list"],"solved":false},{"id":"cf_edu_283911a","judge":"Codeforces","title":"Binary Search","url":"https://codeforces.com/edu/course/2/lesson/6/1/practice/contest/283911/problem/A","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_283911b","judge":"Codeforces","title":"Closest to the Left","url":"https://codeforces.com/edu/course/2/lesson/6/1/practice/contest/283911/problem/B","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_283911c","judge":"Codeforces","title":"Closest to the Right","url":"https://codeforces.com/edu/course/2/lesson/6/1/practice/contest/283911/problem/C","difficulty":1,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_283911d","judge":"Codeforces","title":"Fast search","url":"https://codeforces.com/edu/course/2/lesson/6/1/practice/contest/283911/problem/D","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cses_1620","judge":"CSES","title":"Factory Machines","url":"https://cses.fi/problemset/task/1620","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":true},{"id":"cf_edu_283932a","judge":"Codeforces","title":"Packing Rectangles","url":"https://codeforces.com/edu/course/2/lesson/6/2/practice/contest/283932/problem/A","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cses_2422","judge":"CSES","title":"Multiplication Table","url":"https://cses.fi/problemset/task/2422","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_283932b","judge":"Codeforces","title":"Ropes","url":"https://codeforces.com/edu/course/2/lesson/6/2/practice/contest/283932/problem/B","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_283932c","judge":"Codeforces","title":"Very Easy Task","url":"https://codeforces.com/edu/course/2/lesson/6/2/practice/contest/283932/problem/C","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_283932e","judge":"Codeforces","title":"Equation","url":"https://codeforces.com/edu/course/2/lesson/6/2/practice/contest/283932/problem/E","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_2014c","judge":"Codeforces","title":"Robin Hood in Town","url":"https://codeforces.com/contest/2014/problem/C","difficulty":1,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_1201c","judge":"Codeforces","title":"Maximum Median","url":"https://codeforces.com/contest/1201/problem/C","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":true},{"id":"cses_1085","judge":"CSES","title":"Array Division","url":"https://cses.fi/problemset/task/1085","difficulty":1,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_285083b","judge":"Codeforces","title":"Splitting an Array","url":"https://codeforces.com/edu/course/2/lesson/6/3/practice/contest/285083/problem/B","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"leetcode_ugly_number_iii","judge":"LeetCode","title":"Ugly Number III","url":"https://leetcode.com/problems/ugly-number-iii/","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search","principle_of_inclusion_and_exclusion"],"solved":false},{"id":"codeforces_1730b","judge":"Codeforces","title":"Meeting on the Line","url":"https://codeforces.com/problemset/problem/1730/B","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_285083a","judge":"Codeforces","title":"Get together","url":"https://codeforces.com/edu/course/2/lesson/6/3/practice/contest/285083/problem/A","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cses_2431","judge":"CSES","title":"Digit Queries","url":"https://cses.fi/problemset/task/2431","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":true},{"id":"cf_edu_285083c","judge":"Codeforces","title":"Cows in Stalls","url":"https://codeforces.com/edu/course/2/lesson/6/3/practice/contest/285083/problem/C","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"spoj_aggrcow","judge":"SPOJ","title":"AGGRCOW - Aggressive cows","url":"https://www.spoj.com/problems/AGGRCOW/","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_285069a","judge":"Codeforces","title":"Maximum Average Segment","url":"https://codeforces.com/edu/course/2/lesson/6/4/practice/contest/285069/problem/A","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_285069c","judge":"Codeforces","title":"Pair Selection","url":"https://codeforces.com/edu/course/2/lesson/6/4/practice/contest/285069/problem/C","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_1117c","judge":"Codeforces","title":"Magic Ship","url":"https://codeforces.com/problemset/problem/1117/C","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_782b","judge":"Codeforces","title":"The Meeting Place Cannot Be Changed","url":"https://codeforces.com/contest/782/problem/B","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_1538f","judge":"Codeforces","title":"Interesting Function","url":"https://codeforces.com/problemset/problem/1538/F","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_670d1","judge":"Codeforces","title":"Magic Powder - 1","url":"https://codeforces.com/problemset/problem/670/D1","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_348a","judge":"Codeforces","title":"Mafia","url":"https://codeforces.com/problemset/problem/348/A","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"yosupo_static_range_frequency","judge":"Library Checker","title":"Static Range Frequency","url":"https://judge.yosupo.jp/problem/static_range_frequency","difficulty":2,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_1538g","judge":"Codeforces","title":"Gift Set","url":"https://codeforces.com/problemset/problem/1538/G","difficulty":2,"starred":false,"topic":"binary_search","topics":["ternary_search","binary_search"],"solved":false},{"id":"atcoder_abc227_d","judge":"AtCoder","title":"Project Planning","url":"https://atcoder.jp/contests/abc227/tasks/abc227_d","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_1985f","judge":"Codeforces","title":"Final Boss","url":"https://codeforces.com/contest/1985/problem/F","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_285084c","judge":"Codeforces","title":"K-th Sum","url":"https://codeforces.com/edu/course/2/lesson/6/5/practice/contest/285084/problem/C","difficulty":3,"starred":true,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"gym_101242l","judge":"CF Gym","title":"Swap Space","url":"https://vjudge.net/problem/Gym-101242L","difficulty":3,"starred":true,"topic":"binary_search","topics":["binary_search","activity_selection_problem"],"solved":false},{"id":"codeforces_1996f","judge":"Codeforces","title":"Bomb","url":"https://codeforces.com/contest/1996/problem/F","difficulty":3,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_2020b","judge":"Codeforces","title":"Brightness Begins","url":"https://codeforces.com/contest/2020/problem/B","difficulty":1,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_600b","judge":"Codeforces","title":"Queries about less or equal elements","url":"https://codeforces.com/contest/600/problem/B","difficulty":1,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"atcoder_abc395_f","judge":"AtCoder","title":"Smooth Occlusion","url":"https://atcoder.jp/contests/abc395/tasks/abc395_f","difficulty":1,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_1703f","judge":"Codeforces","title":"Yet Another Problem About Pairs Satisfying an Inequality","url":"https://codeforces.com/contest/1703/problem/F","difficulty":1,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"ioi20_routers","judge":"oj.uz","title":"Finding Routers","url":"https://oj.uz/problem/view/IOI20_routers","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_670d2","judge":"Codeforces","title":"Magic Powder - 2","url":"https://codeforces.com/contest/670/problem/D2","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_2091d","judge":"Codeforces","title":"Place of the Olympiad","url":"https://codeforces.com/contest/2091/problem/D","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_1794c","judge":"Codeforces","title":"Scoring Subsequences","url":"https://codeforces.com/problemset/problem/1794/C","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"codeforces_2146c","judge":"Codeforces","title":"Wrong Binary Search","url":"https://codeforces.com/problemset/problem/2146/C","difficulty":2,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"atcoder_abc374_e","judge":"AtCoder","title":"Sensor Optimization Dilemma 2","url":"https://atcoder.jp/contests/abc374/tasks/abc374_e","difficulty":3,"starred":false,"topic":"binary_search","topics":["binary_search"],"solved":false},{"id":"cf_edu_307092a","judge":"Codeforces","title":"Merging Arrays","url":"https://codeforces.com/edu/course/2/lesson/9/1/practice/contest/307092/problem/A","difficulty":1,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"cf_edu_307093a","judge":"Codeforces","title":"Segment with Small Sum","url":"https://codeforces.com/edu/course/2/lesson/9/2/practice/contest/307093/problem/A","difficulty":1,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"cf_edu_307093b","judge":"Codeforces","title":"Segment with Big Sum","url":"https://codeforces.com/edu/course/2/lesson/9/2/practice/contest/307093/problem/B","difficulty":1,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"cf_edu_307093c","judge":"Codeforces","title":"Number of Segments with Small Sum","url":"https://codeforces.com/edu/course/2/lesson/9/2/practice/contest/307093/problem/C","difficulty":1,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"cf_edu_307093d","judge":"Codeforces","title":"Number of Segments with Big Sum","url":"https://codeforces.com/edu/course/2/lesson/9/2/practice/contest/307093/problem/D","difficulty":1,"starred":false,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"cses_1660","judge":"CSES","title":"Subarray Sums I","url":"https://cses.fi/problemset/task/1660","difficulty":1,"starred":false,"topic":"two_pointers","topics":["two_pointers"],"solved":true},{"id":"codeforces_1538c","judge":"Codeforces","title":"Number of Pairs","url":"https://codeforces.com/problemset/problem/1538/C","difficulty":2,"starred":false,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"codeforces_279b","judge":"Codeforces","title":"Books","url":"https://codeforces.com/contest/279/problem/B","difficulty":1,"starred":false,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"codeforces_702c","judge":"Codeforces","title":"Cellular Network","url":"https://codeforces.com/contest/702/problem/C","difficulty":1,"starred":false,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"codeforces_701c","judge":"Codeforces","title":"They Are Everywhere","url":"https://codeforces.com/problemset/problem/701/C","difficulty":1,"starred":false,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"codeforces_1669f","judge":"Codeforces","title":"Eating Candies","url":"https://codeforces.com/contest/1669/problem/F","difficulty":1,"starred":false,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"codeforces_1006c","judge":"Codeforces","title":"Three Parts of the Array","url":"https://codeforces.com/problemset/problem/1006/C","difficulty":1,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"cses_1141","judge":"CSES","title":"Playlist","url":"https://cses.fi/problemset/task/1141","difficulty":1,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":true},{"id":"codeforces_2148e","judge":"Codeforces","title":"Split","url":"https://codeforces.com/problemset/problem/2148/E","difficulty":2,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"cses_2428","judge":"CSES","title":"Subarray Distinct Values","url":"https://cses.fi/problemset/task/2428","difficulty":1,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"cf_edu_307093e","judge":"Codeforces","title":"Segments with Small Set","url":"https://codeforces.com/edu/course/2/lesson/9/2/practice/contest/307093/problem/E","difficulty":2,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"cf_edu_307093f","judge":"Codeforces","title":"Segments with Small Spread","url":"https://codeforces.com/edu/course/2/lesson/9/2/practice/contest/307093/problem/F","difficulty":2,"starred":true,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"codeforces_1777c","judge":"Codeforces","title":"Quiz Master","url":"https://codeforces.com/contest/1777/problem/C","difficulty":2,"starred":false,"topic":"two_pointers","topics":["two_pointers"],"solved":false},{"id":"dmoj_sort1","judge":"DMOJ","title":"Bubble Sort","url":"https://vjudge.net/problem/DMOJ-sort1","difficulty":1,"starred":false,"topic":"bubble_sort","topics":["bubble_sort"],"solved":false},{"id":"hackerrank_ctci_bubble_sort","judge":"HackerRank","title":"Sorting: Bubble Sort","url":"https://vjudge.net/problem/HackerRank-ctci-bubble-sort","difficulty":1,"starred":true,"topic":"bubble_sort","topics":["bubble_sort"],"solved":false},{"id":"aizu_alds1_2_b","judge":"Aizu","title":"Selection Sort","url":"https://vjudge.net/problem/Aizu-ALDS1_2_B","difficulty":1,"starred":true,"topic":"selection_sort","topics":["selection_sort"],"solved":false},{"id":"aizu_alds1_1_a","judge":"Aizu","title":"Insertion Sort","url":"https://vjudge.net/problem/Aizu-ALDS1_1_A","difficulty":1,"starred":true,"topic":"insertion_sort","topics":["insertion_sort"],"solved":false},{"id":"hackerrank_countingsort2","judge":"HackerRank","title":"Counting Sort 2","url":"https://vjudge.net/problem/HackerRank-countingsort2","difficulty":1,"starred":true,"topic":"counting_sort","topics":["counting_sort"],"solved":false},{"id":"hackerrank_countingsort4","judge":"HackerRank","title":"The Full Counting Sort","url":"https://vjudge.net/problem/HackerRank-countingsort4","difficulty":1,"starred":false,"topic":"counting_sort","topics":["counting_sort"],"solved":false},{"id":"gym_324997d","judge":"CF Gym","title":"Merge sort","url":"https://vjudge.net/problem/Gym-324997D","difficulty":1,"starred":true,"topic":"merge_sort","topics":["merge_sort"],"solved":false},{"id":"aizu_alds1_5_b","judge":"Aizu","title":"Merge Sort 2","url":"https://vjudge.net/problem/Aizu-ALDS1_5_B","difficulty":2,"starred":false,"topic":"merge_sort","topics":["merge_sort"],"solved":false},{"id":"spoj_invcnt","judge":"SPOJ","title":"Inversion Count","url":"https://vjudge.net/problem/SPOJ-INVCNT","difficulty":1,"starred":true,"topic":"merge_sort","topics":["merge_sort","ordered_set","inversions","divide_and_conquer"],"solved":false},{"id":"spoj_bubblesort","judge":"SPOJ","title":"Bubble Sort?","url":"https://vjudge.net/problem/SPOJ-BUBBLESORT","difficulty":2,"starred":true,"topic":"merge_sort","topics":["merge_sort"],"solved":false},{"id":"aizu_alds1_6_c","judge":"Aizu","title":"Quick Sort","url":"https://vjudge.net/problem/Aizu-ALDS1_6_C","difficulty":1,"starred":true,"topic":"quick_sort","topics":["quick_sort"],"solved":false},{"id":"codechef_rdx","judge":"CodeChef","title":"Radix Sort","url":"https://vjudge.net/problem/CodeChef-RDX","difficulty":1,"starred":true,"topic":"radix_sort","topics":["radix_sort"],"solved":false},{"id":"codechef_tsort","judge":"CodeChef","title":"Simple Sorting","url":"https://vjudge.net/problem/CodeChef-TSORT","difficulty":1,"starred":true,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"hackerrank_ctci_comparator_sorting","judge":"HackerRank","title":"Sorting: Comparator","url":"https://vjudge.net/problem/HackerRank-ctci-comparator-sorting","difficulty":1,"starred":true,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"spoj_sort2d","judge":"SPOJ","title":"2D-SORT","url":"https://vjudge.net/problem/SPOJ-SORT2D","difficulty":1,"starred":true,"topic":"stl_sort","topics":["stl_sort"],"solved":true},{"id":"aizu_itp2_5_b","judge":"Aizu","title":"Sorting Tuples","url":"https://vjudge.net/problem/Aizu-ITP2_5_B","difficulty":1,"starred":true,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"hdu_5427","judge":"HDU","title":"A problem of sorting","url":"https://vjudge.net/problem/HDU-5427","difficulty":1,"starred":true,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_632c","judge":"Codeforces","title":"The Smallest String Concatenation","url":"https://codeforces.com/problemset/problem/632/C","difficulty":2,"starred":true,"topic":"stl_sort","topics":["stl_sort","exchange_arguments"],"solved":false},{"id":"codeforces_1312b","judge":"Codeforces","title":"Bogosort","url":"https://vjudge.net/problem/CodeForces-1312B","difficulty":1,"starred":false,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_454b","judge":"Codeforces","title":"Little Pony and Sort by Shift","url":"https://vjudge.net/problem/CodeForces-454B","difficulty":1,"starred":false,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_1851b","judge":"Codeforces","title":"Parity Sort","url":"https://vjudge.net/problem/CodeForces-1851B","difficulty":1,"starred":true,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_166a","judge":"Codeforces","title":"Rank List","url":"https://codeforces.com/problemset/problem/166/A","difficulty":1,"starred":false,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_1605b","judge":"Codeforces","title":"Reverse Sort","url":"https://vjudge.net/problem/CodeForces-1605B","difficulty":1,"starred":false,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_451b","judge":"Codeforces","title":"Sort the Array","url":"https://vjudge.net/problem/CodeForces-451B","difficulty":1,"starred":false,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"hackerrank_big_sorting","judge":"HackerRank","title":"Big Sorting","url":"https://vjudge.net/problem/HackerRank-big-sorting","difficulty":2,"starred":true,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_2024c","judge":"Codeforces","title":"Concatenation of Arrays","url":"https://codeforces.com/contest/2024/problem/C","difficulty":2,"starred":true,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_1681c","judge":"Codeforces","title":"Double Sort","url":"https://vjudge.net/problem/CodeForces-1681C","difficulty":2,"starred":true,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_1472e","judge":"Codeforces","title":"Correct Placement","url":"https://codeforces.com/problemset/problem/1472/E","difficulty":3,"starred":false,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"codeforces_1478c","judge":"Codeforces","title":"Nezzar and Symmetric Array","url":"https://codeforces.com/problemset/problem/1478/C","difficulty":3,"starred":false,"topic":"stl_sort","topics":["stl_sort"],"solved":false},{"id":"spoj_abacaba","judge":"SPOJ","title":"Print The Pattern","url":"https://vjudge.net/problem/SPOJ-ABACABA","difficulty":1,"starred":true,"topic":"divide_and_conquer","topics":["divide_and_conquer"],"solved":false},{"id":"codeforces_873d","judge":"Codeforces","title":"Merge Sort?","url":"https://vjudge.net/problem/CodeForces-873D","difficulty":2,"starred":true,"topic":"divide_and_conquer","topics":["divide_and_conquer"],"solved":false},{"id":"spoj_adacabaa","judge":"SPOJ","title":"Ada and Species","url":"https://www.spoj.com/problems/ADACABAA/","difficulty":3,"starred":false,"topic":"divide_and_conquer","topics":["bit","divide_and_conquer"],"solved":false},{"id":"gym_102951b","judge":"CF Gym","title":"Studying Algorithms","url":"https://vjudge.net/problem/Gym-102951B","difficulty":1,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"cses_1094","judge":"CSES","title":"Increasing Array","url":"https://cses.fi/problemset/task/1094","difficulty":1,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":true},{"id":"cses_1090","judge":"CSES","title":"Ferris Wheel","url":"https://cses.fi/problemset/task/1090","difficulty":1,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":true},{"id":"cses_1630","judge":"CSES","title":"Tasks and Deadlines","url":"https://cses.fi/problemset/task/1630","difficulty":1,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":true},{"id":"cses_1631","judge":"CSES","title":"Reading Books","url":"https://cses.fi/problemset/task/1631","difficulty":1,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":true},{"id":"cses_1092","judge":"CSES","title":"Two Sets","url":"https://cses.fi/problemset/task/1092","difficulty":2,"starred":true,"topic":"greedy_algorithms","topics":["constructive_algorithms","greedy_algorithms"],"solved":true},{"id":"usaco_1012","judge":"USACO","title":"Mad Scientist","url":"https://vjudge.net/problem/USACO-1012","difficulty":2,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"cses_1074","judge":"CSES","title":"Stick Lengths","url":"https://cses.fi/problemset/task/1074","difficulty":2,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":true},{"id":"cses_1643","judge":"CSES","title":"Maximum Subarray Sum","url":"https://cses.fi/problemset/task/1643","difficulty":2,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":true},{"id":"codeforces_762b","judge":"Codeforces","title":"USB vs. PS/2","url":"https://codeforces.com/contest/762/problem/B","difficulty":1,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"codeforces_1158a","judge":"Codeforces","title":"The Party and Sweets","url":"https://codeforces.com/problemset/problem/1158/A","difficulty":2,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"codeforces_1924a","judge":"Codeforces","title":"Did We Get Everything Covered?","url":"https://codeforces.com/problemset/problem/1924/A","difficulty":2,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"codeforces_1919c","judge":"Codeforces","title":"Grouping Increases","url":"https://codeforces.com/problemset/problem/1919/C","difficulty":2,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"codeforces_1896c","judge":"Codeforces","title":"Matching Arrays","url":"https://codeforces.com/problemset/problem/1896/C","difficulty":2,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"codeforces_1779c","judge":"Codeforces","title":"Least Prefix Sum","url":"https://codeforces.com/problemset/problem/1779/C","difficulty":2,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"codeforces_1974g","judge":"Codeforces","title":"Money Buys Less Happiness Now","url":"https://codeforces.com/contest/1974/problem/G","difficulty":3,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"cses_2183","judge":"CSES","title":"Missing Coin Sum","url":"https://cses.fi/problemset/task/2183","difficulty":3,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":true},{"id":"leetcode_increasing_triplet_subsequence","judge":"LeetCode","title":"Increasing Triplet Subsequence","url":"https://leetcode.com/problems/increasing-triplet-subsequence/","difficulty":1,"starred":true,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"cses_1629","judge":"CSES","title":"Movie Festival","url":"https://cses.fi/problemset/task/1629/","difficulty":1,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":true},{"id":"codeforces_1914c","judge":"Codeforces","title":"Quests","url":"https://codeforces.com/problemset/problem/1914/C","difficulty":2,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"codeforces_2014d","judge":"Codeforces","title":"Robert Hood and Mrs Hood","url":"https://codeforces.com/contest/2014/problem/D","difficulty":2,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"codeforces_1882b","judge":"Codeforces","title":"Sets and Union","url":"https://codeforces.com/contest/1882/problem/B","difficulty":2,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"cses_1084","judge":"CSES","title":"Apartments","url":"https://cses.fi/problemset/task/1084","difficulty":3,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":true},{"id":"codeforces_2061d","judge":"Codeforces","title":"Kevin and Numbers","url":"https://codeforces.com/contest/2061/problem/D","difficulty":3,"starred":false,"topic":"greedy_algorithms","topics":["greedy_algorithms"],"solved":false},{"id":"codeforces_1454a","judge":"Codeforces","title":"Special Permutation","url":"https://codeforces.com/problemset/problem/1454/A","difficulty":1,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":true},{"id":"codeforces_1325a","judge":"Codeforces","title":"EhAb AnD gCd","url":"https://codeforces.com/problemset/problem/1325/A","difficulty":1,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":true},{"id":"codeforces_1335b","judge":"Codeforces","title":"Construct the String","url":"https://codeforces.com/problemset/problem/1335/B","difficulty":1,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"cses_1070","judge":"CSES","title":"Permutations","url":"https://cses.fi/problemset/task/1070","difficulty":1,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":true},{"id":"codeforces_754a","judge":"Codeforces","title":"Lesha and array splitting","url":"https://codeforces.com/problemset/problem/754/A","difficulty":1,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"cses_1755","judge":"CSES","title":"Palindrome Reorder","url":"https://cses.fi/problemset/task/1755","difficulty":1,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":true},{"id":"codeforces_1665a","judge":"Codeforces","title":"GCD vs LCM","url":"https://codeforces.com/problemset/problem/1665/A","difficulty":1,"starred":false,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":true},{"id":"codeforces_1028b","judge":"Codeforces","title":"Unnatural Conditions","url":"https://codeforces.com/contest/1028/problem/B","difficulty":1,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_1476a","judge":"Codeforces","title":"K-divisible Sum","url":"https://codeforces.com/problemset/problem/1476/A","difficulty":1,"starred":false,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":true},{"id":"codeforces_1957b","judge":"Codeforces","title":"A BIT of a Construction","url":"https://codeforces.com/problemset/problem/1957/B","difficulty":2,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_1497c2","judge":"Codeforces","title":"k-LCM (hard version)","url":"https://codeforces.com/problemset/problem/1497/C2","difficulty":2,"starred":false,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_1353d","judge":"Codeforces","title":"Constructing the Array","url":"https://codeforces.com/problemset/problem/1353/D","difficulty":2,"starred":false,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_1364c","judge":"Codeforces","title":"Ehab and Prefix MEXs","url":"https://codeforces.com/problemset/problem/1364/C","difficulty":2,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_1381a2","judge":"Codeforces","title":"Prefix Flip (Hard Version)","url":"https://codeforces.com/problemset/problem/1381/A2","difficulty":2,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_1396a","judge":"Codeforces","title":"Multiples of Length","url":"https://codeforces.com/problemset/problem/1396/A","difficulty":2,"starred":true,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_1512d","judge":"Codeforces","title":"Corrupted Array","url":"https://codeforces.com/problemset/problem/1512/D","difficulty":1,"starred":false,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_2137b","judge":"Codeforces","title":"Fun Permutation","url":"https://codeforces.com/contest/2137/problem/B","difficulty":1,"starred":false,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_1691b","judge":"Codeforces","title":"Shoe Shuffling","url":"https://codeforces.com/contest/1691/problem/B","difficulty":1,"starred":false,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_1978c","judge":"Codeforces","title":"Manhattan Permutations","url":"https://codeforces.com/contest/1978/problem/C","difficulty":2,"starred":false,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"codeforces_2057c","judge":"Codeforces","title":"Trip to the Olympiad","url":"https://codeforces.com/contest/2057/problem/C","difficulty":3,"starred":false,"topic":"constructive_algorithms","topics":["constructive_algorithms"],"solved":false},{"id":"cses_1652","judge":"CSES","title":"Forest Queries","url":"https://cses.fi/problemset/task/1652","difficulty":1,"starred":true,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":true},{"id":"cf_group_262795g","judge":"Codeforces","title":"range sum 2d","url":"https://codeforces.com/group/c3FDl9EUi9/contest/262795/problem/G","difficulty":1,"starred":true,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":false},{"id":"codeforces_1722e","judge":"Codeforces","title":"Counting Rectangles","url":"https://codeforces.com/contest/1722/problem/E","difficulty":1,"starred":true,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":false},{"id":"usaco_919","judge":"USACO","title":"Painting the Barn","url":"https://vjudge.net/problem/USACO-919","difficulty":1,"starred":false,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":false},{"id":"usaco_416","judge":"USACO","title":"The Lazy Cow","url":"https://vjudge.net/problem/USACO-416","difficulty":1,"starred":false,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":false},{"id":"leetcode_matrix_block_sum","judge":"LeetCode","title":"Matrix Block Sum","url":"https://leetcode.com/problems/matrix-block-sum/","difficulty":1,"starred":false,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":false},{"id":"codeforces_1829g","judge":"Codeforces","title":"Hits Different","url":"https://codeforces.com/contest/1829/problem/G","difficulty":4,"starred":false,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":false},{"id":"codechef_tictacto","judge":"CodeChef","title":"Tic Tac Toe","url":"https://www.codechef.com/LTIME97B/problems/TICTACTO","difficulty":2,"starred":false,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":false},{"id":"codeforces_1982d","judge":"Codeforces","title":"Beauty of the mountains","url":"https://codeforces.com/contest/1982/problem/D","difficulty":2,"starred":true,"topic":"2d_prefix_sum","topics":["bezouts_identity","2d_prefix_sum"],"solved":false},{"id":"cf_gym_101532d","judge":"CF Gym","title":"Counting Test","url":"https://codeforces.com/gym/101532/problem/D","difficulty":2,"starred":true,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":false},{"id":"codeforces_2113c","judge":"Codeforces","title":"Smilo and Minecraft","url":"https://codeforces.com/contest/2113/problem/C","difficulty":3,"starred":false,"topic":"2d_prefix_sum","topics":["2d_prefix_sum"],"solved":false},{"id":"codeforces_816b","judge":"Codeforces","title":"Karen and Coffee","url":"https://codeforces.com/contest/816/problem/B","difficulty":1,"starred":true,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"hackerrank_crush","judge":"HackerRank","title":"Array Manipulation","url":"https://www.hackerrank.com/challenges/crush/problem","difficulty":1,"starred":true,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"codeforces_296c","judge":"Codeforces","title":"Greg and Array","url":"https://codeforces.com/contest/296/problem/C","difficulty":2,"starred":true,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"codeforces_276c","judge":"Codeforces","title":"Little Girl and Maximum Sum","url":"https://codeforces.com/contest/276/problem/C","difficulty":2,"starred":true,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"codeforces_863e","judge":"Codeforces","title":"Turn Off The TV","url":"https://codeforces.com/contest/863/problem/E","difficulty":2,"starred":false,"topic":"difference_array","topics":["difference_array","coordinate_compression"],"solved":false},{"id":"codeforces_602b","judge":"Codeforces","title":"Approximating a Constant Range","url":"https://codeforces.com/contest/602/problem/B","difficulty":1,"starred":false,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"codeforces_177d2","judge":"Codeforces","title":"Encrypting Messages","url":"https://codeforces.com/contest/177/problem/D2","difficulty":1,"starred":true,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"atcoder_abc419_d","judge":"AtCoder","title":"Substr Swap","url":"https://atcoder.jp/contests/abc419/tasks/abc419_d","difficulty":1,"starred":false,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"codechef_cens20a","judge":"CodeChef","title":"Cherry and Bits","url":"https://www.codechef.com/CENS2020/problems/CENS20A","difficulty":2,"starred":true,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"codeforces_1707b","judge":"Codeforces","title":"Difference Array","url":"https://vjudge.net/problem/CodeForces-1707B","difficulty":2,"starred":false,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"codeforces_2030d","judge":"Codeforces","title":"QED's Favorite Permutation","url":"https://codeforces.com/contest/2030/problem/D","difficulty":3,"starred":false,"topic":"difference_array","topics":["difference_array"],"solved":false},{"id":"codeforces_1692g","judge":"Codeforces","title":"2^Sort","url":"https://codeforces.com/problemset/problem/1692/G","difficulty":1,"starred":false,"topic":"sliding_window_technique","topics":["sliding_window_technique"],"solved":false},{"id":"cses_3221","judge":"CSES","title":"Sliding Window Minimum","url":"https://cses.fi/boi24/task/3221","difficulty":1,"starred":true,"topic":"sliding_window_technique","topics":["monotonous_queue","sliding_window_technique"],"solved":true},{"id":"atcoder_abc194_e","judge":"AtCoder","title":"Mex Min","url":"https://atcoder.jp/contests/abc194/tasks/abc194_e","difficulty":2,"starred":true,"topic":"sliding_window_technique","topics":["sliding_window_technique"],"solved":false},{"id":"cses_1076","judge":"CSES","title":"Sliding Window Median","url":"https://cses.fi/problemset/task/1076","difficulty":2,"starred":true,"topic":"sliding_window_technique","topics":["sliding_window_technique","ordered_set"],"solved":true},{"id":"hackerrank_deque_stl","judge":"HackerRank","title":"Deque-STL","url":"https://vjudge.net/problem/HackerRank-deque-stl","difficulty":3,"starred":true,"topic":"sliding_window_technique","topics":["sliding_window_technique"],"solved":false},{"id":"codechef_p6172","judge":"CodeChef","title":"Tactical Removal","url":"https://www.codechef.com/problems/P6172","difficulty":3,"starred":false,"topic":"sliding_window_technique","topics":["sliding_window_technique"],"solved":false},{"id":"codeforces_484a","judge":"Codeforces","title":"Bits","url":"https://codeforces.com/problemset/problem/484/A","difficulty":1,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1421a","judge":"Codeforces","title":"XORwice","url":"https://codeforces.com/problemset/problem/1421/A","difficulty":1,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codechef_nxs2","judge":"CodeChef","title":"Bitwise Operators","url":"https://vjudge.net/problem/CodeChef-NXS2","difficulty":1,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1527a","judge":"Codeforces","title":"And Then There Were K","url":"https://codeforces.com/problemset/problem/1527/A","difficulty":1,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1514b","judge":"Codeforces","title":"AND 0, Sum Big","url":"https://codeforces.com/problemset/problem/1514/B","difficulty":1,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":true},{"id":"codechef_bittup","judge":"CodeChef","title":"Bitwise Tuples","url":"https://vjudge.net/problem/CodeChef-BITTUP","difficulty":1,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1682b","judge":"Codeforces","title":"AND Sorting","url":"https://vjudge.net/problem/CodeForces-1682B","difficulty":1,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1973b","judge":"Codeforces","title":"Cat, Fox and the Lonely Array","url":"https://codeforces.com/contest/1973/problem/B","difficulty":1,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_242e","judge":"Codeforces","title":"XOR on Segment","url":"https://codeforces.com/problemset/problem/242/E","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["segment_tree_with_lazy_propagation","bit_manipulation"],"solved":false},{"id":"codeforces_482b","judge":"Codeforces","title":"Interesting Array","url":"https://codeforces.com/contest/482/problem/B","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["segment_tree","bit_manipulation"],"solved":false},{"id":"codeforces_2118c","judge":"Codeforces","title":"Make It Beautiful","url":"https://codeforces.com/contest/2118/problem/C","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1368d","judge":"Codeforces","title":"AND, OR and square sum","url":"https://codeforces.com/problemset/problem/1368/D","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"atcoder_abc171_e","judge":"AtCoder","title":"Red Scarf","url":"https://vjudge.net/problem/AtCoder-abc171_e","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation","the_xor_trick"],"solved":false},{"id":"hackerrank_sum_vs_xor","judge":"HackerRank","title":"Sum vs XOR","url":"https://vjudge.net/problem/HackerRank-sum-vs-xor","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"hackerrank_the_great_xor","judge":"HackerRank","title":"The Great XOR","url":"https://vjudge.net/problem/HackerRank-the-great-xor","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1981b","judge":"Codeforces","title":"Turtle and an Infinite Sequence","url":"https://codeforces.com/problemset/problem/1981/B","difficulty":2,"starred":false,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1567b","judge":"Codeforces","title":"MEXor Mixup","url":"https://codeforces.com/problemset/problem/1567/B","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1420b","judge":"Codeforces","title":"Rock and Lever","url":"https://codeforces.com/problemset/problem/1420/B","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1362b","judge":"Codeforces","title":"Johnny and His Hobbies","url":"https://codeforces.com/problemset/problem/1362/B","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1615b","judge":"Codeforces","title":"And It's Non-Zero","url":"https://codeforces.com/problemset/problem/1615/B","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1095c","judge":"Codeforces","title":"Powers Of Two","url":"https://codeforces.com/problemset/problem/1095/C","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1270c","judge":"Codeforces","title":"Make Good","url":"https://codeforces.com/problemset/problem/1270/C","difficulty":2,"starred":false,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"atcoder_abc147_d","judge":"AtCoder","title":"Xor Sum 4","url":"https://vjudge.net/problem/AtCoder-abc147_d","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation","contribution_technique"],"solved":false},{"id":"codeforces_1513b","judge":"Codeforces","title":"AND Sequences","url":"https://codeforces.com/problemset/problem/1513/B","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1325d","judge":"Codeforces","title":"Ehab the Xorcist","url":"https://codeforces.com/problemset/problem/1325/D","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1151b","judge":"Codeforces","title":"Dima and a Bad XOR","url":"https://codeforces.com/problemset/problem/1151/B","difficulty":2,"starred":false,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1017d","judge":"Codeforces","title":"The Wu","url":"https://codeforces.com/contest/1017/problem/D","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"codeforces_1879d","judge":"Codeforces","title":"Sum of XOR Functions","url":"https://codeforces.com/contest/1879/problem/D","difficulty":2,"starred":true,"topic":"bit_manipulation","topics":["contribution_technique","bit_manipulation"],"solved":false},{"id":"codeforces_1556d","judge":"Codeforces","title":"Take a Guess","url":"https://codeforces.com/problemset/problem/1556/D","difficulty":2,"starred":false,"topic":"bit_manipulation","topics":["bit_manipulation","interactive_problems"],"solved":false},{"id":"codeforces_1991d","judge":"Codeforces","title":"Prime XOR Coloring","url":"https://codeforces.com/contest/1991/problem/D","difficulty":2,"starred":false,"topic":"bit_manipulation","topics":["bit_manipulation"],"solved":false},{"id":"cf_gym_100739a","judge":"CF Gym","title":"Queries","url":"https://codeforces.com/gym/100739/problem/A","difficulty":3,"starred":true,"topic":"bit_manipulation","topics":["segment_tree_with_lazy_propagation","bit_manipulation"],"solved":false},{"id":"codeforces_2094e","judge":"Codeforces","title":"Boneca Ambalabu","url":"https://codeforces.com/contest/2094/problem/E","difficulty":2,"starred":false,"topic":"bit_manipulation","topics":["contribution_technique","bit_manipulation"],"solved":false},{"id":"hackerrank_ctci_lonely_integer","judge":"HackerRank","title":"Lonely Integer","url":"https://vjudge.net/problem/HackerRank-ctci-lonely-integer","difficulty":1,"starred":false,"topic":"the_xor_trick","topics":["the_xor_trick"],"solved":false},{"id":"cses_1083","judge":"CSES","title":"Missing Number","url":"https://cses.fi/problemset/task/1083","difficulty":1,"starred":true,"topic":"the_xor_trick","topics":["the_xor_trick"],"solved":true},{"id":"codeforces_1872e","judge":"Codeforces","title":"Data Structures Fan","url":"https://codeforces.com/contest/1872/problem/E","difficulty":2,"starred":false,"topic":"the_xor_trick","topics":["the_xor_trick"],"solved":false},{"id":"cses_1095","judge":"CSES","title":"Exponentiation","url":"https://cses.fi/problemset/task/1095","difficulty":1,"starred":true,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":true},{"id":"uva_3671","judge":"UVa","title":"MODEX","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=3671","difficulty":1,"starred":false,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"uva_310","judge":"UVa","title":"Big Mod","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=310","difficulty":1,"starred":false,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"spoj_lastdig","judge":"SPOJ","title":"The last digit","url":"https://www.spoj.com/problems/LASTDIG/","difficulty":1,"starred":true,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"leetcode_count_good_numbers","judge":"LeetCode","title":"Count Good Numbers","url":"https://leetcode.com/problems/count-good-numbers/","difficulty":1,"starred":true,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"codeforces_1178c","judge":"Codeforces","title":"Tiles","url":"https://codeforces.com/contest/1178/problem/C","difficulty":1,"starred":false,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"uva_1970","judge":"UVa","title":"Leading and Trailing","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1970","difficulty":2,"starred":true,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"codechef_riffles","judge":"CodeChef","title":"Chef and Riffles","url":"https://www.codechef.com/JAN221B/problems/RIFFLES","difficulty":2,"starred":true,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"spoj_zsum","judge":"SPOJ","title":"Just Add It","url":"https://www.spoj.com/problems/ZSUM/","difficulty":1,"starred":true,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"spoj_locker","judge":"SPOJ","title":"Magic of the locker","url":"https://www.spoj.com/problems/LOCKER/","difficulty":3,"starred":true,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"gym_248968s","judge":"CF Gym","title":"Factorial Under Modulo","url":"https://vjudge.net/problem/Gym-248968S","difficulty":1,"starred":true,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"cf_gym_105767c","judge":"CF Gym","title":"Kaosar loves Polynomials","url":"https://codeforces.com/gym/105767/problem/C","difficulty":1,"starred":false,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"codeforces_913a","judge":"Codeforces","title":"Modular Exponentiation","url":"https://vjudge.net/problem/CodeForces-913A","difficulty":1,"starred":true,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"codeforces_1731b","judge":"Codeforces","title":"Kill Demodogs","url":"https://codeforces.com/problemset/problem/1731/B","difficulty":2,"starred":false,"topic":"binary_exponentiation","topics":["binary_exponentiation"],"solved":false},{"id":"eolymp_9606","judge":"Eolymp","title":"Modular division","url":"https://vjudge.net/problem/EOlymp-9606","difficulty":1,"starred":true,"topic":"fermats_little_theorem","topics":["fermats_little_theorem"],"solved":false},{"id":"cses_1712","judge":"CSES","title":"Exponentiation II","url":"https://cses.fi/problemset/task/1712","difficulty":1,"starred":true,"topic":"fermats_little_theorem","topics":["fermats_little_theorem","power_tower"],"solved":false},{"id":"cses_1079","judge":"CSES","title":"Binomial Coefficients","url":"https://cses.fi/problemset/task/1079","difficulty":1,"starred":true,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"cses_1715","judge":"CSES","title":"Creating Strings II","url":"https://cses.fi/problemset/task/1715","difficulty":1,"starred":true,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"cses_1716","judge":"CSES","title":"Distributing Apples","url":"https://cses.fi/problemset/task/1716","difficulty":1,"starred":true,"topic":"permutations_and_combinations","topics":["permutations_and_combinations","stars_and_bars"],"solved":false},{"id":"codeforces_300c","judge":"Codeforces","title":"Beautiful Numbers","url":"https://codeforces.com/contest/300/problem/C","difficulty":1,"starred":true,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"cses_1072","judge":"CSES","title":"Two Knights","url":"https://cses.fi/problemset/task/1072","difficulty":1,"starred":true,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":true},{"id":"spoj_hc12","judge":"SPOJ","title":"Card Game","url":"https://www.spoj.com/problems/HC12/","difficulty":1,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"codechef_nways","judge":"CodeChef","title":"Number of Ways","url":"https://www.codechef.com/LTIME24/problems/NWAYS/","difficulty":1,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"spoj_adateams","judge":"SPOJ","title":"Ada and Teams","url":"https://www.spoj.com/problems/ADATEAMS/","difficulty":2,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"spoj_goodb","judge":"SPOJ","title":"Good Predictions","url":"https://www.spoj.com/problems/GOODB/","difficulty":2,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"codeforces_407c","judge":"Codeforces","title":"Curious Array","url":"https://codeforces.com/problemset/problem/407/C","difficulty":3,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"codeforces_1696e","judge":"Codeforces","title":"Placing Jinas","url":"https://codeforces.com/problemset/problem/1696/E","difficulty":3,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"gym_103860c","judge":"CF Gym","title":"Selection Sort Count","url":"https://vjudge.net/problem/Gym-103860C","difficulty":3,"starred":true,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"codeforces_1771a","judge":"Codeforces","title":"Hossam and Combinatorics","url":"https://codeforces.com/problemset/problem/1771/A","difficulty":1,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"hackerrank_sherlock_and_permutations","judge":"HackerRank","title":"Sherlock and Permutations","url":"https://www.hackerrank.com/challenges/sherlock-and-permutations/problem","difficulty":1,"starred":true,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"codeforces_1475e","judge":"Codeforces","title":"Advertising Agency","url":"https://codeforces.com/contest/1475/problem/E","difficulty":2,"starred":true,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"codeforces_1866b","judge":"Codeforces","title":"Battling with Numbers","url":"https://codeforces.com/problemset/problem/1866/B","difficulty":2,"starred":true,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"codeforces_1957c","judge":"Codeforces","title":"How Does the Rook Move?","url":"https://codeforces.com/problemset/problem/1957/C","difficulty":2,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"codeforces_1879c","judge":"Codeforces","title":"Make it Alternating","url":"https://codeforces.com/contest/1879/problem/C","difficulty":2,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"codeforces_2146b","judge":"Codeforces","title":"Merging the Sets","url":"https://codeforces.com/problemset/problem/2146/B","difficulty":2,"starred":false,"topic":"permutations_and_combinations","topics":["permutations_and_combinations"],"solved":false},{"id":"lightoj_problem_makes_problem","judge":"LightOJ","title":"Problem Makes Problem","url":"https://lightoj.com/problem/problem-makes-problem","difficulty":1,"starred":true,"topic":"stars_and_bars","topics":["number_of_solutions_to_a_basic_linear_algebraic_equation","stars_and_bars"],"solved":false},{"id":"codeforces_57c","judge":"Codeforces","title":"Array","url":"https://codeforces.com/contest/57/problem/C","difficulty":1,"starred":true,"topic":"stars_and_bars","topics":["stars_and_bars"],"solved":false},{"id":"codeforces_553a","judge":"Codeforces","title":"Kyoya and Colored Balls","url":"https://codeforces.com/problemset/problem/553/A","difficulty":1,"starred":true,"topic":"stars_and_bars","topics":["stars_and_bars"],"solved":false},{"id":"spoj_ucv2013e","judge":"SPOJ","title":"Greedy Walking","url":"https://www.spoj.com/problems/UCV2013E/","difficulty":2,"starred":true,"topic":"stars_and_bars","topics":["stars_and_bars"],"solved":false},{"id":"codeforces_1288c","judge":"Codeforces","title":"Two Arrays","url":"https://codeforces.com/problemset/problem/1288/C","difficulty":2,"starred":true,"topic":"stars_and_bars","topics":["stars_and_bars"],"solved":false},{"id":"spoj_marbles","judge":"SPOJ","title":"Marbles","url":"https://www.spoj.com/problems/MARBLES/","difficulty":2,"starred":false,"topic":"stars_and_bars","topics":["stars_and_bars"],"solved":false},{"id":"codeforces_1931g","judge":"Codeforces","title":"One-Dimensional Puzzle","url":"https://codeforces.com/contest/1931/problem/G","difficulty":2,"starred":false,"topic":"stars_and_bars","topics":["stars_and_bars"],"solved":false},{"id":"atcoder_abc156_e","judge":"AtCoder","title":"Roaming","url":"https://atcoder.jp/contests/abc156/tasks/abc156_e","difficulty":3,"starred":true,"topic":"stars_and_bars","topics":["stars_and_bars"],"solved":false},{"id":"atcoder_abc110_d","judge":"AtCoder","title":"Factorization","url":"https://atcoder.jp/contests/abc110/tasks/abc110_d","difficulty":3,"starred":true,"topic":"stars_and_bars","topics":["stars_and_bars"],"solved":false},{"id":"codeforces_1305c","judge":"Codeforces","title":"Kuroni and Impossible Calculation","url":"https://codeforces.com/problemset/problem/1305/C","difficulty":1,"starred":true,"topic":"pigeonhole_principle","topics":["pigeonhole_principle"],"solved":false},{"id":"spoj_hallow","judge":"SPOJ","title":"Halloween treats","url":"https://www.spoj.com/problems/HALLOW/","difficulty":2,"starred":true,"topic":"pigeonhole_principle","topics":["pigeonhole_principle"],"solved":false},{"id":"codeforces_1501c","judge":"Codeforces","title":"Going Home","url":"https://codeforces.com/problemset/problem/1501/C","difficulty":2,"starred":true,"topic":"pigeonhole_principle","topics":["pigeonhole_principle"],"solved":false},{"id":"codeforces_1994d","judge":"Codeforces","title":"Funny Game","url":"https://codeforces.com/contest/1994/problem/D","difficulty":1,"starred":true,"topic":"pigeonhole_principle","topics":["pigeonhole_principle"],"solved":false},{"id":"codeforces_577b","judge":"Codeforces","title":"Modulo Sum","url":"https://codeforces.com/problemset/problem/577/B","difficulty":2,"starred":true,"topic":"pigeonhole_principle","topics":["pigeonhole_principle"],"solved":false},{"id":"codeforces_335b","judge":"Codeforces","title":"Palindrome","url":"https://codeforces.com/contest/335/problem/B","difficulty":2,"starred":false,"topic":"pigeonhole_principle","topics":["pigeonhole_principle"],"solved":false},{"id":"codeforces_1536b","judge":"Codeforces","title":"Prinzessin der Verurteilung","url":"https://codeforces.com/contest/1536/problem/B","difficulty":2,"starred":false,"topic":"pigeonhole_principle","topics":["pigeonhole_principle"],"solved":false},{"id":"cf_gym_105884i","judge":"CF Gym","title":"XOR This OR That","url":"https://codeforces.com/gym/105884/problem/I","difficulty":2,"starred":true,"topic":"pigeonhole_principle","topics":["pigeonhole_principle"],"solved":false},{"id":"leetcode_find_center_of_star_graph","judge":"LeetCode","title":"Find Center of Star Graph","url":"https://leetcode.com/problems/find-center-of-star-graph/","difficulty":1,"starred":false,"topic":"graph_representations","topics":["graph_representations"],"solved":true},{"id":"aizu_alds1_11_a","judge":"Aizu","title":"Graph","url":"https://vjudge.net/problem/Aizu-ALDS1_11_A","difficulty":1,"starred":true,"topic":"graph_representations","topics":["graph_representations"],"solved":false},{"id":"leetcode_minimum_number_of_vertices_to_reach_all_nodes","judge":"LeetCode","title":"Minimum Number of Vertices to Reach All Nodes","url":"https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/","difficulty":1,"starred":false,"topic":"graph_representations","topics":["graph_representations"],"solved":false},{"id":"codeforces_292b","judge":"Codeforces","title":"Network Topology","url":"https://codeforces.com/problemset/problem/292/B","difficulty":1,"starred":true,"topic":"graph_representations","topics":["graph_representations"],"solved":true},{"id":"codeforces_330b","judge":"Codeforces","title":"Road Construction","url":"https://codeforces.com/problemset/problem/330/B","difficulty":2,"starred":false,"topic":"graph_representations","topics":["graph_representations"],"solved":false},{"id":"cf_edu_273169a","judge":"Codeforces","title":"Segment Tree for the Sum","url":"https://codeforces.com/edu/course/2/lesson/4/1/practice/contest/273169/problem/A","difficulty":null,"starred":true,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"cf_edu_273169b","judge":"Codeforces","title":"Segment Tree for the Minimum","url":"https://codeforces.com/edu/course/2/lesson/4/1/practice/contest/273169/problem/B","difficulty":null,"starred":true,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"cf_edu_273169c","judge":"Codeforces","title":"Number of Minimums on a Segment","url":"https://codeforces.com/edu/course/2/lesson/4/1/practice/contest/273169/problem/C","difficulty":1,"starred":true,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"cf_edu_274545a","judge":"Codeforces","title":"Inversions","url":"https://codeforces.com/edu/course/2/lesson/4/3/practice/contest/274545/problem/A","difficulty":1,"starred":true,"topic":"segment_tree","topics":["segment_tree","bit","ordered_set"],"solved":false},{"id":"cses_1144","judge":"CSES","title":"Salary Queries","url":"https://cses.fi/problemset/task/1144/","difficulty":1,"starred":true,"topic":"segment_tree","topics":["segment_tree","dynamic_segment_tree","bit","coordinate_compression","merge_sort_tree","ordered_set"],"solved":false},{"id":"codeforces_61e","judge":"Codeforces","title":"Enemy is weak","url":"https://codeforces.com/contest/61/problem/E","difficulty":1,"starred":false,"topic":"segment_tree","topics":["segment_tree","ordered_set","bit"],"solved":false},{"id":"kattis_megainversions","judge":"Kattis","title":"Mega Inversions","url":"https://vjudge.net/problem/Kattis-megainversions","difficulty":1,"starred":false,"topic":"segment_tree","topics":["segment_tree","bit","ordered_set","inversions"],"solved":false},{"id":"spoj_kquery","judge":"SPOJ","title":"K-query","url":"https://www.spoj.com/problems/KQUERY/","difficulty":1,"starred":true,"topic":"segment_tree","topics":["segment_tree","dynamic_segment_tree","bit","offline_queries","coordinate_compression","merge_sort_tree"],"solved":false},{"id":"codeforces_459d","judge":"Codeforces","title":"Pashmak and Parmida's problem","url":"https://codeforces.com/contest/459/problem/D","difficulty":null,"starred":false,"topic":"segment_tree","topics":["segment_tree","bit","ordered_set"],"solved":false},{"id":"cf_edu_274684c","judge":"Codeforces","title":"Number of Inversions on Segment","url":"https://codeforces.com/edu/course/2/lesson/4/4/practice/contest/274684/problem/C","difficulty":2,"starred":false,"topic":"segment_tree","topics":["segment_tree","bit"],"solved":false},{"id":"cf_edu_280801b","judge":"Codeforces","title":"Add Arithmetic Progression On Segment","url":"https://codeforces.com/edu/course/2/lesson/5/4/practice/contest/280801/problem/B","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"codeforces_1234d","judge":"Codeforces","title":"Distinct Characters Queries","url":"https://codeforces.com/problemset/problem/1234/D","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree","bit"],"solved":false},{"id":"cses_1734","judge":"CSES","title":"Distinct Values Queries","url":"https://cses.fi/problemset/task/1734","difficulty":null,"starred":true,"topic":"segment_tree","topics":["segment_tree","persistent_segment_tree","bit","mos_algorithm","offline_queries","coordinate_compression","dynamic_segment_tree"],"solved":false},{"id":"codeforces_339d","judge":"Codeforces","title":"Xenia and Bit Operations","url":"https://codeforces.com/problemset/problem/339/D","difficulty":2,"starred":false,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"codeforces_380c","judge":"Codeforces","title":"Sereja and Brackets","url":"https://codeforces.com/contest/380/problem/C","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree","balanced_brackets"],"solved":false},{"id":"codeforces_19d","judge":"Codeforces","title":"Points","url":"https://codeforces.com/contest/19/problem/D","difficulty":2,"starred":false,"topic":"segment_tree","topics":["segment_tree","offline_queries"],"solved":false},{"id":"codeforces_474f","judge":"Codeforces","title":"Ant colony","url":"https://codeforces.com/contest/474/problem/F","difficulty":null,"starred":true,"topic":"segment_tree","topics":["segment_tree","sparse_table"],"solved":false},{"id":"codeforces_540e","judge":"Codeforces","title":"Infinite Inversions","url":"https://codeforces.com/contest/540/problem/E","difficulty":2,"starred":false,"topic":"segment_tree","topics":["segment_tree","coordinate_compression"],"solved":false},{"id":"codeforces_597c","judge":"Codeforces","title":"Subsequences","url":"https://codeforces.com/contest/597/problem/C","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree","dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_920f","judge":"Codeforces","title":"SUM and REPLACE","url":"https://codeforces.com/problemset/problem/920/F","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree","bit"],"solved":false},{"id":"cses_1143","judge":"CSES","title":"Hotel Queries","url":"https://cses.fi/problemset/task/1143","difficulty":2,"starred":false,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"cses_1748","judge":"CSES","title":"Increasing subsequence II","url":"https://cses.fi/problemset/task/1748","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree","coordinate_compression","bit"],"solved":false},{"id":"cses_1749","judge":"CSES","title":"List Removals","url":"https://cses.fi/problemset/task/1749/","difficulty":2,"starred":false,"topic":"segment_tree","topics":["segment_tree","bit","ordered_set"],"solved":false},{"id":"codeforces_396c","judge":"Codeforces","title":"On Changing Tree","url":"https://codeforces.com/contest/396/problem/C","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"yaroslav and divisors","judge":"Codeforces","title":"Yaroslav and Divisors","url":"https://codeforces.com/contest/301/problem/D","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree","offline_queries","bit"],"solved":false},{"id":"cses_1190","judge":"SPOJ","title":"Can you answer these queries III","url":"https://www.spoj.com/problems/GSS3/","difficulty":null,"starred":true,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"codeforces_594d","judge":"Codeforces","title":"REQ","url":"https://codeforces.com/contest/594/problem/D","difficulty":3,"starred":true,"topic":"segment_tree","topics":["segment_tree","bit","offline_queries","eulers_totient_function"],"solved":false},{"id":"codeforces_501d","judge":"Codeforces","title":"Misha and Permutations Summation","url":"https://codeforces.com/contest/501/problem/D","difficulty":3,"starred":false,"topic":"segment_tree","topics":["segment_tree","factoradic_number_system","ordered_set"],"solved":false},{"id":"codeforces_115e","judge":"Codeforces","title":"Linear Kingdom Races","url":"https://codeforces.com/contest/115/problem/E","difficulty":3,"starred":false,"topic":"segment_tree","topics":["segment_tree_with_lazy_propagation","dp_optimization_using_data_structures","segment_tree"],"solved":false},{"id":"codeforces_786b","judge":"Codeforces","title":"Legacy","url":"https://codeforces.com/contest/786/problem/B","difficulty":1,"starred":true,"topic":"segment_tree","topics":["dijkstra_on_segment_tree","segment_tree"],"solved":false},{"id":"atcoder_abc343_f","judge":"AtCoder","title":"Second Largest Query","url":"https://atcoder.jp/contests/abc343/tasks/abc343_f","difficulty":1,"starred":true,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"atcoder_abc341_e","judge":"AtCoder","title":"Alternating String","url":"https://atcoder.jp/contests/abc341/tasks/abc341_e","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"codeforces_914d","judge":"Codeforces","title":"Bash and a Tough Math Puzzle","url":"https://codeforces.com/problemset/problem/914/D","difficulty":2,"starred":false,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"codeforces_2000h","judge":"Codeforces","title":"Ksyusha and the Loaded Set","url":"https://codeforces.com/contest/2000/problem/H","difficulty":2,"starred":false,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"codeforces_1691d","judge":"Codeforces","title":"Max GEQ Sum","url":"https://codeforces.com/problemset/problem/1691/D","difficulty":2,"starred":true,"topic":"segment_tree","topics":["segment_tree","all_subarray_maximum_minimum"],"solved":false},{"id":"codeforces_383c","judge":"Codeforces","title":"Propagating tree","url":"https://codeforces.com/contest/383/problem/C","difficulty":2,"starred":false,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"codeforces_2117h","judge":"Codeforces","title":"Incessant Rain","url":"https://codeforces.com/contest/2117/problem/H","difficulty":3,"starred":false,"topic":"segment_tree","topics":["segment_tree"],"solved":false},{"id":"cf_edu_279653d","judge":"Codeforces","title":"Addition and Sum","url":"https://codeforces.com/edu/course/2/lesson/5/2/practice/contest/279653/problem/D","difficulty":1,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation","bit_with_range_update_and_range_query"],"solved":false},{"id":"cf_edu_279653a","judge":"Codeforces","title":"Addition and Minimum","url":"https://codeforces.com/edu/course/2/lesson/5/2/practice/contest/279653/problem/A","difficulty":1,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_52c","judge":"Codeforces","title":"Circular RMQ","url":"https://codeforces.com/problemset/problem/52/C","difficulty":1,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cf_edu_279653b","judge":"Codeforces","title":"Multiplication and Sum","url":"https://codeforces.com/edu/course/2/lesson/5/2/practice/contest/279653/problem/B","difficulty":1,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cf_edu_279653f","judge":"Codeforces","title":"Assignment and Sum","url":"https://codeforces.com/edu/course/2/lesson/5/2/practice/contest/279653/problem/F","difficulty":1,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cses_2166","judge":"CSES","title":"Prefix Sum Queries","url":"https://cses.fi/problemset/task/2166","difficulty":1,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cf_edu_280801a","judge":"CSES","title":"Range Updates and Sums","url":"https://cses.fi/problemset/task/1735","difficulty":2,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation","sqrt_decomposition"],"solved":false},{"id":"yosupo_range_affine_range_sum","judge":"Library Checker","title":"Range Affine Range Sum","url":"https://judge.yosupo.jp/problem/range_affine_range_sum","difficulty":2,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cf_edu_279653c","judge":"Codeforces","title":"Bitwise OR and AND","url":"https://codeforces.com/edu/course/2/lesson/5/2/practice/contest/279653/problem/C","difficulty":2,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cf_edu_280799b","judge":"Codeforces","title":"Inverse and K-th one","url":"https://codeforces.com/edu/course/2/lesson/5/3/practice/contest/280799/problem/B","difficulty":2,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cf_edu_280799c","judge":"Codeforces","title":"Addition and First element at least X","url":"https://codeforces.com/edu/course/2/lesson/5/3/practice/contest/280799/problem/C","difficulty":2,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cf_edu_280799a","judge":"Codeforces","title":"Assignment and Maximal Segment","url":"https://codeforces.com/edu/course/2/lesson/5/3/practice/contest/280799/problem/A","difficulty":2,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_580e","judge":"Codeforces","title":"Kefa and Watch","url":"https://codeforces.com/problemset/problem/580/E","difficulty":2,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation","string_hashing"],"solved":false},{"id":"codeforces_558e","judge":"Codeforces","title":"A Simple Task","url":"https://codeforces.com/problemset/problem/558/E","difficulty":2,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cses_1736","judge":"CSES","title":"Polynomial Queries","url":"https://cses.fi/problemset/task/1736","difficulty":2,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_145e","judge":"Codeforces","title":"Lucky Queries","url":"https://codeforces.com/contest/145/problem/E","difficulty":2,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_1555e","judge":"Codeforces","title":"Boring Segments","url":"https://codeforces.com/contest/1555/problem/E","difficulty":2,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_438d","judge":"Codeforces","title":"The Child and Sequence","url":"https://codeforces.com/contest/438/problem/D","difficulty":null,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_beats","segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_446c","judge":"Codeforces","title":"DZY Loves Fibonacci Numbers","url":"https://codeforces.com/contest/446/problem/C","difficulty":3,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_1114f","judge":"Codeforces","title":"Please, another Queries on Array?","url":"https://codeforces.com/problemset/problem/1114/F","difficulty":3,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation","offline_queries","eulers_totient_function","bit_with_range_update_and_range_query"],"solved":false},{"id":"codeforces_1132g","judge":"Codeforces","title":"Greedy Subsequences","url":"https://codeforces.com/contest/1132/problem/G","difficulty":3,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_1791f","judge":"Codeforces","title":"Range Update Point Query","url":"https://codeforces.com/contest/1791/problem/F","difficulty":1,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"atcoder_abc357_f","judge":"AtCoder","title":"Two Sequence Queries","url":"https://atcoder.jp/contests/abc357/tasks/abc357_f","difficulty":1,"starred":true,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_838b","judge":"Codeforces","title":"Diverging Directions","url":"https://codeforces.com/contest/838/problem/B","difficulty":2,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_817f","judge":"Codeforces","title":"MEX Queries","url":"https://codeforces.com/problemset/problem/817/F","difficulty":2,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"atcoder_abc332_f","judge":"AtCoder","title":"Random Update Query","url":"https://atcoder.jp/contests/abc332/tasks/abc332_f","difficulty":2,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_1252k","judge":"Codeforces","title":"Addition Robot","url":"https://codeforces.com/problemset/problem/1252/K","difficulty":3,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_1179c","judge":"Codeforces","title":"Serge and Dining Room","url":"https://codeforces.com/contest/1179/problem/C","difficulty":3,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_1919f1","judge":"Codeforces","title":"Wine Factory (Easy Version)","url":"https://codeforces.com/problemset/problem/1919/F1","difficulty":3,"starred":false,"topic":"segment_tree_with_lazy_propagation","topics":["segment_tree_with_lazy_propagation"],"solved":false},{"id":"cses_1737","judge":"CSES","title":"Range Queries and Copies","url":"https://cses.fi/problemset/task/1737","difficulty":1,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"spoj_kqueryo","judge":"SPOJ","title":"K-Query Online","url":"https://www.spoj.com/problems/KQUERYO/","difficulty":1,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"spoj_mkthnum","judge":"SPOJ","title":"K-th Number","url":"https://www.spoj.com/problems/MKTHNUM/","difficulty":1,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree","wavelet_tree"],"solved":false},{"id":"hackerrank_wet_shark_and_kth_largest_number","judge":"HackerRank","title":"Kth Number","url":"https://www.hackerrank.com/contests/morgan-stanley-2015/challenges/wet-shark-and-kth-largest-number","difficulty":1,"starred":false,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"spoj_ttm","judge":"SPOJ","title":"To the moon","url":"https://www.spoj.com/problems/TTM/","difficulty":1,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree","persistent_segment_tree_with_lazy_propagation"],"solved":false},{"id":"codeforces_786c","judge":"Codeforces","title":"Till I Collapse","url":"https://codeforces.com/contest/786/problem/C","difficulty":2,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree","sqrt_n_sequence_recovery"],"solved":false},{"id":"codeforces_837g","judge":"Codeforces","title":"Functions On The Segments","url":"https://codeforces.com/problemset/problem/837/G","difficulty":2,"starred":false,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"codeforces_484e","judge":"Codeforces","title":"Sign on Fence","url":"https://codeforces.com/contest/484/problem/E","difficulty":2,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree","parallel_binary_search"],"solved":false},{"id":"spoj_cot","judge":"SPOJ","title":"Count on a tree","url":"https://www.spoj.com/problems/COT/","difficulty":2,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"codechef_frbsum","judge":"CodeChef","title":"Forbidden Sum","url":"https://www.codechef.com/problems/FRBSUM","difficulty":2,"starred":false,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"codechef_prmq","judge":"CodeChef","title":"Chef and Prime Queries","url":"https://www.codechef.com/problems/PRMQ","difficulty":2,"starred":false,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"codeforces_1422f","judge":"Codeforces","title":"Boring Queries","url":"https://codeforces.com/contest/1422/problem/F","difficulty":null,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"lightoj_function_not_again","judge":"LightOJ","title":"Function! Not Again!!","url":"https://lightoj.com/problem/function-not-again","difficulty":3,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"codeforces_226e","judge":"Codeforces","title":"Noble Knight's Path","url":"https://codeforces.com/contest/226/problem/E","difficulty":null,"starred":false,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"codechef_cloneme","judge":"CodeChef","title":"Cloning","url":"https://www.codechef.com/problems/CLONEME","difficulty":3,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree","multiset_hashing"],"solved":false},{"id":"codeforces_464e","judge":"Codeforces","title":"The Classic Problem","url":"https://codeforces.com/contest/464/problem/E","difficulty":3,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree","dijkstras_algorithm"],"solved":false},{"id":"codeforces_813e","judge":"Codeforces","title":"Army Creation","url":"https://codeforces.com/contest/813/problem/E","difficulty":2,"starred":false,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"codeforces_2126g2","judge":"Codeforces","title":"G2. Big Wins! (hard version)","url":"https://codeforces.com/contest/2126/problem/G2","difficulty":2,"starred":false,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"codeforces_1771f","judge":"Codeforces","title":"Hossam and Range Minimum Query","url":"https://codeforces.com/contest/1771/problem/F","difficulty":2,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree","xor_hashing"],"solved":false},{"id":"codeforces_1000f","judge":"Codeforces","title":"One Occurrence","url":"https://codeforces.com/contest/1000/problem/F","difficulty":2,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree"],"solved":false},{"id":"atcoder_abc339_g","judge":"AtCoder","title":"Smaller Sum","url":"https://atcoder.jp/contests/abc339/tasks/abc339_g","difficulty":2,"starred":true,"topic":"persistent_segment_tree","topics":["merge_sort_tree","persistent_segment_tree"],"solved":false},{"id":"codeforces_1957f2","judge":"Codeforces","title":"Frequency Mismatch (Hard Version)","url":"https://codeforces.com/contest/1957/problem/F2","difficulty":3,"starred":true,"topic":"persistent_segment_tree","topics":["persistent_segment_tree","multiset_hashing","parallel_binary_search"],"solved":false},{"id":"codeforces_1479d","judge":"Codeforces","title":"Odd Mineral Resource","url":"https://codeforces.com/contest/1479/problem/D","difficulty":3,"starred":false,"topic":"persistent_segment_tree","topics":["persistent_segment_tree","xor_hashing"],"solved":false},{"id":"codechef_query","judge":"CodeChef","title":"Observing the Tree","url":"https://www.codechef.com/problems/QUERY","difficulty":2,"starred":false,"topic":"persistent_segment_tree_with_lazy_propagation","topics":["persistent_segment_tree_with_lazy_propagation","hld"],"solved":false},{"id":"codechef_subinver","judge":"CodeChef","title":"SubInversing","url":"https://www.codechef.com/problems/SUBINVER","difficulty":3,"starred":false,"topic":"persistent_segment_tree_with_lazy_propagation","topics":["persistent_segment_tree_with_lazy_propagation","string_hashing"],"solved":false},{"id":"codechef_fibtree","judge":"CodeChef","title":"Fibonacci Numbers on Tree","url":"https://www.codechef.com/problems/FIBTREE","difficulty":4,"starred":false,"topic":"persistent_segment_tree_with_lazy_propagation","topics":["persistent_segment_tree_with_lazy_propagation","hld"],"solved":false},{"id":"cses_1739","judge":"CSES","title":"Forest Queries II","url":"https://cses.fi/problemset/task/1739","difficulty":1,"starred":true,"topic":"2d_segment_tree","topics":["2d_segment_tree","2d_bit"],"solved":false},{"id":"uva_3226","judge":"UVa","title":"The Ultimate Bamboo Eater","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=3226","difficulty":3,"starred":true,"topic":"2d_segment_tree","topics":["2d_segment_tree","manhattan_chebyshev"],"solved":false},{"id":"codeforces_869e","judge":"Codeforces","title":"The Untended Antiquity","url":"https://codeforces.com/problemset/problem/869/E","difficulty":3,"starred":true,"topic":"2d_segment_tree","topics":["2d_segment_tree","2d_bit_with_range_update_and_range_query","xor_hashing"],"solved":false},{"id":"ioi13_game","judge":"oj.uz","title":"Games","url":"https://oj.uz/problem/view/IOI13_game","difficulty":null,"starred":true,"topic":"2d_segment_tree","topics":["2d_segment_tree","2d_dynamic_segment_tree","treap"],"solved":false},{"id":"wcipeg_ioi0722","judge":"oj.uz","title":"Pairs","url":"https://oj.uz/problem/view/IOI07_pairs","difficulty":4,"starred":false,"topic":"2d_segment_tree","topics":["2d_bit","2d_segment_tree"],"solved":false},{"id":"yosupo_point_add_rectangle_sum","judge":"Library Checker","title":"Point Add Rectangle Sum","url":"https://judge.yosupo.jp/problem/point_add_rectangle_sum","difficulty":1,"starred":true,"topic":"2d_segment_tree","topics":["2d_segment_tree"],"solved":false},{"id":"yosupo_rectangle_sum","judge":"Library Checker","title":"Rectangle Sum","url":"https://judge.yosupo.jp/problem/rectangle_sum","difficulty":1,"starred":true,"topic":"2d_segment_tree","topics":["2d_segment_tree"],"solved":false},{"id":"codeforces_677d","judge":"Codeforces","title":"Vanya and Treasure","url":"https://codeforces.com/contest/677/problem/D","difficulty":1,"starred":true,"topic":"2d_segment_tree","topics":["2d_segment_tree","splitting_objects_into_light_and_heavy"],"solved":false},{"id":"codeforces_15d","judge":"Codeforces","title":"Map","url":"https://codeforces.com/contest/15/problem/D","difficulty":2,"starred":true,"topic":"2d_segment_tree","topics":["2d_segment_tree","sparse_table_2d","monotonous_queue_2d"],"solved":false},{"id":"cf_gym_105789g","judge":"CF Gym","title":"Game of Pieces","url":"https://codeforces.com/gym/105789/problem/G","difficulty":2,"starred":false,"topic":"dynamic_segment_tree","topics":["dynamic_segment_tree"],"solved":false},{"id":"izho12_apple","judge":"oj.uz","title":"Monkey and Apple-trees","url":"https://oj.uz/problem/view/IZhO12_apple","difficulty":2,"starred":true,"topic":"dynamic_segment_tree","topics":["dynamic_segment_tree"],"solved":false},{"id":"codeforces_369e","judge":"Codeforces","title":"Valera and Queries","url":"https://codeforces.com/contest/369/problem/E","difficulty":1,"starred":true,"topic":"merge_sort_tree","topics":["merge_sort_tree"],"solved":false},{"id":"yosupo_range_kth_smallest","judge":"Library Checker","title":"Range Kth Smallest","url":"https://judge.yosupo.jp/problem/range_kth_smallest","difficulty":1,"starred":true,"topic":"merge_sort_tree","topics":["wavelet_tree","merge_sort_tree"],"solved":false},{"id":"atcoder_abc237_g","judge":"AtCoder","title":"Range Sort Query (Solve using Segment Tree Merging)","url":"https://atcoder.jp/contests/abc237/tasks/abc237_g","difficulty":2,"starred":true,"topic":"segment_tree_merging","topics":["segment_tree_merging"],"solved":false},{"id":"szkopul_sue3qzxbtasek_rawmzaxy_p","judge":"Szkopuł","title":"Task Tree Rotations (rot)","url":"https://szkopul.edu.pl/problemset/problem/sUe3qzxBtasek-RAWmZaxY_p/site/?key=statement","difficulty":3,"starred":false,"topic":"segment_tree_merging","topics":["segment_tree_merging"],"solved":false},{"id":"spoj_cot3","judge":"SPOJ","title":"Combat on a tree","url":"https://www.spoj.com/problems/COT3/","difficulty":3,"starred":true,"topic":"segment_tree_merging","topics":["segment_tree_merging"],"solved":false},{"id":"szkopul_b0bm0al2crqbt6zovetjfoc6","judge":"Szkopuł","title":"Task Tree Rotations 2 (rod)","url":"https://szkopul.edu.pl/problemset/problem/b0BM0al2crQBt6zovEtJfOc6/site/?key=statement","difficulty":4,"starred":false,"topic":"segment_tree_merging","topics":["segment_tree_merging"],"solved":false},{"id":"loj_2537","judge":"LibreOJ","title":"Minimax","url":"https://loj.ac/p/2537","difficulty":4,"starred":true,"topic":"segment_tree_merging","topics":["segment_tree_merging"],"solved":false},{"id":"codeforces_1515h","judge":"Codeforces","title":"Phoenix and Bits","url":"https://codeforces.com/contest/1515/problem/H","difficulty":4,"starred":true,"topic":"segment_tree_merging","topics":["segment_tree_merging"],"solved":false},{"id":"loj_2553","judge":"LibreOJ","title":"violent writing","url":"https://loj.ac/p/2553","difficulty":4,"starred":false,"topic":"segment_tree_merging","topics":["segment_tree_merging"],"solved":false},{"id":"loj_3340","judge":"LibreOJ","title":"destiny","url":"https://loj.ac/p/3340","difficulty":4,"starred":false,"topic":"segment_tree_merging","topics":["segment_tree_merging"],"solved":false},{"id":"hdu_5306","judge":"HDU","title":"Gorgeous Sequence","url":"http://acm.hdu.edu.cn/showproblem.php?pid=5306","difficulty":1,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"cf_group_327313b","judge":"Codeforces","title":"Minimize!","url":"https://codeforces.com/group/1rv4rhCsHp/contest/327313/problem/B","difficulty":1,"starred":true,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"cf_group_327313d","judge":"Codeforces","title":"Minimize, add!","url":"https://codeforces.com/group/1rv4rhCsHp/contest/327313/problem/D","difficulty":1,"starred":true,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"atcoder_abc256_h","judge":"AtCoder","title":"I like Query Problem","url":"https://atcoder.jp/contests/abc256/tasks/abc256_h","difficulty":2,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"yosupo_range_chmin_chmax_add_range_sum","judge":"Library Checker","title":"Range Chmin Chmax Add Range Sum","url":"https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum","difficulty":null,"starred":true,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"csacademy_and_or_max","judge":"CS Academy","title":"And or Max","url":"https://csacademy.com/contest/round-70/task/and-or-max","difficulty":2,"starred":true,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"codeforces_679e","judge":"Codeforces","title":"Bear and Bad Powers of 42","url":"https://codeforces.com/contest/679/problem/E","difficulty":2,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"codeforces_453e","judge":"Codeforces","title":"Little Pony and Lord Tirek","url":"https://codeforces.com/problemset/problem/453/E","difficulty":2,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"codeforces_793f","judge":"Codeforces","title":"Julia the snail","url":"https://codeforces.com/problemset/problem/793/F","difficulty":2,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"codeforces_855f","judge":"Codeforces","title":"Nagini","url":"https://codeforces.com/contest/855/problem/F","difficulty":2,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats","pragmas"],"solved":false},{"id":"hackerrank_box_operations","judge":"HackerRank","title":"Box Operations","url":"https://www.hackerrank.com/challenges/box-operations/problem","difficulty":2,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"codeforces_997e","judge":"Codeforces","title":"Good Subsegments","url":"https://codeforces.com/contest/997/problem/E","difficulty":2,"starred":true,"topic":"segment_tree_beats","topics":["segment_tree_beats","permutation_tree"],"solved":false},{"id":"cf_group_327313e","judge":"Codeforces","title":"Minimize, add, GCDize and their friends","url":"https://codeforces.com/group/1rv4rhCsHp/contest/327313/problem/E","difficulty":3,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"uoj_169","judge":"UOJ","title":"New Year’s Day Old Man and Sequence","url":"https://uoj.ac/problem/169","difficulty":null,"starred":true,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"codeforces_1572f","judge":"Codeforces","title":"Stations","url":"https://codeforces.com/contest/1572/problem/F","difficulty":null,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"uoj_164","judge":"UOJ","title":"Tsinghua Training Camp 2015V","url":"https://uoj.ac/problem/164","difficulty":4,"starred":false,"topic":"segment_tree_beats","topics":["historic_information_on_segment_trees","segment_tree_beats"],"solved":false},{"id":"dmoj_olep1","judge":"DMOJ","title":"Overflow","url":"https://dmoj.ca/problem/olep1","difficulty":3,"starred":false,"topic":"segment_tree_beats","topics":["segment_tree_beats"],"solved":false},{"id":"baekjoon_24271","judge":"Baekjoon","title":"xor^2","url":"https://www.acmicpc.net/problem/24271","difficulty":1,"starred":true,"topic":"xor_segment_tree","topics":["xor_segment_tree"],"solved":false},{"id":"codeforces_1716e","judge":"Codeforces","title":"Swap and Maximum Block","url":"https://codeforces.com/contest/1716/problem/E","difficulty":1,"starred":true,"topic":"xor_segment_tree","topics":["xor_segment_tree"],"solved":false},{"id":"yukicoder_1891","judge":"yukicoder","title":"Static Xor Range Composite Query","url":"https://yukicoder.me/problems/no/1891","difficulty":2,"starred":true,"topic":"xor_segment_tree","topics":["xor_segment_tree"],"solved":false},{"id":"codeforces_1654f","judge":"Codeforces","title":"Minimal String Xoration","url":"https://codeforces.com/contest/1654/problem/F","difficulty":2,"starred":false,"topic":"xor_segment_tree","topics":["xor_segment_tree"],"solved":false},{"id":"codeforces_1401f","judge":"Codeforces","title":"Reverse and Swap","url":"https://codeforces.com/contest/1401/problem/F","difficulty":2,"starred":false,"topic":"xor_segment_tree","topics":["xor_segment_tree"],"solved":false},{"id":"cf_gym_103470e","judge":"CF Gym","title":"Paimon Segment Tree","url":"https://codeforces.com/gym/103470/problem/E","difficulty":3,"starred":false,"topic":"historic_information_on_segment_trees","topics":["historic_information_on_segment_trees","matrix_exponentiation"],"solved":false},{"id":"lightoj_curious_robin_hood","judge":"LightOJ","title":"Curious Robin Hood","url":"https://lightoj.com/problem/curious-robin-hood","difficulty":1,"starred":true,"topic":"bit","topics":["bit","sqrt_decomposition"],"solved":false},{"id":"cses_1651","judge":"CSES","title":"Range Update Queries","url":"https://cses.fi/problemset/task/1651","difficulty":1,"starred":true,"topic":"bit","topics":["bit","sqrt_decomposition"],"solved":true},{"id":"spoj_crayon","judge":"SPOJ","title":"Crayon","url":"https://www.spoj.com/problems/CRAYON/","difficulty":1,"starred":true,"topic":"bit","topics":["bit","offline_queries"],"solved":false},{"id":"codeforces_12d","judge":"Codeforces","title":"Ball","url":"https://codeforces.com/contest/12/problem/D","difficulty":2,"starred":true,"topic":"bit","topics":["bit"],"solved":false},{"id":"codeforces_961e","judge":"Codeforces","title":"Tufurama","url":"https://codeforces.com/contest/961/problem/E","difficulty":1,"starred":false,"topic":"bit","topics":["bit"],"solved":false},{"id":"cses_2169","judge":"CSES","title":"Nested Ranges Count","url":"https://cses.fi/problemset/task/2169","difficulty":2,"starred":true,"topic":"bit","topics":["bit","offline_queries"],"solved":false},{"id":"codeforces_1788e","judge":"Codeforces","title":"Sum Over Zero","url":"https://codeforces.com/contest/1788/problem/E","difficulty":2,"starred":false,"topic":"bit","topics":["bit"],"solved":false},{"id":"timus_1896","judge":"Timus","title":"War Games 2.1","url":"https://acm.timus.ru/problem.aspx?space=1&num=1896","difficulty":null,"starred":true,"topic":"lower_bound_on_bit","topics":["lower_bound_on_bit"],"solved":false},{"id":"codeforces_1354d","judge":"Codeforces","title":"Multiset","url":"https://codeforces.com/contest/1354/problem/D","difficulty":1,"starred":false,"topic":"lower_bound_on_bit","topics":["lower_bound_on_bit"],"solved":false},{"id":"cf_gym_104375d","judge":"CF Gym","title":"Dynamic Collection","url":"https://codeforces.com/gym/104375/problem/D","difficulty":1,"starred":false,"topic":"lower_bound_on_bit","topics":["lower_bound_on_bit","ordered_set"],"solved":false},{"id":"spoj_orderset","judge":"SPOJ","title":"Order Statistic Set","url":"https://www.spoj.com/problems/ORDERSET/en/","difficulty":1,"starred":false,"topic":"lower_bound_on_bit","topics":["treap","ordered_set","lower_bound_on_bit"],"solved":false},{"id":"codeforces_992e","judge":"Codeforces","title":"Nastya and King-Shamans","url":"https://codeforces.com/contest/992/problem/E","difficulty":2,"starred":false,"topic":"lower_bound_on_bit","topics":["lower_bound_on_bit"],"solved":false},{"id":"poj_1195","judge":"POJ","title":"Mobile phones","url":"http://poj.org/problem?id=1195","difficulty":1,"starred":false,"topic":"2d_bit","topics":["2d_bit"],"solved":false},{"id":"codeforces_785e","judge":"Codeforces","title":"Anton and Permutation","url":"https://codeforces.com/contest/785/problem/E","difficulty":2,"starred":true,"topic":"2d_bit","topics":["2d_bit"],"solved":false},{"id":"dmoj_bfs17p6","judge":"DMOJ","title":"Crowded Cities","url":"https://dmoj.ca/problem/bfs17p6","difficulty":3,"starred":false,"topic":"2d_bit","topics":["2d_bit"],"solved":false},{"id":"lightoj_points_in_rectangle","judge":"LightOJ","title":"Points in Rectangle","url":"https://lightoj.com/problem/points-in-rectangle","difficulty":1,"starred":false,"topic":"2d_bit","topics":["2d_bit"],"solved":false},{"id":"cf_gym_105190a","judge":"CF Gym","title":"A. Boring Class","url":"https://codeforces.com/gym/105190/problem/A","difficulty":2,"starred":false,"topic":"2d_bit","topics":["2d_bit","sqrt_decomposition"],"solved":false},{"id":"hackerearth_counting_in_byteland","judge":"HackerEarth","title":"Counting In Byteland (3D)","url":"https://www.hackerearth.com/practice/data-structures/advanced-data-structures/fenwick-binary-indexed-trees/practice-problems/algorithm/counting-in-byteland/","difficulty":2,"starred":true,"topic":"2d_bit","topics":["2d_bit"],"solved":false},{"id":"codeforces_1093e","judge":"Codeforces","title":"Intersection of Permutations","url":"https://codeforces.com/contest/1093/problem/E","difficulty":2,"starred":false,"topic":"2d_bit","topics":["cdq_divide_and_conquer","2d_bit"],"solved":false},{"id":"codeforces_848c","judge":"Codeforces","title":"Goodbye Souvenir","url":"https://codeforces.com/contest/848/problem/C","difficulty":null,"starred":false,"topic":"2d_bit","topics":["2d_bit"],"solved":false},{"id":"spoj_usubqsub","judge":"SPOJ","title":"Update Sub-Matrix & Query Sub-Matrix","url":"https://www.spoj.com/problems/USUBQSUB/","difficulty":null,"starred":true,"topic":"2d_bit_with_range_update_and_range_query","topics":["2d_bit_with_range_update_and_range_query"],"solved":false},{"id":"codeforces_341d","judge":"Codeforces","title":"Iahub and Xors","url":"https://codeforces.com/problemset/problem/341/D","difficulty":3,"starred":true,"topic":"2d_bit_with_range_update_and_range_query","topics":["2d_bit_with_range_update_and_range_query"],"solved":false},{"id":"eolymp_4500","judge":"Eolymp","title":"Чипполино","url":"https://basecamp.eolymp.com/en/problems/4500","difficulty":1,"starred":false,"topic":"2d_bit_with_range_update_and_range_query","topics":["2d_bit_with_range_update_and_range_query"],"solved":false},{"id":"spoj_thrbl","judge":"SPOJ","title":"Catapult that ball","url":"https://www.spoj.com/problems/THRBL/","difficulty":1,"starred":false,"topic":"sparse_table","topics":["sparse_table"],"solved":true},{"id":"codeforces_2050f","judge":"Codeforces","title":"Maximum modulo equality","url":"https://codeforces.com/contest/2050/problem/F","difficulty":1,"starred":true,"topic":"sparse_table","topics":["sparse_table"],"solved":false},{"id":"cses_1647","judge":"CSES","title":"Static Range Minimum Queries","url":"https://cses.fi/problemset/task/1647","difficulty":1,"starred":true,"topic":"sparse_table","topics":["sparse_table","divide_and_conquer_on_queries"],"solved":true},{"id":"codeforces_1547f","judge":"Codeforces","title":"Array Stabilization (GCD version)","url":"https://codeforces.com/contest/1547/problem/F","difficulty":2,"starred":true,"topic":"sparse_table","topics":["sparse_table"],"solved":false},{"id":"codeforces_475d","judge":"Codeforces","title":"CGCDSSQ","url":"https://codeforces.com/contest/475/problem/D","difficulty":2,"starred":true,"topic":"sparse_table","topics":["sparse_table","logarithmic_bruteforce"],"solved":false},{"id":"codechef_lgseg","judge":"CodeChef","title":"Longest Good Segment","url":"https://www.codechef.com/problems/LGSEG","difficulty":2,"starred":true,"topic":"sparse_table","topics":["sparse_table","binary_lifting_and_lca"],"solved":false},{"id":"dmoj_year2016p7","judge":"DMOJ","title":"Old Christmas Lights","url":"https://dmoj.ca/problem/year2016p7","difficulty":2,"starred":false,"topic":"sparse_table","topics":["sparse_table"],"solved":false},{"id":"codeforces_514d","judge":"Codeforces","title":"R2D2 and Droid Army","url":"https://codeforces.com/problemset/problem/514/D","difficulty":2,"starred":false,"topic":"sparse_table","topics":["sparse_table"],"solved":false},{"id":"codechef_sead","judge":"CodeChef","title":"Sereja and D","url":"https://www.codechef.com/problems/SEAD","difficulty":2,"starred":false,"topic":"sparse_table","topics":["sparse_table"],"solved":false},{"id":"dmoj_pacnw16j","judge":"DMOJ","title":"Shopping","url":"https://dmoj.ca/problem/pacnw16j","difficulty":2,"starred":false,"topic":"sparse_table","topics":["sparse_table"],"solved":false},{"id":"codeforces_675e","judge":"Codeforces","title":"Trains and Statistic","url":"https://codeforces.com/contest/675/problem/E","difficulty":2,"starred":false,"topic":"sparse_table","topics":["sparse_table","dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_713d","judge":"Codeforces","title":"Animals and Puzzle","url":"https://codeforces.com/contest/713/problem/D","difficulty":2,"starred":true,"topic":"sparse_table_2d","topics":["sparse_table_2d"],"solved":false},{"id":"codechef_cens20b","judge":"CodeChef","title":"Cherry and Squares","url":"https://www.codechef.com/problems/CENS20B","difficulty":2,"starred":false,"topic":"sparse_table_2d","topics":["sparse_table_2d"],"solved":false},{"id":"codechef_chsqarr","judge":"CodeChef","title":"Chef and Rectangle Array","url":"https://www.codechef.com/JUNE16/problems/CHSQARR/","difficulty":null,"starred":false,"topic":"sparse_table_2d","topics":["sparse_table_2d","monotonous_queue_2d"],"solved":false},{"id":"codechef_segprod","judge":"CodeChef","title":"Product on the segment by modulo","url":"https://www.codechef.com/problems/SEGPROD","difficulty":1,"starred":true,"topic":"disjoint_sparse_table","topics":["disjoint_sparse_table","sqrt_tree","divide_and_conquer_on_queries"],"solved":false},{"id":"cf_group_102954a","judge":"Codeforces","title":"Count maxima on an interval","url":"https://codeforces.com/group/1rv4rhCsHp/contest/102954/problem/A","difficulty":1,"starred":true,"topic":"disjoint_sparse_table","topics":["disjoint_sparse_table","sqrt_tree","divide_and_conquer_on_queries"],"solved":false},{"id":"cf_group_102954c","judge":"Codeforces","title":"Calculate MARS","url":"https://codeforces.com/group/1rv4rhCsHp/contest/102954/problem/C","difficulty":3,"starred":true,"topic":"disjoint_sparse_table","topics":["disjoint_sparse_table"],"solved":false},{"id":"cf_group_102954d","judge":"Codeforces","title":"Maximize MARS","url":"https://codeforces.com/group/1rv4rhCsHp/contest/102954/problem/D","difficulty":3,"starred":false,"topic":"disjoint_sparse_table","topics":["disjoint_sparse_table"],"solved":false},{"id":"spoj_adaindex","judge":"SPOJ","title":"Ada and Indexing","url":"https://www.spoj.com/problems/ADAINDEX/","difficulty":1,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"spoj_trycomp","judge":"SPOJ","title":"Try to complete","url":"https://www.spoj.com/problems/TRYCOMP/","difficulty":1,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"karuta","judge":"AtCoder","title":"Karuta","url":"https://atcoder.jp/contests/abc287/tasks/abc287_e","difficulty":1,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"codechef_nplflf","judge":"CodeChef","title":"Query On Strings","url":"https://www.codechef.com/problems/NPLFLF","difficulty":1,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"uva_12506","judge":"UVa","title":"Shortest Names","url":"https://vjudge.net/problem/UVA-12506","difficulty":1,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"toph_priority_of_digits","judge":"Toph","title":"Order of Digits","url":"https://toph.co/p/priority-of-digits","difficulty":1,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_706d","judge":"Codeforces","title":"Vasiliy's Multiset","url":"https://codeforces.com/contest/706/problem/D","difficulty":1,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"uva_11488","judge":"UVa","title":"Hyper Prefix Sets","url":"https://vjudge.net/problem/UVA-11488","difficulty":1,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"yosupo_set_xor_min","judge":"Library Checker","title":"Set Xor-Min","url":"https://judge.yosupo.jp/problem/set_xor_min","difficulty":1,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_842d","judge":"Codeforces","title":"Vitya and Strange Lesson","url":"https://codeforces.com/contest/842/problem/D","difficulty":2,"starred":false,"topic":"trie","topics":["trie","venice_technique"],"solved":false},{"id":"spoj_subxor","judge":"SPOJ","title":"SubXor","url":"https://www.spoj.com/problems/SUBXOR/","difficulty":null,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_665e","judge":"Codeforces","title":"Beautiful Subarrays","url":"https://codeforces.com/problemset/problem/665/E","difficulty":1,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"izho12_xor","judge":"oj.uz","title":"XOR","url":"https://oj.uz/problem/view/IZhO12_xor","difficulty":1,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_282e","judge":"Codeforces","title":"Sausage Maximization","url":"https://codeforces.com/problemset/problem/282/E","difficulty":1,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_817e","judge":"Codeforces","title":"Choosing The Commander","url":"https://codeforces.com/contest/817/problem/E","difficulty":1,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"csacademy_xor_submatrix","judge":"CS Academy","title":"Xor Submatrix","url":"https://csacademy.com/contest/round-42/task/xor-submatrix/statement/","difficulty":1,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"toph_yet_another_xor_problem","judge":"Toph","title":"Yet Another XOR Problem","url":"https://toph.co/p/yet-another-xor-problem","difficulty":1,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"cses_1731","judge":"CSES","title":"Word Combinations","url":"https://cses.fi/problemset/task/1731","difficulty":2,"starred":true,"topic":"trie","topics":["trie","dp_optimization_using_data_structures","aho_corasick"],"solved":false},{"id":"codeforces_456d","judge":"Codeforces","title":"A Lot of Games","url":"https://codeforces.com/contest/456/problem/D","difficulty":2,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"coci20_vlak","judge":"oj.uz","title":"Vlak","url":"https://oj.uz/problem/view/COCI20_vlak","difficulty":2,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"ioi08_printer","judge":"oj.uz","title":"Type Printer","url":"https://oj.uz/problem/view/IOI08_printer","difficulty":2,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"atcoder_arc122_d","judge":"AtCoder","title":"XOR Game","url":"https://atcoder.jp/contests/arc122/tasks/arc122_d","difficulty":2,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_965e","judge":"Codeforces","title":"Short Code","url":"https://codeforces.com/contest/965/problem/E","difficulty":2,"starred":true,"topic":"trie","topics":["trie","dsu_on_tree"],"solved":false},{"id":"uva_11539","judge":"UVa","title":"Another Word Game","url":"https://vjudge.net/problem/UVA-11539","difficulty":2,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_1416c","judge":"Codeforces","title":"XOR Inverse","url":"https://codeforces.com/contest/1416/problem/C","difficulty":2,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"usaco_1281","judge":"USACO","title":"Find and Replace","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1281","difficulty":2,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_1055f","judge":"Codeforces","title":"Tree and XOR","url":"https://codeforces.com/contest/1055/problem/F","difficulty":3,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"joi16_selling_rna","judge":"oj.uz","title":"Selling RNA Strands","url":"https://oj.uz/problem/view/JOI16_selling_rna","difficulty":3,"starred":true,"topic":"trie","topics":["trie","dsu_on_tree"],"solved":false},{"id":"codeforces_271d","judge":"Codeforces","title":"Good Substrings","url":"https://codeforces.com/contest/271/problem/D","difficulty":1,"starred":true,"topic":"trie","topics":["string_hashing","trie"],"solved":false},{"id":"spoj_phonelst","judge":"SPOJ","title":"Phone List","url":"https://www.spoj.com/problems/PHONELST/","difficulty":1,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_2093g","judge":"Codeforces","title":"Shorten the Array","url":"https://codeforces.com/contest/2093/problem/G","difficulty":1,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_1983f","judge":"Codeforces","title":"array-value","url":"https://codeforces.com/contest/1983/problem/F","difficulty":2,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"chef and string","judge":"Other","title":"Chef and String","url":"Chef and String","difficulty":2,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_1792d","judge":"Codeforces","title":"Fixed Prefix Permutations","url":"https://codeforces.com/contest/1792/problem/D","difficulty":2,"starred":false,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_1851f","judge":"Codeforces","title":"Lisa and the Martians","url":"https://codeforces.com/contest/1851/problem/F","difficulty":2,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"lightoj_vishon_xor","judge":"LightOJ","title":"Vishon XOR","url":"https://lightoj.com/problem/vishon-xor","difficulty":2,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"cf_gym_101801j","judge":"CF Gym","title":"Weird Sum","url":"https://codeforces.com/gym/101801/problem/J","difficulty":2,"starred":false,"topic":"trie","topics":["cartesian_tree","trie"],"solved":false},{"id":"codeforces_1980g","judge":"Codeforces","title":"Yasya and the Mysterious Tree","url":"https://codeforces.com/contest/1980/problem/G","difficulty":2,"starred":true,"topic":"trie","topics":["trie"],"solved":false},{"id":"codeforces_1777f","judge":"Codeforces","title":"Comfortably Numb","url":"https://codeforces.com/problemset/problem/1777/F","difficulty":3,"starred":true,"topic":"trie","topics":["all_subarray_maximum_minimum","trie","cartesian_tree"],"solved":false},{"id":"codechef_xrqrs","judge":"CodeChef","title":"Xor Queries","url":"https://www.codechef.com/problems/XRQRS","difficulty":null,"starred":true,"topic":"persistent_trie","topics":["persistent_trie"],"solved":false},{"id":"cf_gym_101628k","judge":"CF Gym","title":"Know Your Statement","url":"https://codeforces.com/gym/101628/problem/K","difficulty":null,"starred":true,"topic":"persistent_trie","topics":["persistent_trie"],"solved":false},{"id":"toph_yet_another_xor_tree_problem","judge":"Toph","title":"Yet Another XOR Tree Problem","url":"https://toph.co/p/yet-another-xor-tree-problem","difficulty":2,"starred":true,"topic":"persistent_trie","topics":["persistent_trie"],"solved":false},{"id":"coci20_klasika","judge":"oj.uz","title":"Klasika","url":"https://oj.uz/problem/view/COCI20_klasika","difficulty":2,"starred":true,"topic":"persistent_trie","topics":["persistent_trie","offline_queries","euler_tour_technique"],"solved":false},{"id":"toph_jontrona_of_liakot","judge":"Toph","title":"Jontrona of Liakot","url":"https://toph.co/p/jontrona-of-liakot","difficulty":2,"starred":true,"topic":"persistent_trie","topics":["persistent_trie"],"solved":false},{"id":"codechef_gpd","judge":"CodeChef","title":"Gotham PD","url":"https://www.codechef.com/problems/GPD","difficulty":null,"starred":false,"topic":"persistent_trie","topics":["hld","persistent_trie"],"solved":false},{"id":"toph_xor_is_fun","judge":"Toph","title":"XOR Is Fun","url":"https://toph.co/p/xor-is-fun","difficulty":3,"starred":true,"topic":"persistent_trie","topics":["persistent_trie"],"solved":false},{"id":"yosupo_unionfind","judge":"Library Checker","title":"Unionfind","url":"https://judge.yosupo.jp/problem/unionfind","difficulty":1,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"cses_1676","judge":"CSES","title":"Road Construction","url":"https://cses.fi/problemset/task/1676","difficulty":1,"starred":true,"topic":"dsu","topics":["dsu"],"solved":true},{"id":"cf_edu_289391b","judge":"Codeforces","title":"Parking","url":"https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/B","difficulty":1,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"cf_edu_289390d","judge":"Codeforces","title":"Cutting a graph","url":"https://codeforces.com/edu/course/2/lesson/7/1/practice/contest/289390/problem/D","difficulty":1,"starred":true,"topic":"dsu","topics":["dsu","offline_queries"],"solved":false},{"id":"spoj_consec","judge":"SPOJ","title":"Consecutive Letters","url":"https://www.spoj.com/problems/CONSEC/","difficulty":1,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"timus_1671","judge":"Timus","title":"Anansi's Cobweb","url":"https://acm.timus.ru/problem.aspx?space=1&num=1671","difficulty":1,"starred":true,"topic":"dsu","topics":["dsu","offline_queries"],"solved":false},{"id":"codechef_abroads","judge":"CodeChef","title":"Ancient Berland Roads","url":"https://www.codechef.com/problems/ABROADS","difficulty":1,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"cf_edu_289391d","judge":"Codeforces","title":"Bosses","url":"https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/D","difficulty":1,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_25d","judge":"Codeforces","title":"Roads not only in Berland","url":"https://codeforces.com/contest/25/problem/D","difficulty":1,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"cf_edu_289390c","judge":"Codeforces","title":"Experience","url":"https://codeforces.com/edu/course/2/lesson/7/1/practice/contest/289390/problem/C","difficulty":1,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_150b","judge":"Codeforces","title":"Quantity of Strings","url":"https://codeforces.com/contest/150/problem/B","difficulty":1,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_1559d1","judge":"Codeforces","title":"Mocha and Diana (Easy Version)","url":"https://codeforces.com/contest/1559/problem/D1","difficulty":1,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"toph_unbelievable_array","judge":"Toph","title":"Unbelievable Array","url":"https://toph.co/p/unbelievable-array","difficulty":2,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"cf_edu_289391i","judge":"Codeforces","title":"Bipartite Graph","url":"https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/I","difficulty":2,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_468b","judge":"Codeforces","title":"Two Sets","url":"https://codeforces.com/contest/468/problem/B","difficulty":2,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"usaco_992","judge":"USACO","title":"Wormhole Sort","url":"https://usaco.org/index.php?page=viewproblem2&cpid=992","difficulty":2,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"usaco_669","judge":"USACO","title":"Moocast","url":"https://usaco.org/index.php?page=viewproblem2&cpid=669","difficulty":2,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"csacademy_mountain_time","judge":"CS Academy","title":"Mountain Time","url":"https://csacademy.com/contest/archive/task/mountain-time/statement/","difficulty":2,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"cf_edu_289391c","judge":"Codeforces","title":"Restructuring Company","url":"https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/C","difficulty":2,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_1213g","judge":"Codeforces","title":"Path Queries","url":"https://codeforces.com/contest/1213/problem/G","difficulty":2,"starred":true,"topic":"dsu","topics":["dsu","mst"],"solved":false},{"id":"codeforces_1468j","judge":"Codeforces","title":"Road Reform","url":"https://codeforces.com/contest/1468/problem/J","difficulty":2,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_1624g","judge":"Codeforces","title":"MinOr Tree","url":"https://codeforces.com/contest/1624/problem/G","difficulty":2,"starred":true,"topic":"dsu","topics":["mst","dsu"],"solved":false},{"id":"atcoder_abc335_e","judge":"AtCoder","title":"Non-Decreasing Colorful Path","url":"https://atcoder.jp/contests/abc335/tasks/abc335_e","difficulty":2,"starred":false,"topic":"dsu","topics":["dsu","dp_on_trees_and_dags"],"solved":false},{"id":"usaco_1259","judge":"USACO","title":"Strongest Friendship Group","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1259","difficulty":3,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_766d","judge":"Codeforces","title":"Mahmoud and a Dictionary","url":"https://codeforces.com/contest/766/problem/D","difficulty":1,"starred":false,"topic":"dsu","topics":["augmented_dsu","dsu"],"solved":false},{"id":"atcoder_abc420_e","judge":"AtCoder","title":"Reachability Query","url":"https://atcoder.jp/contests/abc420/tasks/abc420_e","difficulty":1,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_990g","judge":"Codeforces","title":"GCD Counting","url":"https://codeforces.com/problemset/problem/990/G","difficulty":2,"starred":true,"topic":"dsu","topics":["dsu","logarithmic_bruteforce"],"solved":false},{"id":"codeforces_1559d2","judge":"Codeforces","title":"Mocha and Diana (Hard Version)","url":"https://codeforces.com/contest/1559/problem/D2","difficulty":2,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_2117g","judge":"Codeforces","title":"Omg Graph","url":"https://codeforces.com/contest/2117/problem/G","difficulty":2,"starred":false,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"codeforces_915f","judge":"Codeforces","title":"Imbalance Value of a Tree","url":"https://codeforces.com/contest/915/problem/F","difficulty":3,"starred":true,"topic":"dsu","topics":["dsu"],"solved":false},{"id":"cf_edu_289392a","judge":"Codeforces","title":"DSU with rollback","url":"https://codeforces.com/edu/course/2/lesson/7/3/practice/contest/289392/problem/A","difficulty":1,"starred":true,"topic":"dsu_with_rollbacks","topics":["dsu_with_rollbacks"],"solved":false},{"id":"dmoj_mmcc15p1","judge":"DMOJ","title":"Inaho","url":"https://dmoj.ca/problem/mmcc15p1","difficulty":1,"starred":false,"topic":"dsu_with_rollbacks","topics":["dsu_with_rollbacks"],"solved":false},{"id":"yosupo_persistent_unionfind","judge":"Library Checker","title":"Persistent Unionfind","url":"https://judge.yosupo.jp/problem/persistent_unionfind","difficulty":2,"starred":true,"topic":"dsu_with_rollbacks","topics":["dsu_with_rollbacks","persistent_dsu"],"solved":false},{"id":"codeforces_1706e","judge":"Codeforces","title":"Qpwoeirut and Vertices","url":"https://codeforces.com/contest/1706/problem/E","difficulty":1,"starred":true,"topic":"reachability_tree","topics":["reachability_tree"],"solved":false},{"id":"codeforces_1416d","judge":"Codeforces","title":"Graph and Queries","url":"https://codeforces.com/contest/1416/problem/D","difficulty":2,"starred":true,"topic":"reachability_tree","topics":["reachability_tree","offline_queries"],"solved":false},{"id":"coci18_pictionary","judge":"oj.uz","title":"Pictionary","url":"https://oj.uz/problem/view/COCI18_pictionary","difficulty":2,"starred":true,"topic":"reachability_tree","topics":["parallel_binary_search","reachability_tree"],"solved":false},{"id":"codechef_chefcomp","judge":"CodeChef","title":"Chefina and Strange Tree","url":"https://www.codechef.com/problems/CHEFCOMP","difficulty":2,"starred":false,"topic":"reachability_tree","topics":["reachability_tree"],"solved":false},{"id":"atcoder_asaporo2_e","judge":"AtCoder","title":"Black Cats Deployment","url":"https://atcoder.jp/contests/cf17-tournament-round3-open/tasks/asaporo2_e","difficulty":2,"starred":false,"topic":"reachability_tree","topics":["reachability_tree"],"solved":false},{"id":"codechef_tulips","judge":"CodeChef","title":"Tiptoe through the tulips","url":"https://www.codechef.com/problems/TULIPS","difficulty":3,"starred":true,"topic":"reachability_tree","topics":["reachability_tree"],"solved":false},{"id":"codeforces_1628e","judge":"Codeforces","title":"Groceries in Meteor Town","url":"https://codeforces.com/contest/1628/problem/E","difficulty":3,"starred":true,"topic":"reachability_tree","topics":["reachability_tree"],"solved":false},{"id":"tlx_apio2020_b","judge":"TLX","title":"Swapping Cities","url":"https://tlx.toki.id/problems/apio-2020/B","difficulty":3,"starred":false,"topic":"reachability_tree","topics":["reachability_tree"],"solved":false},{"id":"usaco_384","judge":"USACO","title":"Ski Course Rating","url":"https://usaco.org/index.php?page=viewproblem2&cpid=384","difficulty":3,"starred":false,"topic":"reachability_tree","topics":["reachability_tree"],"solved":false},{"id":"codeforces_2021e3","judge":"Codeforces","title":"Digital Village (Extreme Version)","url":"https://codeforces.com/contest/2021/problem/E3","difficulty":3,"starred":false,"topic":"reachability_tree","topics":["reachability_tree"],"solved":false},{"id":"codeforces_1920f2","judge":"Codeforces","title":"Smooth Sailing (Hard Version)","url":"https://codeforces.com/problemset/problem/1920/F2","difficulty":3,"starred":false,"topic":"reachability_tree","topics":["reachability_tree"],"solved":false},{"id":"cses_2101","judge":"CSES","title":"New Roads Queries","url":"https://cses.fi/problemset/task/2101","difficulty":1,"starred":true,"topic":"partially_persistent_dsu","topics":["partially_persistent_dsu","persistent_dsu","parallel_binary_search"],"solved":false},{"id":"cf_gym_102396c","judge":"CF Gym","title":"Jet Trains","url":"https://codeforces.com/gym/102396/problem/C","difficulty":2,"starred":false,"topic":"partially_persistent_dsu","topics":["partially_persistent_dsu"],"solved":false},{"id":"cf_gym_102021m","judge":"CF Gym","title":"Mountaineers","url":"https://codeforces.com/gym/102021/problem/M","difficulty":2,"starred":false,"topic":"partially_persistent_dsu","topics":["partially_persistent_dsu"],"solved":false},{"id":"cf_gym_104468b","judge":"CF Gym","title":"Osama-utiful Components","url":"https://codeforces.com/gym/104468/problem/B","difficulty":2,"starred":false,"topic":"partially_persistent_dsu","topics":["persistent_dsu","partially_persistent_dsu"],"solved":false},{"id":"kattis_particles","judge":"Kattis","title":"Particle Swapping","url":"https://open.kattis.com/problems/particles","difficulty":2,"starred":false,"topic":"partially_persistent_dsu","topics":["partially_persistent_dsu"],"solved":false},{"id":"atcoder_abc328_f","judge":"AtCoder","title":"Good Set Query","url":"https://atcoder.jp/contests/abc328/tasks/abc328_f","difficulty":1,"starred":true,"topic":"augmented_dsu","topics":["augmented_dsu"],"solved":false},{"id":"spoj_chain","judge":"SPOJ","title":"Strange Food Chain","url":"https://www.spoj.com/problems/CHAIN/","difficulty":1,"starred":true,"topic":"augmented_dsu","topics":["augmented_dsu"],"solved":false},{"id":"timus_1003","judge":"Timus","title":"Parity","url":"https://acm.timus.ru/problem.aspx?space=1&num=1003","difficulty":1,"starred":false,"topic":"augmented_dsu","topics":["augmented_dsu"],"solved":false},{"id":"yosupo_unionfind_with_potential","judge":"Library Checker","title":"Unionfind with Potential","url":"https://judge.yosupo.jp/problem/unionfind_with_potential","difficulty":1,"starred":false,"topic":"augmented_dsu","topics":["augmented_dsu"],"solved":false},{"id":"codeforces_1788f","judge":"Codeforces","title":"XOR, Tree, and Queries","url":"https://codeforces.com/contest/1788/problem/F","difficulty":2,"starred":true,"topic":"augmented_dsu","topics":["augmented_dsu"],"solved":false},{"id":"cses_1139","judge":"CSES","title":"Distinct Colors","url":"https://cses.fi/problemset/task/1139/","difficulty":1,"starred":true,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"codeforces_600e","judge":"Codeforces","title":"Lomsat gelral","url":"https://codeforces.com/contest/600/problem/E","difficulty":1,"starred":true,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"usaco_696","judge":"USACO","title":"Promotion Counting","url":"https://usaco.org/index.php?page=viewproblem2&cpid=696","difficulty":1,"starred":true,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"codeforces_570d","judge":"Codeforces","title":"Tree Requests","url":"https://codeforces.com/contest/570/problem/D","difficulty":1,"starred":false,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"sgu_507","judge":"Codeforces","title":"Treediff","url":"https://vjudge.net/problem/SGU-507","difficulty":1,"starred":true,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"hackerearth_the_grass_type","judge":"HackerEarth","title":"The Grass Type","url":"https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/practice-problems/algorithm/the-grass-type/","difficulty":1,"starred":false,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"codeforces_246e","judge":"Codeforces","title":"Blood Cousins Return","url":"https://codeforces.com/contest/246/problem/E","difficulty":1,"starred":false,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"codeforces_1009f","judge":"Codeforces","title":"Dominant Indices","url":"https://codeforces.com/contest/1009/problem/F","difficulty":1,"starred":false,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"codeforces_375d","judge":"Codeforces","title":"Tree and Queries","url":"https://codeforces.com/contest/375/problem/D","difficulty":2,"starred":true,"topic":"dsu_on_tree","topics":["dsu_on_tree","mos_algorithm"],"solved":false},{"id":"kattis_speedlimit2","judge":"Kattis","title":"The Cost of Speed Limits","url":"https://open.kattis.com/problems/speedlimit2","difficulty":2,"starred":false,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"joi20_joitter2","judge":"oj.uz","title":"Making Friends on Joitter is Fun","url":"https://oj.uz/problem/view/JOI20_joitter2","difficulty":2,"starred":false,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"codeforces_741d","judge":"Codeforces","title":"Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths","url":"https://codeforces.com/contest/741/problem/D","difficulty":2,"starred":false,"topic":"dsu_on_tree","topics":["dsu_on_tree"],"solved":false},{"id":"codeforces_914e","judge":"Codeforces","title":"Palindromes in a Tree","url":"https://codeforces.com/contest/914/problem/E","difficulty":2,"starred":true,"topic":"dsu_on_tree","topics":["dsu_on_tree","centroid_decomposition"],"solved":false},{"id":"atcoder_abc337_g","judge":"AtCoder","title":"Tree Inversion","url":"https://atcoder.jp/contests/abc337/tasks/abc337_g","difficulty":2,"starred":true,"topic":"dsu_on_tree","topics":["dsu_on_tree","rerooting_technique"],"solved":false},{"id":"cf_gym_101864d","judge":"CF Gym","title":"Beauty and The Tree","url":"https://codeforces.com/gym/101864/problem/D","difficulty":2,"starred":false,"topic":"dsu_on_tree","topics":["sqrt_decomposition","dsu_on_tree"],"solved":false},{"id":"cf_gym_103119i","judge":"CF Gym","title":"Nim Cheater","url":"https://codeforces.com/gym/103119/problem/I","difficulty":2,"starred":true,"topic":"dsu_on_tree","topics":["hld","dsu_on_tree"],"solved":false},{"id":"yosupo_range_parallel_unionfind","judge":"Library Checker","title":"Range Parallel Unionfind","url":"https://judge.yosupo.jp/problem/range_parallel_unionfind","difficulty":2,"starred":true,"topic":"maintaining_log_n_dsu","topics":["maintaining_log_n_dsu"],"solved":false},{"id":"csacademy_substring_restrictions","judge":"CS Academy","title":"Substring Restrictions","url":"https://csacademy.com/contest/archive/task/substring-restrictions/statement/","difficulty":2,"starred":true,"topic":"maintaining_log_n_dsu","topics":["maintaining_log_n_dsu"],"solved":false},{"id":"cf_gym_103388l","judge":"CF Gym","title":"Listing Passwords","url":"https://codeforces.com/gym/103388/problem/L","difficulty":2,"starred":true,"topic":"maintaining_log_n_dsu","topics":["maintaining_log_n_dsu"],"solved":false},{"id":"codechef_cowsheds","judge":"CodeChef","title":"Kuroni and the Cowsheds","url":"https://www.codechef.com/problems/COWSHEDS","difficulty":2,"starred":true,"topic":"maintaining_log_n_dsu","topics":["maintaining_log_n_dsu"],"solved":false},{"id":"atcoder_abc349_g","judge":"AtCoder","title":"Palindrome Construction","url":"https://atcoder.jp/contests/abc349/tasks/abc349_g","difficulty":2,"starred":true,"topic":"maintaining_log_n_dsu","topics":["maintaining_log_n_dsu"],"solved":false},{"id":"spoj_dquery","judge":"SPOJ","title":"D-query","url":"https://www.spoj.com/problems/DQUERY/","difficulty":2,"starred":false,"topic":"sqrt_decomposition","topics":["sqrt_decomposition"],"solved":false},{"id":"spoj_giveaway","judge":"SPOJ","title":"Give Away","url":"https://www.spoj.com/problems/GIVEAWAY/","difficulty":2,"starred":true,"topic":"sqrt_decomposition","topics":["sqrt_decomposition"],"solved":false},{"id":"codechef_hilljump","judge":"CodeChef","title":"Hill Jumping","url":"https://www.codechef.com/AUG17/problems/HILLJUMP","difficulty":2,"starred":true,"topic":"sqrt_decomposition","topics":["sqrt_decomposition"],"solved":false},{"id":"uva_3141","judge":"UVa","title":"Dynamic Inversion","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3141","difficulty":null,"starred":true,"topic":"sqrt_decomposition","topics":["sqrt_decomposition","cdq_divide_and_conquer"],"solved":false},{"id":"uva_3154","judge":"UVa","title":"Array Transformer","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3154","difficulty":2,"starred":true,"topic":"sqrt_decomposition","topics":["sqrt_decomposition"],"solved":false},{"id":"codechef_chefexq","judge":"CodeChef","title":"Chef And Easy Xor Queries","url":"https://www.codechef.com/problems/CHEFEXQ","difficulty":3,"starred":true,"topic":"sqrt_decomposition","topics":["sqrt_decomposition"],"solved":false},{"id":"codechef_fncs","judge":"CodeChef","title":"Chef and Churu","url":"https://www.codechef.com/problems/FNCS","difficulty":3,"starred":false,"topic":"sqrt_decomposition","topics":["sqrt_decomposition"],"solved":false},{"id":"codeforces_896e","judge":"Codeforces","title":"Welcome home, Chtholly","url":"https://codeforces.com/contest/896/problem/E","difficulty":3,"starred":true,"topic":"sqrt_decomposition","topics":["sqrt_decomposition","pragmas"],"solved":false},{"id":"codeforces_2148f","judge":"Codeforces","title":"Gravity Falls","url":"https://codeforces.com/contest/2148/problem/F","difficulty":1,"starred":false,"topic":"sqrt_decomposition","topics":["sqrt_decomposition"],"solved":false},{"id":"yosupo_point_set_range_frequency","judge":"Library Checker","title":"Point Set Range Frequency","url":"https://judge.yosupo.jp/problem/point_set_range_frequency","difficulty":1,"starred":true,"topic":"sqrt_decomposition","topics":["sqrt_decomposition"],"solved":false},{"id":"spoj_freq2","judge":"SPOJ","title":"Most Frequent Value","url":"https://www.spoj.com/problems/FREQ2/","difficulty":2,"starred":true,"topic":"sqrt_decomposition","topics":["sqrt_decomposition"],"solved":false},{"id":"codeforces_914f","judge":"Codeforces","title":"Substrings in a String","url":"https://codeforces.com/problemset/problem/914/F","difficulty":3,"starred":true,"topic":"sqrt_decomposition","topics":["string_matching_using_bitsets","sqrt_decomposition"],"solved":false},{"id":"codeforces_1017g","judge":"Codeforces","title":"The Tree","url":"https://codeforces.com/contest/1017/problem/G","difficulty":3,"starred":false,"topic":"sqrt_decomposition","topics":["hld","sqrt_decomposition"],"solved":false},{"id":"codeforces_220b","judge":"Codeforces","title":"Little Elephant and Array","url":"https://codeforces.com/contest/220/problem/B","difficulty":1,"starred":true,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"codechef_kol15c","judge":"CodeChef","title":"Just Update and Print the array","url":"https://www.codechef.com/problems/KOL15C","difficulty":1,"starred":true,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"codeforces_348c","judge":"Codeforces","title":"Subset Sums","url":"https://codeforces.com/contest/348/problem/C","difficulty":2,"starred":true,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"codeforces_13e","judge":"Codeforces","title":"Holes","url":"https://codeforces.com/contest/13/problem/E","difficulty":null,"starred":true,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"codeforces_1619h","judge":"Codeforces","title":"Permutation and Queries","url":"https://codeforces.com/contest/1619/problem/H","difficulty":2,"starred":false,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy","implicit_treap"],"solved":false},{"id":"codeforces_1580c","judge":"Codeforces","title":"Train Maintenance","url":"https://codeforces.com/contest/1580/problem/C","difficulty":2,"starred":true,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"atcoder_abc219_g","judge":"AtCoder","title":"Propagation","url":"https://atcoder.jp/contests/abc219/tasks/abc219_g","difficulty":3,"starred":true,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"codeforces_506d","judge":"Codeforces","title":"Mr. Kitayuta's Colorful Graph","url":"https://codeforces.com/contest/506/problem/D","difficulty":3,"starred":false,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"codeforces_398d","judge":"Codeforces","title":"Instant Messanger","url":"https://codeforces.com/contest/398/problem/D","difficulty":3,"starred":false,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"spoj_maxchildsum","judge":"SPOJ","title":"Maximum Child Sum","url":"https://www.spoj.com/problems/MAXCHILDSUM/","difficulty":2,"starred":false,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"cf_group_628229e","judge":"Codeforces","title":"Jaber and the Prediction Tree","url":"https://codeforces.com/group/Rilx5irOux/contest/628229/problem/E","difficulty":3,"starred":false,"topic":"splitting_objects_into_light_and_heavy","topics":["cht","splitting_objects_into_light_and_heavy"],"solved":false},{"id":"cf_gym_105009l","judge":"CF Gym","title":"Modulo Queries","url":"https://codeforces.com/gym/105009/problem/L","difficulty":3,"starred":true,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy","offline_queries"],"solved":false},{"id":"codeforces_1254d","judge":"Codeforces","title":"Tree Queries","url":"https://codeforces.com/contest/1254/problem/D","difficulty":3,"starred":false,"topic":"splitting_objects_into_light_and_heavy","topics":["splitting_objects_into_light_and_heavy"],"solved":false},{"id":"spoj_xxxxxxxx","judge":"SPOJ","title":"XXXXXXXX","url":"https://www.spoj.com/problems/XXXXXXXX/","difficulty":1,"starred":true,"topic":"batch_processing","topics":["mos_with_update","batch_processing"],"solved":false},{"id":"timus_1846","judge":"Timus","title":"GCD 2010","url":"https://acm.timus.ru/problem.aspx?space=1&num=1846","difficulty":2,"starred":true,"topic":"batch_processing","topics":["batch_processing","dynamic_connectivity_problem"],"solved":false},{"id":"cf_gym_100589a","judge":"CF Gym","title":"Queries on the Tree","url":"https://codeforces.com/gym/100589/problem/A","difficulty":2,"starred":true,"topic":"batch_processing","topics":["sqrt_fragmented_tree","batch_processing"],"solved":false},{"id":"codeforces_487d","judge":"Codeforces","title":"Conveyor Belts","url":"https://codeforces.com/contest/487/problem/D","difficulty":3,"starred":false,"topic":"batch_processing","topics":["batch_processing"],"solved":false},{"id":"codeforces_455d","judge":"Codeforces","title":"Serega and Fun","url":"https://codeforces.com/contest/455/problem/D","difficulty":null,"starred":true,"topic":"batch_processing","topics":["sqrt_decomposition_split_and_build_technique","batch_processing"],"solved":false},{"id":"eolymp_2961","judge":"Eolymp","title":"Жесть","url":"https://www.eolymp.com/en/problems/2961","difficulty":3,"starred":true,"topic":"sqrt_decomposition_split_and_build_technique","topics":["sqrt_decomposition_split_and_build_technique"],"solved":false},{"id":"codeforces_86d","judge":"Codeforces","title":"Powerful Array","url":"https://codeforces.com/contest/86/problem/D","difficulty":1,"starred":true,"topic":"mos_algorithm","topics":["mos_algorithm"],"solved":false},{"id":"codeforces_617e","judge":"Codeforces","title":"XOR and Favorite Number","url":"https://codeforces.com/contest/617/problem/E","difficulty":1,"starred":true,"topic":"mos_algorithm","topics":["mos_algorithm","sweepline_mo"],"solved":false},{"id":"yosupo_static_range_inversions_query","judge":"Library Checker","title":"Static Range Inversions Query","url":"https://judge.yosupo.jp/problem/static_range_inversions_query","difficulty":2,"starred":true,"topic":"mos_algorithm","topics":["mos_algorithm","inversions"],"solved":false},{"id":"codeforces_351d","judge":"Codeforces","title":"Jeff and Removing Periods","url":"https://codeforces.com/contest/351/problem/D","difficulty":2,"starred":false,"topic":"mos_algorithm","topics":["mos_algorithm"],"solved":false},{"id":"codechef_decopair","judge":"CodeChef","title":"Chefina and Beautiful Pairs","url":"https://www.codechef.com/problems/DECOPAIR","difficulty":2,"starred":true,"topic":"mos_algorithm","topics":["mos_algorithm"],"solved":false},{"id":"codeforces_840d","judge":"Codeforces","title":"Destiny","url":"https://codeforces.com/contest/840/problem/D","difficulty":2,"starred":true,"topic":"mos_algorithm","topics":["mos_algorithm","randomized_algorithms","boyer_moore_voting_algorithm_and_misra_gries_algorithm"],"solved":false},{"id":"codeforces_877f","judge":"Codeforces","title":"Ann and Books","url":"https://codeforces.com/contest/877/problem/F","difficulty":2,"starred":false,"topic":"mos_algorithm","topics":["mos_algorithm"],"solved":false},{"id":"codeforces_577e","judge":"Codeforces","title":"Points on Plane","url":"https://codeforces.com/contest/577/problem/E","difficulty":2,"starred":false,"topic":"mos_algorithm","topics":["mos_algorithm"],"solved":false},{"id":"codechef_stdprgs","judge":"CodeChef","title":"Estimating progress","url":"https://www.codechef.com/problems/STDPRGS","difficulty":3,"starred":false,"topic":"mos_algorithm","topics":["mos_algorithm"],"solved":false},{"id":"codeforces_2014h","judge":"Codeforces","title":"Robin Hood Archery","url":"https://codeforces.com/contest/2014/problem/H","difficulty":1,"starred":false,"topic":"mos_algorithm","topics":["mos_algorithm","xor_hashing"],"solved":false},{"id":"atcoder_abc293_g","judge":"AtCoder","title":"Triple Index","url":"https://atcoder.jp/contests/abc293/tasks/abc293_g","difficulty":1,"starred":false,"topic":"mos_algorithm","topics":["mos_algorithm"],"solved":false},{"id":"codechef_gerald07","judge":"CodeChef","title":"Chef and Graph Queries","url":"https://www.codechef.com/MARCH14/problems/GERALD07","difficulty":1,"starred":true,"topic":"mos_with_dsu","topics":["mos_with_dsu"],"solved":false},{"id":"codechef_qchef","judge":"CodeChef","title":"Chef and Problems","url":"https://www.codechef.com/problems/QCHEF","difficulty":2,"starred":true,"topic":"mos_with_dsu","topics":["mos_with_dsu"],"solved":false},{"id":"spoj_zquery","judge":"SPOJ","title":"Zero Query","url":"https://www.spoj.com/problems/ZQUERY/","difficulty":2,"starred":false,"topic":"mos_with_dsu","topics":["mos_with_dsu"],"solved":false},{"id":"yosupo_static_range_mode_query","judge":"Library Checker","title":"Static Range Mode Query","url":"https://judge.yosupo.jp/problem/static_range_mode_query","difficulty":2,"starred":true,"topic":"mos_with_dsu","topics":["mos_with_dsu"],"solved":false},{"id":"spoj_cot2","judge":"SPOJ","title":"Count on a tree II","url":"https://www.spoj.com/problems/COT2/","difficulty":1,"starred":true,"topic":"mos_on_tree","topics":["mos_on_tree"],"solved":false},{"id":"cf_gym_100962f","judge":"CF Gym","title":"Frank Sinatra","url":"https://codeforces.com/gym/100962/problem/F","difficulty":null,"starred":true,"topic":"mos_on_tree","topics":["mos_on_tree"],"solved":false},{"id":"codechef_fctre","judge":"CodeChef","title":"Factor Tree","url":"https://www.codechef.com/APRIL20A/problems/FCTRE/","difficulty":2,"starred":false,"topic":"mos_on_tree","topics":["mos_on_tree"],"solved":false},{"id":"codechef_closefar","judge":"CodeChef","title":"So Close Yet So Far","url":"https://www.codechef.com/problems/CLOSEFAR","difficulty":2,"starred":false,"topic":"mos_on_tree","topics":["mos_on_tree"],"solved":false},{"id":"codechef_vlb","judge":"CodeChef","title":"Vasya and Little Bear","url":"https://www.codechef.com/ALKH2016/problems/VLB","difficulty":2,"starred":false,"topic":"mos_on_tree","topics":["mos_on_tree"],"solved":false},{"id":"toph_distinct_dishting","judge":"Toph","title":"Distinct Dishting","url":"https://toph.co/p/distinct-dishting","difficulty":1,"starred":true,"topic":"mos_with_update","topics":["mos_with_update"],"solved":false},{"id":"codeforces_940f","judge":"Codeforces","title":"Machine Learning","url":"https://codeforces.com/problemset/problem/940/F","difficulty":2,"starred":true,"topic":"mos_with_update","topics":["mos_with_update","mos_online"],"solved":false},{"id":"uoj_58","judge":"UOJ","title":"Candy Park","url":"https://uoj.ac/problem/58","difficulty":2,"starred":false,"topic":"mos_with_update","topics":["mos_with_update"],"solved":false},{"id":"codechef_distnum3","judge":"CodeChef","title":"Primitive Queries","url":"https://www.codechef.com/FEB17/problems/DISTNUM3","difficulty":3,"starred":false,"topic":"mos_with_update","topics":["mos_with_update"],"solved":false},{"id":"codeforces_2043g","judge":"Codeforces","title":"Problem with Queries","url":"https://codeforces.com/problemset/problem/2043/G","difficulty":1,"starred":false,"topic":"mos_online","topics":["mos_online"],"solved":false},{"id":"gym_101138d","judge":"CF Gym","title":"Strange Queries","url":"https://vjudge.net/problem/Gym-101138D","difficulty":2,"starred":true,"topic":"4d_mo","topics":["4d_mo"],"solved":false},{"id":"codeforces_1767f","judge":"Codeforces","title":"Two Subtrees","url":"https://codeforces.com/contest/1767/problem/F","difficulty":null,"starred":true,"topic":"4d_mo","topics":["4d_mo"],"solved":false},{"id":"cses_1138","judge":"CSES","title":"Path Queries","url":"https://cses.fi/problemset/task/1138","difficulty":1,"starred":true,"topic":"hld","topics":["hld"],"solved":false},{"id":"cses_2134","judge":"CSES","title":"Path Queries II","url":"https://cses.fi/problemset/task/2134","difficulty":1,"starred":true,"topic":"hld","topics":["hld"],"solved":false},{"id":"spoj_qtree","judge":"SPOJ","title":"Query on a tree","url":"https://www.spoj.com/problems/QTREE/","difficulty":1,"starred":false,"topic":"hld","topics":["hld"],"solved":false},{"id":"spoj_grasspla","judge":"SPOJ","title":"Grass Planting","url":"https://www.spoj.com/problems/GRASSPLA/","difficulty":1,"starred":true,"topic":"hld","topics":["hld"],"solved":false},{"id":"usaco_921","judge":"USACO","title":"Cow Land","url":"https://usaco.org/index.php?page=viewproblem2&cpid=921","difficulty":1,"starred":false,"topic":"hld","topics":["hld"],"solved":false},{"id":"spoj_qtree3","judge":"SPOJ","title":"QTREE3 - Query on a tree again!","url":"https://www.spoj.com/problems/QTREE3/","difficulty":1,"starred":false,"topic":"hld","topics":["hld"],"solved":false},{"id":"hackerrank_subtrees_and_paths","judge":"HackerRank","title":"Subtrees And Paths","url":"https://www.hackerrank.com/challenges/subtrees-and-paths/problem","difficulty":null,"starred":true,"topic":"hld","topics":["hld"],"solved":false},{"id":"yosupo_vertex_set_path_composite","judge":"Library Checker","title":"Vertex Set Path Composite","url":"https://judge.yosupo.jp/problem/vertex_set_path_composite","difficulty":2,"starred":true,"topic":"hld","topics":["hld"],"solved":false},{"id":"spoj_gss7","judge":"SPOJ","title":"Can you answer these queries VII","url":"https://www.spoj.com/problems/GSS7/","difficulty":2,"starred":true,"topic":"hld","topics":["hld"],"solved":false},{"id":"codechef_pshttr","judge":"CodeChef","title":"Pishty and tree","url":"https://www.codechef.com/JULY17/problems/PSHTTR","difficulty":2,"starred":false,"topic":"hld","topics":["hld","offline_queries"],"solved":false},{"id":"codechef_qryland","judge":"CodeChef","title":"Ivan Pesic and His World Tour","url":"https://www.codechef.com/problems/QRYLAND","difficulty":2,"starred":false,"topic":"hld","topics":["hld","multiset_hashing"],"solved":false},{"id":"codechef_blwhtree","judge":"CodeChef","title":"Black-and-White Tree","url":"https://www.codechef.com/problems/BLWHTREE","difficulty":2,"starred":false,"topic":"hld","topics":["hld"],"solved":false},{"id":"usaco_970","judge":"USACO","title":"Milk Visits","url":"https://usaco.org/index.php?page=viewproblem2&cpid=970","difficulty":2,"starred":false,"topic":"hld","topics":["hld"],"solved":false},{"id":"spoj_qtree4","judge":"SPOJ","title":"QTREE4 - Query on a tree IV","url":"https://www.spoj.com/problems/QTREE4/","difficulty":2,"starred":false,"topic":"hld","topics":["centroid_decomposition","hld"],"solved":false},{"id":"codeforces_827d","judge":"Codeforces","title":"Best Edge Weight","url":"https://codeforces.com/problemset/problem/827/D","difficulty":2,"starred":false,"topic":"hld","topics":["hld"],"solved":false},{"id":"codechef_monoploy","judge":"CodeChef","title":"Gangsters of Treeland","url":"https://www.codechef.com/problems/MONOPLOY","difficulty":3,"starred":false,"topic":"hld","topics":["hld","lct"],"solved":false},{"id":"usaco_576","judge":"USACO","title":"Max Flow","url":"https://usaco.org/current/index.php?page=viewproblem2&cpid=576","difficulty":null,"starred":false,"topic":"hld","topics":["hld"],"solved":false},{"id":"usaco_901","judge":"USACO","title":"Exercise Route","url":"https://usaco.org/index.php?page=viewproblem2&cpid=901","difficulty":3,"starred":false,"topic":"hld","topics":["hld"],"solved":false},{"id":"tlx_troc_14h","judge":"TLX","title":"Tree Game","url":"https://tlx.toki.id/problems/troc-14/H/","difficulty":3,"starred":true,"topic":"hld","topics":["hld"],"solved":false},{"id":"cses_2079","judge":"CSES","title":"Finding a Centroid","url":"https://cses.fi/problemset/task/2079","difficulty":1,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_321c","judge":"Codeforces","title":"Ciel the Commander","url":"https://codeforces.com/contest/321/problem/C","difficulty":1,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"cses_2080","judge":"CSES","title":"Fixed-Length Paths I","url":"https://cses.fi/problemset/task/2080","difficulty":1,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"cses_2081","judge":"CSES","title":"Fixed-Length Paths II","url":"https://cses.fi/problemset/task/2081","difficulty":1,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_342e","judge":"Codeforces","title":"Xenia and Tree","url":"https://codeforces.com/contest/342/problem/E","difficulty":2,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_766e","judge":"Codeforces","title":"Mahmoud and a xor trip","url":"https://codeforces.com/problemset/problem/766/E","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["dp_on_trees_and_dags","centroid_decomposition"],"solved":false},{"id":"codeforces_1387b2","judge":"Codeforces","title":"Village (Maximum)","url":"https://codeforces.com/contest/1387/problem/B2","difficulty":null,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_716e","judge":"Codeforces","title":"Digit Tree","url":"https://codeforces.com/contest/716/problem/E","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition","string_hashing"],"solved":false},{"id":"ioi11_race","judge":"oj.uz","title":"Race","url":"https://oj.uz/problem/view/IOI11_race","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_776f","judge":"Codeforces","title":"Sherlock's bet to Moriarty","url":"https://codeforces.com/contest/776/problem/F","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"dmoj_coci19c3p4","judge":"DMOJ","title":"Lampice","url":"https://dmoj.ca/problem/coci19c3p4","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"spoj_qtree5","judge":"SPOJ","title":"Query on a tree V","url":"https://www.spoj.com/problems/QTREE5/","difficulty":2,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codechef_primedst","judge":"CodeChef","title":"Prime Distance On Tree","url":"https://www.codechef.com/problems/PRIMEDST","difficulty":null,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_293e","judge":"Codeforces","title":"Close Vertices","url":"https://codeforces.com/contest/293/problem/E","difficulty":2,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"cf_gym_100633d","judge":"CF Gym","title":"LWDB","url":"https://codeforces.com/gym/100633/problem/D","difficulty":2,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"lightoj_good_path","judge":"LightOJ","title":"Good Path on a Tree","url":"https://lightoj.com/problem/good-path","difficulty":null,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"cf_gym_100570f","judge":"CF Gym","title":"Tree Query","url":"https://codeforces.com/gym/100570/problem/F","difficulty":2,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"usaco_817","judge":"USACO","title":"New Barns","url":"https://usaco.org/index.php?page=viewproblem2&cpid=817","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"hackerrank_bst_maintenance","judge":"HackerRank","title":"BST maintenance","url":"https://www.hackerrank.com/challenges/bst-maintenance/problem","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codechef_btree","judge":"CodeChef","title":"Union on Tree","url":"https://www.codechef.com/problems/BTREE","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codechef_cntit","judge":"CodeChef","title":"Count It","url":"https://www.codechef.com/problems/CNTIT","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codechef_trdst","judge":"CodeChef","title":"Yet Another Tree Problem","url":"https://www.codechef.com/FEB19A/problems/TRDST/","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codechef_gerald2","judge":"CodeChef","title":"Black and White Tree","url":"https://www.codechef.com/problems/GERALD2","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"cf_gym_101991a","judge":"CF Gym","title":"Awesome Shawarma","url":"https://codeforces.com/gym/101991/problem/A","difficulty":2,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition","fft","number_of_paths_of_each_length_in_a_tree"],"solved":false},{"id":"codeforces_1140g","judge":"Codeforces","title":"Double Tree","url":"https://codeforces.com/contest/1140/problem/G","difficulty":3,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"cf_gym_102114d","judge":"CF Gym","title":"Daylight","url":"https://codeforces.com/gym/102114/problem/D","difficulty":3,"starred":true,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"joi14_factories","judge":"oj.uz","title":"Factories","url":"https://oj.uz/problem/view/JOI14_factories","difficulty":3,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"dmoj_dmopc19c7p6","judge":"DMOJ","title":"Bob Equilibrium","url":"https://dmoj.ca/problem/dmopc19c7p6","difficulty":3,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"joi13_synchronization","judge":"oj.uz","title":"Synchronization","url":"https://oj.uz/problem/view/JOI13_synchronization","difficulty":3,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"dmoj_tc19summerh","judge":"DMOJ","title":"Time Traveller Imaxblue","url":"https://dmoj.ca/problem/tc19summerh","difficulty":3,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_150e","judge":"Codeforces","title":"Freezing with Style","url":"https://codeforces.com/contest/150/problem/E","difficulty":3,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_833d","judge":"Codeforces","title":"Red-Black Cobweb","url":"https://codeforces.com/contest/833/problem/D","difficulty":3,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"spoj_yosales","judge":"SPOJ","title":"Another Travelling Salesman Problem","url":"https://www.spoj.com/problems/YOSALES/","difficulty":2,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_1797f","judge":"Codeforces","title":"Li Hua and Path","url":"https://codeforces.com/contest/1797/problem/F","difficulty":3,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"dmoj_stnbd6","judge":"DMOJ","title":"Terminus Est","url":"https://dmoj.ca/problem/stnbd6","difficulty":3,"starred":false,"topic":"centroid_decomposition","topics":["centroid_decomposition"],"solved":false},{"id":"codeforces_757g","judge":"Codeforces","title":"Can Bash Save the Day?","url":"https://codeforces.com/contest/757/problem/G","difficulty":3,"starred":true,"topic":"persistent_centroid_decomposition","topics":["persistent_centroid_decomposition","binarizing_a_tree"],"solved":false},{"id":"codeforces_526g","judge":"Codeforces","title":"Spiders Evil Plan","url":"https://codeforces.com/contest/526/problem/G","difficulty":2,"starred":true,"topic":"long_path_decomposition","topics":["long_path_decomposition"],"solved":false},{"id":"leetcode_description","judge":"LeetCode","title":"Search in a Binary Search Tree","url":"https://leetcode.com/problems/search-in-a-binary-search-tree/","difficulty":1,"starred":true,"topic":"bst","topics":["bst"],"solved":true},{"id":"leetcode_insert_into_a_binary_search_tree","judge":"LeetCode","title":"Insert into a Binary Search Tree","url":"https://leetcode.com/problems/insert-into-a-binary-search-tree/","difficulty":1,"starred":true,"topic":"bst","topics":["bst"],"solved":false},{"id":"leetcode_delete_node_in_a_bst","judge":"LeetCode","title":"Delete Node in a BST","url":"https://leetcode.com/problems/delete-node-in-a-bst/","difficulty":1,"starred":true,"topic":"bst","topics":["bst"],"solved":false},{"id":"leetcode_number_of_ways_to_reorder_array_to_get_same_bst","judge":"LeetCode","title":"Number of Ways to Reorder Array to Get Same BST","url":"https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst/","difficulty":2,"starred":true,"topic":"bst","topics":["bst"],"solved":false},{"id":"codeforces_797d","judge":"Codeforces","title":"Broken BST","url":"https://codeforces.com/problemset/problem/797/D","difficulty":2,"starred":false,"topic":"bst","topics":["bst"],"solved":false},{"id":"codeforces_1929f","judge":"Codeforces","title":"Sasha and the Wedding Binary Search Tree","url":"https://codeforces.com/problemset/problem/1929/F","difficulty":3,"starred":false,"topic":"bst","topics":["bst"],"solved":false},{"id":"leetcode_recover_binary_search_tree","judge":"LeetCode","title":"Recover Binary Search Tree","url":"https://leetcode.com/problems/recover-binary-search-tree/","difficulty":2,"starred":false,"topic":"bst","topics":["bst"],"solved":false},{"id":"spoj_adaaphid","judge":"SPOJ","title":"Ada and Aphids","url":"https://www.spoj.com/problems/ADAAPHID/","difficulty":1,"starred":true,"topic":"treap","topics":["treap"],"solved":false},{"id":"spoj_count1it","judge":"SPOJ","title":"Ghost Town","url":"https://www.spoj.com/problems/COUNT1IT/","difficulty":1,"starred":false,"topic":"treap","topics":["treap"],"solved":false},{"id":"codeforces_911g","judge":"Codeforces","title":"Mass Change Queries","url":"https://codeforces.com/contest/911/problem/G","difficulty":1,"starred":true,"topic":"treap","topics":["treap","pragmas"],"solved":false},{"id":"codedrills_the_cabins_in_the_woods","judge":"CodeDrills","title":"The Cabins in the Woods","url":"https://codedrills.io/contests/icpc-asia-west-continent-final-contest-2023/problems/the-cabins-in-the-woods","difficulty":2,"starred":true,"topic":"treap","topics":["treap","permutation_cycles"],"solved":false},{"id":"codeforces_809d","judge":"Codeforces","title":"Hitchhiking in the Baltic States","url":"https://codeforces.com/problemset/problem/809/D","difficulty":2,"starred":true,"topic":"treap","topics":["treap"],"solved":false},{"id":"hackerearth_septembereasy_points_and_distances_d30d0e6b","judge":"HackerEarth","title":"Points and distances","url":"https://www.hackerearth.com/problem/algorithm/septembereasy-points-and-distances-d30d0e6b/","difficulty":3,"starred":false,"topic":"treap","topics":["treap"],"solved":false},{"id":"atcoder_abc392_f","judge":"AtCoder","title":"Insert","url":"https://atcoder.jp/contests/abc392/tasks/abc392_f","difficulty":1,"starred":false,"topic":"treap","topics":["treap"],"solved":false},{"id":"yosupo_range_reverse_range_sum","judge":"Library Checker","title":"Range Reverse Range Sum","url":"https://judge.yosupo.jp/problem/range_reverse_range_sum","difficulty":2,"starred":true,"topic":"treap","topics":["treap"],"solved":false},{"id":"infoarena_vaporeon","judge":"Infoarena","title":"Vaporeon","url":"https://www.infoarena.ro/problema/vaporeon","difficulty":4,"starred":false,"topic":"treap","topics":["cartesian_tree","treap"],"solved":false},{"id":"cf_gym_102787a","judge":"CF Gym","title":"Shandom Ruffle","url":"https://codeforces.com/gym/102787/problem/A","difficulty":1,"starred":true,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"cf_gym_102787z","judge":"CF Gym","title":"Trick or Treap","url":"https://codeforces.com/gym/102787/problem/Z","difficulty":1,"starred":true,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"cses_2073","judge":"CSES","title":"Substring Reversals","url":"https://cses.fi/problemset/task/2073","difficulty":1,"starred":true,"topic":"implicit_treap","topics":["implicit_treap","rope"],"solved":false},{"id":"cses_2074","judge":"CSES","title":"Reversals and Sums","url":"https://cses.fi/problemset/task/2074","difficulty":1,"starred":true,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"codeforces_863d","judge":"Codeforces","title":"Yet Another Array Queries Problem","url":"https://codeforces.com/problemset/problem/863/D","difficulty":1,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"spoj_allin1","judge":"SPOJ","title":"All in One","url":"https://www.spoj.com/problems/ALLIN1/","difficulty":1,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"dmoj_noi05p2","judge":"DMOJ","title":"Maintaining a Sequence","url":"https://dmoj.ca/problem/noi05p2","difficulty":2,"starred":true,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"usaco_402","judge":"USACO","title":"Airplane Boarding","url":"https://usaco.org/index.php?page=viewproblem2&cpid=402","difficulty":2,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"csacademy_strings","judge":"CS Academy","title":"Strings","url":"https://csacademy.com/contest/archive/task/strings/statement/","difficulty":2,"starred":true,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"cf_gym_102787c","judge":"CF Gym","title":"Sneetches and Speeches 3","url":"https://codeforces.com/gym/102787/problem/C","difficulty":2,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"codeforces_420d","judge":"Codeforces","title":"Cup Trick","url":"https://codeforces.com/contest/420/problem/D","difficulty":2,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"cf_gym_102787d","judge":"CF Gym","title":"The Grim Treaper","url":"https://codeforces.com/gym/102787/problem/D","difficulty":2,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"spoj_gss6","judge":"SPOJ","title":"Can you answer these queries VI","url":"https://www.spoj.com/problems/GSS6/","difficulty":2,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"codeforces_702f","judge":"Codeforces","title":"T-Shirts","url":"https://codeforces.com/contest/702/problem/F","difficulty":2,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"codechef_palindr","judge":"CodeChef","title":"Lucy and Palindromes","url":"https://www.codechef.com/problems/PALINDR","difficulty":2,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"cses_2072","judge":"CSES","title":"Cut and Paste","url":"https://cses.fi/problemset/task/2072","difficulty":1,"starred":true,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"spoj_gss8","judge":"SPOJ","title":"Can you answer these queries VIII","url":"https://www.spoj.com/problems/GSS8/","difficulty":3,"starred":false,"topic":"implicit_treap","topics":["implicit_treap"],"solved":false},{"id":"uva_12538","judge":"UVa","title":"Version Controlled IDE","url":"https://vjudge.net/problem/UVA-12538","difficulty":1,"starred":true,"topic":"persistent_treap","topics":["persistent_treap"],"solved":false},{"id":"codechef_genetics","judge":"CodeChef","title":"Genetics","url":"https://www.codechef.com/problems/GENETICS","difficulty":null,"starred":false,"topic":"persistent_treap","topics":["persistent_treap"],"solved":false},{"id":"eolymp_2957","judge":"Eolymp","title":"Persistent List","url":"https://www.eolymp.com/en/problems/2957","difficulty":2,"starred":false,"topic":"persistent_treap","topics":["persistent_treap"],"solved":false},{"id":"baekjoon_19068","judge":"Baekjoon","title":"Sequence","url":"https://www.acmicpc.net/problem/19068","difficulty":3,"starred":false,"topic":"persistent_treap","topics":["persistent_treap"],"solved":false},{"id":"baekjoon_14131","judge":"Baekjoon","title":"Okret","url":"https://www.acmicpc.net/problem/14131","difficulty":1,"starred":true,"topic":"rope","topics":["rope"],"solved":false},{"id":"cf_gym_103997a","judge":"CF Gym","title":"SuperMemo","url":"https://codeforces.com/gym/103997/problem/A","difficulty":1,"starred":true,"topic":"splay_tree","topics":["splay_tree"],"solved":false},{"id":"spoj_adalist","judge":"SPOJ","title":"Ada and List","url":"https://www.spoj.com/problems/ADALIST/","difficulty":1,"starred":false,"topic":"splay_tree","topics":["splay_tree"],"solved":false},{"id":"hdu_3487","judge":"HDU","title":"Play with Chain","url":"http://acm.hdu.edu.cn/showproblem.php?pid=3487","difficulty":1,"starred":false,"topic":"splay_tree","topics":["splay_tree"],"solved":false},{"id":"spoj_dynacon1","judge":"SPOJ","title":"Dynamic Tree Connectivity","url":"https://www.spoj.com/problems/DYNACON1/","difficulty":1,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"yosupo_dynamic_tree_vertex_add_path_sum","judge":"Library Checker","title":"Dynamic Tree Vertex Add Path Sum","url":"https://judge.yosupo.jp/problem/dynamic_tree_vertex_add_path_sum","difficulty":1,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"spoj_dynalca","judge":"SPOJ","title":"Dynamic LCA","url":"https://www.spoj.com/problems/DYNALCA/","difficulty":2,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"dmoj_ds5easy","judge":"DMOJ","title":"Dynamic Tree Test (Easy)","url":"https://dmoj.ca/problem/ds5easy","difficulty":2,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"codechef_qtree6","judge":"CodeChef","title":"Query on a tree VI","url":"https://www.codechef.com/problems/QTREE6","difficulty":null,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"dmoj_wac4p7","judge":"DMOJ","title":"Squirrel Cities","url":"https://dmoj.ca/problem/wac4p7","difficulty":2,"starred":false,"topic":"lct","topics":["lct"],"solved":false},{"id":"hackerrank_pwsh_tokens","judge":"HackerRank","title":"Balanced Tokens","url":"https://www.hackerrank.com/contests/pwshpc-online-round/challenges/pwsh-tokens/problem","difficulty":2,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"yosupo_dynamic_tree_vertex_set_path_composite","judge":"Library Checker","title":"Dynamic Tree Vertex Set Path Composite","url":"https://judge.yosupo.jp/problem/dynamic_tree_vertex_set_path_composite","difficulty":2,"starred":false,"topic":"lct","topics":["lct"],"solved":false},{"id":"yosupo_dynamic_tree_vertex_add_subtree_sum","judge":"Library Checker","title":"Dynamic Tree Vertex Add Subtree Sum","url":"https://judge.yosupo.jp/problem/dynamic_tree_vertex_add_subtree_sum","difficulty":2,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"codeforces_1172e","judge":"Codeforces","title":"Nauuo and ODT","url":"https://codeforces.com/contest/1172/problem/E","difficulty":3,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"codeforces_117e","judge":"Codeforces","title":"Tree or not Tree","url":"https://codeforces.com/contest/117/problem/E","difficulty":3,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"codeforces_1344e","judge":"Codeforces","title":"Train Tracks","url":"https://codeforces.com/contest/1344/problem/E","difficulty":3,"starred":false,"topic":"lct","topics":["lct"],"solved":false},{"id":"codeforces_603e","judge":"Codeforces","title":"Pastoral Oddities","url":"https://codeforces.com/contest/603/problem/E","difficulty":3,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"codeforces_1109f","judge":"Codeforces","title":"Sasha and Algorithm of Silence's Sounds","url":"https://codeforces.com/contest/1109/problem/F","difficulty":3,"starred":false,"topic":"lct","topics":["lct"],"solved":false},{"id":"luogu_p4219","judge":"Luogu","title":"大融合","url":"https://www.luogu.com.cn/problem/P4219","difficulty":3,"starred":false,"topic":"lct","topics":["lct"],"solved":false},{"id":"uoj_207","judge":"UOJ","title":"共价大爷游长沙","url":"https://uoj.ac/problem/207","difficulty":3,"starred":true,"topic":"lct","topics":["lct"],"solved":false},{"id":"timus_1553","judge":"Timus","title":"Caves and Tunnels","url":"https://acm.timus.ru/problem.aspx?space=1&num=1553","difficulty":2,"starred":false,"topic":"lct","topics":["lct"],"solved":false},{"id":"codeforces_2097e","judge":"Codeforces","title":"Clearing the Snowdrift","url":"https://codeforces.com/contest/2097/problem/E","difficulty":2,"starred":false,"topic":"lct","topics":["lct"],"solved":false},{"id":"ioi11_elephants","judge":"oj.uz","title":"Dancing Elephants","url":"https://oj.uz/problem/view/IOI11_elephants","difficulty":3,"starred":false,"topic":"lct","topics":["lct"],"solved":false},{"id":"yosupo_dynamic_tree_subtree_add_subtree_sum","judge":"Library Checker","title":"Dynamic Tree Subtree Add Subtree Sum","url":"https://judge.yosupo.jp/problem/dynamic_tree_subtree_add_subtree_sum","difficulty":3,"starred":true,"topic":"ett","topics":["ett","top_tree"],"solved":false},{"id":"codeforces_414e","judge":"Codeforces","title":"Mashmokh's Designed Problem","url":"https://codeforces.com/contest/414/problem/E","difficulty":3,"starred":true,"topic":"ett","topics":["ett"],"solved":false},{"id":"dmoj_ds5","judge":"DMOJ","title":"Dynamic Tree Test","url":"https://dmoj.ca/problem/ds5","difficulty":null,"starred":false,"topic":"top_tree","topics":["top_tree"],"solved":false},{"id":"codeforces_1599i","judge":"Codeforces","title":"Desert","url":"https://codeforces.com/contest/1599/problem/I","difficulty":2,"starred":true,"topic":"link_cut_cactus","topics":["link_cut_cactus"],"solved":false},{"id":"spoj_meanarr","judge":"SPOJ","title":"Mean of array","url":"https://www.spoj.com/problems/MEANARR/","difficulty":1,"starred":true,"topic":"ordered_set","topics":["ordered_set"],"solved":false},{"id":"spoj_koiline","judge":"SPOJ","title":"Line up","url":"https://www.spoj.com/problems/KOILINE/","difficulty":1,"starred":true,"topic":"ordered_set","topics":["ordered_set"],"solved":false},{"id":"codeforces_762e","judge":"Codeforces","title":"Radio stations","url":"https://codeforces.com/contest/762/problem/E","difficulty":2,"starred":true,"topic":"ordered_set","topics":["ordered_set"],"solved":false},{"id":"cf_gym_100861d","judge":"CF Gym","title":"Database Query Engine","url":"https://codeforces.com/gym/100861/problem/D","difficulty":2,"starred":false,"topic":"ordered_set","topics":["ordered_set"],"solved":false},{"id":"cf_gym_104308i","judge":"CF Gym","title":"Colorful Queries","url":"https://codeforces.com/gym/104308/problem/I","difficulty":1,"starred":false,"topic":"ordered_set","topics":["ordered_set"],"solved":false},{"id":"codeforces_1915f","judge":"Codeforces","title":"Greetings","url":"https://codeforces.com/problemset/problem/1915/F","difficulty":1,"starred":false,"topic":"ordered_set","topics":["inversions","ordered_set"],"solved":false},{"id":"codeforces_1324d","judge":"Codeforces","title":"Pair of Topics","url":"https://vjudge.net/problem/CodeForces-1324D","difficulty":1,"starred":true,"topic":"ordered_set","topics":["ordered_set"],"solved":true},{"id":"codeforces_1042d","judge":"Codeforces","title":"Petya and Array","url":"https://codeforces.com/contest/1042/problem/D","difficulty":1,"starred":false,"topic":"ordered_set","topics":["ordered_set"],"solved":false},{"id":"codeforces_264c","judge":"Codeforces","title":"Choosing Balls","url":"https://codeforces.com/contest/264/problem/C","difficulty":2,"starred":true,"topic":"gp_hash_table","topics":["gp_hash_table"],"solved":false},{"id":"codeforces_505c","judge":"Codeforces","title":"Mr. Kitayuta, the Treasure Hunter","url":"https://codeforces.com/contest/505/problem/C","difficulty":2,"starred":false,"topic":"gp_hash_table","topics":["gp_hash_table"],"solved":false},{"id":"cf_gym_101808b","judge":"CF Gym","title":"Amer and Graphs","url":"https://codeforces.com/gym/101808/problem/B","difficulty":2,"starred":false,"topic":"gp_hash_table","topics":["multiset_hashing","gp_hash_table"],"solved":false},{"id":"yosupo_cartesian_tree","judge":"Library Checker","title":"Cartesian Tree","url":"https://judge.yosupo.jp/problem/cartesian_tree","difficulty":1,"starred":true,"topic":"cartesian_tree","topics":["cartesian_tree"],"solved":false},{"id":"codeforces_1748e","judge":"Codeforces","title":"Yet Another Array Counting Problem","url":"https://codeforces.com/contest/1748/problem/E","difficulty":1,"starred":true,"topic":"cartesian_tree","topics":["cartesian_tree"],"solved":false},{"id":"ceoi20_fancyfence","judge":"oj.uz","title":"Fancy Fence","url":"https://oj.uz/problem/view/CEOI20_fancyfence","difficulty":2,"starred":false,"topic":"cartesian_tree","topics":["cartesian_tree"],"solved":false},{"id":"codeforces_1290e","judge":"Codeforces","title":"Cartesian Tree","url":"https://codeforces.com/problemset/problem/1290/E","difficulty":null,"starred":false,"topic":"cartesian_tree","topics":["cartesian_tree"],"solved":false},{"id":"codeforces_2048f","judge":"Codeforces","title":"Kevin and Math Class","url":"https://codeforces.com/contest/2048/problem/F","difficulty":2,"starred":false,"topic":"cartesian_tree","topics":["cartesian_tree"],"solved":false},{"id":"codeforces_1580d","judge":"Codeforces","title":"Subsequence","url":"https://codeforces.com/problemset/problem/1580/D","difficulty":3,"starred":false,"topic":"cartesian_tree","topics":["cartesian_tree"],"solved":false},{"id":"toph_remember_the_name","judge":"Toph","title":"Remember the Name...","url":"https://toph.co/p/remember-the-name","difficulty":1,"starred":true,"topic":"kd_tree","topics":["kd_tree"],"solved":false},{"id":"spoj_gannhat","judge":"SPOJ","title":"Closest distance","url":"https://www.spoj.com/problems/GANNHAT/","difficulty":1,"starred":true,"topic":"kd_tree","topics":["kd_tree"],"solved":false},{"id":"cses_1649","judge":"CSES","title":"Dynamic Range Minimum Queries","url":"https://cses.fi/problemset/task/1649","difficulty":1,"starred":true,"topic":"sqrt_tree","topics":["sqrt_tree"],"solved":false},{"id":"cf_gym_101620i","judge":"CF Gym","title":"Intrinsic Interval","url":"https://codeforces.com/gym/101620/problem/I","difficulty":2,"starred":true,"topic":"permutation_tree","topics":["permutation_tree"],"solved":false},{"id":"codeforces_526f","judge":"Codeforces","title":"Pudding Monsters","url":"https://codeforces.com/contest/526/problem/F","difficulty":2,"starred":true,"topic":"permutation_tree","topics":["permutation_tree","all_subarray_maximum_minimum"],"solved":false},{"id":"codechef_armyofme","judge":"CodeChef","title":"Army of Me","url":"https://www.codechef.com/problems/ARMYOFME","difficulty":3,"starred":true,"topic":"permutation_tree","topics":["permutation_tree"],"solved":false},{"id":"codechef_goodsegs","judge":"CodeChef","title":"Good Subsequences","url":"https://www.codechef.com/MARCH20A/problems/GOODSEGS","difficulty":3,"starred":false,"topic":"permutation_tree","topics":["permutation_tree"],"solved":false},{"id":"codeforces_1205f","judge":"Codeforces","title":"Beauty of a Permutation","url":"https://codeforces.com/contest/1205/problem/F","difficulty":3,"starred":false,"topic":"permutation_tree","topics":["permutation_tree"],"solved":false},{"id":"yosupo_common_interval_decomposition_tree","judge":"Library Checker","title":"Common Interval Decomposition Tree","url":"https://judge.yosupo.jp/problem/common_interval_decomposition_tree","difficulty":1,"starred":true,"topic":"permutation_tree","topics":["permutation_tree"],"solved":false},{"id":"codeforces_1552i","judge":"Codeforces","title":"Organizing a Music Festival","url":"https://codeforces.com/contest/1552/problem/I","difficulty":3,"starred":true,"topic":"pq_tree","topics":["pq_tree"],"solved":false},{"id":"codeforces_243e","judge":"Codeforces","title":"Matrix","url":"https://codeforces.com/contest/243/problem/E","difficulty":3,"starred":false,"topic":"pq_tree","topics":["pq_tree"],"solved":false},{"id":"cf_gym_101726g","judge":"CF Gym","title":"Classroom Scheduling","url":"https://codeforces.com/gym/101726/problem/G","difficulty":3,"starred":false,"topic":"pq_tree","topics":["pq_tree"],"solved":false},{"id":"cf_gym_100551a","judge":"CF Gym","title":"Connect and Disconnect","url":"https://codeforces.com/gym/100551/problem/A","difficulty":1,"starred":true,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"cses_2133","judge":"CSES","title":"Dynamic Connectivity","url":"https://cses.fi/problemset/task/2133","difficulty":1,"starred":false,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"codeforces_981e","judge":"Codeforces","title":"Addition on Segments","url":"https://codeforces.com/contest/981/problem/E","difficulty":1,"starred":false,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"codeforces_1140f","judge":"Codeforces","title":"Extending Set of Points","url":"https://codeforces.com/contest/1140/problem/F","difficulty":1,"starred":true,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"cf_gym_100551e","judge":"CF Gym","title":"Disconnected Graph","url":"https://codeforces.com/gym/100551/problem/E","difficulty":1,"starred":false,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"yosupo_dynamic_graph_vertex_add_component_sum","judge":"Library Checker","title":"Dynamic Graph Vertex Add Component Sum","url":"https://judge.yosupo.jp/problem/dynamic_graph_vertex_add_component_sum","difficulty":1,"starred":true,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem","online_dynamic_connectivity_problem"],"solved":false},{"id":"codeforces_1386c","judge":"Codeforces","title":"Joker","url":"https://codeforces.com/contest/1386/problem/C","difficulty":2,"starred":true,"topic":"dynamic_connectivity_problem","topics":["queue_undo_trick","dynamic_connectivity_problem","priority_queue_undo_trick"],"solved":false},{"id":"codeforces_601e","judge":"Codeforces","title":"A Museum Robbery","url":"https://codeforces.com/contest/601/problem/E","difficulty":null,"starred":true,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"codeforces_813f","judge":"Codeforces","title":"Bipartite Checking","url":"https://codeforces.com/contest/813/problem/F","difficulty":2,"starred":false,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"codeforces_2069f","judge":"Codeforces","title":"Graph Inclusion","url":"https://codeforces.com/contest/2069/problem/F","difficulty":2,"starred":false,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"codeforces_2104g","judge":"Codeforces","title":"Modulo 3","url":"https://codeforces.com/contest/2104/problem/G","difficulty":2,"starred":true,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"codechef_p8169","judge":"CodeChef","title":"Tree Queries","url":"https://www.codechef.com/problems/P8169","difficulty":2,"starred":false,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"cf_gym_105789f","judge":"CF Gym","title":"Festival Signs","url":"https://codeforces.com/gym/105789/problem/F","difficulty":3,"starred":false,"topic":"dynamic_connectivity_problem","topics":["dynamic_connectivity_problem"],"solved":false},{"id":"codeforces_1217f","judge":"Codeforces","title":"Forced Online Queries Problem","url":"https://codeforces.com/contest/1217/problem/F","difficulty":1,"starred":true,"topic":"online_dynamic_connectivity_problem","topics":["online_dynamic_connectivity_problem"],"solved":false},{"id":"leetcode_next_greater_element_i","judge":"LeetCode","title":"Next Greater Element I","url":"https://leetcode.com/problems/next-greater-element-i/","difficulty":1,"starred":true,"topic":"all_subarray_maximum_minimum","topics":["monotonous_queue","all_subarray_maximum_minimum"],"solved":false},{"id":"atcoder_agc005_b","judge":"AtCoder","title":"Minimum Sum","url":"https://atcoder.jp/contests/agc005/tasks/agc005_b","difficulty":1,"starred":true,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"leetcode_sum_of_subarray_minimums","judge":"LeetCode","title":"Sum of Subarray Minimums","url":"https://leetcode.com/problems/sum-of-subarray-minimums/","difficulty":1,"starred":true,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"codeforces_817d","judge":"Codeforces","title":"Imbalanced Array","url":"https://codeforces.com/problemset/problem/817/D","difficulty":1,"starred":false,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum","contribution_technique"],"solved":false},{"id":"spoj_diferenc","judge":"SPOJ","title":"DIFERENCIJA","url":"https://www.spoj.com/problems/DIFERENC/","difficulty":1,"starred":true,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"codeforces_547b","judge":"Codeforces","title":"Mike and Feet","url":"https://codeforces.com/problemset/problem/547/B","difficulty":1,"starred":true,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"gym_104120i","judge":"CF Gym","title":"Ivan And Mega Queries","url":"https://vjudge.net/problem/Gym-104120I","difficulty":2,"starred":true,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"codeforces_602d","judge":"Codeforces","title":"Lipshitz Sequence","url":"https://codeforces.com/contest/602/problem/D","difficulty":2,"starred":false,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"codechef_mtmxsum","judge":"CodeChef","title":"Matrix Maximum Sum","url":"https://www.codechef.com/FEB16/problems/MTMXSUM/","difficulty":2,"starred":false,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"codeforces_1483c","judge":"Codeforces","title":"Skyline Photo","url":"https://codeforces.com/contest/1483/problem/C","difficulty":2,"starred":true,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"csacademy_min_max_sum","judge":"CS Academy","title":"Min Max Sum","url":"https://csacademy.com/contest/round-35/task/min-max-sum/statement/","difficulty":3,"starred":true,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"dmoj_coci14c2p6","judge":"DMOJ","title":"Norma","url":"https://dmoj.ca/problem/coci14c2p6","difficulty":3,"starred":true,"topic":"all_subarray_maximum_minimum","topics":["all_subarray_maximum_minimum"],"solved":false},{"id":"leetcode_largest_rectangle_in_histogram","judge":"LeetCode","title":"Largest Rectangle in Histogram","url":"https://leetcode.com/problems/largest-rectangle-in-histogram/","difficulty":1,"starred":true,"topic":"monotonous_queue","topics":["monotonous_queue"],"solved":false},{"id":"codeforces_488d","judge":"Codeforces","title":"Strip","url":"https://codeforces.com/contest/488/problem/D","difficulty":2,"starred":false,"topic":"monotonous_queue","topics":["monotonous_queue","dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_1077f2","judge":"Codeforces","title":"Pictures with Kittens (hard version)","url":"https://codeforces.com/contest/1077/problem/F2","difficulty":3,"starred":false,"topic":"monotonous_queue","topics":["monotonous_queue","dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_846d","judge":"Codeforces","title":"Monitor","url":"https://codeforces.com/contest/846/problem/D","difficulty":null,"starred":true,"topic":"monotonous_queue_2d","topics":["monotonous_queue_2d"],"solved":false},{"id":"wcipeg_ioi0612","judge":"PEG","title":"Pyramid","url":"https://wcipeg.com/problem/ioi0612","difficulty":2,"starred":false,"topic":"monotonous_queue_2d","topics":["monotonous_queue_2d"],"solved":false},{"id":"atcoder_abc228_f","judge":"AtCoder","title":"Stamp Game","url":"https://atcoder.jp/contests/abc228/tasks/abc228_f","difficulty":2,"starred":false,"topic":"monotonous_queue_2d","topics":["monotonous_queue_2d"],"solved":false},{"id":"codeforces_1195e","judge":"Codeforces","title":"OpenStreetMap","url":"https://codeforces.com/problemset/problem/1195/E","difficulty":2,"starred":false,"topic":"monotonous_queue_2d","topics":["monotonous_queue_2d"],"solved":false},{"id":"qoj_149","judge":"QOJ","title":"Peru","url":"https://qoj.ac/contest/168/problem/149","difficulty":1,"starred":true,"topic":"monotonic_deque","topics":["monotonic_deque"],"solved":false},{"id":"cses_3405","judge":"CSES","title":"Sliding Window Or","url":"https://cses.fi/problemset/task/3405/","difficulty":1,"starred":false,"topic":"monotonic_deque","topics":["monotonic_deque"],"solved":false},{"id":"codeforces_2026f","judge":"Codeforces","title":"Bermart Ice Cream","url":"https://codeforces.com/contest/2026/problem/F","difficulty":3,"starred":false,"topic":"monotonic_deque","topics":["monotonic_deque"],"solved":false},{"id":"cf_gym_101889d","judge":"CF Gym","title":"Daunting Device","url":"https://codeforces.com/gym/101889/problem/D","difficulty":1,"starred":true,"topic":"interval_set","topics":["interval_set"],"solved":false},{"id":"codechef_tricount2","judge":"CodeChef","title":"Triangle Count (Hard)","url":"https://www.codechef.com/problems/TRICOUNT2","difficulty":1,"starred":true,"topic":"interval_set","topics":["interval_set"],"solved":false},{"id":"yosupo_persistent_queue","judge":"Library Checker","title":"Persistent Queue","url":"https://judge.yosupo.jp/problem/persistent_queue","difficulty":1,"starred":true,"topic":"persistent_array","topics":["persistent_array","persistent_queue"],"solved":false},{"id":"cf_gym_100431g","judge":"CF Gym","title":"Persistent Queue ASC 37","url":"https://codeforces.com/gym/100431/problem/G","difficulty":1,"starred":false,"topic":"persistent_queue","topics":["persistent_queue"],"solved":false},{"id":"yosupo_k_shortest_walk","judge":"Library Checker","title":"K-th Shortest Walk","url":"https://judge.yosupo.jp/problem/k_shortest_walk","difficulty":4,"starred":true,"topic":"persistent_heap","topics":["persistent_heap","eppsteins_algorithm"],"solved":false},{"id":"codeforces_893d","judge":"Codeforces","title":"Credit Card","url":"https://codeforces.com/contest/893/problem/D","difficulty":2,"starred":false,"topic":"venice_technique","topics":["venice_technique"],"solved":false},{"id":"atcoder_abc212_d","judge":"AtCoder","title":"Querying Multiset","url":"https://vjudge.net/problem/AtCoder-abc212_d","difficulty":1,"starred":true,"topic":"venice_technique","topics":["venice_technique"],"solved":false},{"id":"gym_105593p","judge":"CF Gym","title":"PELODE","url":"https://vjudge.net/problem/Gym-105593P","difficulty":2,"starred":true,"topic":"venice_technique","topics":["venice_technique"],"solved":false},{"id":"spoj_bdoi16e","judge":"SPOJ","title":"Village Fair","url":"https://www.spoj.com/problems/BDOI16E/","difficulty":3,"starred":false,"topic":"venice_technique","topics":["venice_technique"],"solved":false},{"id":"codeforces_522d","judge":"Codeforces","title":"Closest Equals","url":"https://codeforces.com/problemset/problem/522/D","difficulty":2,"starred":false,"topic":"offline_queries","topics":["offline_queries"],"solved":false},{"id":"codechef_minxorseg","judge":"CodeChef","title":"Minimum Xor On Segment","url":"https://www.codechef.com/LTIME109A/problems/MINXORSEG","difficulty":3,"starred":false,"topic":"offline_queries","topics":["offline_queries"],"solved":false},{"id":"toph_prime_divisor_on_tree_path","judge":"Toph","title":"Prime Divisor on Tree Path","url":"https://toph.co/p/prime-divisor-on-tree-path","difficulty":3,"starred":true,"topic":"offline_queries","topics":["offline_queries"],"solved":false},{"id":"codeforces_959f","judge":"Codeforces","title":"Mahmoud and Ehab and yet another xor task","url":"https://codeforces.com/contest/959/problem/F","difficulty":2,"starred":true,"topic":"offline_queries","topics":["basis_vector","offline_queries"],"solved":false},{"id":"cses_2085","judge":"CSES","title":"Monster Game II","url":"https://cses.fi/problemset/task/2085","difficulty":2,"starred":true,"topic":"static_to_dynamic_trick","topics":["static_to_dynamic_trick"],"solved":false},{"id":"codeforces_710f","judge":"Codeforces","title":"String Set Queries","url":"https://codeforces.com/contest/710/problem/F","difficulty":2,"starred":true,"topic":"static_to_dynamic_trick","topics":["static_to_dynamic_trick","dynamic_aho_corasick"],"solved":false},{"id":"joi14_secret","judge":"oj.uz","title":"Secret","url":"https://oj.uz/problem/view/JOI14_secret","difficulty":2,"starred":true,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries"],"solved":false},{"id":"boi17_toll","judge":"oj.uz","title":"Toll","url":"https://oj.uz/problem/view/BOI17_toll","difficulty":2,"starred":false,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries"],"solved":false},{"id":"dmoj_dmopc19c7p4","judge":"DMOJ","title":"Bob and Continued Fractions","url":"https://dmoj.ca/problem/dmopc19c7p4","difficulty":2,"starred":true,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries"],"solved":false},{"id":"codebreaker_supperbox","judge":"Codebreaker","title":"Estelle’s Supper Box","url":"https://codebreaker.xyz/problem/supperbox","difficulty":2,"starred":false,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries"],"solved":false},{"id":"codeforces_1100f","judge":"Codeforces","title":"Ivan and Burgers","url":"https://codeforces.com/problemset/problem/1100/F","difficulty":2,"starred":true,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries","basis_vector","basis_vector_ft_lexicographically_largest_basis"],"solved":false},{"id":"cf_gym_101741j","judge":"CF Gym","title":"Subsequence Sum Queries","url":"https://codeforces.com/gym/101741/problem/J","difficulty":null,"starred":true,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries"],"solved":false},{"id":"usaco_997","judge":"USACO","title":"Non-Decreasing Subsequences","url":"https://usaco.org/index.php?page=viewproblem2&cpid=997","difficulty":null,"starred":true,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries"],"solved":false},{"id":"vnoi_mofkcup_r1_e","judge":"Vnoi","title":"XORSHIFT","url":"https://oj.vnoi.info/problem/mofkcup_r1_e","difficulty":2,"starred":false,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries"],"solved":false},{"id":"cf_gym_101991g","judge":"CF Gym","title":"Greatest Chicken Dish","url":"https://codeforces.com/gym/101991/problem/G","difficulty":3,"starred":true,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries"],"solved":false},{"id":"codeforces_232e","judge":"Codeforces","title":"Quick Tortoise","url":"https://codeforces.com/contest/232/problem/E","difficulty":3,"starred":true,"topic":"divide_and_conquer_on_queries","topics":["divide_and_conquer_on_queries"],"solved":false},{"id":"spoj_lis2","judge":"SPOJ","title":"Another Longest Increasing Subsequence Problem","url":"https://www.spoj.com/problems/LIS2/","difficulty":1,"starred":true,"topic":"cdq_divide_and_conquer","topics":["cdq_divide_and_conquer"],"solved":false},{"id":"zerojudge_c571","judge":"ZeroJudge","title":"三維偏序問題","url":"https://zerojudge.tw/ShowProblem?problemid=c571","difficulty":2,"starred":false,"topic":"cdq_divide_and_conquer","topics":["cdq_divide_and_conquer"],"solved":false},{"id":"codeforces_19e","judge":"Codeforces","title":"Fairy","url":"https://codeforces.com/contest/19/problem/E","difficulty":2,"starred":true,"topic":"queue_undo_trick","topics":["queue_undo_trick","dfs_tree"],"solved":false},{"id":"codeforces_1442d","judge":"Codeforces","title":"Sum","url":"https://codeforces.com/contest/1442/problem/D","difficulty":2,"starred":false,"topic":"queue_undo_trick","topics":["queue_undo_trick","min_plus_convolution_convex_and_arbitrary"],"solved":false},{"id":"codeforces_603e_copy","judge":"Codeforces","title":"Pastoral Oddities (Copy)","url":"https://codeforces.com/contest/603/problem/E","difficulty":3,"starred":false,"topic":"priority_queue_undo_trick","topics":["priority_queue_undo_trick"],"solved":false},{"id":"cses_1666","judge":"CSES","title":"Building Roads","url":"https://cses.fi/problemset/task/1666","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":true},{"id":"cses_1674","judge":"CSES","title":"Subordinates","url":"https://cses.fi/problemset/task/1674","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":true},{"id":"codeforces_580c","judge":"Codeforces","title":"Kefa and Park","url":"https://codeforces.com/problemset/problem/580/C","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":true},{"id":"codeforces_727a","judge":"Codeforces","title":"Transformation: from A to B","url":"https://codeforces.com/contest/727/problem/A","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":true},{"id":"codeforces_24a","judge":"Codeforces","title":"Ring road","url":"https://codeforces.com/contest/24/problem/A","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":true},{"id":"codeforces_802j1","judge":"Codeforces","title":"Send the Fool Further! (easy)","url":"https://codeforces.com/problemset/problem/802/J1","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":true},{"id":"usaco_944","judge":"USACO","title":"Fence Planning","url":"https://usaco.org/index.php?page=viewproblem2&cpid=944","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_29c","judge":"Codeforces","title":"Mail Stamps","url":"https://codeforces.com/contest/29/problem/C","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"cses_1192","judge":"CSES","title":"Counting Rooms","url":"https://cses.fi/problemset/task/1192","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs","direction_array"],"solved":true},{"id":"usaco_644","judge":"USACO","title":"Closing the Farm","url":"https://usaco.org/index.php?page=viewproblem2&cpid=644","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_813c","judge":"Codeforces","title":"The Tag Game","url":"https://codeforces.com/contest/813/problem/C","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"cses_1668","judge":"CSES","title":"Building Teams","url":"https://cses.fi/problemset/task/1668","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":true},{"id":"spoj_buglife","judge":"SPOJ","title":"A Bug’s Life","url":"https://www.spoj.com/problems/BUGLIFE/","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":true},{"id":"codeforces_862b","judge":"Codeforces","title":"Mahmoud and Ehab and the bipartiteness","url":"https://codeforces.com/contest/862/problem/B","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs"],"solved":true},{"id":"codeforces_378c","judge":"Codeforces","title":"Maze","url":"https://codeforces.com/contest/378/problem/C","difficulty":1,"starred":true,"topic":"dfs","topics":["bfs","dfs","direction_array"],"solved":true},{"id":"codeforces_540c","judge":"Codeforces","title":"Ice Cave","url":"https://codeforces.com/contest/540/problem/C","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs","direction_array","bfs"],"solved":false},{"id":"spoj_adasea","judge":"SPOJ","title":"Ada and Island","url":"https://www.spoj.com/problems/ADASEA/","difficulty":2,"starred":true,"topic":"dfs","topics":["dfs","probabilities_and_expected_values"],"solved":false},{"id":"spoj_koze","judge":"SPOJ","title":"Sheep","url":"https://www.spoj.com/problems/KOZE/","difficulty":2,"starred":true,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_638c","judge":"Codeforces","title":"Road Improvement","url":"https://codeforces.com/contest/638/problem/C","difficulty":2,"starred":true,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_767c","judge":"Codeforces","title":"Garland","url":"https://codeforces.com/contest/767/problem/C","difficulty":2,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_794d","judge":"Codeforces","title":"Labelling Cities","url":"https://codeforces.com/contest/794/problem/D","difficulty":2,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_841d","judge":"Codeforces","title":"Leha and another game about graph","url":"https://codeforces.com/contest/841/problem/D","difficulty":2,"starred":true,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_29d","judge":"Codeforces","title":"Ant on the Tree","url":"https://codeforces.com/contest/29/problem/D","difficulty":2,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_1833e","judge":"Codeforces","title":"Round Dance","url":"https://codeforces.com/contest/1833/problem/E","difficulty":2,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_1144f","judge":"Codeforces","title":"Graph Without Long Directed Paths","url":"https://codeforces.com/contest/1144/problem/F","difficulty":2,"starred":true,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_1176e","judge":"Codeforces","title":"Cover it!","url":"https://codeforces.com/problemset/problem/1176/E","difficulty":2,"starred":true,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_1093d","judge":"Codeforces","title":"Beautiful Graph","url":"https://codeforces.com/contest/1093/problem/D","difficulty":2,"starred":true,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_977e","judge":"Codeforces","title":"Cyclic Components","url":"https://codeforces.com/contest/977/problem/E","difficulty":2,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_761e","judge":"Codeforces","title":"Dasha and Puzzle","url":"https://codeforces.com/contest/761/problem/E","difficulty":3,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_844e","judge":"Codeforces","title":"Upgrading Tree","url":"https://codeforces.com/contest/844/problem/E","difficulty":3,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_709e","judge":"Codeforces","title":"Centroids","url":"https://codeforces.com/contest/709/problem/E","difficulty":3,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_1805d","judge":"Codeforces","title":"A Wide, Wide Graph","url":"https://codeforces.com/contest/1805/problem/D","difficulty":1,"starred":true,"topic":"dfs","topics":["dfs","tree_diameter"],"solved":false},{"id":"codeforces_982c","judge":"Codeforces","title":"Cut 'em all!","url":"https://codeforces.com/contest/982/problem/C","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_1139c","judge":"Codeforces","title":"Edgy Trees","url":"https://codeforces.com/problemset/problem/1139/C","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_2114e","judge":"Codeforces","title":"Kirei Attacks the Estate","url":"https://codeforces.com/problemset/problem/2114/E","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_1106d","judge":"Codeforces","title":"Lunar New Year and a Wander","url":"https://codeforces.com/problemset/problem/1106/D","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_1985h1","judge":"Codeforces","title":"Maximize the Largest Component (Easy Version)","url":"https://codeforces.com/contest/1985/problem/H1","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_755c","judge":"Codeforces","title":"PolandBall and Forest","url":"https://codeforces.com/contest/755/problem/C","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"codeforces_2034c","judge":"Codeforces","title":"Trapped in the Witch's Labyrinth","url":"https://codeforces.com/problemset/problem/2034/C","difficulty":1,"starred":false,"topic":"dfs","topics":["dfs"],"solved":false},{"id":"cses_1667","judge":"CSES","title":"Message Route","url":"https://cses.fi/problemset/task/1667","difficulty":1,"starred":true,"topic":"bfs","topics":["bfs"],"solved":true},{"id":"codeforces_242c","judge":"Codeforces","title":"King's Path","url":"https://codeforces.com/contest/242/problem/C","difficulty":1,"starred":true,"topic":"bfs","topics":["bfs","direction_array"],"solved":false},{"id":"spoj_nakanj","judge":"SPOJ","title":"Minimum Knight moves !!!","url":"https://www.spoj.com/problems/NAKANJ/","difficulty":1,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"cses_1193","judge":"CSES","title":"Labyrinth","url":"https://cses.fi/problemset/task/1193","difficulty":1,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_769c","judge":"Codeforces","title":"Cycle In Maze","url":"https://codeforces.com/contest/769/problem/C","difficulty":1,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"spoj_adacycle","judge":"SPOJ","title":"Ada and Cycle","url":"https://www.spoj.com/problems/ADACYCLE/","difficulty":1,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"spoj_digokeys","judge":"SPOJ","title":"Find the Treasure","url":"https://www.spoj.com/problems/DIGOKEYS/","difficulty":1,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"uva_336","judge":"UVa","title":"A Node Too Far","url":"https://vjudge.net/problem/UVA-336","difficulty":1,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"uva_429","judge":"UVa","title":"Word Transformation","url":"https://vjudge.net/problem/UVA-429","difficulty":1,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"uva_439","judge":"UVa","title":"Knight Moves","url":"https://vjudge.net/problem/UVA-439","difficulty":1,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_796d","judge":"Codeforces","title":"Police Stations","url":"https://codeforces.com/contest/796/problem/D","difficulty":null,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_1037d","judge":"Codeforces","title":"Valid BFS?","url":"https://codeforces.com/contest/1037/problem/D","difficulty":2,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_1651d","judge":"Codeforces","title":"Nearest Excluded Points","url":"https://codeforces.com/contest/1651/problem/D","difficulty":2,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_35c","judge":"Codeforces","title":"Fire Again","url":"https://codeforces.com/contest/35/problem/C","difficulty":2,"starred":true,"topic":"bfs","topics":["bfs"],"solved":true},{"id":"codeforces_59e","judge":"Codeforces","title":"Shortest Path","url":"https://codeforces.com/problemset/problem/59/E","difficulty":2,"starred":false,"topic":"bfs","topics":["bfs","dijkstras_algorithm"],"solved":false},{"id":"cses_1194","judge":"CSES","title":"Monsters","url":"https://cses.fi/problemset/task/1194","difficulty":2,"starred":true,"topic":"bfs","topics":["bfs"],"solved":true},{"id":"spoj_multii","judge":"SPOJ","title":"Yet Another Multiple Problem","url":"https://www.spoj.com/problems/MULTII/","difficulty":2,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"uva_10653","judge":"UVa","title":"Bombs! NO they are Mines!!","url":"https://vjudge.net/problem/UVA-10653","difficulty":2,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_1407e","judge":"Codeforces","title":"Egor in the Republic of Dagestan","url":"https://codeforces.com/problemset/problem/1407/E","difficulty":3,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"csacademy_bfs_dfs","judge":"CS Academy","title":"BFS-DFS","url":"https://csacademy.com/contest/archive/task/bfs-dfs/statement/","difficulty":1,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"atcoder_abc269_d","judge":"AtCoder","title":"Do use hexagon grid","url":"https://atcoder.jp/contests/abc269/tasks/abc269_d","difficulty":1,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_1661b","judge":"Codeforces","title":"Getting Zero","url":"https://codeforces.com/problemset/problem/1661/B","difficulty":1,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_1941d","judge":"Codeforces","title":"Rudolf and the Ball Game","url":"https://codeforces.com/contest/1941/problem/D","difficulty":1,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_1593e","judge":"Codeforces","title":"Gardener and Tree","url":"https://codeforces.com/problemset/problem/1593/E","difficulty":2,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"cses_1707","judge":"CSES","title":"Graph Girth","url":"https://cses.fi/problemset/task/1707","difficulty":2,"starred":true,"topic":"bfs","topics":["bfs","cycle_detection"],"solved":false},{"id":"codeforces_1272e","judge":"Codeforces","title":"Nearest Opposite Parity","url":"https://codeforces.com/contest/1272/problem/E","difficulty":2,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"atcoder_arc084_b","judge":"AtCoder","title":"Small Multiple","url":"https://atcoder.jp/contests/arc084/tasks/arc084_b","difficulty":2,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"cses_1670","judge":"CSES","title":"Swap Game","url":"https://cses.fi/problemset/task/1670/","difficulty":2,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_520b","judge":"Codeforces","title":"Two Buttons","url":"https://codeforces.com/problemset/problem/520/B","difficulty":2,"starred":false,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"atcoder_abc197_f","judge":"AtCoder","title":"Construct a Palindrome","url":"https://atcoder.jp/contests/abc197/tasks/abc197_f","difficulty":3,"starred":true,"topic":"bfs","topics":["bfs"],"solved":false},{"id":"codeforces_118e","judge":"Codeforces","title":"Bertown roads","url":"https://codeforces.com/contest/118/problem/E","difficulty":1,"starred":true,"topic":"dfs_tree","topics":["dfs_tree"],"solved":false},{"id":"spoj_cac","judge":"SPOJ","title":"Cactus","url":"https://www.spoj.com/problems/CAC/","difficulty":1,"starred":true,"topic":"dfs_tree","topics":["dfs_tree","cactus_graph"],"solved":false},{"id":"codeforces_861f","judge":"Codeforces","title":"Wizard's Tour","url":"https://codeforces.com/contest/861/problem/F","difficulty":2,"starred":false,"topic":"dfs_tree","topics":["dfs_tree"],"solved":false},{"id":"codeforces_231e","judge":"Codeforces","title":"Cactus","url":"https://codeforces.com/contest/231/problem/E","difficulty":2,"starred":true,"topic":"dfs_tree","topics":["dfs_tree","cactus_graph"],"solved":false},{"id":"codeforces_1391e","judge":"Codeforces","title":"Pairs of Pairs","url":"https://codeforces.com/contest/1391/problem/E","difficulty":2,"starred":true,"topic":"dfs_tree","topics":["dfs_tree"],"solved":false},{"id":"codeforces_412d","judge":"Codeforces","title":"Giving Awards","url":"https://codeforces.com/contest/412/problem/D","difficulty":2,"starred":false,"topic":"dfs_tree","topics":["dfs_tree"],"solved":false},{"id":"cf_gym_101612g","judge":"CF Gym","title":"Grand Test","url":"https://codeforces.com/gym/101612/problem/G","difficulty":2,"starred":false,"topic":"dfs_tree","topics":["dfs_tree"],"solved":false},{"id":"ceoi17_oneway","judge":"oj.uz","title":"One-Way Streets","url":"https://oj.uz/problem/view/CEOI17_oneway","difficulty":1,"starred":false,"topic":"dfs_tree","topics":["dfs_tree","articulation_bridges_and_bridge_tree"],"solved":false},{"id":"codeforces_1364d","judge":"Codeforces","title":"Ehab's Last Corollary","url":"https://codeforces.com/contest/1364/problem/D","difficulty":2,"starred":false,"topic":"dfs_tree","topics":["dfs_tree"],"solved":false},{"id":"codeforces_1277e","judge":"Codeforces","title":"Two Fairs","url":"https://codeforces.com/contest/1277/problem/E","difficulty":2,"starred":false,"topic":"dfs_tree","topics":["dfs_tree"],"solved":false},{"id":"codeforces_1325f","judge":"Codeforces","title":"Ehab's Last Theorem","url":"https://codeforces.com/problemset/problem/1325/F","difficulty":2,"starred":true,"topic":"dfs_tree","topics":["dfs_tree"],"solved":false},{"id":"codeforces_732f","judge":"Codeforces","title":"Tourist Reform","url":"https://codeforces.com/contest/732/problem/F","difficulty":2,"starred":true,"topic":"dfs_tree","topics":["dfs_tree","articulation_bridges_and_bridge_tree"],"solved":false},{"id":"codeforces_962f","judge":"Codeforces","title":"Simple Cycles Edges","url":"https://codeforces.com/contest/962/problem/F","difficulty":3,"starred":true,"topic":"dfs_tree","topics":["dfs_tree"],"solved":false},{"id":"cses_2177","judge":"CSES","title":"Strongly Connected Edges","url":"https://cses.fi/problemset/task/2177","difficulty":1,"starred":true,"topic":"dfs_tree","topics":["strong_orientation","dfs_tree"],"solved":false},{"id":"cses_1679","judge":"CSES","title":"Course Schedule","url":"https://cses.fi/problemset/task/1679","difficulty":1,"starred":true,"topic":"topological_sorting","topics":["topological_sorting"],"solved":true},{"id":"spoj_toposort","judge":"SPOJ","title":"Topological Sorting","url":"https://www.spoj.com/problems/TOPOSORT/","difficulty":1,"starred":true,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"uva_10305","judge":"UVa","title":"Ordering Tasks","url":"https://vjudge.net/problem/UVA-10305","difficulty":1,"starred":false,"topic":"topological_sorting","topics":["topological_sorting"],"solved":true},{"id":"codeforces_2143c","judge":"Codeforces","title":"Max Tree","url":"https://codeforces.com/problemset/problem/2143/C","difficulty":1,"starred":true,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"codeforces_510c","judge":"Codeforces","title":"Fox And Names","url":"https://codeforces.com/problemset/problem/510/C","difficulty":1,"starred":true,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"spoj_rpla","judge":"SPOJ","title":"Answer the boss!","url":"https://www.spoj.com/problems/RPLA/","difficulty":1,"starred":false,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"atcoder_abc291_e","judge":"AtCoder","title":"Find Permutation","url":"https://atcoder.jp/contests/abc291/tasks/abc291_e","difficulty":1,"starred":true,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"codeforces_1931f","judge":"Codeforces","title":"Chat Screenshots","url":"https://codeforces.com/problemset/problem/1931/F","difficulty":1,"starred":false,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"leetcode_count_ways_to_build_rooms_in_an_ant_colony","judge":"LeetCode","title":"Count Ways to Build Rooms in an Ant Colony","url":"https://leetcode.com/problems/count-ways-to-build-rooms-in-an-ant-colony/","difficulty":2,"starred":true,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"codechef_buildt","judge":"CodeChef","title":"Build Towers","url":"https://www.codechef.com/problems/BUILDT","difficulty":2,"starred":false,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"cf_gym_103741h","judge":"CF Gym","title":"Permutation Counting","url":"https://codeforces.com/gym/103741/problem/H","difficulty":2,"starred":true,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"codeforces_1385e","judge":"Codeforces","title":"Directing Edges","url":"https://codeforces.com/contest/1385/problem/E","difficulty":2,"starred":false,"topic":"topological_sorting","topics":["topological_sorting"],"solved":false},{"id":"cf_gym_101102k","judge":"CF Gym","title":"Topological Sort","url":"https://codeforces.com/gym/101102/problem/K","difficulty":null,"starred":true,"topic":"topological_sorting","topics":["topological_sorting","inverse_graph"],"solved":false},{"id":"cses_1131","judge":"CSES","title":"Tree Diameter","url":"https://cses.fi/problemset/task/1131","difficulty":1,"starred":true,"topic":"tree_diameter","topics":["tree_diameter","dp_on_trees_and_dags"],"solved":true},{"id":"cses_1132","judge":"CSES","title":"Tree Distances I","url":"https://cses.fi/problemset/task/1132","difficulty":1,"starred":true,"topic":"tree_diameter","topics":["tree_diameter","rerooting_technique"],"solved":true},{"id":"spoj_eagle1","judge":"SPOJ","title":"Eagle and Dogs","url":"https://www.spoj.com/problems/EAGLE1/","difficulty":1,"starred":true,"topic":"tree_diameter","topics":["tree_diameter"],"solved":true},{"id":"cf_gym_102694a","judge":"CF Gym","title":"Circumference of a Tree","url":"https://codeforces.com/gym/102694/problem/A","difficulty":1,"starred":false,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"cf_gym_102694b","judge":"CF Gym","title":"Dynamic Diameter","url":"https://codeforces.com/gym/102694/problem/B","difficulty":1,"starred":false,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"codeforces_734e","judge":"Codeforces","title":"Anton and Tree","url":"https://codeforces.com/problemset/problem/734/E","difficulty":2,"starred":true,"topic":"tree_diameter","topics":["tree_diameter","dp_on_trees_and_dags"],"solved":false},{"id":"atcoder_agc033_c","judge":"AtCoder","title":"Removing Coins","url":"https://atcoder.jp/contests/agc033/tasks/agc033_c","difficulty":2,"starred":true,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"codeforces_1404b","judge":"Codeforces","title":"Tree Tag","url":"https://codeforces.com/contest/1404/problem/B","difficulty":2,"starred":false,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"codeforces_456e","judge":"Codeforces","title":"Civilization","url":"https://codeforces.com/contest/456/problem/E","difficulty":2,"starred":false,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"codeforces_1294f","judge":"Codeforces","title":"Three paths on a tree","url":"https://codeforces.com/contest/1294/problem/F","difficulty":2,"starred":true,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"codeforces_1004e","judge":"Codeforces","title":"Sonya and Ice Cream","url":"https://codeforces.com/contest/1004/problem/E","difficulty":3,"starred":false,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"codeforces_1943c","judge":"Codeforces","title":"Tree Compass","url":"https://codeforces.com/contest/1943/problem/C","difficulty":3,"starred":true,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"codeforces_633f","judge":"Codeforces","title":"The Chocolate Spree","url":"https://codeforces.com/contest/633/problem/F","difficulty":3,"starred":false,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"atcoder_arc117_d","judge":"AtCoder","title":"Miracle Tree","url":"https://atcoder.jp/contests/arc117/tasks/arc117_d","difficulty":3,"starred":true,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"atcoder_arc108_f","judge":"AtCoder","title":"Paint Tree","url":"https://atcoder.jp/contests/arc108/tasks/arc108_f","difficulty":3,"starred":true,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"atcoder_abc221_f","judge":"AtCoder","title":"Diameter set","url":"https://atcoder.jp/contests/abc221/tasks/abc221_f","difficulty":3,"starred":false,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"codeforces_1434d","judge":"Codeforces","title":"Roads and Ramen","url":"https://codeforces.com/contest/1434/problem/D","difficulty":4,"starred":true,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"codeforces_1214h","judge":"Codeforces","title":"Tiles Placement","url":"https://codeforces.com/contest/1214/problem/H","difficulty":4,"starred":false,"topic":"tree_diameter","topics":["tree_diameter"],"solved":false},{"id":"cses_1137","judge":"CSES","title":"Subtree Queries","url":"https://cses.fi/problemset/task/1137","difficulty":1,"starred":true,"topic":"euler_tour_technique","topics":["euler_tour_technique"],"solved":false},{"id":"cf_gym_102694e","judge":"CF Gym","title":"Filthy Rich Trees","url":"https://codeforces.com/gym/102694/problem/E","difficulty":1,"starred":false,"topic":"euler_tour_technique","topics":["euler_tour_technique"],"solved":false},{"id":"codeforces_781c","judge":"Codeforces","title":"Underground Lab","url":"https://codeforces.com/contest/781/problem/C","difficulty":1,"starred":true,"topic":"euler_tour_technique","topics":["euler_tour_technique"],"solved":false},{"id":"codeforces_916e","judge":"Codeforces","title":"Jamie and Tree","url":"https://codeforces.com/contest/916/problem/E","difficulty":2,"starred":false,"topic":"euler_tour_technique","topics":["binary_lifting_and_lca","euler_tour_technique"],"solved":false},{"id":"cf_gym_102694f","judge":"CF Gym","title":"The Lorax","url":"https://codeforces.com/gym/102694/problem/F","difficulty":2,"starred":false,"topic":"euler_tour_technique","topics":["euler_tour_technique"],"solved":false},{"id":"codeforces_620e","judge":"Codeforces","title":"New Year Tree","url":"https://codeforces.com/problemset/problem/620/E","difficulty":2,"starred":false,"topic":"euler_tour_technique","topics":["euler_tour_technique"],"solved":false},{"id":"codeforces_208e","judge":"Codeforces","title":"Blood Cousins","url":"https://codeforces.com/contest/208/problem/E","difficulty":2,"starred":false,"topic":"euler_tour_technique","topics":["euler_tour_technique","binary_lifting_and_lca"],"solved":false},{"id":"codeforces_343d","judge":"Codeforces","title":"Water Tree","url":"https://codeforces.com/problemset/problem/343/D","difficulty":2,"starred":false,"topic":"euler_tour_technique","topics":["euler_tour_technique"],"solved":false},{"id":"codeforces_877e","judge":"Codeforces","title":"Danil and a Part-time Job","url":"https://codeforces.com/problemset/problem/877/E","difficulty":2,"starred":true,"topic":"euler_tour_technique","topics":["euler_tour_technique"],"solved":false},{"id":"atcoder_abc294_g","judge":"AtCoder","title":"Distance Queries on a Tree","url":"https://atcoder.jp/contests/abc294/tasks/abc294_g","difficulty":2,"starred":true,"topic":"euler_tour_technique","topics":["euler_tour_technique"],"solved":false},{"id":"yosupo_connected_components_of_complement_graph","judge":"Library Checker","title":"Connected Components of Complement Graph","url":"https://judge.yosupo.jp/problem/connected_components_of_complement_graph","difficulty":1,"starred":true,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"codeforces_920e","judge":"Codeforces","title":"Connected Components?","url":"https://codeforces.com/problemset/problem/920/E","difficulty":1,"starred":true,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"codeforces_1242b","judge":"Codeforces","title":"0-1 MST","url":"https://codeforces.com/problemset/problem/1242/B","difficulty":1,"starred":true,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"codeforces_190e","judge":"Codeforces","title":"Counter Attack","url":"https://codeforces.com/contest/190/problem/E","difficulty":2,"starred":false,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"usaco_765","judge":"USACO","title":"A Pie for a Pie","url":"https://usaco.org/index.php?page=viewproblem2&cpid=765","difficulty":2,"starred":true,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"codeforces_653e","judge":"Codeforces","title":"Bear and Forgotten Tree 2","url":"https://codeforces.com/contest/653/problem/E","difficulty":2,"starred":false,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"codeforces_1508c","judge":"Codeforces","title":"Complete the MST","url":"https://codeforces.com/contest/1508/problem/C","difficulty":2,"starred":false,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"kattis_flightplans","judge":"Kattis","title":"Flight Plans","url":"https://open.kattis.com/problems/flightplans","difficulty":2,"starred":true,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"hackerrank_rust_murderer","judge":"HackerRank","title":"Rust & Murderer","url":"https://www.hackerrank.com/challenges/rust-murderer/problem","difficulty":2,"starred":false,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"codeforces_1477d","judge":"Codeforces","title":"Nezzar and Hidden Permutations","url":"https://codeforces.com/contest/1477/problem/D","difficulty":3,"starred":false,"topic":"inverse_graph","topics":["inverse_graph"],"solved":false},{"id":"cses_1687","judge":"CSES","title":"Company Queries I","url":"https://cses.fi/problemset/task/1687","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"cses_1688","judge":"CSES","title":"Company Queries II","url":"https://cses.fi/problemset/task/1688","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"yosupo_lca","judge":"Library Checker","title":"Lowest Common Ancestor","url":"https://judge.yosupo.jp/problem/lca","difficulty":1,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"cses_1135","judge":"CSES","title":"Distance Queries","url":"https://cses.fi/problemset/task/1135","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"yosupo_jump_on_tree","judge":"Library Checker","title":"Jump on Tree","url":"https://judge.yosupo.jp/problem/jump_on_tree","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"spoj_disquery","judge":"SPOJ","title":"Distance Query","url":"https://www.spoj.com/problems/DISQUERY/","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"hackerrank_kth_ancestor","judge":"HackerRank","title":"Kth Ancestor","url":"https://www.hackerrank.com/challenges/kth-ancestor/problem","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"lightoj_a_secret_mission","judge":"LightOJ","title":"A Secret Mission","url":"https://lightoj.com/problem/a-secret-mission","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"cses_1750","judge":"CSES","title":"Planets Queries I","url":"https://cses.fi/problemset/task/1750","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["functional_graphs","binary_lifting_and_lca"],"solved":false},{"id":"cf_gym_102694c","judge":"CF Gym","title":"Sloth Naptime","url":"https://codeforces.com/gym/102694/problem/C","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"cf_gym_102694d","judge":"CF Gym","title":"Cycle Free Flow","url":"https://codeforces.com/gym/102694/problem/D","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"lightoj_min_max_roads","judge":"LightOJ","title":"Min Max Roads","url":"https://lightoj.com/problem/min-max-roads","difficulty":1,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_1328e","judge":"Codeforces","title":"Tree Queries","url":"https://codeforces.com/contest/1328/problem/E","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_1702g2","judge":"Codeforces","title":"Passable Paths (hard version)","url":"https://codeforces.com/contest/1702/problem/G2","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_832d","judge":"Codeforces","title":"Misha, Grisha and Underground","url":"https://codeforces.com/contest/832/problem/D","difficulty":1,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"spoj_qtree2","judge":"SPOJ","title":"Query on a tree II","url":"https://www.spoj.com/problems/QTREE2/","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_1142b","judge":"Codeforces","title":"Lynyrd Skynyrd","url":"https://codeforces.com/contest/1142/problem/B","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"cses_1160","judge":"CSES","title":"Planets Queries II","url":"https://cses.fi/problemset/task/1160","difficulty":1,"starred":true,"topic":"binary_lifting_and_lca","topics":["functional_graphs","binary_lifting_and_lca"],"solved":false},{"id":"toph_city_of_atlantis","judge":"Toph","title":"City of Atlantis","url":"https://toph.co/p/city-of-atlantis","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"cses_1191","judge":"CSES","title":"Cyclic Array","url":"https://cses.fi/problemset/task/1191/","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_176e","judge":"Codeforces","title":"Archaeology","url":"https://codeforces.com/contest/176/problem/E","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_191c","judge":"Codeforces","title":"Fools and Roads","url":"https://codeforces.com/contest/191/problem/C","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_466e","judge":"Codeforces","title":"Information Graph","url":"https://codeforces.com/contest/466/problem/E","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_519e","judge":"Codeforces","title":"A and B and Lecture Rooms","url":"https://codeforces.com/contest/519/problem/E","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_587c","judge":"Codeforces","title":"Duff in the Army","url":"https://codeforces.com/contest/587/problem/C","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_609e","judge":"Codeforces","title":"Minimum spanning tree for each edge","url":"https://codeforces.com/contest/609/problem/E","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["mst","binary_lifting_and_lca"],"solved":false},{"id":"hackerearth_optimal_connectivity_c6ae79ca","judge":"HackerEarth","title":"Optimal Connectivity","url":"https://www.hackerearth.com/practice/algorithms/graphs/graph-representation/practice-problems/algorithm/optimal-connectivity-c6ae79ca/","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codechef_talca","judge":"CodeChef","title":"Lowest Common Ancestor","url":"https://www.codechef.com/problems/TALCA","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_629e","judge":"Codeforces","title":"Famil Door and Roads","url":"https://codeforces.com/contest/629/problem/E","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"csacademy_root_lca_queries","judge":"CS Academy","title":"Root LCA Queries","url":"https://csacademy.com/contest/archive/task/root-lca-queries/statement/","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_733f","judge":"Codeforces","title":"Drivers Dissatisfaction","url":"https://codeforces.com/contest/733/problem/F","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_855d","judge":"Codeforces","title":"Rowena Ravenclaw's Diadem","url":"https://codeforces.com/contest/855/problem/D","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"spoj_adaorang","judge":"SPOJ","title":"Ada and Orange Tree","url":"https://www.spoj.com/problems/ADAORANG/","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_1843f2","judge":"Codeforces","title":"Omsk Metro (hard version)","url":"https://codeforces.com/contest/1843/problem/F2","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"atcoder_abc346_f","judge":"AtCoder","title":"SSttrriinngg in StringString","url":"https://atcoder.jp/contests/abc346/tasks/abc346_f","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"kattis_surveillance","judge":"Kattis","title":"Surveillance","url":"https://vjudge.net/problem/Kattis-surveillance","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"toph_fun_with_functions","judge":"Toph","title":"Fun With Functions","url":"https://toph.co/p/fun-with-functions","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"toph_static_tree","judge":"Toph","title":"Static Tree","url":"https://toph.co/p/static-tree","difficulty":2,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_372d","judge":"Codeforces","title":"Choosing Subtree is Fun","url":"https://codeforces.com/contest/372/problem/D","difficulty":3,"starred":true,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_986e","judge":"Codeforces","title":"Prince's Problem","url":"https://codeforces.com/contest/986/problem/E","difficulty":3,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"tlx_troc_12f","judge":"TLX","title":"Functional Constraint","url":"https://tlx.toki.id/problems/troc-12/F","difficulty":3,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"tlx_troc_13g","judge":"TLX","title":"Graph and Destination","url":"https://tlx.toki.id/problems/troc-13/G","difficulty":3,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_1175e","judge":"Codeforces","title":"Minimal Segment Cover","url":"https://codeforces.com/contest/1175/problem/E","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["binary_lifting_and_lca"],"solved":false},{"id":"codeforces_1000g","judge":"Codeforces","title":"Two-Paths","url":"https://codeforces.com/problemset/problem/1000/G","difficulty":2,"starred":false,"topic":"binary_lifting_and_lca","topics":["rerooting_technique","binary_lifting_and_lca"],"solved":false},{"id":"yosupo_scc","judge":"Library Checker","title":"Strongly Connected Components","url":"https://judge.yosupo.jp/problem/scc","difficulty":1,"starred":true,"topic":"scc","topics":["scc"],"solved":false},{"id":"cses_1682","judge":"CSES","title":"Flight Routes Check","url":"https://cses.fi/problemset/task/1682","difficulty":1,"starred":true,"topic":"scc","topics":["scc"],"solved":true},{"id":"cses_1683","judge":"CSES","title":"Planets and Kingdoms","url":"https://cses.fi/problemset/task/1683/","difficulty":1,"starred":true,"topic":"scc","topics":["scc"],"solved":true},{"id":"spoj_gooda","judge":"SPOJ","title":"Good Travels","url":"https://www.spoj.com/problems/GOODA/","difficulty":1,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"spoj_lego","judge":"SPOJ","title":"Lego","url":"https://www.spoj.com/problems/LEGO/","difficulty":1,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"codechef_chefrrun","judge":"CodeChef","title":"Chef and Round Run","url":"https://www.codechef.com/AUG16/problems/CHEFRRUN","difficulty":1,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"spoj_capcity","judge":"SPOJ","title":"Capital City","url":"https://www.spoj.com/problems/CAPCITY/","difficulty":1,"starred":true,"topic":"scc","topics":["scc"],"solved":false},{"id":"codeforces_427c","judge":"Codeforces","title":"Checkposts","url":"https://codeforces.com/contest/427/problem/C","difficulty":1,"starred":true,"topic":"scc","topics":["scc"],"solved":false},{"id":"szkopul_akksmtjwttdoehdqnmq3_eaa","judge":"Szkopuł","title":"Bike paths","url":"https://szkopul.edu.pl/problemset/problem/aKKSmtjWTtDOEHDqnmQ3-eAA/site/?key=statement","difficulty":1,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"cses_1686","judge":"CSES","title":"Coin Collector","url":"https://cses.fi/problemset/task/1686/","difficulty":2,"starred":true,"topic":"scc","topics":["scc","dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_505d","judge":"Codeforces","title":"Mr. Kitayuta's Technology","url":"https://codeforces.com/contest/505/problem/D","difficulty":2,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"spoj_tfriends","judge":"SPOJ","title":"True Friends","url":"https://www.spoj.com/problems/TFRIENDS/","difficulty":2,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"codeforces_22e","judge":"Codeforces","title":"Scheme","url":"https://codeforces.com/contest/22/problem/E","difficulty":2,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"spoj_adapanel","judge":"SPOJ","title":"Ada and Panels","url":"https://www.spoj.com/problems/ADAPANEL/","difficulty":2,"starred":true,"topic":"scc","topics":["scc"],"solved":false},{"id":"codeforces_894e","judge":"Codeforces","title":"Ralph and Mushrooms","url":"https://codeforces.com/contest/894/problem/E","difficulty":2,"starred":true,"topic":"scc","topics":["scc","dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1239d","judge":"Codeforces","title":"Catowice City","url":"https://codeforces.com/contest/1239/problem/D","difficulty":2,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"codeforces_1423b","judge":"Codeforces","title":"Valuable Paper","url":"https://codeforces.com/problemset/problem/1423/B","difficulty":2,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"cses_1685","judge":"CSES","title":"New Flight Routes","url":"https://cses.fi/problemset/task/1685","difficulty":3,"starred":true,"topic":"scc","topics":["scc"],"solved":false},{"id":"codeforces_1534f2","judge":"Codeforces","title":"Falling Sand (Hard Version)","url":"https://codeforces.com/contest/1534/problem/F2","difficulty":4,"starred":false,"topic":"scc","topics":["scc"],"solved":false},{"id":"yosupo_incremental_scc","judge":"Library Checker","title":"Strongly Connected Components (Incremental)","url":"https://judge.yosupo.jp/problem/incremental_scc","difficulty":2,"starred":true,"topic":"incremental_scc","topics":["incremental_scc"],"solved":false},{"id":"baekjoon_19028","judge":"Baekjoon","title":"Link Cut Digraph","url":"https://www.acmicpc.net/problem/19028","difficulty":3,"starred":false,"topic":"incremental_scc","topics":["incremental_scc"],"solved":false},{"id":"codeforces_1989f","judge":"Codeforces","title":"Simultaneous Coloring","url":"https://codeforces.com/contest/1989/problem/F","difficulty":4,"starred":false,"topic":"incremental_scc","topics":["incremental_scc"],"solved":false},{"id":"yosupo_two_edge_connected_components","judge":"Library Checker","title":"Two-Edge-Connected Components","url":"https://judge.yosupo.jp/problem/two_edge_connected_components","difficulty":1,"starred":true,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"codeforces_1000e","judge":"Codeforces","title":"We Need More Bosses","url":"https://codeforces.com/problemset/problem/1000/E","difficulty":1,"starred":true,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"spoj_ec_p","judge":"SPOJ","title":"Critical Edges","url":"https://www.spoj.com/problems/EC_P/","difficulty":1,"starred":false,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"uva_796","judge":"UVa","title":"Critical Links","url":"https://vjudge.net/problem/UVA-796","difficulty":1,"starred":false,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"uva_610","judge":"UVa","title":"Street Directions","url":"https://vjudge.net/problem/UVA-610","difficulty":1,"starred":false,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"cf_gym_100114j","judge":"CF Gym","title":"Computer Network","url":"https://codeforces.com/gym/100114/problem/J","difficulty":2,"starred":true,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"spoj_graffdef","judge":"SPOJ","title":"King Graffs Defense","url":"https://www.spoj.com/problems/GRAFFDEF/","difficulty":2,"starred":false,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"codeforces_700c","judge":"Codeforces","title":"Break Up","url":"https://codeforces.com/contest/700/problem/C","difficulty":2,"starred":false,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"cf_gym_100676h","judge":"CF Gym","title":"Capital City","url":"https://codeforces.com/gym/100676/problem/H","difficulty":2,"starred":true,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"hackerearth_delete_and_cut_game_91969de1","judge":"HackerEarth","title":"Delete and Cut Game","url":"https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/practice-problems/algorithm/delete-and-cut-game-91969de1/","difficulty":2,"starred":false,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"codechef_prcnsr2","judge":"CodeChef","title":"Code Land","url":"https://www.codechef.com/problems/PRCNSR2","difficulty":2,"starred":false,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"codeforces_555e","judge":"Codeforces","title":"Case of Computer Network","url":"https://codeforces.com/contest/555/problem/E","difficulty":3,"starred":true,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"hackerrank_sherlock_and_queries_on_the_graph","judge":"HackerRank","title":"Sherlock and Queries on the Graph","url":"https://www.hackerrank.com/contests/101hack26/challenges/sherlock-and-queries-on-the-graph/problem","difficulty":3,"starred":true,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"codeforces_652e","judge":"Codeforces","title":"Pursuit For Artifacts","url":"https://codeforces.com/problemset/problem/652/E","difficulty":1,"starred":true,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"codeforces_1986f","judge":"Codeforces","title":"Rada and the Chamomile Valley","url":"https://codeforces.com/contest/1986/problem/F","difficulty":2,"starred":false,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"codeforces_2132f","judge":"Codeforces","title":"Rada and the Chamomile Valley","url":"https://codeforces.com/contest/2132/problem/F","difficulty":2,"starred":true,"topic":"articulation_bridges_and_bridge_tree","topics":["articulation_bridges_and_bridge_tree"],"solved":false},{"id":"cf_gym_100551b","judge":"CF Gym","title":"GraphAero","url":"https://codeforces.com/gym/100551/problem/B","difficulty":2,"starred":true,"topic":"online_articulation_bridges","topics":["online_articulation_bridges"],"solved":false},{"id":"uva_315","judge":"UVa","title":"Network","url":"https://vjudge.net/problem/UVA-315","difficulty":1,"starred":true,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"uva_10199","judge":"UVa","title":"Tourist Guide","url":"https://vjudge.net/problem/UVA-10199","difficulty":1,"starred":true,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"uva_10765","judge":"UVa","title":"Doves and bombs","url":"https://vjudge.net/problem/UVA-10765","difficulty":1,"starred":false,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"cses_1705","judge":"CSES","title":"Forbidden Cities","url":"https://cses.fi/problemset/task/1705","difficulty":2,"starred":true,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"yosupo_biconnected_components","judge":"Library Checker","title":"Biconnected Components","url":"https://judge.yosupo.jp/problem/biconnected_components","difficulty":1,"starred":true,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"spoj_submerge","judge":"SPOJ","title":"Submerging Islands","url":"https://www.spoj.com/problems/SUBMERGE/","difficulty":2,"starred":true,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"szkopul_edt8w290owtatmcjad0o0ywk","judge":"Szkopuł","title":"Blockade","url":"https://szkopul.edu.pl/problemset/problem/eDt8w290owtatmCjad0O0ywk/site/?key=statement","difficulty":2,"starred":false,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"apio18_duathlon","judge":"oj.uz","title":"Duathlon","url":"https://oj.uz/problem/view/APIO18_duathlon","difficulty":2,"starred":false,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"szkopul_yy6_3ua_c1rt7q_97lawc0up","judge":"Szkopuł","title":"Amusing journeys","url":"https://szkopul.edu.pl/problemset/problem/YY6-3ua-C1rt7q-97laWc0UP/site/?key=statement","difficulty":2,"starred":false,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"cf_gym_102512a","judge":"CF Gym","title":"Leakage","url":"https://codeforces.com/gym/102512/problem/A","difficulty":2,"starred":true,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"dmoj_tle17c1p6","judge":"DMOJ","title":"Investment","url":"https://dmoj.ca/problem/tle17c1p6","difficulty":3,"starred":false,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"ceoi15_pipes","judge":"oj.uz","title":"Pipes","url":"https://oj.uz/problem/view/CEOI15_pipes","difficulty":3,"starred":false,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"codechef_sadpairs","judge":"CodeChef","title":"Chef and Sad Pairs","url":"https://www.codechef.com/problems/SADPAIRS","difficulty":3,"starred":true,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"spoj_stopcity","judge":"SPOJ","title":"Stopping-off Cities","url":"https://www.spoj.com/problems/STOPCITY/","difficulty":2,"starred":false,"topic":"articulation_points","topics":["articulation_points"],"solved":false},{"id":"yosupo_three_edge_connected_components","judge":"Library Checker","title":"Three-Edge-Connected Components","url":"https://judge.yosupo.jp/problem/three_edge_connected_components","difficulty":1,"starred":true,"topic":"three_edge_connectivity","topics":["three_edge_connectivity"],"solved":false},{"id":"toph_maxflow_ii","judge":"Toph","title":"MaxFlow (II)","url":"https://toph.co/p/maxflow-ii","difficulty":2,"starred":true,"topic":"three_edge_connectivity","topics":["three_edge_connectivity"],"solved":false},{"id":"cf_gym_102760c","judge":"CF Gym","title":"Economic One-way Roads","url":"https://codeforces.com/gym/102760/problem/C","difficulty":3,"starred":true,"topic":"ear_decomposition","topics":["ear_decomposition"],"solved":false},{"id":"szkopul_nldsb4ew1yuzykblf4lczl1y","judge":"Szkopuł","title":"Zones","url":"https://szkopul.edu.pl/problemset/problem/nldsb4EW1YuZykBlf4lcZL1Y/site/?key=statement","difficulty":1,"starred":false,"topic":"strong_orientation","topics":["strong_orientation"],"solved":false},{"id":"yosupo_st_numbering","judge":"Library Checker","title":"st-Numbering","url":"https://judge.yosupo.jp/problem/st_numbering","difficulty":1,"starred":true,"topic":"st_numbering","topics":["st_numbering"],"solved":false},{"id":"codeforces_1916f","judge":"Codeforces","title":"Group Division","url":"https://codeforces.com/contest/1916/problem/F","difficulty":1,"starred":true,"topic":"st_numbering","topics":["st_numbering"],"solved":false},{"id":"cses_241c","judge":"CSES","title":"Graph Ordering","url":"https://cses.fi/241/task/C","difficulty":null,"starred":true,"topic":"st_numbering","topics":["st_numbering"],"solved":false},{"id":"cf_edu_289391e","judge":"Codeforces","title":"Spanning Tree","url":"https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/E","difficulty":1,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"cses_1675","judge":"CSES","title":"Road Reparation","url":"https://cses.fi/problemset/task/1675","difficulty":1,"starred":true,"topic":"mst","topics":["mst"],"solved":true},{"id":"cf_edu_289391f","judge":"Codeforces","title":"Dense spanning tree","url":"https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/F","difficulty":1,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codechef_icl16a","judge":"CodeChef","title":"Fullmetal Alchemist","url":"https://www.codechef.com/ICL2016/problems/ICL16A","difficulty":1,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"codechef_chefelec","judge":"CodeChef","title":"Chefland and Electricity","url":"https://www.codechef.com/problems/CHEFELEC","difficulty":1,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_32c","judge":"Codeforces","title":"Flea","url":"https://codeforces.com/problemset/problem/32/C","difficulty":null,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_598d","judge":"Codeforces","title":"Igor In the Museum","url":"https://codeforces.com/contest/598/problem/D","difficulty":1,"starred":false,"topic":"mst","topics":["mst","direction_array"],"solved":false},{"id":"spoj_iitkwpcg","judge":"SPOJ","title":"Help the old King","url":"https://www.spoj.com/problems/IITKWPCG/","difficulty":1,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"spoj_ec_mode","judge":"SPOJ","title":"Modems","url":"https://www.spoj.com/problems/EC_MODE/","difficulty":1,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"uva_11747","judge":"UVa","title":"Heavy Cycle Edges","url":"https://vjudge.net/problem/UVA-11747","difficulty":1,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_472d","judge":"Codeforces","title":"Design Tutorial: Inverse the Problem","url":"https://codeforces.com/contest/472/problem/D","difficulty":1,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"usaco_531","judge":"USACO","title":"Superbull","url":"https://usaco.org/index.php?page=viewproblem2&cpid=531","difficulty":1,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"usaco_623","judge":"USACO","title":"Fenced In","url":"https://usaco.org/index.php?page=viewproblem2&cpid=623","difficulty":1,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_744a","judge":"Codeforces","title":"Hongcow Builds A Nation","url":"https://codeforces.com/problemset/problem/744/A","difficulty":2,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"cf_edu_289391h","judge":"Codeforces","title":"Oil business","url":"https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/H","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_160d","judge":"Codeforces","title":"Edges in MST","url":"https://codeforces.com/contest/160/problem/D","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_891c","judge":"Codeforces","title":"Envy","url":"https://codeforces.com/contest/891/problem/C","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"spoj_koicost","judge":"SPOJ","title":"Cost","url":"https://www.spoj.com/problems/KOICOST/","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"spoj_marybmw","judge":"SPOJ","title":"BMW","url":"https://www.spoj.com/problems/MARYBMW/","difficulty":2,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"hackerrank_johnland","judge":"HackerRank","title":"Roads in HackerLand","url":"https://www.hackerrank.com/contests/june-world-codesprint/challenges/johnland/problem","difficulty":2,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"uva_12176","judge":"UVa","title":"Bring Your Own Horse","url":"https://vjudge.net/problem/UVA-12176","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_1513d","judge":"Codeforces","title":"GCD and MST","url":"https://codeforces.com/problemset/problem/1513/D","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"atcoder_abc282_e","judge":"AtCoder","title":"Choose Two and Eat One","url":"https://atcoder.jp/contests/abc282/tasks/abc282_e","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"hackerrank_spanning_tree_fraction","judge":"HackerRank","title":"Spanning Tree Fraction","url":"https://www.hackerrank.com/contests/w31/challenges/spanning-tree-fraction/problem","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"uva_10600","judge":"UVa","title":"ACM Contest and Blackout","url":"https://vjudge.net/problem/UVA-10600","difficulty":2,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"usaco_946","judge":"USACO","title":"I Would Walk 500 Miles","url":"https://usaco.org/index.php?page=viewproblem2&cpid=946","difficulty":2,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"usaco_1211","judge":"USACO","title":"Moo Network","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1211","difficulty":2,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_125e","judge":"Codeforces","title":"MST Company","url":"https://codeforces.com/contest/125/problem/E","difficulty":2,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_76a","judge":"Codeforces","title":"Gift","url":"https://codeforces.com/contest/76/problem/A","difficulty":2,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"usaco_1138","judge":"USACO","title":"Portals","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1138","difficulty":null,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_1707c","judge":"Codeforces","title":"DFS Trees","url":"https://codeforces.com/contest/1707/problem/C","difficulty":null,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"toph_better_together","judge":"Toph","title":"Better Together!","url":"https://toph.co/p/better-together","difficulty":1,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"toph_and_maximum_spanning_tree","judge":"Toph","title":"AND Maximum Spanning Tree","url":"https://toph.co/p/and-maximum-spanning-tree","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_1857g","judge":"Codeforces","title":"Counting Graphs","url":"https://codeforces.com/problemset/problem/1857/G","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_959e","judge":"Codeforces","title":"Mahmoud and Ehab and the xor-MST","url":"https://codeforces.com/problemset/problem/959/E","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"lightoj_road_construction","judge":"LightOJ","title":"Road Construction","url":"https://lightoj.com/problem/road-construction","difficulty":2,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_1981e","judge":"Codeforces","title":"Turtle and Intersected Segments","url":"https://codeforces.com/contest/1981/problem/E","difficulty":2,"starred":true,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_1408e","judge":"Codeforces","title":"Avoid Rainbow Cycles","url":"https://codeforces.com/problemset/problem/1408/E","difficulty":3,"starred":false,"topic":"mst","topics":["mst"],"solved":false},{"id":"codeforces_152e","judge":"Codeforces","title":"Garden","url":"https://codeforces.com/contest/152/problem/E","difficulty":2,"starred":true,"topic":"steiner_tree_problem","topics":["steiner_tree_problem"],"solved":false},{"id":"spoj_ticket","judge":"SPOJ","title":"Ticket to Ride","url":"https://www.spoj.com/problems/TICKET/","difficulty":2,"starred":false,"topic":"steiner_tree_problem","topics":["steiner_tree_problem"],"solved":false},{"id":"yosupo_minimum_steiner_tree","judge":"Library Checker","title":"Minimum Steiner Tree","url":"https://judge.yosupo.jp/problem/minimum_steiner_tree","difficulty":1,"starred":true,"topic":"steiner_tree_problem","topics":["steiner_tree_problem"],"solved":false},{"id":"codechef_spantree","judge":"CodeChef","title":"Spanning Tree","url":"https://www.codechef.com/problems/SPANTREE","difficulty":2,"starred":false,"topic":"boruvkas_algorithm","topics":["boruvkas_algorithm"],"solved":false},{"id":"codeforces_1648e","judge":"Codeforces","title":"Air Reform","url":"https://codeforces.com/problemset/problem/1648/E","difficulty":3,"starred":false,"topic":"boruvkas_algorithm","topics":["boruvkas_algorithm"],"solved":false},{"id":"codeforces_1305g","judge":"Codeforces","title":"Kuroni and Antihype","url":"https://codeforces.com/contest/1305/problem/G","difficulty":3,"starred":true,"topic":"boruvkas_algorithm","topics":["boruvkas_algorithm"],"solved":true},{"id":"codeforces_888g","judge":"Codeforces","title":"Xor-MST","url":"https://codeforces.com/contest/888/problem/G","difficulty":null,"starred":true,"topic":"boruvkas_algorithm","topics":["boruvkas_algorithm"],"solved":false},{"id":"yosupo_minimum_diameter_spanning_tree","judge":"Library Checker","title":"Minimum Diameter Spanning Tree","url":"https://judge.yosupo.jp/problem/minimum_diameter_spanning_tree","difficulty":1,"starred":true,"topic":"minimum_diameter_spanning_tree","topics":["minimum_diameter_spanning_tree"],"solved":false},{"id":"spoj_pt07c","judge":"SPOJ","title":"The GbAaY Kingdom","url":"https://www.spoj.com/problems/PT07C/","difficulty":null,"starred":true,"topic":"minimum_diameter_spanning_tree","topics":["minimum_diameter_spanning_tree"],"solved":false},{"id":"spoj_mdst","judge":"SPOJ","title":"Minimum Diameter Spanning Tree","url":"https://www.spoj.com/problems/MDST/","difficulty":1,"starred":false,"topic":"minimum_diameter_spanning_tree","topics":["minimum_diameter_spanning_tree"],"solved":false},{"id":"codeforces_266d","judge":"Codeforces","title":"BerDonalds","url":"https://codeforces.com/contest/266/problem/D","difficulty":null,"starred":true,"topic":"minimum_diameter_spanning_tree","topics":["minimum_diameter_spanning_tree"],"solved":false},{"id":"codechef_dragonst","judge":"CodeChef","title":"Dragonstone","url":"https://www.codechef.com/problems/DRAGONST","difficulty":1,"starred":true,"topic":"manhattan_mst","topics":["manhattan_mst"],"solved":false},{"id":"kattis_gridmst","judge":"Kattis","title":"Grid MST","url":"https://open.kattis.com/problems/gridmst","difficulty":1,"starred":true,"topic":"manhattan_mst","topics":["sweep_line_algorithm","manhattan_mst"],"solved":false},{"id":"yosupo_manhattanmst","judge":"Library Checker","title":"Manhattan MST","url":"https://judge.yosupo.jp/problem/manhattanmst","difficulty":1,"starred":true,"topic":"manhattan_mst","topics":["manhattan_mst"],"solved":false},{"id":"csacademy_the_sprawl","judge":"CS Academy","title":"The Sprawl","url":"https://csacademy.com/contest/archive/task/the-sprawl","difficulty":3,"starred":true,"topic":"manhattan_mst","topics":["manhattan_mst"],"solved":false},{"id":"yosupo_euclidean_mst","judge":"Library Checker","title":"Euclidean MST","url":"https://judge.yosupo.jp/problem/euclidean_mst","difficulty":1,"starred":true,"topic":"euclidean_mst","topics":["euclidean_mst"],"solved":false},{"id":"acmsguru_99999383","judge":"Codeforces","title":"Caravans","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/383","difficulty":2,"starred":false,"topic":"euclidean_mst","topics":["euclidean_mst","delaunay_triangulation"],"solved":false},{"id":"yosupo_directedmst","judge":"Library Checker","title":"Directed MST","url":"https://judge.yosupo.jp/problem/directedmst","difficulty":1,"starred":true,"topic":"directed_mst","topics":["directed_mst"],"solved":false},{"id":"topcoder_12614","judge":"TopCoder","title":"FoxTheLinguist","url":"https://vjudge.net/problem/TopCoder-12614","difficulty":2,"starred":false,"topic":"directed_mst","topics":["directed_mst"],"solved":false},{"id":"lightoj_stream_my_contest","judge":"LightOJ","title":"Stream My Contest","url":"https://lightoj.com/problem/stream-my-contest","difficulty":2,"starred":true,"topic":"directed_mst","topics":["directed_mst"],"solved":false},{"id":"lightoj_teleport","judge":"LightOJ","title":"Teleport","url":"https://lightoj.com/problem/teleport","difficulty":2,"starred":true,"topic":"directed_mst","topics":["directed_mst"],"solved":false},{"id":"dmoj_ccoprep4p3","judge":"DMOJ","title":"Dynamic MST","url":"https://dmoj.ca/problem/ccoprep4p3","difficulty":1,"starred":true,"topic":"dynamic_mst","topics":["dynamic_mst"],"solved":false},{"id":"acmsguru_99999529","judge":"Codeforces","title":"It's Time to Repair the Roads","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/529","difficulty":null,"starred":true,"topic":"dynamic_mst","topics":["dynamic_mst"],"solved":false},{"id":"atcoder_abc355_f","judge":"AtCoder","title":"MST Query","url":"https://atcoder.jp/contests/abc355/tasks/abc355_f","difficulty":1,"starred":false,"topic":"dynamic_mst","topics":["dynamic_mst"],"solved":false},{"id":"joi18_collapse","judge":"oj.uz","title":"collapse","url":"https://oj.uz/problem/view/JOI18_collapse","difficulty":2,"starred":false,"topic":"dynamic_mst","topics":["dynamic_mst"],"solved":false},{"id":"yosupo_counting_spanning_tree_undirected","judge":"Library Checker","title":"Counting Spanning Trees (Undirected)","url":"https://judge.yosupo.jp/problem/counting_spanning_tree_undirected","difficulty":1,"starred":true,"topic":"kirchoffs_theorem_ft_number_of_msts","topics":["kirchoffs_theorem_ft_number_of_msts"],"solved":false},{"id":"lightoj_trux_it_up","judge":"LightOJ","title":"Trux it Up","url":"https://lightoj.com/problem/trux-it-up","difficulty":1,"starred":true,"topic":"kirchoffs_theorem_ft_number_of_msts","topics":["kirchoffs_theorem_ft_number_of_msts"],"solved":false},{"id":"codechef_starroad","judge":"CodeChef","title":"Roads in Stars","url":"https://www.codechef.com/problems/STARROAD","difficulty":2,"starred":true,"topic":"kirchoffs_theorem_ft_number_of_msts","topics":["kirchoffs_theorem_ft_number_of_msts"],"solved":false},{"id":"codechef_cstree","judge":"CodeChef","title":"Complement Spanning Trees","url":"https://www.codechef.com/problems/CSTREE","difficulty":2,"starred":false,"topic":"kirchoffs_theorem_ft_number_of_msts","topics":["kirchoffs_theorem_ft_number_of_msts"],"solved":false},{"id":"atcoder_abc253_h","judge":"AtCoder","title":"We Love Forest","url":"https://atcoder.jp/contests/abc253/tasks/abc253_h","difficulty":2,"starred":true,"topic":"kirchoffs_theorem_ft_number_of_msts","topics":["kirchoffs_theorem_ft_number_of_msts"],"solved":false},{"id":"loj_6271","judge":"LibreOJ","title":"生成树求和 加强版","url":"https://loj.ac/p/6271","difficulty":4,"starred":false,"topic":"kirchoffs_theorem_ft_number_of_msts","topics":["kirchoffs_theorem_ft_number_of_msts"],"solved":false},{"id":"cses_1671","judge":"CSES","title":"Shortest Routes I","url":"https://cses.fi/problemset/task/1671","difficulty":1,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":true},{"id":"yosupo_shortest_path","judge":"Library Checker","title":"Shortest Path","url":"https://judge.yosupo.jp/problem/shortest_path","difficulty":1,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_20c","judge":"Codeforces","title":"Dijkstra?","url":"https://codeforces.com/problemset/problem/20/C","difficulty":1,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":true},{"id":"usaco_861","judge":"USACO","title":"Fine Dining","url":"https://usaco.org/index.php?page=viewproblem2&cpid=861","difficulty":1,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"spoj_shpath","judge":"SPOJ","title":"The Shortest Path","url":"https://www.spoj.com/problems/SHPATH/","difficulty":1,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"spoj_adatrip","judge":"SPOJ","title":"Ada and Trip","url":"https://www.spoj.com/problems/ADATRIP/","difficulty":1,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"cf_gym_100625d","judge":"CF Gym","title":"Destination Unknown","url":"https://codeforces.com/gym/100625/problem/D","difficulty":1,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_1846g","judge":"Codeforces","title":"Rudolf and CodeVid-23","url":"https://codeforces.com/contest/1846/problem/G","difficulty":1,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"cses_1195","judge":"CSES","title":"Flight Discount","url":"https://cses.fi/problemset/task/1195","difficulty":2,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":true},{"id":"cses_1196","judge":"CSES","title":"Flight Routes","url":"https://cses.fi/problemset/task/1196/","difficulty":2,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":true},{"id":"cses_1202","judge":"CSES","title":"Investigation","url":"https://cses.fi/problemset/task/1202","difficulty":2,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"kattis_robotturtles","judge":"Kattis","title":"Robot Turtles","url":"https://open.kattis.com/problems/robotturtles","difficulty":2,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_567e","judge":"Codeforces","title":"President and Roads","url":"https://codeforces.com/problemset/problem/567/E","difficulty":2,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"timus_1930","judge":"Timus","title":"Ivan's Car","url":"https://acm.timus.ru/problem.aspx?space=1&num=1930","difficulty":2,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_449b","judge":"Codeforces","title":"Jzzhu and Cities","url":"https://codeforces.com/problemset/problem/449/B","difficulty":2,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_715b","judge":"Codeforces","title":"Complete The Graph","url":"https://codeforces.com/problemset/problem/715/B","difficulty":2,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"cf_gym_100753a","judge":"CF Gym","title":"A Journey to Greece","url":"https://codeforces.com/gym/100753/problem/A","difficulty":2,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_757f","judge":"Codeforces","title":"Team Rocket Rises Again","url":"https://codeforces.com/contest/757/problem/F","difficulty":2,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm","dominator_tree"],"solved":false},{"id":"ioi11_crocodile","judge":"oj.uz","title":"Crocodile's Underground City","url":"https://oj.uz/problem/view/IOI11_crocodile","difficulty":3,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"joi21_ho_t4","judge":"oj.uz","title":"Robot","url":"https://oj.uz/problem/view/JOI21_ho_t4","difficulty":3,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"dmoj_apio11p2","judge":"DMOJ","title":"Find the Path","url":"https://dmoj.ca/problem/apio11p2","difficulty":3,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"baekjoon_5250","judge":"Baekjoon","title":"Shortest Paths","url":"https://www.acmicpc.net/problem/5250","difficulty":3,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_843d","judge":"Codeforces","title":"Dynamic Shortest Path","url":"https://codeforces.com/problemset/problem/843/D","difficulty":3,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_827f","judge":"Codeforces","title":"Dirty Arkady's Kitchen","url":"https://codeforces.com/contest/827/problem/F","difficulty":3,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"lightoj_dangerous_bull_who_wants_to_p","judge":"LightOJ","title":"Dangerous Bull! Who Wants to Pull?","url":"https://lightoj.com/problem/dangerous-bull-who-wants-to-p","difficulty":3,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_1915g","judge":"Codeforces","title":"Bicycles","url":"https://codeforces.com/contest/1915/problem/G","difficulty":1,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_2014e","judge":"Codeforces","title":"Rendez-vous de Marian et Robin","url":"https://codeforces.com/contest/2014/problem/E","difficulty":1,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_2059d","judge":"Codeforces","title":"Graph and Graph","url":"https://codeforces.com/contest/2059/problem/D","difficulty":2,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_1810e","judge":"Codeforces","title":"Monsters","url":"https://codeforces.com/contest/1810/problem/E","difficulty":2,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_1433g","judge":"Codeforces","title":"Reducing Delivery Cost","url":"https://codeforces.com/problemset/problem/1433/G","difficulty":2,"starred":true,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"codeforces_2024d","judge":"Codeforces","title":"Skipping","url":"https://codeforces.com/contest/2024/problem/D","difficulty":2,"starred":false,"topic":"dijkstras_algorithm","topics":["dijkstras_algorithm"],"solved":false},{"id":"usaco_1164","judge":"USACO","title":"Tickets","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1164","difficulty":2,"starred":true,"topic":"dijkstra_on_segment_tree","topics":["dijkstra_on_segment_tree"],"solved":false},{"id":"codechef_densegrp","judge":"CodeChef","title":"Dense Graph","url":"https://www.codechef.com/problems/DENSEGRP","difficulty":2,"starred":true,"topic":"dijkstra_on_segment_tree","topics":["dijkstra_on_segment_tree"],"solved":false},{"id":"codeforces_1903f","judge":"Codeforces","title":"Babysitting","url":"https://codeforces.com/contest/1903/problem/F","difficulty":3,"starred":true,"topic":"dijkstra_on_segment_tree","topics":["2_sat","dijkstra_on_segment_tree"],"solved":false},{"id":"codeforces_1904f","judge":"Codeforces","title":"Beautiful Tree","url":"https://codeforces.com/contest/1904/problem/F","difficulty":2,"starred":false,"topic":"dijkstra_on_segment_tree","topics":["dijkstra_on_segment_tree"],"solved":false},{"id":"cses_1672","judge":"CSES","title":"Shortest Routes II","url":"https://cses.fi/problemset/task/1672","difficulty":1,"starred":true,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":true},{"id":"codeforces_295b","judge":"Codeforces","title":"Greg and Graph","url":"https://codeforces.com/problemset/problem/295/B","difficulty":1,"starred":true,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"codeforces_25c","judge":"Codeforces","title":"Roads in Berland","url":"https://codeforces.com/contest/25/problem/C","difficulty":1,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"spoj_socialne","judge":"SPOJ","title":"Possible Friends","url":"https://www.spoj.com/problems/SOCIALNE/","difficulty":1,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"spoj_chicago","judge":"SPOJ","title":"106 miles to Chicago","url":"https://www.spoj.com/problems/CHICAGO/","difficulty":1,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"lightoj_travel_company","judge":"LightOJ","title":"Travel Company","url":"https://lightoj.com/problem/travel-company","difficulty":1,"starred":true,"topic":"floyd_warshall","topics":["floyd_warshall","bellman_ford"],"solved":false},{"id":"codeforces_33b","judge":"Codeforces","title":"String Problem","url":"https://codeforces.com/contest/33/problem/B","difficulty":1,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"spoj_arbitrag","judge":"SPOJ","title":"Arbitrage","url":"https://www.spoj.com/problems/ARBITRAG/","difficulty":1,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"uva_10724","judge":"UVa","title":"Road Construction","url":"https://vjudge.net/problem/UVA-10724","difficulty":2,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"codeforces_21d","judge":"Codeforces","title":"Traveling Graph","url":"https://codeforces.com/problemset/problem/21/D","difficulty":null,"starred":true,"topic":"floyd_warshall","topics":["floyd_warshall","chinese_postman_problem","bitmask_dp","eulerian_path_and_cycle"],"solved":false},{"id":"cf_gym_101223c","judge":"CF Gym","title":"Manic Moving","url":"https://codeforces.com/gym/101223/problem/C","difficulty":2,"starred":true,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"lightoj_jogging_trails","judge":"LightOJ","title":"Jogging Trails","url":"https://lightoj.com/problem/jogging-trails","difficulty":2,"starred":true,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"spoj_ingred","judge":"SPOJ","title":"Ingredients","url":"https://www.spoj.com/problems/INGRED/","difficulty":2,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"atcoder_agc022_c","judge":"AtCoder","title":"Remainder Game","url":"https://atcoder.jp/contests/agc022/tasks/agc022_c","difficulty":3,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"kattis_allpairspath","judge":"Kattis","title":"All Pairs Shortest Path","url":"https://open.kattis.com/problems/allpairspath","difficulty":1,"starred":true,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"atcoder_abc243_e","judge":"AtCoder","title":"Edge Deletion","url":"https://atcoder.jp/contests/abc243/tasks/abc243_e","difficulty":1,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"uva_534","judge":"UVa","title":"Frogger","url":"https://vjudge.net/problem/UVA-534","difficulty":1,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"cf_gym_101020h","judge":"CF Gym","title":"Weekend","url":"https://codeforces.com/gym/101020/problem/H","difficulty":1,"starred":false,"topic":"floyd_warshall","topics":["floyd_warshall"],"solved":false},{"id":"kattis_shortestpath3","judge":"Kattis","title":"Single source shortest path, negative weights","url":"https://open.kattis.com/problems/shortestpath3","difficulty":1,"starred":true,"topic":"bellman_ford","topics":["bellman_ford"],"solved":false},{"id":"cses_1673","judge":"CSES","title":"High Score","url":"https://cses.fi/problemset/task/1673","difficulty":1,"starred":true,"topic":"bellman_ford","topics":["bellman_ford"],"solved":true},{"id":"cses_1197","judge":"CSES","title":"Cycle Finding","url":"https://cses.fi/problemset/task/1197/","difficulty":1,"starred":true,"topic":"bellman_ford","topics":["cycle_detection","bellman_ford"],"solved":true},{"id":"eolymp_1453","judge":"Eolymp","title":"Ford-Bellman","url":"https://www.eolymp.com/en/problems/1453","difficulty":1,"starred":false,"topic":"bellman_ford","topics":["bellman_ford"],"solved":false},{"id":"uva_423","judge":"UVa","title":"MPI Maelstrom","url":"https://vjudge.net/problem/UVA-423","difficulty":1,"starred":false,"topic":"bellman_ford","topics":["bellman_ford"],"solved":false},{"id":"uva_10099","judge":"UVa","title":"The Tourist Guide","url":"https://vjudge.net/problem/UVA-10099","difficulty":1,"starred":false,"topic":"bellman_ford","topics":["bellman_ford","spfa"],"solved":false},{"id":"uva_515","judge":"UVa","title":"King","url":"https://vjudge.net/problem/UVA-515","difficulty":1,"starred":false,"topic":"bellman_ford","topics":["bellman_ford"],"solved":false},{"id":"spoj_segments","judge":"SPOJ","title":"Segments","url":"https://www.spoj.com/problems/SEGMENTS/","difficulty":1,"starred":false,"topic":"bellman_ford","topics":["bellman_ford"],"solved":false},{"id":"lightoj_extended_traffic","judge":"LightOJ","title":"Extended Traffic","url":"https://lightoj.com/problem/extended-traffic","difficulty":2,"starred":false,"topic":"bellman_ford","topics":["bellman_ford"],"solved":false},{"id":"uva_11671","judge":"UVa","title":"Sign of Matrix","url":"https://vjudge.net/problem/UVA-11671","difficulty":2,"starred":true,"topic":"bellman_ford","topics":["bellman_ford","spfa"],"solved":false},{"id":"atcoder_abc404_g","judge":"AtCoder","title":"Specified Range Sums","url":"https://atcoder.jp/contests/abc404/tasks/abc404_g","difficulty":3,"starred":true,"topic":"bellman_ford","topics":["bellman_ford"],"solved":false},{"id":"cf_gym_101498l","judge":"CF Gym","title":"The Shortest Path","url":"https://codeforces.com/gym/101498/problem/L","difficulty":1,"starred":true,"topic":"spfa","topics":["spfa","johnsons_algorithm"],"solved":false},{"id":"spoj_jhnsn","judge":"SPOJ","title":"Johnsons Algorithm","url":"https://www.spoj.com/problems/JHNSN/","difficulty":1,"starred":true,"topic":"johnsons_algorithm","topics":["johnsons_algorithm"],"solved":false},{"id":"atcoder_abc237_e","judge":"AtCoder","title":"Skiing","url":"https://atcoder.jp/contests/abc237/tasks/abc237_e","difficulty":1,"starred":false,"topic":"johnsons_algorithm","topics":["johnsons_algorithm"],"solved":false},{"id":"codeforces_1063b","judge":"Codeforces","title":"Labyrinth","url":"https://codeforces.com/contest/1063/problem/B","difficulty":1,"starred":true,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"spoj_kaththi","judge":"SPOJ","title":"KATHTHI","url":"https://www.spoj.com/problems/KATHTHI/","difficulty":1,"starred":true,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"codeforces_821d","judge":"Codeforces","title":"Okabe and City","url":"https://codeforces.com/contest/821/problem/D","difficulty":1,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"codeforces_877d","judge":"Codeforces","title":"Olya and Energy Drinks","url":"https://codeforces.com/problemset/problem/877/D","difficulty":1,"starred":true,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"codeforces_173b","judge":"Codeforces","title":"Chamber of Secrets","url":"https://codeforces.com/problemset/problem/173/B","difficulty":1,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"boi13_tracks","judge":"oj.uz","title":"Tracks in the Snow","url":"https://oj.uz/problem/view/BOI13_tracks","difficulty":1,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"cf_gym_100625j","judge":"CF Gym","title":"Jailbreak","url":"https://codeforces.com/gym/100625/problem/J","difficulty":1,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"uva_11573","judge":"UVa","title":"Ocean Currents","url":"https://vjudge.net/problem/UVA-11573","difficulty":1,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"codechef_cc004","judge":"CodeChef","title":"Valentines Day","url":"https://www.codechef.com/problems/CC004","difficulty":1,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"atcoder_abc176_d","judge":"AtCoder","title":"Wizard in Maze","url":"https://atcoder.jp/contests/abc176/tasks/abc176_d","difficulty":1,"starred":true,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"atcoder_abc213_e","judge":"AtCoder","title":"Stronger Takahashi","url":"https://atcoder.jp/contests/abc213/tasks/abc213_e","difficulty":1,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"codeforces_590c","judge":"Codeforces","title":"Three States","url":"https://codeforces.com/problemset/problem/590/C","difficulty":2,"starred":true,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"codeforces_173c","judge":"Codeforces","title":"Spiral Maximum","url":"https://codeforces.com/problemset/problem/173/C","difficulty":2,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"codeforces_1341e","judge":"Codeforces","title":"Nastya and Unexpected Guest","url":"https://codeforces.com/contest/1341/problem/E","difficulty":2,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"atcoder_arc061_c","judge":"AtCoder","title":"Snuke's Subway Trip","url":"https://atcoder.jp/contests/arc061/tasks/arc061_c","difficulty":2,"starred":false,"topic":"0_1_bfs","topics":["0_1_bfs"],"solved":false},{"id":"acmsguru_99999314","judge":"Codeforces","title":"Shortest Paths","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/314","difficulty":4,"starred":false,"topic":"eppsteins_algorithm","topics":["eppsteins_algorithm"],"solved":false},{"id":"baekjoon_19133","judge":"Baekjoon","title":"Subset Sum","url":"https://www.acmicpc.net/problem/19133","difficulty":4,"starred":false,"topic":"eppsteins_algorithm","topics":["eppsteins_algorithm"],"solved":false},{"id":"baekjoon_14166","judge":"Baekjoon","title":"Robotic Cow Herd","url":"https://www.acmicpc.net/problem/14166","difficulty":4,"starred":false,"topic":"eppsteins_algorithm","topics":["eppsteins_algorithm"],"solved":false},{"id":"baekjoon_19616","judge":"Baekjoon","title":"Shopping Plans","url":"https://www.acmicpc.net/problem/19616","difficulty":4,"starred":false,"topic":"eppsteins_algorithm","topics":["eppsteins_algorithm"],"solved":false},{"id":"cf_gym_102979l","judge":"CF Gym","title":"Lights On The Road","url":"https://codeforces.com/gym/102979/problem/L","difficulty":4,"starred":false,"topic":"eppsteins_algorithm","topics":["eppsteins_algorithm"],"solved":false},{"id":"cf_gym_101398a","judge":"CF Gym","title":"Admiral","url":"https://codeforces.com/gym/101398/problem/A","difficulty":1,"starred":true,"topic":"suurballes_algorithm","topics":["suurballes_algorithm","min_cost_max_flow"],"solved":false},{"id":"bubblecup_booklet2015.pdf","judge":"Bubblecup","title":"Boa viagem, Roim","url":"https://bubblecup.org/Content/Media/Booklet2015.pdf","difficulty":1,"starred":false,"topic":"suurballes_algorithm","topics":["suurballes_algorithm"],"solved":false},{"id":"yandex_17756i","judge":"Yandex","title":"Interest","url":"https://official.contest.yandex.ru/opencupXX/contest/17756/problems/I/","difficulty":null,"starred":true,"topic":"suurballes_algorithm","topics":["suurballes_algorithm"],"solved":false},{"id":"hackerrank_pacman_astar","judge":"HackerRank","title":"Pacman A*","url":"https://vjudge.net/problem/HackerRank-pacman-astar","difficulty":2,"starred":false,"topic":"a_star_algorithm","topics":["a_star_algorithm"],"solved":false},{"id":"hackerrank_pacman_ucs","judge":"HackerRank","title":"Pacman - UCS","url":"https://vjudge.net/problem/HackerRank-pacman-ucs","difficulty":2,"starred":false,"topic":"a_star_algorithm","topics":["a_star_algorithm"],"solved":false},{"id":"spoj_rapregui","judge":"SPOJ","title":"A rã saltadora preguiçosa","url":"https://br.spoj.com/problems/RAPREGUI/","difficulty":null,"starred":true,"topic":"a_star_algorithm","topics":["a_star_algorithm"],"solved":false},{"id":"dmoj_coci09c2p5","judge":"DMOJ","title":"Poslozi","url":"https://dmoj.ca/problem/coci09c2p5","difficulty":3,"starred":false,"topic":"a_star_algorithm","topics":["a_star_algorithm"],"solved":false},{"id":"cses_1669","judge":"CSES","title":"Round Trip","url":"https://cses.fi/problemset/task/1669","difficulty":1,"starred":true,"topic":"cycle_detection","topics":["cycle_detection"],"solved":true},{"id":"cses_1678","judge":"CSES","title":"Round Trip II","url":"https://cses.fi/problemset/task/1678/","difficulty":1,"starred":true,"topic":"cycle_detection","topics":["cycle_detection"],"solved":true},{"id":"yosupo_cycle_detection","judge":"Library Checker","title":"Cycle Detection (Directed)","url":"https://judge.yosupo.jp/problem/cycle_detection","difficulty":1,"starred":true,"topic":"cycle_detection","topics":["cycle_detection"],"solved":false},{"id":"spoj_ucv2013b","judge":"SPOJ","title":"Alice in Amsterdam, I mean Wonderland","url":"https://www.spoj.com/problems/UCV2013B/","difficulty":1,"starred":false,"topic":"cycle_detection","topics":["cycle_detection"],"solved":false},{"id":"yosupo_cycle_detection_undirected","judge":"Library Checker","title":"Cycle Detection (Undirected)","url":"https://judge.yosupo.jp/problem/cycle_detection_undirected","difficulty":1,"starred":true,"topic":"cycle_detection","topics":["cycle_detection"],"solved":false},{"id":"codeforces_263d","judge":"Codeforces","title":"Cycle in Graph","url":"https://codeforces.com/contest/263/problem/D","difficulty":2,"starred":false,"topic":"cycle_detection","topics":["cycle_detection"],"solved":false},{"id":"codeforces_1454e","judge":"Codeforces","title":"Number of Simple Paths","url":"https://codeforces.com/contest/1454/problem/E","difficulty":2,"starred":true,"topic":"cycle_detection","topics":["cycle_detection"],"solved":false},{"id":"leetcode_linked_list_cycle","judge":"LeetCode","title":"Linked List Cycle","url":"https://leetcode.com/problems/linked-list-cycle/","difficulty":1,"starred":false,"topic":"cycle_detection","topics":["cycle_detection"],"solved":true},{"id":"codeforces_2044g1","judge":"Codeforces","title":"Medium Demon Problem (easy version)","url":"https://codeforces.com/contest/2044/problem/G1","difficulty":2,"starred":false,"topic":"cycle_detection","topics":["cycle_detection","functional_graphs"],"solved":false},{"id":"cf_gym_100917f","judge":"CF Gym","title":"Find the Length","url":"https://codeforces.com/gym/100917/problem/F","difficulty":1,"starred":true,"topic":"minimum_weight_cycle_for_each_vertex","topics":["minimum_weight_cycle_for_each_vertex"],"solved":false},{"id":"lightoj_ride_sharing_dilemma","judge":"LightOJ","title":"Ride Sharing Dilemma","url":"https://lightoj.com/problem/ride-sharing-dilemma","difficulty":1,"starred":true,"topic":"minimum_weight_cycle_for_each_edge","topics":["minimum_weight_cycle_for_each_edge"],"solved":false},{"id":"uva_11090","judge":"UVa","title":"Going in Cycle!!","url":"https://vjudge.net/problem/UVA-11090","difficulty":1,"starred":false,"topic":"minimum_mean_weight_cycle","topics":["minimum_mean_weight_cycle"],"solved":false},{"id":"spoj_wordring","judge":"SPOJ","title":"Word Rings","url":"https://www.spoj.com/problems/WORDRING/","difficulty":1,"starred":true,"topic":"minimum_mean_weight_cycle","topics":["minimum_mean_weight_cycle"],"solved":false},{"id":"yosupo_enumerate_triangles","judge":"Library Checker","title":"Enumerate Triangles","url":"https://judge.yosupo.jp/problem/enumerate_triangles","difficulty":1,"starred":true,"topic":"number_of_3_and_4_length_cycles","topics":["number_of_3_and_4_length_cycles"],"solved":false},{"id":"cf_gym_102028l","judge":"CF Gym","title":"Connected Subgraphs","url":"https://codeforces.com/gym/102028/problem/L","difficulty":3,"starred":true,"topic":"number_of_3_and_4_length_cycles","topics":["number_of_3_and_4_length_cycles"],"solved":false},{"id":"codeforces_613d","judge":"Codeforces","title":"Kingdom and its Cities","url":"https://codeforces.com/contest/613/problem/D","difficulty":2,"starred":true,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"hackerrank_wccity","judge":"HackerRank","title":"World Cup City","url":"https://www.hackerrank.com/contests/worldcupsemifinals/challenges/wccity/problem","difficulty":2,"starred":true,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"codeforces_1292d","judge":"Codeforces","title":"Chaotic V.","url":"https://codeforces.com/contest/1292/problem/D","difficulty":2,"starred":false,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"hackerrank_kittys_calculations_on_a_tree","judge":"HackerRank","title":"Kitty's Calculations on a Tree","url":"https://www.hackerrank.com/contests/hourrank-15/challenges/kittys-calculations-on-a-tree/problem","difficulty":2,"starred":true,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"codechef_yatp","judge":"CodeChef","title":"Yet Another Tree Problem","url":"https://www.codechef.com/DEC21A/problems/YATP","difficulty":2,"starred":true,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"atcoder_abc340_g","judge":"AtCoder","title":"Leaf Color","url":"https://atcoder.jp/contests/abc340/tasks/abc340_g","difficulty":2,"starred":false,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"codechef_adjleaf2","judge":"CodeChef","title":"Adjacent Leaves","url":"https://www.codechef.com/problems/ADJLEAF2","difficulty":2,"starred":false,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"codechef_icl1705","judge":"CodeChef","title":"Tree Obsession","url":"https://www.codechef.com/problems/ICL1705","difficulty":null,"starred":false,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"codeforces_1681f","judge":"Codeforces","title":"Unique Occurrences","url":"https://codeforces.com/contest/1681/problem/F","difficulty":2,"starred":true,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"codeforces_1320e","judge":"Codeforces","title":"Treeland and Viruses","url":"https://codeforces.com/contest/1320/problem/E","difficulty":3,"starred":false,"topic":"virtual_tree","topics":["virtual_tree"],"solved":false},{"id":"cses_1133","judge":"CSES","title":"Tree Distances II","url":"https://cses.fi/problemset/task/1133","difficulty":1,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"codeforces_1092f","judge":"Codeforces","title":"Tree with Maximum Cost","url":"https://codeforces.com/contest/1092/problem/F","difficulty":1,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"codeforces_219d","judge":"Codeforces","title":"Choosing Capital for Treeland","url":"https://codeforces.com/contest/219/problem/D","difficulty":1,"starred":false,"topic":"rerooting_technique","topics":["dp_on_trees_and_dags","rerooting_technique"],"solved":false},{"id":"codeforces_1324f","judge":"Codeforces","title":"Maximum White Subtree","url":"https://codeforces.com/contest/1324/problem/F","difficulty":1,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"atcoder_dp_v","judge":"AtCoder","title":"Subtree","url":"https://atcoder.jp/contests/dp/tasks/dp_v","difficulty":2,"starred":true,"topic":"rerooting_technique","topics":["dp_on_trees_and_dags","rerooting_technique"],"solved":false},{"id":"codeforces_1187e","judge":"Codeforces","title":"Tree Painting","url":"https://codeforces.com/contest/1187/problem/E","difficulty":2,"starred":false,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"atcoder_abc220_f","judge":"AtCoder","title":"Distance Sums 2","url":"https://atcoder.jp/contests/abc220/tasks/abc220_f","difficulty":2,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"baekjoon_14875","judge":"Baekjoon","title":"City Attractions","url":"https://www.acmicpc.net/problem/14875","difficulty":2,"starred":false,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"atcoder_abc160_f","judge":"AtCoder","title":"Distributing Integers","url":"https://atcoder.jp/contests/abc160/tasks/abc160_f","difficulty":2,"starred":false,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"codeforces_960e","judge":"Codeforces","title":"Alternating Tree","url":"https://codeforces.com/contest/960/problem/E","difficulty":2,"starred":false,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"atcoder_abc149_f","judge":"AtCoder","title":"Surrounded Nodes","url":"https://atcoder.jp/contests/abc149/tasks/abc149_f","difficulty":2,"starred":false,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"atcoder_abc223_g","judge":"AtCoder","title":"Vertex Deletion","url":"https://atcoder.jp/contests/abc223/tasks/abc223_g","difficulty":2,"starred":false,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"atcoder_abc222_f","judge":"AtCoder","title":"Expensive Expense","url":"https://atcoder.jp/contests/abc222/tasks/abc222_f","difficulty":2,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"codeforces_543d","judge":"Codeforces","title":"Road Improvement","url":"https://codeforces.com/contest/543/problem/D","difficulty":2,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"codeforces_852e","judge":"Codeforces","title":"Casinos and travel","url":"https://codeforces.com/contest/852/problem/E","difficulty":2,"starred":false,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"dmoj_apio10p2","judge":"DMOJ","title":"Patrol","url":"https://dmoj.ca/problem/apio10p2","difficulty":3,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"izho17_road","judge":"oj.uz","title":"Hard route","url":"https://oj.uz/problem/view/IZhO17_road","difficulty":3,"starred":false,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"cf_group_363472a","judge":"Codeforces","title":"is-this-rerooting","url":"https://codeforces.com/group/qepOKX6Mi9/contest/363472/problem/A","difficulty":3,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"codeforces_1402c","judge":"Codeforces","title":"Star Trek","url":"https://codeforces.com/contest/1402/problem/C","difficulty":4,"starred":false,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"yosupo_tree_path_composite_sum","judge":"Library Checker","title":"Tree Path Composite Sum","url":"https://judge.yosupo.jp/problem/tree_path_composite_sum","difficulty":2,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"codeforces_1882d","judge":"Codeforces","title":"Tree XOR","url":"https://codeforces.com/problemset/problem/1882/D","difficulty":2,"starred":false,"topic":"rerooting_technique","topics":["dp_on_trees_and_dags","rerooting_technique"],"solved":false},{"id":"spoj_treesum","judge":"SPOJ","title":"Tree Sum","url":"https://www.spoj.com/problems/TREESUM/","difficulty":3,"starred":true,"topic":"rerooting_technique","topics":["rerooting_technique"],"solved":false},{"id":"codeforces_1083c","judge":"Codeforces","title":"Max Mex","url":"https://codeforces.com/problemset/problem/1083/C","difficulty":2,"starred":true,"topic":"path_union","topics":["path_union"],"solved":false},{"id":"codeforces_1527d","judge":"Codeforces","title":"MEX Tree","url":"https://codeforces.com/problemset/problem/1527/D","difficulty":2,"starred":true,"topic":"path_union","topics":["path_union"],"solved":false},{"id":"cf_gym_102040f","judge":"CF Gym","title":"Path Intersection","url":"https://codeforces.com/gym/102040/problem/F","difficulty":2,"starred":true,"topic":"path_intersection","topics":["path_intersection"],"solved":false},{"id":"yosupo_frequency_table_of_tree_distance","judge":"Library Checker","title":"Frequency Table of Tree Distance","url":"https://judge.yosupo.jp/problem/frequency_table_of_tree_distance","difficulty":2,"starred":true,"topic":"number_of_paths_of_each_length_in_a_tree","topics":["fft","number_of_paths_of_each_length_in_a_tree"],"solved":false},{"id":"codeforces_1192b","judge":"Codeforces","title":"Dynamic Diameter","url":"https://codeforces.com/contest/1192/problem/B","difficulty":2,"starred":true,"topic":"dynamic_diameter_online","topics":["dynamic_diameter_online"],"solved":false},{"id":"szkopul_3bbt_3vusu78usxtqswajzvo","judge":"Szkopuł","title":"Polarization","url":"https://szkopul.edu.pl/problemset/problem/3bBT-3VuSu78UsxTQSwaJzVo/site/?key=statement","difficulty":2,"starred":true,"topic":"tree_orientation_to_maximize_pairs_of_reachable_nodes","topics":["tree_orientation_to_maximize_pairs_of_reachable_nodes"],"solved":false},{"id":"yosupo_two_sat","judge":"Library Checker","title":"2 Sat","url":"https://judge.yosupo.jp/problem/two_sat","difficulty":1,"starred":true,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"cses_1684","judge":"CSES","title":"Giant Pizza","url":"https://cses.fi/problemset/task/1684/","difficulty":1,"starred":true,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"eolymp_7538","judge":"Eolymp","title":"Flipping Cards","url":"https://www.eolymp.com/en/problems/7538","difficulty":1,"starred":false,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"codeforces_1475f","judge":"Codeforces","title":"Unusual Matrix","url":"https://codeforces.com/contest/1475/problem/F","difficulty":1,"starred":true,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"codeforces_776d","judge":"Codeforces","title":"The Door Problem","url":"https://codeforces.com/contest/776/problem/D","difficulty":1,"starred":true,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"codechef_hkrman","judge":"CodeChef","title":"Hackerman","url":"https://www.codechef.com/LTIME95A/problems/HKRMAN","difficulty":1,"starred":false,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"kattis_illumination","judge":"Kattis","title":"Illumination","url":"https://open.kattis.com/problems/illumination","difficulty":1,"starred":false,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"atcoder_abc210_f","judge":"AtCoder","title":"Coprime Solitaire","url":"https://atcoder.jp/contests/abc210/tasks/abc210_f","difficulty":2,"starred":true,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"cf_gym_102412h","judge":"CF Gym","title":"Mex on DAG","url":"https://codeforces.com/gym/102412/problem/H","difficulty":2,"starred":true,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"codeforces_1218i","judge":"Codeforces","title":"The Light Square","url":"https://codeforces.com/problemset/problem/1218/I","difficulty":2,"starred":true,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"uva_11930","judge":"UVa","title":"Rectangles","url":"https://vjudge.net/problem/UVA-11930","difficulty":2,"starred":false,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"codeforces_1215f","judge":"Codeforces","title":"Radio Stations","url":"https://codeforces.com/problemset/problem/1215/F","difficulty":3,"starred":false,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"codeforces_1971h","judge":"Codeforces","title":"±1","url":"https://codeforces.com/contest/1971/problem/H","difficulty":1,"starred":true,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"codeforces_1007d","judge":"Codeforces","title":"Ants","url":"https://codeforces.com/problemset/problem/1007/D","difficulty":3,"starred":false,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"codedrills_exam_requirements","judge":"CodeDrills","title":"Exam Requirements","url":"https://codedrills.io/contests/icpc-amritapuri-2022-regional-round/problems/exam-requirements","difficulty":3,"starred":true,"topic":"2_sat","topics":["2_sat"],"solved":false},{"id":"uva_11478","judge":"UVa","title":"Halum","url":"https://vjudge.net/problem/UVA-11478","difficulty":1,"starred":false,"topic":"system_of_difference_constraints","topics":["system_of_difference_constraints"],"solved":false},{"id":"toph_playing_on_a_directed_graph","judge":"Toph","title":"Playing On A Directed Graph","url":"https://toph.co/p/playing-on-a-directed-graph","difficulty":1,"starred":true,"topic":"system_of_difference_constraints","topics":["system_of_difference_constraints"],"solved":false},{"id":"wcipeg_noi99p1","judge":"PEG","title":"01 Sequence","url":"https://wcipeg.com/problem/noi99p1","difficulty":2,"starred":false,"topic":"system_of_difference_constraints","topics":["system_of_difference_constraints"],"solved":false},{"id":"poj_1201","judge":"POJ","title":"Intervals","url":"https://vjudge.net/problem/POJ-1201","difficulty":2,"starred":false,"topic":"system_of_difference_constraints","topics":["system_of_difference_constraints"],"solved":false},{"id":"rmi19_restore","judge":"oj.uz","title":"Restore Array","url":"https://oj.uz/problem/view/RMI19_restore","difficulty":null,"starred":false,"topic":"system_of_difference_constraints","topics":["system_of_difference_constraints"],"solved":false},{"id":"yosupo_eulerian_trail_directed","judge":"Library Checker","title":"Eulerian Trail (Directed)","url":"https://judge.yosupo.jp/problem/eulerian_trail_directed","difficulty":1,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"yosupo_eulerian_trail_undirected","judge":"Library Checker","title":"Eulerian Trail (Undirected)","url":"https://judge.yosupo.jp/problem/eulerian_trail_undirected","difficulty":1,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"cses_1693","judge":"CSES","title":"Teleporters Path","url":"https://cses.fi/problemset/task/1693/","difficulty":1,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"codeforces_508d","judge":"Codeforces","title":"Tanya and Password","url":"https://codeforces.com/contest/508/problem/D","difficulty":1,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"cses_1691","judge":"CSES","title":"Mail Delivery","url":"https://cses.fi/problemset/task/1691/","difficulty":1,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"codeforces_723e","judge":"Codeforces","title":"One-Way Reform","url":"https://codeforces.com/contest/723/problem/E","difficulty":1,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"boi14_postmen","judge":"oj.uz","title":"Senior Postmen","url":"https://oj.uz/problem/view/BOI14_postmen","difficulty":1,"starred":false,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"spoj_words1","judge":"SPOJ","title":"Play on Words","url":"https://www.spoj.com/problems/WORDS1/","difficulty":1,"starred":false,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"csacademy_matching_substrings","judge":"CS Academy","title":"Matching Substrings","url":"https://csacademy.com/contest/archive/task/matching-substrings/statement/","difficulty":null,"starred":true,"topic":"eulerian_path_and_cycle","topics":["de_bruijn_sequence","eulerian_path_and_cycle"],"solved":false},{"id":"codeforces_1361c","judge":"Codeforces","title":"Johnny and Megan's Necklace","url":"https://codeforces.com/contest/1361/problem/C","difficulty":2,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"codeforces_1981d","judge":"Codeforces","title":"Turtle and Multiplication","url":"https://codeforces.com/contest/1981/problem/D","difficulty":2,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"baekjoon_13973","judge":"Baekjoon","title":"Acrobat","url":"https://www.acmicpc.net/problem/13973","difficulty":2,"starred":false,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"codeforces_788b","judge":"Codeforces","title":"Weird journey","url":"https://codeforces.com/problemset/problem/788/B","difficulty":2,"starred":false,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"toph_red_blue_graph","judge":"Toph","title":"Red Blue Graph","url":"https://toph.co/p/red-blue-graph","difficulty":2,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"codeforces_528c","judge":"Codeforces","title":"Data Center Drama","url":"https://codeforces.com/contest/528/problem/C","difficulty":3,"starred":false,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"codeforces_2110e","judge":"Codeforces","title":"Melody","url":"https://codeforces.com/contest/2110/problem/E","difficulty":1,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"codeforces_1634e","judge":"Codeforces","title":"Fair Share","url":"https://codeforces.com/contest/1634/problem/E","difficulty":2,"starred":true,"topic":"eulerian_path_and_cycle","topics":["eulerian_path_and_cycle"],"solved":false},{"id":"codechef_tools","judge":"CodeChef","title":"Fetching Cooking Tools","url":"https://www.codechef.com/problems/TOOLS","difficulty":1,"starred":false,"topic":"hamiltonian_path_and_cycle","topics":["hamiltonian_path_and_cycle"],"solved":false},{"id":"uva_775","judge":"UVa","title":"Hamiltonian Cycle","url":"https://vjudge.net/problem/UVA-775","difficulty":1,"starred":true,"topic":"hamiltonian_path_and_cycle","topics":["backtracking","hamiltonian_path_and_cycle"],"solved":false},{"id":"cses_1690","judge":"CSES","title":"Hamiltonian Flights","url":"https://cses.fi/problemset/task/1690","difficulty":1,"starred":true,"topic":"hamiltonian_path_and_cycle","topics":["hamiltonian_path_and_cycle","bitmask_dp"],"solved":false},{"id":"atcoder_arc118_d","judge":"AtCoder","title":"Hamiltonian Cycle","url":"https://atcoder.jp/contests/arc118/tasks/arc118_d","difficulty":2,"starred":false,"topic":"hamiltonian_path_heuristic_algorithm","topics":["hamiltonian_path_heuristic_algorithm"],"solved":false},{"id":"joi21_aerobatics","judge":"oj.uz","title":"Aerobatics","url":"https://oj.uz/problem/view/JOI21_aerobatics","difficulty":3,"starred":false,"topic":"hamiltonian_path_heuristic_algorithm","topics":["hamiltonian_path_heuristic_algorithm"],"solved":false},{"id":"codeforces_1105e","judge":"Codeforces","title":"Helping Hiasat","url":"https://codeforces.com/contest/1105/problem/E","difficulty":1,"starred":true,"topic":"maximum_clique","topics":["maximum_clique","maximum_independent_set"],"solved":false},{"id":"codeforces_527d","judge":"Codeforces","title":"Clique Problem","url":"https://codeforces.com/problemset/problem/527/D","difficulty":1,"starred":false,"topic":"maximum_clique","topics":["maximum_clique"],"solved":false},{"id":"kattis_friends","judge":"Kattis","title":"All Friends","url":"https://open.kattis.com/problems/friends","difficulty":2,"starred":true,"topic":"maximum_clique","topics":["maximum_clique"],"solved":false},{"id":"codeforces_566f","judge":"Codeforces","title":"Clique in the Divisibility Graph","url":"https://codeforces.com/problemset/problem/566/F","difficulty":2,"starred":true,"topic":"maximum_clique","topics":["maximum_clique","poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"codeforces_1529e","judge":"Codeforces","title":"Trees of Tranquillity","url":"https://codeforces.com/problemset/problem/1529/E","difficulty":2,"starred":false,"topic":"maximum_clique","topics":["maximum_clique"],"solved":false},{"id":"codeforces_1948e","judge":"Codeforces","title":"Clique Partition","url":"https://codeforces.com/problemset/problem/1948/E","difficulty":2,"starred":false,"topic":"maximum_clique","topics":["maximum_clique"],"solved":false},{"id":"codeforces_1439b","judge":"Codeforces","title":"Graph Subset Problem","url":"https://codeforces.com/problemset/problem/1439/B","difficulty":2,"starred":false,"topic":"maximum_clique","topics":["maximum_clique"],"solved":false},{"id":"yosupo_enumerate_cliques","judge":"Library Checker","title":"Enumerate Cliques","url":"https://judge.yosupo.jp/problem/enumerate_cliques","difficulty":4,"starred":true,"topic":"maximum_clique","topics":["maximum_clique","backtracking"],"solved":false},{"id":"yosupo_maximum_independent_set","judge":"Library Checker","title":"Maximum Independent Set","url":"https://judge.yosupo.jp/problem/maximum_independent_set","difficulty":1,"starred":true,"topic":"maximum_independent_set","topics":["maximum_independent_set","bitmask_dp","meet_in_the_middle"],"solved":false},{"id":"spoj_maxiset","judge":"SPOJ","title":"Maximal Independent Set","url":"https://www.spoj.com/problems/MAXISET/","difficulty":2,"starred":true,"topic":"maximum_independent_set","topics":["maximum_independent_set"],"solved":false},{"id":"kattis_sensor","judge":"Kattis","title":"Sensor Network","url":"https://vjudge.net/problem/Kattis-sensor","difficulty":2,"starred":true,"topic":"maximum_independent_set","topics":["maximum_independent_set"],"solved":false},{"id":"codeforces_1198c","judge":"Codeforces","title":"Matching vs Independent Set","url":"https://codeforces.com/problemset/problem/1198/C","difficulty":2,"starred":false,"topic":"maximum_independent_set","topics":["maximum_independent_set"],"solved":false},{"id":"yosupo_chromatic_number","judge":"Library Checker","title":"Chromatic Number","url":"https://judge.yosupo.jp/problem/chromatic_number","difficulty":1,"starred":true,"topic":"chromatic_number","topics":["chromatic_number"],"solved":false},{"id":"kattis_coloring","judge":"Kattis","title":"Coloring Graphs","url":"https://open.kattis.com/problems/coloring","difficulty":1,"starred":true,"topic":"chromatic_number","topics":["chromatic_number","welsh_powell_algorithm"],"solved":false},{"id":"codeforces_100482a","judge":"CF Gym","title":"Colorful Tree","url":"https://codeforces.com/problemset/gymProblem/100482/A","difficulty":1,"starred":false,"topic":"chromatic_number","topics":["chromatic_number"],"solved":false},{"id":"codechef_vbr","judge":"CodeChef","title":"Vibrating Paths (Challenge)","url":"https://www.codechef.com/problems/VBR","difficulty":4,"starred":false,"topic":"welsh_powell_algorithm","topics":["welsh_powell_algorithm"],"solved":false},{"id":"yosupo_chromatic_polynomial","judge":"Library Checker","title":"Chromatic Polynomial","url":"https://judge.yosupo.jp/problem/chromatic_polynomial","difficulty":1,"starred":true,"topic":"chromatic_polynomial_ft_number_of_dags","topics":["chromatic_polynomial_ft_number_of_dags"],"solved":false},{"id":"codeforces_1193a","judge":"Codeforces","title":"Amusement Park","url":"https://codeforces.com/contest/1193/problem/A","difficulty":3,"starred":true,"topic":"chromatic_polynomial_ft_number_of_dags","topics":["chromatic_polynomial_ft_number_of_dags"],"solved":false},{"id":"baekjoon_10446","judge":"Baekjoon","title":"Algorist Club","url":"https://www.acmicpc.net/problem/10446","difficulty":1,"starred":true,"topic":"edge_coloring_of_simple_graph","topics":["edge_coloring_of_simple_graph"],"solved":false},{"id":"cf_gym_101933g","judge":"CF Gym","title":"Game Scheduling","url":"https://codeforces.com/gym/101933/problem/G","difficulty":2,"starred":false,"topic":"edge_coloring_of_simple_graph","topics":["edge_coloring_of_simple_graph"],"solved":false},{"id":"codeforces_600f","judge":"Codeforces","title":"Edge coloring of bipartite graph","url":"https://codeforces.com/contest/600/problem/F","difficulty":1,"starred":true,"topic":"edge_coloring_of_bipartite_graph","topics":["edge_coloring_of_bipartite_graph"],"solved":false},{"id":"codeforces_212a","judge":"Codeforces","title":"Privatization","url":"https://codeforces.com/contest/212/problem/A","difficulty":2,"starred":true,"topic":"edge_coloring_of_bipartite_graph","topics":["edge_coloring_of_bipartite_graph"],"solved":false},{"id":"codeforces_1240f","judge":"Codeforces","title":"Football","url":"https://codeforces.com/contest/1240/problem/F","difficulty":2,"starred":true,"topic":"edge_coloring_of_bipartite_graph","topics":["edge_coloring_of_bipartite_graph"],"solved":false},{"id":"yandex_17756g","judge":"Yandex","title":"Choreography","url":"https://official.contest.yandex.ru/opencupXX/contest/17756/problems/G/","difficulty":2,"starred":false,"topic":"edge_coloring_of_bipartite_graph","topics":["edge_coloring_of_bipartite_graph"],"solved":false},{"id":"coci18_teoreticar","judge":"oj.uz","title":"Teoreticar","url":"https://oj.uz/problem/view/COCI18_teoreticar","difficulty":2,"starred":false,"topic":"edge_coloring_of_bipartite_graph","topics":["edge_coloring_of_bipartite_graph"],"solved":false},{"id":"acmsguru_99999286","judge":"Codeforces","title":"Ancient decoration","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/286","difficulty":2,"starred":false,"topic":"edge_coloring_of_bipartite_graph","topics":["edge_coloring_of_bipartite_graph"],"solved":false},{"id":"yosupo_bipartite_edge_coloring","judge":"Library Checker","title":"Edge Coloring of Bipartite Graph","url":"https://judge.yosupo.jp/problem/bipartite_edge_coloring","difficulty":null,"starred":true,"topic":"edge_coloring_of_bipartite_graph","topics":["edge_coloring_of_bipartite_graph"],"solved":false},{"id":"atcoder_agc037_d","judge":"AtCoder","title":"Sorting a Grid","url":"https://atcoder.jp/contests/agc037/tasks/agc037_d","difficulty":3,"starred":false,"topic":"edge_coloring_of_bipartite_graph","topics":["edge_coloring_of_bipartite_graph"],"solved":false},{"id":"cses_1134","judge":"CSES","title":"Prüfer Code","url":"https://cses.fi/problemset/task/1134","difficulty":1,"starred":true,"topic":"prufer_code","topics":["prufer_code"],"solved":false},{"id":"timus_1069","judge":"Timus","title":"Prufer Code","url":"https://acm.timus.ru/problem.aspx?space=1&num=1069","difficulty":1,"starred":false,"topic":"prufer_code","topics":["prufer_code"],"solved":false},{"id":"uva_1784","judge":"UVa","title":"Anne's game","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=20&page=show_problem&problem=1784","difficulty":1,"starred":false,"topic":"prufer_code","topics":["prufer_code"],"solved":false},{"id":"codeforces_156d","judge":"Codeforces","title":"Clues","url":"https://codeforces.com/contest/156/problem/D","difficulty":1,"starred":true,"topic":"prufer_code","topics":["prufer_code"],"solved":false},{"id":"codechef_combiisfun","judge":"CodeChef","title":"Combinatorics Is Fun","url":"https://www.codechef.com/problems/COMBIISFUN","difficulty":3,"starred":true,"topic":"prufer_code","topics":["prufer_code"],"solved":false},{"id":"uva_4835","judge":"UVa","title":"Curious Guardians","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4835","difficulty":2,"starred":true,"topic":"prufer_code","topics":["prufer_code"],"solved":false},{"id":"toph_the_selection","judge":"Toph","title":"The Selection","url":"https://toph.co/p/the-selection","difficulty":2,"starred":true,"topic":"prufer_code","topics":["prufer_code"],"solved":false},{"id":"yosupo_counting_spanning_tree_directed","judge":"Library Checker","title":"Counting Spanning Trees (Directed)","url":"https://judge.yosupo.jp/problem/counting_spanning_tree_directed","difficulty":1,"starred":true,"topic":"tuttes_theorem_ft_arborescences_in_a_graph","topics":["tuttes_theorem_ft_arborescences_in_a_graph"],"solved":false},{"id":"spoj_dagcnt","judge":"SPOJ","title":"Counting Arborescence","url":"https://www.spoj.com/problems/DAGCNT/","difficulty":1,"starred":true,"topic":"tuttes_theorem_ft_arborescences_in_a_graph","topics":["tuttes_theorem_ft_arborescences_in_a_graph"],"solved":false},{"id":"yosupo_counting_eulerian_circuits","judge":"Library Checker","title":"Counting Eulerian Circuits","url":"https://judge.yosupo.jp/problem/counting_eulerian_circuits","difficulty":1,"starred":true,"topic":"best_theorem","topics":["best_theorem"],"solved":false},{"id":"atcoder_abc336_g","judge":"AtCoder","title":"16 Integers","url":"https://atcoder.jp/contests/abc336/tasks/abc336_g","difficulty":3,"starred":true,"topic":"best_theorem","topics":["best_theorem"],"solved":false},{"id":"cses_2138","judge":"CSES","title":"Reachable Nodes","url":"https://cses.fi/problemset/task/2138","difficulty":1,"starred":true,"topic":"dag_reachability","topics":["dag_reachability"],"solved":false},{"id":"spoj_dagcnt2","judge":"SPOJ","title":"Counting in a DAG","url":"https://www.spoj.com/problems/DAGCNT2/","difficulty":null,"starred":true,"topic":"dag_reachability","topics":["dag_reachability"],"solved":false},{"id":"codeforces_1062f","judge":"Codeforces","title":"Upgrading Cities","url":"https://codeforces.com/contest/1062/problem/F","difficulty":2,"starred":true,"topic":"dag_reachability","topics":["dag_reachability"],"solved":false},{"id":"cf_gym_103003e","judge":"CF Gym","title":"Dream and the Multiverse","url":"https://codeforces.com/gym/103003/problem/E","difficulty":2,"starred":true,"topic":"dag_reachability","topics":["dag_reachability"],"solved":false},{"id":"codeforces_1795g","judge":"Codeforces","title":"Removal Sequences","url":"https://codeforces.com/problemset/problem/1795/G","difficulty":3,"starred":false,"topic":"dag_reachability","topics":["degree_sequences","dag_reachability"],"solved":false},{"id":"atcoder_agc041_e","judge":"AtCoder","title":"Balancing Network","url":"https://atcoder.jp/contests/agc041/tasks/agc041_e","difficulty":3,"starred":false,"topic":"dag_reachability","topics":["dag_reachability"],"solved":false},{"id":"spoj_ghosts","judge":"SPOJ","title":"Ghosts having fun","url":"https://www.spoj.com/problems/GHOSTS/","difficulty":2,"starred":true,"topic":"dynamic_dag_reachability","topics":["dynamic_dag_reachability"],"solved":false},{"id":"cf_gym_100513l","judge":"CF Gym","title":"Useful Roads","url":"https://codeforces.com/gym/100513/problem/L","difficulty":null,"starred":true,"topic":"dominator_tree","topics":["dominator_tree"],"solved":false},{"id":"codechef_graphcnt","judge":"CodeChef","title":"Counting on a directed graph","url":"https://www.codechef.com/problems/GRAPHCNT","difficulty":2,"starred":false,"topic":"dominator_tree","topics":["dominator_tree"],"solved":false},{"id":"cf_gym_101741l","judge":"CF Gym","title":"Increasing Costs","url":"https://codeforces.com/gym/101741/problem/L","difficulty":2,"starred":true,"topic":"dominator_tree","topics":["dominator_tree"],"solved":false},{"id":"yandex_4227c","judge":"Yandex","title":"Two Paths","url":"https://official.contest.yandex.ru/opencupXVII/contest/4227/problems/C/","difficulty":2,"starred":false,"topic":"dominator_tree","topics":["dominator_tree"],"solved":false},{"id":"yosupo_dominatortree","judge":"Library Checker","title":"Dominator Tree","url":"https://judge.yosupo.jp/problem/dominatortree","difficulty":1,"starred":true,"topic":"dominator_tree","topics":["dominator_tree"],"solved":false},{"id":"cf_gym_102361f","judge":"CF Gym","title":"Forest Program","url":"https://codeforces.com/gym/102361/problem/F","difficulty":1,"starred":true,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"codeforces_856d","judge":"Codeforces","title":"Masha and Cactus","url":"https://codeforces.com/problemset/problem/856/D","difficulty":2,"starred":false,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"codeforces_1510c","judge":"Codeforces","title":"Cactus Not Enough","url":"https://codeforces.com/problemset/problem/1510/C","difficulty":3,"starred":false,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"cf_gym_102201c","judge":"CF Gym","title":"Cactus Determinant","url":"https://codeforces.com/gym/102201/problem/C","difficulty":3,"starred":false,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"cf_gym_102441g","judge":"CF Gym","title":"Sum of Distances in Cactus","url":"https://codeforces.com/gym/102441/problem/G","difficulty":3,"starred":true,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"codeforces_980f","judge":"Codeforces","title":"Cactus to Tree","url":"https://codeforces.com/problemset/problem/980/F","difficulty":3,"starred":false,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"codeforces_720b","judge":"Codeforces","title":"Cactusophobia","url":"https://codeforces.com/problemset/problem/720/B","difficulty":null,"starred":true,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"codeforces_379g","judge":"Codeforces","title":"New Year Cactus","url":"https://codeforces.com/problemset/problem/379/G","difficulty":4,"starred":false,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"codeforces_1268e","judge":"Codeforces","title":"Happy Cactus","url":"https://codeforces.com/problemset/problem/1268/E","difficulty":4,"starred":false,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"cf_gym_102391e","judge":"CF Gym","title":"Dead Cacti Society","url":"https://codeforces.com/gym/102391/problem/E","difficulty":4,"starred":false,"topic":"cactus_graph","topics":["cactus_graph"],"solved":false},{"id":"codeforces_1779e","judge":"Codeforces","title":"Anya's Simultaneous Exhibition","url":"https://codeforces.com/problemset/problem/1779/E","difficulty":1,"starred":true,"topic":"tournament_graph","topics":["tournament_graph","interactive_problems"],"solved":false},{"id":"codeforces_117c","judge":"Codeforces","title":"Cycle","url":"https://codeforces.com/problemset/problem/117/C","difficulty":2,"starred":true,"topic":"tournament_graph","topics":["tournament_graph"],"solved":false},{"id":"codechef_rankfrad","judge":"CodeChef","title":"Rank Fraud","url":"https://www.codechef.com/IARCSJUD/problems/RANKFRAD","difficulty":2,"starred":false,"topic":"tournament_graph","topics":["tournament_graph"],"solved":false},{"id":"atcoder_arc163_d","judge":"AtCoder","title":"Sum of SCC","url":"https://atcoder.jp/contests/arc163/tasks/arc163_d","difficulty":2,"starred":false,"topic":"tournament_graph","topics":["tournament_graph"],"solved":false},{"id":"codeforces_878c","judge":"Codeforces","title":"Tournament","url":"https://codeforces.com/problemset/problem/878/C","difficulty":2,"starred":true,"topic":"tournament_graph","topics":["tournament_graph"],"solved":false},{"id":"codeforces_323b","judge":"Codeforces","title":"Tournament-graph","url":"https://codeforces.com/contest/323/problem/B","difficulty":2,"starred":false,"topic":"tournament_graph","topics":["tournament_graph"],"solved":false},{"id":"codeforces_850d","judge":"Codeforces","title":"Tournament Construction","url":"https://codeforces.com/problemset/problem/850/D","difficulty":3,"starred":false,"topic":"tournament_graph","topics":["tournament_graph"],"solved":false},{"id":"codeforces_1268d","judge":"Codeforces","title":"Invertation in Tournament","url":"https://codeforces.com/problemset/problem/1268/D","difficulty":null,"starred":true,"topic":"tournament_graph","topics":["tournament_graph"],"solved":false},{"id":"spoj_cyclerun","judge":"SPOJ","title":"Riding in cycles","url":"https://www.spoj.com/problems/CYCLERUN/","difficulty":null,"starred":false,"topic":"tournament_graph","topics":["tournament_graph"],"solved":false},{"id":"yosupo_chordal_graph_recognition","judge":"Library Checker","title":"Chordal Graph Recognition","url":"https://judge.yosupo.jp/problem/chordal_graph_recognition","difficulty":1,"starred":true,"topic":"chordal_graph","topics":["chordal_graph"],"solved":false},{"id":"codechef_eggfree","judge":"CodeChef","title":"Egg-free DAG","url":"https://www.codechef.com/problems/EGGFREE","difficulty":2,"starred":true,"topic":"chordal_graph","topics":["chordal_graph"],"solved":false},{"id":"baekjoon_12546","judge":"Baekjoon","title":"City Tour (Large)","url":"https://www.acmicpc.net/problem/12546","difficulty":3,"starred":false,"topic":"chordal_graph","topics":["chordal_graph"],"solved":false},{"id":"baekjoon_19267","judge":"Baekjoon","title":"Kid's Nightmare","url":"https://www.acmicpc.net/problem/19267","difficulty":3,"starred":false,"topic":"chordal_graph","topics":["chordal_graph"],"solved":false},{"id":"codechef_palindeq","judge":"CodeChef","title":"Palindromic Equivalence","url":"https://www.codechef.com/DEC20A/problems/PALINDEQ","difficulty":3,"starred":false,"topic":"chordal_graph","topics":["chordal_graph"],"solved":false},{"id":"baekjoon_25076","judge":"Baekjoon","title":"Road","url":"https://www.acmicpc.net/problem/25076","difficulty":3,"starred":false,"topic":"chordal_graph","topics":["chordal_graph"],"solved":false},{"id":"baekjoon_22460","judge":"Baekjoon","title":"Sister Ports","url":"https://www.acmicpc.net/problem/22460","difficulty":3,"starred":false,"topic":"chordal_graph","topics":["chordal_graph"],"solved":false},{"id":"qoj_7410","judge":"QOJ","title":"Apollonian Network","url":"https://vjudge.net/problem/QOJ-7410","difficulty":4,"starred":false,"topic":"chordal_graph","topics":["chordal_graph"],"solved":false},{"id":"codeforces_2026e","judge":"Codeforces","title":"Best Subsequence","url":"https://codeforces.com/contest/2026/problem/E","difficulty":1,"starred":true,"topic":"max_flow","topics":["bipartite_matching","maximum_independent_set_in_bipartite_graphs","max_flow"],"solved":false},{"id":"cses_1711","judge":"CSES","title":"Distinct Routes","url":"https://cses.fi/problemset/task/1711","difficulty":1,"starred":true,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"cses_1694","judge":"CSES","title":"Download Speed","url":"https://cses.fi/problemset/task/1694","difficulty":1,"starred":true,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"spoj_fastflow","judge":"SPOJ","title":"Fast Maximum Flow","url":"https://www.spoj.com/problems/FASTFLOW/","difficulty":1,"starred":false,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"spoj_matching","judge":"SPOJ","title":"Fast Maximum Matching","url":"https://www.spoj.com/problems/MATCHING/","difficulty":1,"starred":true,"topic":"max_flow","topics":["max_flow","bipartite_matching"],"solved":false},{"id":"yosupo_bipartitematching","judge":"Library Checker","title":"Matching on Bipartite Graph","url":"https://judge.yosupo.jp/problem/bipartitematching","difficulty":1,"starred":true,"topic":"max_flow","topics":["max_flow","bipartite_matching"],"solved":false},{"id":"cses_1695","judge":"CSES","title":"Police Chase","url":"https://cses.fi/problemset/task/1695","difficulty":1,"starred":true,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"cses_1696","judge":"CSES","title":"School Dance","url":"https://cses.fi/problemset/task/1696","difficulty":1,"starred":true,"topic":"max_flow","topics":["max_flow","bipartite_matching"],"solved":false},{"id":"codeforces_498c","judge":"Codeforces","title":"Array and Operations","url":"https://codeforces.com/contest/498/problem/C","difficulty":2,"starred":false,"topic":"max_flow","topics":["max_flow","bipartite_matching"],"solved":false},{"id":"codeforces_808f","judge":"Codeforces","title":"Card Game","url":"https://codeforces.com/problemset/problem/808/F","difficulty":2,"starred":true,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"codechef_spcln","judge":"CodeChef","title":"Cleaning the Space","url":"https://www.codechef.com/problems/SPCLN","difficulty":2,"starred":false,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"cses_1709","judge":"CSES","title":"Coin Grid","url":"https://cses.fi/problemset/task/1709","difficulty":2,"starred":true,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"codeforces_653d","judge":"Codeforces","title":"Delivery Bears","url":"https://codeforces.com/problemset/problem/653/D","difficulty":2,"starred":false,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"codeforces_1783f","judge":"Codeforces","title":"Double Sort II","url":"https://codeforces.com/problemset/problem/1783/F","difficulty":2,"starred":true,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"codeforces_1139e","judge":"Codeforces","title":"Maximize Mex","url":"https://codeforces.com/problemset/problem/1139/E","difficulty":2,"starred":false,"topic":"max_flow","topics":["bipartite_matching","max_flow"],"solved":false},{"id":"spoj_mobivina","judge":"SPOJ","title":"MobiZone vs VinaGone","url":"https://www.spoj.com/problems/MOBIVINA/","difficulty":2,"starred":false,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"codeforces_1082g","judge":"Codeforces","title":"Petya and Graph","url":"https://codeforces.com/contest/1082/problem/G","difficulty":2,"starred":true,"topic":"max_flow","topics":["min_cost_max_flow","maximum_closure_problem","max_flow"],"solved":false},{"id":"cf_gym_100548c","judge":"CF Gym","title":"The Problem Needs 3D Arrays","url":"https://codeforces.com/gym/100548/problem/C","difficulty":2,"starred":true,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"codeforces_1404e","judge":"Codeforces","title":"Bricks","url":"https://codeforces.com/contest/1404/problem/E","difficulty":3,"starred":true,"topic":"max_flow","topics":["max_flow","bipartite_matching"],"solved":false},{"id":"codeforces_724e","judge":"Codeforces","title":"Goods transportation","url":"https://codeforces.com/problemset/problem/724/E","difficulty":3,"starred":false,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"kattis_thewrathofkahn","judge":"Kattis","title":"The Wrath of Kahn","url":"https://open.kattis.com/problems/thewrathofkahn","difficulty":3,"starred":false,"topic":"max_flow","topics":["max_flow","poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"codeforces_739d","judge":"Codeforces","title":"Recover a functional graph","url":"https://codeforces.com/contest/739/problem/D","difficulty":4,"starred":false,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"codeforces_1383f","judge":"Codeforces","title":"Special Edges","url":"https://codeforces.com/contest/1383/problem/F","difficulty":4,"starred":false,"topic":"max_flow","topics":["max_flow"],"solved":false},{"id":"cses_2121","judge":"CSES","title":"Parcel Delivery","url":"https://cses.fi/problemset/task/2121","difficulty":1,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"yosupo_min_cost_b_flow","judge":"Library Checker","title":"Minimum Cost b-flow","url":"https://judge.yosupo.jp/problem/min_cost_b_flow","difficulty":1,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow","duality_in_linear_programming"],"solved":false},{"id":"cses_2129","judge":"CSES","title":"Task Assignment","url":"https://cses.fi/problemset/task/2129","difficulty":1,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow","hungarian_algorithm"],"solved":false},{"id":"cses_2131","judge":"CSES","title":"Grid Puzzle II","url":"https://cses.fi/problemset/task/2131","difficulty":1,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow","hungarian_algorithm"],"solved":false},{"id":"codeforces_818g","judge":"Codeforces","title":"Four Melodies","url":"https://codeforces.com/contest/818/problem/G","difficulty":2,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"cses_2130","judge":"CSES","title":"Distinct Routes II","url":"https://cses.fi/problemset/task/2130","difficulty":2,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"codeforces_1288f","judge":"Codeforces","title":"Red-Blue Graph","url":"https://codeforces.com/contest/1288/problem/F","difficulty":2,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow","l_r_flow"],"solved":false},{"id":"atcoder_abc247_g","judge":"AtCoder","title":"Dream Team","url":"https://atcoder.jp/contests/abc247/tasks/abc247_g","difficulty":2,"starred":false,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"lightoj_component_placement","judge":"LightOJ","title":"Component Placement","url":"https://lightoj.com/problem/component-placement","difficulty":2,"starred":false,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"codeforces_884f","judge":"Codeforces","title":"Anti-Palindromize","url":"https://codeforces.com/contest/884/problem/F","difficulty":2,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"lightoj_space_shuttle_experiments","judge":"LightOJ","title":"Space Shuttle Experiments","url":"https://lightoj.com/problem/space-shuttle-experiments","difficulty":2,"starred":false,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"codeforces_1510b","judge":"Codeforces","title":"Button Lock","url":"https://codeforces.com/problemset/problem/1510/B","difficulty":2,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"codeforces_1107f","judge":"Codeforces","title":"Vasya and Endless Credits","url":"https://codeforces.com/problemset/problem/1107/F","difficulty":2,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow","hungarian_algorithm"],"solved":false},{"id":"codeforces_802a3","judge":"Codeforces","title":"Heidi and Library (hard)","url":"https://codeforces.com/problemset/problem/802/A3","difficulty":3,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"codeforces_802m2","judge":"Codeforces","title":"April Fools' Problem (medium)","url":"https://codeforces.com/problemset/problem/802/M2","difficulty":2,"starred":false,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"codeforces_237e","judge":"Codeforces","title":"Build String","url":"https://codeforces.com/contest/237/problem/E","difficulty":2,"starred":false,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"kattis_catering","judge":"Kattis","title":"Catering","url":"https://vjudge.net/problem/Kattis-catering","difficulty":2,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"atcoder_abc373_g","judge":"AtCoder","title":"No Cross Matching","url":"https://atcoder.jp/contests/abc373/tasks/abc373_g","difficulty":2,"starred":true,"topic":"min_cost_max_flow","topics":["hungarian_algorithm","min_cost_max_flow"],"solved":false},{"id":"cf_gym_105884e","judge":"CF Gym","title":"Polynomial K Paths","url":"https://codeforces.com/gym/105884/problem/E","difficulty":2,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"codeforces_280d","judge":"Codeforces","title":"k-Maximum Subsequence Sum","url":"https://codeforces.com/contest/280/problem/D","difficulty":3,"starred":false,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"cses_2426","judge":"CSES","title":"Programmers and Artists","url":"https://cses.fi/problemset/task/2426","difficulty":3,"starred":false,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"codeforces_802m3","judge":"Codeforces","title":"April Fools' Problem (hard)","url":"https://codeforces.com/problemset/problem/802/M3","difficulty":4,"starred":false,"topic":"min_cost_max_flow","topics":["min_cost_max_flow","aliens_trick","slope_trick"],"solved":false},{"id":"codeforces_1307g","judge":"Codeforces","title":"Cow and Exercise","url":"https://codeforces.com/contest/1307/problem/G","difficulty":4,"starred":true,"topic":"min_cost_max_flow","topics":["min_cost_max_flow","duality_in_linear_programming"],"solved":false},{"id":"codeforces_1427g","judge":"Codeforces","title":"One Billion Shades of Grey","url":"https://codeforces.com/contest/1427/problem/G","difficulty":4,"starred":false,"topic":"min_cost_max_flow","topics":["min_cost_max_flow"],"solved":false},{"id":"uoj_487","judge":"UOJ","title":"最小费用最大流","url":"https://uoj.ac/problem/487","difficulty":2,"starred":false,"topic":"min_cost_max_flow_with_negative_cycles","topics":["min_cost_max_flow_with_negative_cycles"],"solved":false},{"id":"atcoder_arc085_c","judge":"AtCoder","title":"MUL","url":"https://atcoder.jp/contests/arc085/tasks/arc085_c","difficulty":null,"starred":true,"topic":"maximum_closure_problem","topics":["maximum_closure_problem"],"solved":false},{"id":"codeforces_1473f","judge":"Codeforces","title":"Strange Set","url":"https://codeforces.com/problemset/problem/1473/F","difficulty":2,"starred":true,"topic":"maximum_closure_problem","topics":["maximum_closure_problem"],"solved":false},{"id":"csacademy_fashion","judge":"CS Academy","title":"Fashion","url":"https://csacademy.com/contest/rmi-2017-day-1/task/fashion/","difficulty":2,"starred":false,"topic":"maximum_closure_problem","topics":["maximum_closure_problem"],"solved":false},{"id":"kattis_openpitmining","judge":"Kattis","title":"Open-Pit Mining","url":"https://open.kattis.com/problems/openpitmining","difficulty":2,"starred":false,"topic":"maximum_closure_problem","topics":["maximum_closure_problem"],"solved":false},{"id":"codeforces_1146g","judge":"Codeforces","title":"Zoning Restrictions","url":"https://codeforces.com/problemset/problem/1146/G","difficulty":3,"starred":false,"topic":"maximum_closure_problem","topics":["maximum_closure_problem"],"solved":false},{"id":"cf_gym_105873k","judge":"CF Gym","title":"Killable Demon","url":"https://codeforces.com/gym/105873/problem/K","difficulty":2,"starred":false,"topic":"maximum_closure_problem","topics":["maximum_closure_problem"],"solved":false},{"id":"codeforces_704d","judge":"Codeforces","title":"Captain America","url":"https://codeforces.com/problemset/problem/704/D","difficulty":2,"starred":true,"topic":"l_r_flow","topics":["l_r_flow"],"solved":false},{"id":"cf_gym_100199b","judge":"CF Gym","title":"Reactor Cooling","url":"https://codeforces.com/gym/100199/problem/B","difficulty":1,"starred":true,"topic":"l_r_flow","topics":["l_r_flow"],"solved":false},{"id":"cf_gym_102156c","judge":"CF Gym","title":"Diverse Singing","url":"https://codeforces.com/gym/102156/problem/C","difficulty":2,"starred":false,"topic":"l_r_flow","topics":["l_r_flow"],"solved":false},{"id":"codeforces_708d","judge":"Codeforces","title":"Incorrect Flow","url":"https://codeforces.com/contest/708/problem/D","difficulty":3,"starred":false,"topic":"l_r_flow","topics":["l_r_flow"],"solved":false},{"id":"codeforces_1416f","judge":"Codeforces","title":"Showing Off","url":"https://codeforces.com/contest/1416/problem/F","difficulty":4,"starred":false,"topic":"l_r_flow","topics":["l_r_flow"],"solved":false},{"id":"cf_gym_100153d","judge":"CF Gym","title":"Minimal Cut Matrix","url":"https://codeforces.com/gym/100153/problem/D","difficulty":2,"starred":false,"topic":"gomory_hu_tree","topics":["gomory_hu_tree"],"solved":false},{"id":"codeforces_343e","judge":"Codeforces","title":"Pumping Stations","url":"https://codeforces.com/problemset/problem/343/E","difficulty":2,"starred":true,"topic":"gomory_hu_tree","topics":["gomory_hu_tree"],"solved":false},{"id":"cf_gym_102471k","judge":"CF Gym","title":"All Pair Maximum Flow","url":"https://codeforces.com/gym/102471/problem/K","difficulty":2,"starred":true,"topic":"gomory_hu_tree_of_a_planar_graph","topics":["gomory_hu_tree_of_a_planar_graph"],"solved":false},{"id":"uva_10989","judge":"UVa","title":"Bomb, Divide and Conquer","url":"https://vjudge.net/problem/UVA-10989","difficulty":1,"starred":true,"topic":"stoer_wagner_algorithm","topics":["stoer_wagner_algorithm"],"solved":false},{"id":"uva_10296","judge":"UVa","title":"Jogging Trails","url":"https://vjudge.net/problem/UVA-10296","difficulty":null,"starred":true,"topic":"chinese_postman_problem","topics":["chinese_postman_problem"],"solved":false},{"id":"cf_gym_100200a","judge":"CF Gym","title":"Unique Attack","url":"https://codeforces.com/gym/100200/problem/A","difficulty":1,"starred":true,"topic":"unique_min_cut","topics":["unique_min_cut"],"solved":false},{"id":"uva_1389","judge":"UVa","title":"Hard Life","url":"https://vjudge.net/problem/UVA-1389","difficulty":1,"starred":true,"topic":"maximum_density_subgraph","topics":["maximum_density_subgraph"],"solved":false},{"id":"spoj_adahose","judge":"SPOJ","title":"Ada and Hose","url":"https://www.spoj.com/problems/ADAHOSE/","difficulty":1,"starred":true,"topic":"min_cut_in_a_planar_graph","topics":["min_cut_in_a_planar_graph"],"solved":false},{"id":"uva_4122","judge":"UVa","title":"Animal Run","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=4122","difficulty":1,"starred":true,"topic":"min_cut_in_a_planar_graph","topics":["min_cut_in_a_planar_graph"],"solved":false},{"id":"cf_gym_102156f","judge":"CF Gym","title":"Planar Max Cut","url":"https://codeforces.com/gym/102156/problem/F","difficulty":3,"starred":false,"topic":"max_cut_in_a_planar_graph","topics":["max_cut_in_a_planar_graph"],"solved":false},{"id":"kattis_gopher2","judge":"Kattis","title":"Gopher II","url":"https://open.kattis.com/problems/gopher2","difficulty":1,"starred":false,"topic":"bipartite_matching","topics":["bipartite_matching"],"solved":false},{"id":"timus_1099","judge":"Timus","title":"Work Scheduling","url":"https://acm.timus.ru/problem.aspx?space=1&num=1099","difficulty":1,"starred":false,"topic":"bipartite_matching","topics":["bipartite_matching"],"solved":false},{"id":"lightoj_knights_in_chessboard_ii","judge":"LightOJ","title":"Knights in Chessboard (II)","url":"https://lightoj.com/problem/knights-in-chessboard-ii","difficulty":1,"starred":false,"topic":"bipartite_matching","topics":["bipartite_matching"],"solved":false},{"id":"cf_gym_100820a","judge":"CF Gym","title":"Airports","url":"https://codeforces.com/gym/100820/problem/A","difficulty":1,"starred":false,"topic":"bipartite_matching","topics":["bipartite_matching"],"solved":false},{"id":"spoj_adapath","judge":"SPOJ","title":"Ada and Path","url":"https://www.spoj.com/problems/ADAPATH/","difficulty":1,"starred":false,"topic":"bipartite_matching","topics":["bipartite_matching"],"solved":false},{"id":"kattis_borders","judge":"Kattis","title":"Borders","url":"https://open.kattis.com/problems/borders","difficulty":2,"starred":false,"topic":"bipartite_matching","topics":["bipartite_matching"],"solved":false},{"id":"kattis_justenoughbridges","judge":"Kattis","title":"Just Enough Bridges","url":"https://open.kattis.com/problems/justenoughbridges","difficulty":null,"starred":true,"topic":"bipartite_matching","topics":["bipartite_matching"],"solved":false},{"id":"cf_gym_104252h","judge":"CF Gym","title":"Horse Race","url":"https://codeforces.com/gym/104252/problem/H","difficulty":1,"starred":false,"topic":"bipartite_matching","topics":["bipartite_matching"],"solved":false},{"id":"cf_gym_101873f","judge":"CF Gym","title":"Plug It In","url":"https://codeforces.com/gym/101873/problem/F","difficulty":2,"starred":false,"topic":"bipartite_matching","topics":["bipartite_matching"],"solved":false},{"id":"toph_convincing_customers","judge":"Toph","title":"Convincing Customers","url":"https://toph.co/p/convincing-customers","difficulty":1,"starred":false,"topic":"hungarian_algorithm","topics":["hungarian_algorithm"],"solved":false},{"id":"spoj_adacity","judge":"SPOJ","title":"Ada and Cities","url":"https://www.spoj.com/problems/ADACITY/","difficulty":2,"starred":false,"topic":"hungarian_algorithm","topics":["hungarian_algorithm"],"solved":false},{"id":"yosupo_general_matching","judge":"Library Checker","title":"Matching on General Graph","url":"https://judge.yosupo.jp/problem/general_matching","difficulty":1,"starred":true,"topic":"blossom_algorithm_unweighted","topics":["blossom_algorithm_unweighted"],"solved":false},{"id":"spoj_vparty","judge":"SPOJ","title":"Party At School","url":"https://www.spoj.com/problems/VPARTY/","difficulty":1,"starred":true,"topic":"blossom_algorithm_unweighted","topics":["blossom_algorithm_unweighted"],"solved":false},{"id":"uoj_79","judge":"UOJ","title":"一般图最大匹配","url":"https://uoj.ac/problem/79","difficulty":1,"starred":false,"topic":"blossom_algorithm_unweighted","topics":["blossom_algorithm_unweighted"],"solved":false},{"id":"codechef_hamilg","judge":"CodeChef","title":"A game on a graph","url":"https://www.codechef.com/problems/HAMILG","difficulty":2,"starred":true,"topic":"blossom_algorithm_unweighted","topics":["blossom_algorithm_unweighted","matching_game_on_a_graph"],"solved":false},{"id":"yosupo_general_weighted_matching","judge":"Library Checker","title":"General Weighted Matching","url":"https://judge.yosupo.jp/problem/general_weighted_matching","difficulty":1,"starred":true,"topic":"blossom_algorithm_weighted","topics":["blossom_algorithm_weighted"],"solved":false},{"id":"uoj_81","judge":"UOJ","title":"一般图最大权匹配","url":"https://uoj.ac/problem/81","difficulty":1,"starred":false,"topic":"blossom_algorithm_weighted","topics":["blossom_algorithm_weighted"],"solved":false},{"id":"spoj_stablemp","judge":"SPOJ","title":"Stable Marriage Problem","url":"https://www.spoj.com/problems/STABLEMP/","difficulty":1,"starred":true,"topic":"stable_marriage_problem","topics":["stable_marriage_problem"],"solved":false},{"id":"codechef_blocking","judge":"CodeChef","title":"Block Game","url":"https://www.codechef.com/problems/BLOCKING","difficulty":2,"starred":false,"topic":"stable_marriage_problem","topics":["stable_marriage_problem"],"solved":false},{"id":"cf_gym_103081l","judge":"CF Gym","title":"Restaurants","url":"https://codeforces.com/gym/103081/problem/L","difficulty":3,"starred":false,"topic":"stable_marriage_problem","topics":["stable_marriage_problem"],"solved":false},{"id":"cf_gym_100269h","judge":"CF Gym","title":"Heavy Chain Clusterization","url":"https://codeforces.com/gym/100269/problem/H","difficulty":1,"starred":false,"topic":"maximum_independent_set_in_bipartite_graphs","topics":["maximum_independent_set_in_bipartite_graphs"],"solved":false},{"id":"csacademy_no_prime_sum","judge":"CS Academy","title":"No Prime Sum","url":"https://csacademy.com/contest/archive/task/no-prime-sum/","difficulty":1,"starred":true,"topic":"maximum_independent_set_in_bipartite_graphs","topics":["maximum_independent_set_in_bipartite_graphs"],"solved":false},{"id":"cf_gym_101666e","judge":"CF Gym","title":"Easter Eggs","url":"https://codeforces.com/gym/101666/problem/E","difficulty":2,"starred":false,"topic":"maximum_independent_set_in_bipartite_graphs","topics":["maximum_independent_set_in_bipartite_graphs"],"solved":false},{"id":"codeforces_628f","judge":"Codeforces","title":"Bear and Fair Set","url":"https://codeforces.com/contest/628/problem/F","difficulty":2,"starred":true,"topic":"halls_theorem","topics":["halls_theorem"],"solved":false},{"id":"atcoder_arc076_d","judge":"AtCoder","title":"Exhausted?","url":"https://atcoder.jp/contests/arc076/tasks/arc076_d","difficulty":2,"starred":true,"topic":"halls_theorem","topics":["halls_theorem"],"solved":false},{"id":"cf_gym_102268h","judge":"CF Gym","title":"Hall's Theorem","url":"https://codeforces.com/gym/102268/problem/H","difficulty":2,"starred":false,"topic":"halls_theorem","topics":["halls_theorem"],"solved":false},{"id":"baekjoon_8177","judge":"Baekjoon","title":"Ice Skates","url":"https://www.acmicpc.net/problem/8177","difficulty":2,"starred":true,"topic":"halls_theorem","topics":["halls_theorem"],"solved":false},{"id":"ioi15_teams","judge":"oj.uz","title":"Teams","url":"https://oj.uz/problem/view/IOI15_teams","difficulty":2,"starred":true,"topic":"halls_theorem","topics":["halls_theorem"],"solved":false},{"id":"codeforces_611h","judge":"Codeforces","title":"New Year and Forgotten Tree","url":"https://codeforces.com/contest/611/problem/H","difficulty":3,"starred":false,"topic":"halls_theorem","topics":["halls_theorem"],"solved":false},{"id":"codechef_cheflst","judge":"CodeChef","title":"Chef and Lost Story","url":"https://www.codechef.com/SEPT18A/problems/CHEFLST","difficulty":3,"starred":false,"topic":"matching_using_determinants","topics":["matching_using_determinants","schwartz_zippel_lemma"],"solved":false},{"id":"csacademy_divisible_matching","judge":"CS Academy","title":"Divisible Matching","url":"https://csacademy.com/contest/round-67/task/divisible-matching/statement/","difficulty":3,"starred":true,"topic":"matching_using_determinants","topics":["matching_using_determinants"],"solved":false},{"id":"usaco_496","judge":"USACO","title":"Cow Jog","url":"https://usaco.org/index.php?page=viewproblem2&cpid=496","difficulty":1,"starred":true,"topic":"poset_ft_dilworths_and_mirskys_theorem","topics":["poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"spoj_mdolls","judge":"SPOJ","title":"Nested Dolls","url":"https://www.spoj.com/problems/MDOLLS/","difficulty":1,"starred":false,"topic":"poset_ft_dilworths_and_mirskys_theorem","topics":["poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"codeforces_1765a","judge":"Codeforces","title":"Access Levels","url":"https://codeforces.com/contest/1765/problem/A","difficulty":2,"starred":false,"topic":"poset_ft_dilworths_and_mirskys_theorem","topics":["poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"spoj_divrel","judge":"SPOJ","title":"Divisibility Relation","url":"https://www.spoj.com/problems/DIVREL/","difficulty":2,"starred":true,"topic":"poset_ft_dilworths_and_mirskys_theorem","topics":["poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"codechef_polcon","judge":"CodeChef","title":"Polygon Containment","url":"https://www.codechef.com/AM19MOS/problems/POLCON","difficulty":2,"starred":false,"topic":"poset_ft_dilworths_and_mirskys_theorem","topics":["poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"atcoder_abc354_g","judge":"AtCoder","title":"Select Strings","url":"https://atcoder.jp/contests/abc354/tasks/abc354_g","difficulty":2,"starred":true,"topic":"poset_ft_dilworths_and_mirskys_theorem","topics":["poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"codeforces_1977e","judge":"Codeforces","title":"Tensor","url":"https://codeforces.com/contest/1977/problem/E","difficulty":2,"starred":true,"topic":"poset_ft_dilworths_and_mirskys_theorem","topics":["poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"codeforces_590e","judge":"Codeforces","title":"Birthday","url":"https://codeforces.com/contest/590/problem/E","difficulty":4,"starred":true,"topic":"poset_ft_dilworths_and_mirskys_theorem","topics":["aho_corasick","poset_ft_dilworths_and_mirskys_theorem"],"solved":false},{"id":"cses_1751","judge":"CSES","title":"Planets Cycles","url":"https://cses.fi/problemset/task/1751","difficulty":1,"starred":true,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"atcoder_abc357_e","judge":"AtCoder","title":"Reachability in Functional Graph","url":"https://atcoder.jp/contests/abc357/tasks/abc357_e","difficulty":1,"starred":true,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"codeforces_1530d","judge":"Codeforces","title":"Secret Santa","url":"https://codeforces.com/contest/1530/problem/D","difficulty":1,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"codeforces_1020b","judge":"Codeforces","title":"Badge","url":"https://codeforces.com/contest/1020/problem/B","difficulty":1,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"usaco_764","judge":"USACO","title":"The Bovine Shuffle","url":"https://usaco.org/index.php?page=viewproblem2&cpid=764","difficulty":1,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"codeforces_1137d","judge":"Codeforces","title":"Cooperative Game","url":"https://codeforces.com/contest/1137/problem/D","difficulty":2,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"usaco_1230","judge":"USACO","title":"Visits","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1230","difficulty":2,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"usaco_284","judge":"USACO","title":"Luxury River Cruise","url":"https://usaco.org/index.php?page=viewproblem2&cpid=284","difficulty":2,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"codeforces_702e","judge":"Codeforces","title":"Analysis of Pathes in Functional Graph","url":"https://codeforces.com/problemset/problem/702/E","difficulty":2,"starred":true,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"toph_infinite_tree","judge":"Toph","title":"Infinite Tree","url":"https://toph.co/arena?practice=65ecc1a8c0b22c15ba984e0b#!/p/65d0c60eff9ef22def4bd3b5","difficulty":3,"starred":true,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"kattis_hobsonstrains","judge":"Kattis","title":"Hobson's Trains","url":"https://vjudge.net/problem/Kattis-hobsonstrains","difficulty":3,"starred":true,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"eolymp_7782","judge":"Eolymp","title":"Kernel Knights","url":"https://basecamp.eolymp.com/en/problems/7782","difficulty":2,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"codeforces_2044g2","judge":"Codeforces","title":"Medium Demon Problem (hard version)","url":"https://codeforces.com/contest/2044/problem/G2","difficulty":2,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"kattis_mafija","judge":"Kattis","title":"Mafija","url":"https://open.kattis.com/problems/mafija","difficulty":3,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"kattis_vending","judge":"Kattis","title":"Vending Machine","url":"https://open.kattis.com/problems/vending","difficulty":3,"starred":false,"topic":"functional_graphs","topics":["functional_graphs"],"solved":false},{"id":"codeforces_100738d","judge":"CF Gym","title":"Degree Sequence Tree","url":"https://codeforces.com/problemset/gymProblem/100738/D","difficulty":1,"starred":true,"topic":"degree_sequences","topics":["degree_sequences"],"solved":false},{"id":"codeforces_976d","judge":"Codeforces","title":"Degree Set","url":"https://codeforces.com/problemset/problem/976/D","difficulty":1,"starred":true,"topic":"degree_sequences","topics":["degree_sequences"],"solved":false},{"id":"codeforces_1082d","judge":"Codeforces","title":"Maximum Diameter Graph","url":"https://codeforces.com/problemset/problem/1082/d","difficulty":1,"starred":false,"topic":"degree_sequences","topics":["degree_sequences"],"solved":false},{"id":"codeforces_1091e","judge":"Codeforces","title":"New Year and the Acquaintance Estimation","url":"https://codeforces.com/contest/1091/problem/E","difficulty":2,"starred":false,"topic":"degree_sequences","topics":["degree_sequences"],"solved":false},{"id":"atcoder_abc303_h","judge":"AtCoder","title":"Constrained Tree Degree","url":"https://atcoder.jp/contests/abc303/tasks/abc303_h","difficulty":3,"starred":true,"topic":"degree_sequences","topics":["degree_sequences","ntt"],"solved":false},{"id":"cses_1700","judge":"CSES","title":"Tree Isomorphism I","url":"https://cses.fi/problemset/task/1700","difficulty":1,"starred":true,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"cses_1701","judge":"CSES","title":"Tree Isomorphism II","url":"https://cses.fi/problemset/task/1701","difficulty":1,"starred":true,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"spoj_treeiso","judge":"SPOJ","title":"Tree Isomorphism","url":"https://www.spoj.com/problems/TREEISO/","difficulty":1,"starred":false,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"yosupo_rooted_tree_isomorphism_classification","judge":"Library Checker","title":"Rooted Tree Isomorphism Classification","url":"https://judge.yosupo.jp/problem/rooted_tree_isomorphism_classification","difficulty":1,"starred":true,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"csacademy_binary_isomorphism","judge":"CS Academy","title":"Binary Isomorphism","url":"https://csacademy.com/contest/round-73/task/binary-isomorphism/","difficulty":1,"starred":false,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"codeforces_1800g","judge":"Codeforces","title":"Symmetree","url":"https://codeforces.com/contest/1800/problem/G","difficulty":1,"starred":true,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"codechef_twotrees","judge":"CodeChef","title":"A tale of two trees","url":"https://www.codechef.com/problems/TWOTREES","difficulty":2,"starred":false,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"codeforces_1252f","judge":"Codeforces","title":"Regular Forestation","url":"https://codeforces.com/contest/1252/problem/F","difficulty":2,"starred":false,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"cf_gym_102354j","judge":"CF Gym","title":"Tree Automorphisms","url":"https://codeforces.com/gym/102354/problem/J","difficulty":2,"starred":false,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"kattis_twochartsbecomeone","judge":"Kattis","title":"Two Charts Become One","url":"https://open.kattis.com/problems/twochartsbecomeone","difficulty":2,"starred":false,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"toph_isomorphic_graph","judge":"Toph","title":"Isomorphic Graph","url":"https://toph.co/p/isomorphic-graph","difficulty":2,"starred":true,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"codeforces_763d","judge":"Codeforces","title":"Timofey and a flat tree","url":"https://codeforces.com/problemset/problem/763/D","difficulty":3,"starred":true,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"cf_gym_103640g","judge":"CF Gym","title":"Generator Tree","url":"https://codeforces.com/gym/103640/problem/G","difficulty":3,"starred":true,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"qoj_10097","judge":"QOJ","title":"Vortex","url":"https://qoj.ac/contest/1917/problem/10097","difficulty":1,"starred":false,"topic":"tree_isomorphism","topics":["tree_isomorphism"],"solved":false},{"id":"leetcode_count_primes","judge":"LeetCode","title":"Count Primes","url":"https://leetcode.com/problems/count-primes/","difficulty":1,"starred":true,"topic":"sieve","topics":["sieve"],"solved":true},{"id":"toph_n_th_prime","judge":"Toph","title":"N-th Prime","url":"https://toph.co/p/n-th-prime","difficulty":1,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"spoj_tdprimes","judge":"SPOJ","title":"Printing some primes","url":"https://www.spoj.com/problems/TDPRIMES/","difficulty":1,"starred":true,"topic":"sieve","topics":["sieve","linear_sieve"],"solved":true},{"id":"spoj_vectar8","judge":"SPOJ","title":"Primal Fear","url":"https://www.spoj.com/problems/VECTAR8/","difficulty":1,"starred":true,"topic":"sieve","topics":["sieve"],"solved":true},{"id":"spoj_hs08paul","judge":"SPOJ","title":"A conjecture of Paul Erdős","url":"https://www.spoj.com/problems/HS08PAUL/","difficulty":1,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"spoj_ptri2","judge":"SPOJ","title":"primes triangle (I)","url":"https://www.spoj.com/problems/PTRI2/","difficulty":1,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"spoj_factcg2","judge":"SPOJ","title":"Medium Factorization","url":"https://www.spoj.com/problems/FACTCG2/","difficulty":1,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"spoj_fact0","judge":"SPOJ","title":"Integer Factorization (15 digits)","url":"https://www.spoj.com/problems/FACT0/","difficulty":1,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"cses_1081","judge":"CSES","title":"Common Divisors","url":"https://cses.fi/problemset/task/1081","difficulty":1,"starred":true,"topic":"sieve","topics":["sieve","sigma_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"codeforces_776b","judge":"Codeforces","title":"Sherlock and his girlfriend","url":"https://codeforces.com/contest/776/problem/B","difficulty":1,"starred":false,"topic":"sieve","topics":["sieve"],"solved":true},{"id":"atcoder_abc169_d","judge":"AtCoder","title":"Div Game","url":"https://atcoder.jp/contests/abc169/tasks/abc169_d","difficulty":1,"starred":true,"topic":"sieve","topics":["sieve"],"solved":true},{"id":"leetcode_four_divisors","judge":"LeetCode","title":"Four Divisors","url":"https://leetcode.com/problems/four-divisors/","difficulty":1,"starred":false,"topic":"sieve","topics":["sieve"],"solved":true},{"id":"spoj_divsum2","judge":"SPOJ","title":"Divisor Summation (Hard)","url":"https://www.spoj.com/problems/DIVSUM2/","difficulty":1,"starred":true,"topic":"sieve","topics":["sigma_function","sieve"],"solved":false},{"id":"codeforces_230b","judge":"Codeforces","title":"T-primes","url":"https://codeforces.com/problemset/problem/230/B","difficulty":2,"starred":true,"topic":"sieve","topics":["sieve"],"solved":true},{"id":"spoj_nfactor","judge":"SPOJ","title":"N-Factorful","url":"https://www.spoj.com/problems/NFACTOR/","difficulty":2,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"spoj_ngirl","judge":"SPOJ","title":"Namit In Trouble","url":"https://www.spoj.com/problems/NGIRL/","difficulty":2,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"spoj_dcepc505","judge":"SPOJ","title":"Bazinga!","url":"https://www.spoj.com/problems/DCEPC505/","difficulty":2,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"spoj_bsprime","judge":"SPOJ","title":"Binary Sequence of Prime Number","url":"https://www.spoj.com/problems/BSPRIME/","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"uva_2338","judge":"UVa","title":"A Different Kind of Sorting","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2338","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_17a","judge":"Codeforces","title":"Noldbach problem","url":"https://codeforces.com/problemset/problem/17/A","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_154b","judge":"Codeforces","title":"Colliders","url":"https://codeforces.com/contest/154/problem/B","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_546d","judge":"Codeforces","title":"Soldier and Number Game","url":"https://codeforces.com/contest/546/problem/D","difficulty":2,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_222c","judge":"Codeforces","title":"Reducing Fractions","url":"https://codeforces.com/contest/222/problem/C","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_1649d","judge":"Codeforces","title":"Integral Array","url":"https://codeforces.com/contest/1649/problem/D","difficulty":2,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_1561d2","judge":"Codeforces","title":"Up the Strip","url":"https://codeforces.com/contest/1561/problem/D2","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_1225d","judge":"Codeforces","title":"Power Products","url":"https://codeforces.com/contest/1225/problem/D","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_1349a","judge":"Codeforces","title":"Orac and LCM","url":"https://codeforces.com/contest/1349/problem/A","difficulty":2,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_1154g","judge":"Codeforces","title":"Minimum Possible LCM","url":"https://codeforces.com/contest/1154/problem/G","difficulty":2,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_803f","judge":"Codeforces","title":"Coprime Subsequences","url":"https://codeforces.com/contest/803/problem/F","difficulty":2,"starred":true,"topic":"sieve","topics":["sieve","inclusion_and_exclusion_on_multiples","mobius_function"],"solved":false},{"id":"codeforces_1499d","judge":"Codeforces","title":"The Number of Pairs","url":"https://codeforces.com/contest/1499/problem/D","difficulty":3,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"atcoder_abc191_f","judge":"AtCoder","title":"GCD or MIN","url":"https://atcoder.jp/contests/abc191/tasks/abc191_f","difficulty":3,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_1493d","judge":"Codeforces","title":"GCD of an Array","url":"https://codeforces.com/contest/1493/problem/D","difficulty":3,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codechef_chefsums","judge":"CodeChef","title":"Chef and Sums","url":"https://www.codechef.com/problems/CHEFSUMS","difficulty":4,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_2091e","judge":"Codeforces","title":"Interesting Ratio","url":"https://codeforces.com/contest/2091/problem/E","difficulty":1,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"lightoj_1443","judge":"LightOJ","title":"Printing Divisors","url":"https://vjudge.net/problem/LightOJ-1443","difficulty":1,"starred":true,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"atcoder_arc067_a","judge":"AtCoder","title":"An interesting problem","url":"https://atcoder.jp/contests/abc052/tasks/arc067_a","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_450e","judge":"Codeforces","title":"Jzzhu and Apples","url":"https://codeforces.com/contest/450/problem/E","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_1529d","judge":"Codeforces","title":"Kavi on Pairing Duty","url":"https://codeforces.com/contest/1529/problem/D","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"lightoj_trailing_zeroes_i","judge":"LightOJ","title":"Trailing Zeroes (I)","url":"https://lightoj.com/problem/trailing-zeroes-i","difficulty":2,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"codeforces_1954e","judge":"Codeforces","title":"Chain Reaction","url":"https://codeforces.com/contest/1954/problem/E","difficulty":3,"starred":false,"topic":"sieve","topics":["sieve"],"solved":false},{"id":"poj_2635","judge":"POJ","title":"The Embarrassed Cryptographer","url":"https://vjudge.net/problem/POJ-2635","difficulty":1,"starred":false,"topic":"linear_sieve","topics":["linear_sieve"],"solved":false},{"id":"cf_gym_105327i","judge":"CF Gym","title":"Ingredients that may Harm You","url":"https://codeforces.com/gym/105327/problem/I","difficulty":2,"starred":false,"topic":"linear_sieve","topics":["linear_sieve"],"solved":false},{"id":"spoj_prime1","judge":"SPOJ","title":"Prime Generator","url":"https://www.spoj.com/problems/PRIME1/","difficulty":1,"starred":true,"topic":"segmented_sieve","topics":["segmented_sieve"],"solved":true},{"id":"hackerrank_euler134","judge":"HackerRank","title":"Prime pair connection","url":"https://www.hackerrank.com/contests/projecteuler/challenges/euler134/problem","difficulty":1,"starred":true,"topic":"segmented_sieve","topics":["segmented_sieve"],"solved":false},{"id":"atcoder_abc412_e","judge":"AtCoder","title":"LCM Sequence","url":"https://atcoder.jp/contests/abc412/tasks/abc412_e","difficulty":1,"starred":true,"topic":"segmented_sieve","topics":["segmented_sieve"],"solved":false},{"id":"cses_3396","judge":"CSES","title":"Next Prime","url":"https://cses.fi/problemset/task/3396","difficulty":1,"starred":false,"topic":"segmented_sieve","topics":["segmented_sieve","miller_rabin_primality_test"],"solved":false},{"id":"spoj_print","judge":"SPOJ","title":"Prime Intervals","url":"https://www.spoj.com/problems/PRINT/","difficulty":1,"starred":false,"topic":"segmented_sieve","topics":["segmented_sieve"],"solved":false},{"id":"atcoder_abc227_g","judge":"AtCoder","title":"Divisors of Binomial Coefficient","url":"https://atcoder.jp/contests/abc227/tasks/abc227_g","difficulty":2,"starred":true,"topic":"segmented_sieve","topics":["segmented_sieve"],"solved":false},{"id":"yosupo_enumerate_primes","judge":"Library Checker","title":"Enumerate Primes","url":"https://judge.yosupo.jp/problem/enumerate_primes","difficulty":1,"starred":true,"topic":"sieve_upto_1e9","topics":["sieve_upto_1e9"],"solved":false},{"id":"spoj_primes2","judge":"SPOJ","title":"Printing some primes (Hard)","url":"https://www.spoj.com/problems/PRIMES2/","difficulty":1,"starred":true,"topic":"sieve_upto_1e9","topics":["sieve_upto_1e9"],"solved":false},{"id":"yosupo_primality_test","judge":"Library Checker","title":"Primality Test","url":"https://judge.yosupo.jp/problem/primality_test","difficulty":1,"starred":true,"topic":"miller_rabin_primality_test","topics":["miller_rabin_primality_test"],"solved":false},{"id":"spoj_pon","judge":"SPOJ","title":"Prime or Not","url":"https://www.spoj.com/problems/PON/","difficulty":1,"starred":false,"topic":"miller_rabin_primality_test","topics":["miller_rabin_primality_test"],"solved":false},{"id":"yosupo_factorize","judge":"Library Checker","title":"Factorize","url":"https://judge.yosupo.jp/problem/factorize","difficulty":1,"starred":true,"topic":"pollard_rho","topics":["pollard_rho"],"solved":false},{"id":"spoj_fact1","judge":"SPOJ","title":"Integer Factorization (20 digits)","url":"https://www.spoj.com/problems/FACT1/","difficulty":1,"starred":true,"topic":"pollard_rho","topics":["pollard_rho"],"solved":false},{"id":"cf_gym_100753f","judge":"CF Gym","title":"Divisions","url":"https://codeforces.com/gym/100753/problem/F","difficulty":1,"starred":true,"topic":"pollard_rho","topics":["pollard_rho","sigma_function"],"solved":false},{"id":"toph_story_of_totient_function","judge":"Toph","title":"Story of Totient Function","url":"https://toph.co/p/story-of-totient-function","difficulty":1,"starred":true,"topic":"pollard_rho","topics":["pollard_rho"],"solved":false},{"id":"spoj_fact2","judge":"SPOJ","title":"Integer Factorization (29 digits)","url":"https://www.spoj.com/problems/FACT2/","difficulty":3,"starred":false,"topic":"pollard_rho","topics":["pollard_rho"],"solved":false},{"id":"yosupo_counting_primes","judge":"Library Checker","title":"Counting Primes","url":"https://judge.yosupo.jp/problem/counting_primes","difficulty":1,"starred":true,"topic":"prime_counting_function","topics":["prime_counting_function"],"solved":false},{"id":"spoj_nthprime","judge":"SPOJ","title":"Nth Prime","url":"https://www.spoj.com/problems/NTHPRIME/","difficulty":1,"starred":true,"topic":"prime_counting_function","topics":["prime_counting_function"],"solved":false},{"id":"codeforces_665f","judge":"Codeforces","title":"Four Divisors","url":"https://codeforces.com/problemset/problem/665/F","difficulty":2,"starred":true,"topic":"prime_counting_function","topics":["prime_counting_function"],"solved":false},{"id":"toph_perfect_points","judge":"Toph","title":"Perfect Points","url":"https://toph.co/p/perfect-points","difficulty":2,"starred":true,"topic":"prime_counting_function","topics":["prime_counting_function"],"solved":false},{"id":"spoj_aps2","judge":"SPOJ","title":"Amazing Prime Sequence (hard)","url":"https://www.spoj.com/problems/APS2/","difficulty":3,"starred":false,"topic":"prime_counting_function","topics":["prime_counting_function"],"solved":false},{"id":"spoj_bbad","judge":"SPOJ","title":"Breaking Math","url":"https://www.spoj.com/problems/BBAD/","difficulty":3,"starred":false,"topic":"prime_counting_function","topics":["prime_counting_function"],"solved":false},{"id":"spoj_divfact4","judge":"SPOJ","title":"Divisors of factorial (extreme)","url":"https://www.spoj.com/problems/DIVFACT4/","difficulty":3,"starred":false,"topic":"prime_counting_function","topics":["prime_counting_function"],"solved":false},{"id":"spoj_kdiv","judge":"SPOJ","title":"K-Divisors","url":"https://www.spoj.com/problems/KDIV/","difficulty":3,"starred":true,"topic":"k_divisors","topics":["k_divisors"],"solved":false},{"id":"lightoj_politeness","judge":"LightOJ","title":"Politeness","url":"https://lightoj.com/problem/politeness","difficulty":2,"starred":true,"topic":"smallest_number_having_exactly_k_divisors","topics":["smallest_number_having_exactly_k_divisors"],"solved":false},{"id":"spoj_dcepc11b","judge":"SPOJ","title":"Boring Factorials","url":"https://www.spoj.com/problems/DCEPC11B/","difficulty":1,"starred":true,"topic":"wilsons_theorem","topics":["wilsons_theorem"],"solved":false},{"id":"spoj_iitkwpcm","judge":"SPOJ","title":"Coprime Again","url":"https://www.spoj.com/problems/IITKWPCM/","difficulty":3,"starred":true,"topic":"wilsons_theorem","topics":["wilsons_theorem"],"solved":false},{"id":"codeforces_1957e","judge":"Codeforces","title":"Carousel of Combinations","url":"https://codeforces.com/contest/1957/problem/E","difficulty":3,"starred":false,"topic":"wilsons_theorem","topics":["wilsons_theorem"],"solved":false},{"id":"spoj_boring2","judge":"SPOJ","title":"Boring Factorials (Extended)","url":"https://www.spoj.com/problems/BORING2/","difficulty":3,"starred":false,"topic":"wilsons_theorem","topics":["wilsons_theorem"],"solved":false},{"id":"spoj_boring","judge":"SPOJ","title":"Boring Factorials (Reloaded)","url":"https://www.spoj.com/problems/BORING/","difficulty":1,"starred":false,"topic":"wilsons_theorem","topics":["wilsons_theorem"],"solved":false},{"id":"usaco_1213","judge":"USACO","title":"Sleeping in Class","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1213","difficulty":2,"starred":false,"topic":"implicit_prime_factorization","topics":["sos_dp","implicit_prime_factorization"],"solved":false},{"id":"codeforces_1656h","judge":"Codeforces","title":"Equal LCM Subsets","url":"https://codeforces.com/contest/1656/problem/H","difficulty":3,"starred":true,"topic":"implicit_prime_factorization","topics":["implicit_prime_factorization"],"solved":false},{"id":"atcoder_arc122_e","judge":"AtCoder","title":"Increasing LCMs","url":"https://atcoder.jp/contests/arc122/tasks/arc122_e","difficulty":3,"starred":true,"topic":"implicit_prime_factorization","topics":["implicit_prime_factorization"],"solved":false},{"id":"cses_2182","judge":"CSES","title":"Divisor Analysis","url":"https://cses.fi/problemset/task/2182","difficulty":1,"starred":true,"topic":"sigma_function","topics":["sigma_function"],"solved":true},{"id":"cses_1082","judge":"CSES","title":"Sum of Divisors","url":"https://cses.fi/problemset/task/1082","difficulty":1,"starred":true,"topic":"sigma_function","topics":["sigma_function","sum_of_floors"],"solved":true},{"id":"cf_group_338701j","judge":"Codeforces","title":"All About Divisors","url":"https://codeforces.com/group/H10hR2t6Sj/contest/338701/problem/J","difficulty":2,"starred":true,"topic":"sigma_function","topics":["sigma_function"],"solved":false},{"id":"uva_13279","judge":"UVa","title":"Divisors","url":"https://vjudge.net/problem/UVA-13279","difficulty":2,"starred":true,"topic":"sigma_function","topics":["sigma_function"],"solved":false},{"id":"cf_gym_102040c","judge":"CF Gym","title":"Divisors of the Divisors of An Integer","url":"https://codeforces.com/gym/102040/problem/C","difficulty":2,"starred":true,"topic":"sigma_function","topics":["sigma_function"],"solved":false},{"id":"cf_gym_105805b","judge":"CF Gym","title":"Kaosar Loves Divisors","url":"https://codeforces.com/gym/105805/problem/B","difficulty":2,"starred":false,"topic":"sigma_function","topics":["sigma_function"],"solved":false},{"id":"spoj_invdiv","judge":"SPOJ","title":"Smallest Inverse Sum of Divisors","url":"https://www.spoj.com/problems/INVDIV/","difficulty":3,"starred":true,"topic":"sigma_function","topics":["sigma_function"],"solved":false},{"id":"spoj_etf","judge":"SPOJ","title":"Euler Totient Function","url":"https://www.spoj.com/problems/ETF/","difficulty":1,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":true},{"id":"lightoj_mathematically_hard","judge":"LightOJ","title":"Mathematically Hard","url":"https://lightoj.com/problem/mathematically-hard","difficulty":1,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"uva_3856","judge":"UVa","title":"Best Friend","url":"https://onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&problem=3856","difficulty":1,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"spoj_tip1","judge":"SPOJ","title":"Totient in permutation (easy)","url":"https://www.spoj.com/problems/TIP1/","difficulty":1,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"uva_1931","judge":"UVa","title":"Another New Function","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1931","difficulty":1,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"uva_1120","judge":"UVa","title":"Irreducable Basic Fractions","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1120","difficulty":1,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"kattis_farey","judge":"Kattis","title":"Farey Sequence Length","url":"https://open.kattis.com/problems/farey","difficulty":1,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"uva_1240","judge":"UVa","title":"Relatives","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1240","difficulty":1,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"spoj_dcepca03","judge":"SPOJ","title":"Totient Extreme","url":"https://www.spoj.com/problems/DCEPCA03/","difficulty":1,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"spoj_najpwg","judge":"SPOJ","title":"Playing with GCD","url":"https://www.spoj.com/problems/NAJPWG/","difficulty":1,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"codeforces_1514c","judge":"Codeforces","title":"Product 1 Modulo N","url":"https://codeforces.com/problemset/problem/1514/C","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"kattis_coprimeintegers","judge":"Kattis","title":"Coprime Integers","url":"https://open.kattis.com/problems/coprimeintegers","difficulty":1,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function","mobius_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"cses_2417","judge":"CSES","title":"Counting Coprime Pairs","url":"https://cses.fi/problemset/task/2417","difficulty":1,"starred":true,"topic":"eulers_totient_function","topics":["mobius_function","inclusion_and_exclusion_on_multiples","eulers_totient_function"],"solved":false},{"id":"poj_2478","judge":"POJ","title":"Farey Sequence","url":"http://poj.org/problem?id=2478","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"codechef_smplsum","judge":"CodeChef","title":"Simple Sum","url":"https://www.codechef.com/NOV15/problems/SMPLSUM","difficulty":2,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function","mobius_function"],"solved":false},{"id":"spoj_gcdex","judge":"SPOJ","title":"GCD Extreme","url":"https://www.spoj.com/problems/GCDEX/","difficulty":1,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function","mobius_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"spoj_lcmsum","judge":"SPOJ","title":"LCM Sum","url":"https://www.spoj.com/problems/LCMSUM/","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"lightoj_lcm_extreme","judge":"LightOJ","title":"LCM Extreme","url":"https://lightoj.com/problem/lcm-extreme","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"uva_4878","judge":"UVa","title":"Farey Sequence","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4878","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function","rational_approximation_stern_brocot_tree"],"solved":false},{"id":"codechef_cozie","judge":"CodeChef","title":"Golu and Sweetness","url":"https://www.codechef.com/problems/COZIE","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"spoj_dcepc12g","judge":"SPOJ","title":"G Force","url":"https://www.spoj.com/problems/DCEPC12G/","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"leetcode_super_pow","judge":"LeetCode","title":"Super Pow","url":"https://leetcode.com/problems/super-pow/","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"codeforces_776e","judge":"Codeforces","title":"The Holmes Children","url":"https://codeforces.com/problemset/problem/776/E","difficulty":2,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"codeforces_1717e","judge":"Codeforces","title":"Madoka and The Best University","url":"https://codeforces.com/contest/1717/problem/E","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"codeforces_645f","judge":"Codeforces","title":"Cowslip Collections","url":"https://codeforces.com/contest/645/problem/F","difficulty":3,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"timus_1673","judge":"Timus","title":"Admission to Exam","url":"https://acm.timus.ru/problem.aspx?space=1&num=1673","difficulty":1,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function","rational_approximation_stern_brocot_tree"],"solved":false},{"id":"spoj_invphi","judge":"SPOJ","title":"Smallest Inverse Euler Totient Function","url":"https://www.spoj.com/problems/INVPHI/","difficulty":3,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function","backtracking"],"solved":false},{"id":"codeforces_1797e","judge":"Codeforces","title":"Li Hua and Array","url":"https://codeforces.com/problemset/problem/1797/e","difficulty":3,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"codeforces_1295d","judge":"Codeforces","title":"D. Same GCDs","url":"https://codeforces.com/contest/1295/problem/D","difficulty":2,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"toph_eulers_peculiar_dream","judge":"Toph","title":"Eulers Peculiar Dream","url":"https://toph.co/p/eulers-peculiar-dream","difficulty":2,"starred":true,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"codeforces_1731e","judge":"Codeforces","title":"Graph Cost","url":"https://codeforces.com/contest/1731/problem/E","difficulty":2,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"codeforces_1036f","judge":"Codeforces","title":"Relatively Prime Powers","url":"https://codeforces.com/contest/1036/problem/F","difficulty":2,"starred":false,"topic":"eulers_totient_function","topics":["eulers_totient_function"],"solved":false},{"id":"cf_gym_100975f","judge":"CF Gym","title":"Simple Calculations","url":"https://codeforces.com/gym/100975/problem/F","difficulty":1,"starred":true,"topic":"power_tower","topics":["power_tower"],"solved":false},{"id":"kattis_exponial","judge":"Kattis","title":"Exponial","url":"https://open.kattis.com/problems/exponial","difficulty":2,"starred":true,"topic":"power_tower","topics":["power_tower"],"solved":false},{"id":"codeforces_906d","judge":"Codeforces","title":"Power Tower","url":"https://codeforces.com/problemset/problem/906/D","difficulty":2,"starred":true,"topic":"power_tower","topics":["power_tower"],"solved":false},{"id":"codechef_ckoj20e","judge":"CodeChef","title":"Venkatesh is bored","url":"https://www.codechef.com/problems/CKOJ20E","difficulty":2,"starred":true,"topic":"power_tower","topics":["power_tower"],"solved":false},{"id":"atcoder_arc113_b","judge":"AtCoder","title":"A^B^C","url":"https://atcoder.jp/contests/arc113/tasks/arc113_b","difficulty":1,"starred":false,"topic":"power_tower","topics":["power_tower"],"solved":false},{"id":"codechef_coprime3","judge":"CodeChef","title":"Coprime Triples","url":"https://www.codechef.com/LTIME13/problems/COPRIME3","difficulty":1,"starred":true,"topic":"mobius_function","topics":["mobius_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"codeforces_547c","judge":"Codeforces","title":"Mike and Foam","url":"https://codeforces.com/contest/547/problem/C","difficulty":2,"starred":true,"topic":"mobius_function","topics":["mobius_function"],"solved":false},{"id":"codeforces_839d","judge":"Codeforces","title":"Winter is here","url":"https://codeforces.com/contest/839/problem/D","difficulty":2,"starred":true,"topic":"mobius_function","topics":["inclusion_and_exclusion_on_multiples","mobius_function"],"solved":false},{"id":"atcoder_agc038_c","judge":"AtCoder","title":"LCMs","url":"https://atcoder.jp/contests/agc038/tasks/agc038_c","difficulty":2,"starred":true,"topic":"mobius_function","topics":["inclusion_and_exclusion_on_multiples","mobius_function"],"solved":false},{"id":"spoj_pstr","judge":"SPOJ","title":"Number of Prime Strings","url":"https://www.spoj.com/problems/PSTR/","difficulty":2,"starred":true,"topic":"mobius_function","topics":["mobius_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"codeforces_439e","judge":"Codeforces","title":"Devu and Birthday Celebration","url":"https://codeforces.com/contest/439/problem/E","difficulty":2,"starred":false,"topic":"mobius_function","topics":["mobius_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"codeforces_915g","judge":"Codeforces","title":"Coprime Arrays","url":"https://codeforces.com/contest/915/problem/G","difficulty":2,"starred":true,"topic":"mobius_function","topics":["mobius_function"],"solved":false},{"id":"hdu_1695","judge":"HDU","title":"GCD","url":"http://acm.hdu.edu.cn/showproblem.php?pid=1695","difficulty":2,"starred":false,"topic":"mobius_function","topics":["mobius_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"hackerrank_gcd_product","judge":"HackerRank","title":"GCD Product","url":"https://www.hackerrank.com/contests/w3/challenges/gcd-product","difficulty":2,"starred":false,"topic":"mobius_function","topics":["mobius_function"],"solved":false},{"id":"codeforces_1436f","judge":"Codeforces","title":"Sum Over Subsets","url":"https://codeforces.com/contest/1436/problem/F","difficulty":2,"starred":true,"topic":"mobius_function","topics":["mobius_function"],"solved":false},{"id":"atcoder_abc162_e","judge":"AtCoder","title":"Sum of gcd of Tuples (Hard)","url":"https://atcoder.jp/contests/abc162/tasks/abc162_e","difficulty":2,"starred":true,"topic":"mobius_function","topics":["mobius_function","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"codeforces_920g","judge":"Codeforces","title":"List Of Integers","url":"https://codeforces.com/contest/920/problem/G","difficulty":2,"starred":true,"topic":"mobius_function","topics":["mobius_function"],"solved":false},{"id":"spoj_sqfree","judge":"SPOJ","title":"Square-free integers","url":"https://www.spoj.com/problems/SQFREE/","difficulty":2,"starred":true,"topic":"mobius_function","topics":["principle_of_inclusion_and_exclusion","mobius_function"],"solved":false},{"id":"cf_gym_102354b","judge":"CF Gym","title":"Yet Another Convolution","url":"https://codeforces.com/gym/102354/problem/B","difficulty":3,"starred":true,"topic":"mobius_function","topics":["mobius_function"],"solved":false},{"id":"toph_joker_s_gcd_test","judge":"Toph","title":"Joker's GCD Test","url":"https://toph.co/p/joker-s-gcd-test","difficulty":2,"starred":true,"topic":"mobius_function","topics":["mobius_function"],"solved":false},{"id":"atcoder_abc361_f","judge":"AtCoder","title":"x = a^b","url":"https://atcoder.jp/contests/abc361/tasks/abc361_f","difficulty":2,"starred":true,"topic":"mobius_function","topics":["principle_of_inclusion_and_exclusion","mobius_function"],"solved":false},{"id":"yosupo_sum_of_totient_function","judge":"Library Checker","title":"Sum of Totient Function","url":"https://judge.yosupo.jp/problem/sum_of_totient_function","difficulty":1,"starred":true,"topic":"dirichlet_convolution","topics":["dirichlet_convolution","min_25_sieve"],"solved":false},{"id":"hdu_5608","judge":"HDU","title":"function","url":"http://acm.hdu.edu.cn/showproblem.php?pid=5608","difficulty":1,"starred":false,"topic":"dirichlet_convolution","topics":["dirichlet_convolution"],"solved":false},{"id":"luogu_p4213","judge":"Luogu","title":"杜教筛","url":"https://www.luogu.com.cn/problem/P4213","difficulty":1,"starred":false,"topic":"dirichlet_convolution","topics":["dirichlet_convolution","min_25_sieve"],"solved":false},{"id":"spoj_divcnt2","judge":"SPOJ","title":"Counting Divisors (square)","url":"https://www.spoj.com/problems/DIVCNT2/","difficulty":3,"starred":false,"topic":"dirichlet_convolution","topics":["dirichlet_convolution"],"solved":false},{"id":"luogu_p3768","judge":"Luogu","title":"简单的数学题","url":"https://www.luogu.com.cn/problem/P3768","difficulty":3,"starred":false,"topic":"dirichlet_convolution","topics":["dirichlet_convolution"],"solved":false},{"id":"cf_gym_102471c","judge":"CF Gym","title":"Dirichlet 𝑘 -th root","url":"https://codeforces.com/gym/102471/problem/C","difficulty":3,"starred":true,"topic":"dirichlet_convolution","topics":["dirichlet_convolution"],"solved":false},{"id":"yosupo_sum_of_multiplicative_function","judge":"Library Checker","title":"Sum of Multiplicative Function","url":"https://judge.yosupo.jp/problem/sum_of_multiplicative_function","difficulty":1,"starred":true,"topic":"min_25_sieve","topics":["min_25_sieve"],"solved":false},{"id":"luogu_p5325","judge":"Luogu","title":"Min_25 筛","url":"https://www.luogu.com.cn/problem/P5325","difficulty":2,"starred":true,"topic":"min_25_sieve","topics":["min_25_sieve","powerful_number_sieve"],"solved":false},{"id":"spoj_assieve","judge":"SPOJ","title":"A Simple Sieve","url":"https://www.spoj.com/problems/ASSIEVE/","difficulty":2,"starred":true,"topic":"min_25_sieve","topics":["min_25_sieve"],"solved":false},{"id":"loj_6053","judge":"LibreOJ","title":"简单的函数","url":"https://loj.ac/problem/6053","difficulty":1,"starred":true,"topic":"min_25_sieve","topics":["min_25_sieve","powerful_number_sieve"],"solved":false},{"id":"codeforces_2020f","judge":"Codeforces","title":"Count Leaves","url":"https://codeforces.com/contest/2020/problem/F","difficulty":1,"starred":true,"topic":"min_25_sieve","topics":["min_25_sieve"],"solved":false},{"id":"hdu_7186","judge":"HDU","title":"Jo loves counting","url":"https://vjudge.net/problem/HDU-7186","difficulty":2,"starred":true,"topic":"powerful_number_sieve","topics":["powerful_number_sieve"],"solved":false},{"id":"codeforces_217b","judge":"Codeforces","title":"Blackboard Fibonacci","url":"https://codeforces.com/problemset/problem/217/B","difficulty":2,"starred":false,"topic":"euclidean_algorithm","topics":["euclidean_algorithm"],"solved":false},{"id":"uva_1045","judge":"UVa","title":"Euclid Problem","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1045","difficulty":1,"starred":true,"topic":"extended_euclid","topics":["extended_euclid"],"solved":false},{"id":"uva_4628","judge":"UVa","title":"Gift Dilemma","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4628","difficulty":1,"starred":false,"topic":"extended_euclid","topics":["extended_euclid"],"solved":false},{"id":"uva_1031","judge":"UVa","title":"Marbles","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1031","difficulty":1,"starred":false,"topic":"extended_euclid","topics":["extended_euclid"],"solved":false},{"id":"dmoj_ccc01j2","judge":"DMOJ","title":"Mod Inverse","url":"https://vjudge.net/problem/DMOJ-ccc01j2","difficulty":1,"starred":false,"topic":"extended_euclid","topics":["extended_euclid"],"solved":false},{"id":"cf_gym_100963j","judge":"CF Gym","title":"Once Upon A Time","url":"https://codeforces.com/gym/100963/problem/J","difficulty":1,"starred":true,"topic":"extended_euclid","topics":["extended_euclid"],"solved":false},{"id":"uva_1614","judge":"UVa","title":"Play with Floor and Ceil","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1614","difficulty":1,"starred":false,"topic":"extended_euclid","topics":["extended_euclid"],"solved":false},{"id":"codeforces_1748d","judge":"Codeforces","title":"ConstructOR","url":"https://codeforces.com/problemset/problem/1748/D","difficulty":2,"starred":true,"topic":"extended_euclid","topics":["extended_euclid"],"solved":false},{"id":"spoj_main74","judge":"SPOJ","title":"Euclids algorithm revisited","url":"https://www.spoj.com/problems/MAIN74/","difficulty":2,"starred":true,"topic":"extended_euclid","topics":["fibonacci_numbers","extended_euclid"],"solved":false},{"id":"leetcode_check_if_it_is_a_good_array","judge":"LeetCode","title":"Check If It Is a Good Array","url":"https://leetcode.com/problems/check-if-it-is-a-good-array/","difficulty":1,"starred":true,"topic":"bezouts_identity","topics":["bezouts_identity"],"solved":false},{"id":"codeforces_1011e","judge":"Codeforces","title":"Border","url":"https://codeforces.com/contest/1011/problem/E","difficulty":2,"starred":true,"topic":"bezouts_identity","topics":["bezouts_identity"],"solved":false},{"id":"codeforces_1477a","judge":"Codeforces","title":"Nezzar and Board","url":"https://codeforces.com/contest/1477/problem/A","difficulty":2,"starred":true,"topic":"bezouts_identity","topics":["bezouts_identity"],"solved":false},{"id":"codeforces_1245a","judge":"Codeforces","title":"Good ol' Numbers Coloring","url":"https://codeforces.com/contest/1245/problem/A","difficulty":1,"starred":false,"topic":"chicken_mcnugget_theorem","topics":["chicken_mcnugget_theorem"],"solved":false},{"id":"codeforces_1526b","judge":"Codeforces","title":"I Hate 1111","url":"https://codeforces.com/contest/1526/problem/B","difficulty":1,"starred":true,"topic":"chicken_mcnugget_theorem","topics":["chicken_mcnugget_theorem"],"solved":false},{"id":"kattis_chineseremainder","judge":"Kattis","title":"Chinese Remainder","url":"https://open.kattis.com/problems/chineseremainder","difficulty":1,"starred":true,"topic":"crt","topics":["crt"],"solved":false},{"id":"kattis_generalchineseremainder","judge":"Kattis","title":"Chinese Remainder Theorem (non-relatively prime moduli)","url":"https://open.kattis.com/problems/generalchineseremainder","difficulty":1,"starred":true,"topic":"crt","topics":["crt"],"solved":false},{"id":"lightoj_monkey_tradition","judge":"LightOJ","title":"Monkey Tradition","url":"https://lightoj.com/problem/monkey-tradition","difficulty":1,"starred":true,"topic":"crt","topics":["crt"],"solved":false},{"id":"hackerrank_cheese-and-random-toppings","judge":"HackerRank","title":"Cheese and Random Toppings","url":"https://www.hackerrank.com/contests/infinitum10/challenges/cheese-and-random-toppings/problem","difficulty":2,"starred":true,"topic":"crt","topics":["crt"],"solved":false},{"id":"codeforces_687b","judge":"Codeforces","title":"Remainders Game","url":"https://codeforces.com/problemset/problem/687/B","difficulty":1,"starred":false,"topic":"crt","topics":["crt"],"solved":false},{"id":"hackerrank_number_of_sequences","judge":"HackerRank","title":"Number of Sequences","url":"https://www.hackerrank.com/contests/w22/challenges/number-of-sequences/problem","difficulty":2,"starred":true,"topic":"crt","topics":["crt"],"solved":false},{"id":"codeforces_1500b","judge":"Codeforces","title":"Two chandeliers","url":"https://codeforces.com/problemset/problem/1500/B","difficulty":2,"starred":true,"topic":"crt","topics":["crt"],"solved":false},{"id":"codeforces_338d","judge":"Codeforces","title":"GCD Table","url":"https://codeforces.com/problemset/problem/338/D","difficulty":3,"starred":true,"topic":"crt","topics":["crt"],"solved":false},{"id":"szkopul_o730xgzevyntwbmscbinhmbd","judge":"Szkopuł","title":"Arkanoid","url":"https://szkopul.edu.pl/problemset/problem/O730xgZEVynTWBmscBinhMbD/site/?key=statement","difficulty":3,"starred":false,"topic":"crt","topics":["crt"],"solved":false},{"id":"hackerrank_ncr","judge":"HackerRank","title":"nCr","url":"https://www.hackerrank.com/challenges/ncr/problem","difficulty":1,"starred":true,"topic":"crt","topics":["ncr_modulo_any_mod","crt"],"solved":false},{"id":"cf_gym_101481b","judge":"CF Gym","title":"Boring Card Game","url":"https://codeforces.com/gym/101481/problem/B","difficulty":2,"starred":false,"topic":"crt","topics":["crt"],"solved":false},{"id":"kattis_gears","judge":"Kattis","title":"Gears in Action","url":"https://vjudge.net/problem/Kattis-gears","difficulty":2,"starred":false,"topic":"crt","topics":["crt"],"solved":false},{"id":"codechef_sandwich","judge":"CodeChef","title":"Long Sandwich","url":"https://www.codechef.com/problems/SANDWICH","difficulty":2,"starred":true,"topic":"crt","topics":["ncr_modulo_any_mod","crt"],"solved":false},{"id":"spoj_dcepc13d","judge":"SPOJ","title":"The Ultimate Riddle","url":"https://www.spoj.com/problems/DCEPC13D/","difficulty":2,"starred":true,"topic":"crt","topics":["lucas_theorem","crt"],"solved":false},{"id":"codeforces_284a","judge":"Codeforces","title":"Cows and Primitive Roots","url":"https://codeforces.com/problemset/problem/284/A","difficulty":1,"starred":false,"topic":"primitive_root","topics":["primitive_root"],"solved":false},{"id":"spoj_proot","judge":"SPOJ","title":"Primitive Root","url":"https://www.spoj.com/problems/PROOT/","difficulty":2,"starred":true,"topic":"primitive_root","topics":["primitive_root"],"solved":false},{"id":"spoj_problem4","judge":"SPOJ","title":"PRIMITIVEROOTS","url":"https://www.spoj.com/problems/PROBLEM4/","difficulty":2,"starred":false,"topic":"primitive_root","topics":["primitive_root"],"solved":false},{"id":"codechef_minprod","judge":"CodeChef","title":"Product of Minimums","url":"https://www.codechef.com/problems/MINPROD","difficulty":2,"starred":true,"topic":"primitive_root","topics":["primitive_root"],"solved":false},{"id":"codechef_coolsbst","judge":"CodeChef","title":"Cool Subsets","url":"https://www.codechef.com/JAN21A/problems/COOLSBST","difficulty":3,"starred":true,"topic":"primitive_root","topics":["prefix_sum_queries_of_nci","primitive_root"],"solved":false},{"id":"atcoder_agc047_c","judge":"AtCoder","title":"Product Modulo","url":"https://atcoder.jp/contests/agc047/tasks/agc047_c","difficulty":3,"starred":true,"topic":"primitive_root","topics":["primitive_root","fft"],"solved":false},{"id":"toph_i_am_good","judge":"Toph","title":"I Am Good","url":"https://toph.co/p/i-am-good","difficulty":1,"starred":true,"topic":"multiplicative_order","topics":["multiplicative_order"],"solved":false},{"id":"kattis_divideandconquer","judge":"Kattis","title":"Divide and Conquer","url":"https://maps20.kattis.com/contests/maps20/problems/divideandconquer","difficulty":2,"starred":false,"topic":"multiplicative_order","topics":["multiplicative_order"],"solved":false},{"id":"codeforces_852f","judge":"Codeforces","title":"Product transformation","url":"https://codeforces.com/problemset/problem/852/F","difficulty":2,"starred":false,"topic":"multiplicative_order","topics":["multiplicative_order"],"solved":false},{"id":"atcoder_abc335_g","judge":"AtCoder","title":"Discrete Logarithm Problems","url":"https://atcoder.jp/contests/abc335/tasks/abc335_g","difficulty":3,"starred":true,"topic":"multiplicative_order","topics":["multiplicative_order","discrete_log","dp_over_divisors"],"solved":false},{"id":"atcoder_icpc2015summer_day4_d","judge":"AtCoder","title":"Identity Function","url":"https://atcoder.jp/contests/jag2015summer-day4/tasks/icpc2015summer_day4_d","difficulty":3,"starred":true,"topic":"multiplicative_order","topics":["multiplicative_order"],"solved":false},{"id":"cf_gym_101853g","judge":"CF Gym","title":"Hard Equation","url":"https://codeforces.com/gym/101853/problem/G","difficulty":1,"starred":true,"topic":"discrete_log","topics":["discrete_log"],"solved":false},{"id":"spoj_mod","judge":"SPOJ","title":"Power Modulo Inverted","url":"https://www.spoj.com/problems/MOD/","difficulty":1,"starred":false,"topic":"discrete_log","topics":["discrete_log"],"solved":false},{"id":"codechef_invxor","judge":"CodeChef","title":"Inverse of a Function","url":"https://www.codechef.com/problems/INVXOR/","difficulty":2,"starred":true,"topic":"discrete_log","topics":["discrete_log"],"solved":false},{"id":"topcoder_14386","judge":"TopCoder","title":"SplittingFoxes3","url":"https://community.topcoder.com/stat?c=problem_statement&pm=14386&rd=16801","difficulty":2,"starred":false,"topic":"discrete_log","topics":["discrete_log"],"solved":false},{"id":"cf_gym_103260m","judge":"CF Gym","title":"Discrete Logarithm is a Joke","url":"https://codeforces.com/gym/103260/problem/M","difficulty":1,"starred":false,"topic":"discrete_log","topics":["discrete_log"],"solved":false},{"id":"codechef_chefmod","judge":"CodeChef","title":"Chef and Modular Sequence","url":"https://www.codechef.com/problems/CHEFMOD","difficulty":3,"starred":true,"topic":"discrete_log","topics":["discrete_log"],"solved":false},{"id":"hdu_6632","judge":"HDU","title":"discrete logarithm problem","url":"https://vjudge.net/problem/HDU-6632","difficulty":3,"starred":false,"topic":"discrete_log","topics":["discrete_log"],"solved":false},{"id":"acmsguru_99999261","judge":"Codeforces","title":"Discrete Roots","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/261","difficulty":1,"starred":true,"topic":"discrete_root","topics":["discrete_root"],"solved":false},{"id":"spoj_discrt","judge":"SPOJ","title":"Discrete Roots","url":"https://vjudge.net/problem/SPOJ-DISCRT","difficulty":1,"starred":true,"topic":"discrete_root","topics":["discrete_root"],"solved":false},{"id":"codeforces_1106f","judge":"Codeforces","title":"Lunar New Year and a Recursive Sequence","url":"https://codeforces.com/contest/1106/problem/F","difficulty":2,"starred":true,"topic":"discrete_root","topics":["discrete_root","matrix_exponentiation"],"solved":false},{"id":"yosupo_kth_root_mod","judge":"Library Checker","title":"Kth Root (Mod)","url":"https://judge.yosupo.jp/problem/kth_root_mod","difficulty":1,"starred":true,"topic":"discrete_root_in_o_p_1_4","topics":["discrete_root_in_o_p_1_4"],"solved":false},{"id":"yosupo_sqrt_mod","judge":"Library Checker","title":"Sqrt Mod","url":"https://judge.yosupo.jp/problem/sqrt_mod","difficulty":1,"starred":true,"topic":"tonelli_shanks_algorithm","topics":["tonelli_shanks_algorithm"],"solved":false},{"id":"luogu_p5491","judge":"Luogu","title":"二次剩余","url":"https://www.luogu.com.cn/problem/P5491","difficulty":1,"starred":false,"topic":"tonelli_shanks_algorithm","topics":["tonelli_shanks_algorithm"],"solved":false},{"id":"codechef_lcasqrt","judge":"CodeChef","title":"Square Root of LCA Convolution","url":"https://www.codechef.com/problems/LCASQRT","difficulty":2,"starred":true,"topic":"tonelli_shanks_algorithm","topics":["tonelli_shanks_algorithm"],"solved":false},{"id":"toph_congruence_problem","judge":"Toph","title":"Congruence Problem","url":"https://toph.co/p/congruence-problem","difficulty":1,"starred":true,"topic":"number_of_solutions_to_x_2_1_mod_m","topics":["number_of_solutions_to_x_2_1_mod_m"],"solved":false},{"id":"spoj_cequ","judge":"SPOJ","title":"Crucial Equation","url":"https://www.spoj.com/problems/CEQU/","difficulty":1,"starred":false,"topic":"linear_diophantine_equation_with_two_variables","topics":["linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"codechef_copr16g","judge":"CodeChef","title":"Get AC in one go","url":"https://www.codechef.com/problems/COPR16G","difficulty":1,"starred":false,"topic":"linear_diophantine_equation_with_two_variables","topics":["linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"lightoj_solutions_to_an_equation","judge":"LightOJ","title":"Solutions to an Equation","url":"https://lightoj.com/problem/solutions-to-an-equation","difficulty":1,"starred":true,"topic":"linear_diophantine_equation_with_two_variables","topics":["linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"acmsguru_99999106","judge":"Codeforces","title":"The equation","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/106","difficulty":1,"starred":false,"topic":"linear_diophantine_equation_with_two_variables","topics":["linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"sgu_106","judge":"Codeforces","title":"The equation","url":"https://vjudge.net/problem/SGU-106","difficulty":1,"starred":false,"topic":"linear_diophantine_equation_with_two_variables","topics":["linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"uva_13041","judge":"UVa","title":"Fraction and Sequence","url":"https://vjudge.net/problem/UVA-13041","difficulty":2,"starred":false,"topic":"linear_diophantine_equation_with_two_variables","topics":["trivariable_linear_diophantine_equation_with_nonnegative_solutions","linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"codeforces_1260c","judge":"Codeforces","title":"Infinite Fence","url":"https://codeforces.com/contest/1260/problem/C","difficulty":2,"starred":true,"topic":"linear_diophantine_equation_with_two_variables","topics":["linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"atcoder_abc340_f","judge":"AtCoder","title":"S = 1","url":"https://atcoder.jp/contests/abc340/tasks/abc340_f","difficulty":2,"starred":true,"topic":"linear_diophantine_equation_with_two_variables","topics":["linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"uva_718","judge":"UVa","title":"Skyscraper Floors","url":"https://vjudge.net/problem/UVA-718","difficulty":2,"starred":false,"topic":"linear_diophantine_equation_with_two_variables","topics":["linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"codeforces_986f","judge":"Codeforces","title":"Oppa Funcan Style Remastered","url":"https://codeforces.com/contest/986/problem/F","difficulty":4,"starred":false,"topic":"linear_diophantine_equation_with_two_variables","topics":["linear_diophantine_equation_with_two_variables"],"solved":false},{"id":"cf_gym_102020i","judge":"CF Gym","title":"Illegal Towers","url":"https://codeforces.com/gym/102020/problem/I","difficulty":1,"starred":true,"topic":"linear_diophantine_equation_with_n_variables","topics":["linear_diophantine_equation_with_n_variables"],"solved":false},{"id":"codemarshal_duet_2019F","judge":"Google","title":"Building Blocks","url":"https://drive.google.com/file/d/1vNCHV7gCrAz1ZYmXKmmvcsmMugGRQrZa/view","difficulty":2,"starred":true,"topic":"multivariable_linear_diophantine_equation_with_nonnegative_solutions","topics":["multivariable_linear_diophantine_equation_with_nonnegative_solutions"],"solved":false},{"id":"codedrills_strange_keyboard","judge":"CodeDrills","title":"Strange Keyboard","url":"https://codedrills.io/contests/icpc-asia-west-continent-final-contest-2022/problems/strange-keyboard","difficulty":2,"starred":true,"topic":"multivariable_linear_diophantine_equation_with_nonnegative_solutions","topics":["multivariable_linear_diophantine_equation_with_nonnegative_solutions"],"solved":false},{"id":"cf_gym_102769i","judge":"CF Gym","title":"Interstellar Hunter","url":"https://codeforces.com/gym/102769/problem/I","difficulty":2,"starred":true,"topic":"linear_diophantine_with_n_unknowns_and_two_equations","topics":["linear_diophantine_with_n_unknowns_and_two_equations"],"solved":false},{"id":"atcoder_abc087_b","judge":"AtCoder","title":"Coins","url":"https://atcoder.jp/contests/abc087/tasks/abc087_b","difficulty":1,"starred":false,"topic":"number_of_solutions_to_a_basic_linear_algebraic_equation","topics":["number_of_solutions_to_a_basic_linear_algebraic_equation"],"solved":false},{"id":"toph_biswa_the_digital_gutibaj","judge":"Toph","title":"Biswa the Digital Gutibaj","url":"https://toph.co/p/biswa-the-digital-gutibaj","difficulty":2,"starred":false,"topic":"number_of_solutions_to_a_basic_linear_algebraic_equation","topics":["number_of_solutions_to_a_basic_linear_algebraic_equation"],"solved":false},{"id":"lightoj_cricket_ranking","judge":"LightOJ","title":"Cricket Ranking","url":"https://lightoj.com/problem/cricket-ranking","difficulty":2,"starred":true,"topic":"number_of_solutions_to_a_basic_linear_algebraic_equation","topics":["number_of_solutions_to_a_basic_linear_algebraic_equation"],"solved":false},{"id":"codeforces_451e","judge":"Codeforces","title":"Devu and Flowers","url":"https://codeforces.com/problemset/problem/451/E","difficulty":2,"starred":true,"topic":"number_of_solutions_to_a_basic_linear_algebraic_equation","topics":["number_of_solutions_to_a_basic_linear_algebraic_equation"],"solved":false},{"id":"codeforces_1096e","judge":"Codeforces","title":"The Top Scorer","url":"https://codeforces.com/contest/1096/problem/E","difficulty":2,"starred":false,"topic":"number_of_solutions_to_a_basic_linear_algebraic_equation","topics":["number_of_solutions_to_a_basic_linear_algebraic_equation"],"solved":false},{"id":"cf_gym_102114f","judge":"CF Gym","title":"Fireflies","url":"https://codeforces.com/gym/102114/problem/F","difficulty":2,"starred":true,"topic":"number_of_solutions_to_a_basic_linear_algebraic_equation_with_variable_upper_bound_constraints","topics":["number_of_solutions_to_a_basic_linear_algebraic_equation_with_variable_upper_bound_constraints"],"solved":false},{"id":"hackerrank_equations","judge":"HackerRank","title":"Equations","url":"https://www.hackerrank.com/challenges/equations/problem","difficulty":1,"starred":true,"topic":"number_of_integer_solutions_to_1_x_1_y_1_k","topics":["number_of_integer_solutions_to_1_x_1_y_1_k"],"solved":false},{"id":"codechef_pythagoras","judge":"CodeChef","title":"Pythagorean Pair","url":"https://www.codechef.com/START62A/problems/PYTHAGORAS","difficulty":1,"starred":false,"topic":"two_squares_theorem","topics":["two_squares_theorem"],"solved":false},{"id":"timus_1593","judge":"Timus","title":"Square Country. Version 2","url":"https://acm.timus.ru/problem.aspx?space=1&num=1593","difficulty":2,"starred":true,"topic":"two_squares_theorem","topics":["two_squares_theorem"],"solved":false},{"id":"baekjoon_17633","judge":"Baekjoon","title":"제곱수의 합 (More Huge)","url":"https://www.acmicpc.net/problem/17633","difficulty":3,"starred":true,"topic":"two_squares_theorem","topics":["two_squares_theorem"],"solved":false},{"id":"baekjoon_17646","judge":"Baekjoon","title":"제곱수의 합 2 (More Huge)","url":"https://www.acmicpc.net/problem/17646","difficulty":3,"starred":false,"topic":"two_squares_theorem","topics":["two_squares_theorem"],"solved":false},{"id":"uva_12909","judge":"UVa","title":"Numeric Center","url":"https://vjudge.net/problem/UVA-12909","difficulty":2,"starred":true,"topic":"pells_equation","topics":["pells_equation"],"solved":false},{"id":"uva_1182","judge":"UVa","title":"Semi-triangular and also Square","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=14&page=show_problem&problem=1182","difficulty":2,"starred":false,"topic":"pells_equation","topics":["pells_equation"],"solved":false},{"id":"yosupo_enumerate_quotients","judge":"Library Checker","title":"Enumerate Quotients","url":"https://judge.yosupo.jp/problem/enumerate_quotients","difficulty":1,"starred":true,"topic":"sum_of_floors","topics":["sum_of_floors"],"solved":false},{"id":"codeforces_616e","judge":"Codeforces","title":"Sum of Remainders","url":"https://codeforces.com/problemset/problem/616/E","difficulty":2,"starred":true,"topic":"sum_of_floors","topics":["sum_of_floors"],"solved":false},{"id":"atcoder_abc356_e","judge":"AtCoder","title":"Max/Min","url":"https://atcoder.jp/contests/abc356/tasks/abc356_e","difficulty":2,"starred":true,"topic":"sum_of_floors","topics":["sum_of_floors"],"solved":false},{"id":"leetcode_sum_of_floored_pairs","judge":"LeetCode","title":"Sum of Floored Pairs","url":"https://leetcode.com/problems/sum-of-floored-pairs/","difficulty":2,"starred":true,"topic":"sum_of_floors","topics":["sum_of_floors"],"solved":false},{"id":"toph_colded_lcm","judge":"Toph","title":"Colded LCM","url":"https://toph.co/p/colded-lcm","difficulty":2,"starred":true,"topic":"sum_of_floors","topics":["sum_of_floors"],"solved":false},{"id":"hackerearth_yet_another_sum_problem","judge":"HackerEarth","title":"Yet Another Sum Problem","url":"https://www.hackerearth.com/problem/algorithm/yet-another-sum-problem/description/","difficulty":2,"starred":false,"topic":"sum_of_floors","topics":["sum_of_floors","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"atcoder_practice2_c","judge":"AtCoder","title":"Floor Sum","url":"https://atcoder.jp/contests/practice2/tasks/practice2_c","difficulty":1,"starred":true,"topic":"floor_sum_of_arithmetic_progression","topics":["floor_sum_of_arithmetic_progression"],"solved":false},{"id":"toph_linear_programming","judge":"Toph","title":"Linear Programming?","url":"https://toph.co/p/linear-programming","difficulty":1,"starred":true,"topic":"floor_sum_of_arithmetic_progression","topics":["floor_sum_of_arithmetic_progression"],"solved":false},{"id":"atcoder_abc372_g","judge":"AtCoder","title":"Ax + By < C","url":"https://atcoder.jp/contests/abc372/tasks/abc372_g","difficulty":2,"starred":true,"topic":"floor_sum_of_arithmetic_progression","topics":["half_plane_intersection","floor_sum_of_arithmetic_progression"],"solved":false},{"id":"poj_3495","judge":"POJ","title":"Bitwise XOR of Arithmetic Progression","url":"http://poj.org/problem?id=3495","difficulty":2,"starred":true,"topic":"floor_sum_of_arithmetic_progression","topics":["floor_sum_of_arithmetic_progression"],"solved":false},{"id":"topcoder_9733","judge":"TopCoder","title":"WifiPlanet","url":"https://community.topcoder.com/stat?c=problem_statement&pm=9733&rd=12182","difficulty":1,"starred":false,"topic":"generalized_floor_sum_of_arithmetic_progression","topics":["generalized_floor_sum_of_arithmetic_progression"],"solved":false},{"id":"loj_138","judge":"LibreOJ","title":"类欧几里得算法","url":"https://loj.ac/p/138","difficulty":1,"starred":true,"topic":"generalized_floor_sum_of_arithmetic_progression","topics":["generalized_floor_sum_of_arithmetic_progression"],"solved":false},{"id":"luogu_p5170","judge":"Luogu","title":"类欧几里得算法","url":"https://www.luogu.com.cn/problem/P5170","difficulty":1,"starred":true,"topic":"generalized_floor_sum_of_arithmetic_progression","topics":["generalized_floor_sum_of_arithmetic_progression"],"solved":false},{"id":"spoj_fibez","judge":"SPOJ","title":"Easy Fibonacci","url":"https://www.spoj.com/problems/FIBEZ/","difficulty":1,"starred":true,"topic":"fibonacci_numbers","topics":["fibonacci_numbers"],"solved":false},{"id":"hackerrank_is_fibo","judge":"HackerRank","title":"Is Fibo","url":"https://www.hackerrank.com/challenges/is-fibo/problem","difficulty":1,"starred":true,"topic":"fibonacci_numbers","topics":["fibonacci_numbers"],"solved":false},{"id":"cses_1722","judge":"CSES","title":"Fibonacci Numbers","url":"https://cses.fi/problemset/task/1722","difficulty":2,"starred":true,"topic":"fibonacci_numbers","topics":["fibonacci_numbers","matrix_exponentiation","phi_field","linear_recurrence_relations"],"solved":true},{"id":"lightoj_number_sequence","judge":"LightOJ","title":"Number Sequence","url":"https://lightoj.com/problem/number-sequence","difficulty":2,"starred":false,"topic":"fibonacci_numbers","topics":["fibonacci_numbers"],"solved":false},{"id":"spoj_fibosum","judge":"SPOJ","title":"Fibonacci Sum","url":"https://www.spoj.com/problems/FIBOSUM/","difficulty":2,"starred":true,"topic":"fibonacci_numbers","topics":["fibonacci_numbers"],"solved":false},{"id":"hackerrank_euler002","judge":"HackerRank","title":"Even Fibonacci numbers","url":"https://www.hackerrank.com/contests/projecteuler/challenges/euler002/problem","difficulty":1,"starred":false,"topic":"fibonacci_numbers","topics":["fibonacci_numbers"],"solved":false},{"id":"dmoj_fibonacci2","judge":"DMOJ","title":"Fibonacci Sequence (Harder)","url":"https://dmoj.ca/problem/fibonacci2","difficulty":3,"starred":false,"topic":"fibonacci_numbers","topics":["fibonacci_numbers"],"solved":false},{"id":"codeforces_1853b","judge":"Codeforces","title":"Fibonaccharsis","url":"https://codeforces.com/contest/1853/problem/B","difficulty":1,"starred":true,"topic":"fibonacci_numbers","topics":["fibonacci_numbers"],"solved":false},{"id":"hackerrank_fibonacci_lcm","judge":"HackerRank","title":"Fibonacci LCM","url":"https://www.hackerrank.com/contests/infinitum10/challenges/fibonacci-lcm/problem","difficulty":1,"starred":true,"topic":"lcm_of_fibonacci_numbers","topics":["lcm_of_fibonacci_numbers"],"solved":false},{"id":"codeforces_2033f","judge":"Codeforces","title":"Kosuke's Sloth","url":"https://codeforces.com/contest/2033/problem/F","difficulty":2,"starred":true,"topic":"pisano_period","topics":["pisano_period"],"solved":false},{"id":"spoj_pisano","judge":"SPOJ","title":"Modular Fibonacci Period","url":"https://www.spoj.com/problems/PISANO/","difficulty":1,"starred":true,"topic":"pisano_period","topics":["pisano_period"],"solved":false},{"id":"spoj_divfibs2","judge":"SPOJ","title":"Divisible Fibonacci Numbers","url":"https://www.spoj.com/problems/DIVFIBS2/","difficulty":2,"starred":true,"topic":"pisano_period","topics":["pisano_period"],"solved":false},{"id":"codeforces_193e","judge":"Codeforces","title":"Fibonacci Number","url":"https://codeforces.com/problemset/problem/193/E","difficulty":3,"starred":false,"topic":"pisano_period","topics":["pisano_period"],"solved":false},{"id":"cf_gym_104412f","judge":"CF Gym","title":"Fibonacci Fever","url":"https://codeforces.com/gym/104412/problem/F","difficulty":2,"starred":true,"topic":"phi_field","topics":["phi_field"],"solved":false},{"id":"gym_105170c","judge":"CF Gym","title":"Fibonacci Sum","url":"https://vjudge.net/problem/Gym-105170C","difficulty":2,"starred":true,"topic":"phi_field","topics":["phi_field"],"solved":false},{"id":"codeforces_718c","judge":"Codeforces","title":"Sasha and Array","url":"https://codeforces.com/problemset/problem/718/C","difficulty":2,"starred":true,"topic":"phi_field","topics":["matrix_exponentiation","phi_field"],"solved":false},{"id":"codechef_panic","judge":"CodeChef","title":"Panic! at the Disco","url":"https://www.codechef.com/problems/PANIC","difficulty":3,"starred":true,"topic":"phi_field","topics":["phi_field","linear_recurrence_on_matrices","berlekamp_messey","determinant_of_sparse_matrix"],"solved":false},{"id":"spoj_recpwsum","judge":"SPOJ","title":"Recurrence Power Sum","url":"https://www.spoj.com/problems/RECPWSUM/","difficulty":3,"starred":false,"topic":"phi_field","topics":["phi_field"],"solved":false},{"id":"codeforces_707c","judge":"Codeforces","title":"Pythagorean Triples","url":"https://codeforces.com/problemset/problem/707/C","difficulty":1,"starred":false,"topic":"pythagorean_triplets","topics":["pythagorean_triplets"],"solved":false},{"id":"cf_gym_104333i","judge":"CF Gym","title":"Hail Pythagoras","url":"https://codeforces.com/gym/104333/problem/I","difficulty":2,"starred":true,"topic":"pythagorean_triplets","topics":["pythagorean_triplets"],"solved":false},{"id":"yosupo_min_of_mod_of_linear","judge":"Library Checker","title":"Min of Mod of Linear","url":"https://judge.yosupo.jp/problem/min_of_mod_of_linear","difficulty":1,"starred":true,"topic":"min_of_mod_of_arithmetic_progression","topics":["min_of_mod_of_arithmetic_progression"],"solved":false},{"id":"uva_10077","judge":"UVa","title":"The Stern-Brocot Number System","url":"https://vjudge.net/problem/UVA-10077","difficulty":1,"starred":true,"topic":"rational_approximation_stern_brocot_tree","topics":["rational_approximation_stern_brocot_tree"],"solved":false},{"id":"yosupo_rational_approximation","judge":"Library Checker","title":"Rational Approximation","url":"https://judge.yosupo.jp/problem/rational_approximation","difficulty":1,"starred":true,"topic":"rational_approximation_stern_brocot_tree","topics":["rational_approximation_stern_brocot_tree"],"solved":false},{"id":"yandex_5457e","judge":"Yandex","title":"Decimal Form","url":"https://official.contest.yandex.ru/opencupXVIII/contest/5457/problems/E?lang=en","difficulty":2,"starred":true,"topic":"rational_approximation_stern_brocot_tree","topics":["rational_approximation_stern_brocot_tree"],"solved":false},{"id":"atcoder_abc408_g","judge":"AtCoder","title":"A/B < p/q < C/D","url":"https://atcoder.jp/contests/abc408/tasks/abc408_g","difficulty":2,"starred":true,"topic":"rational_approximation_stern_brocot_tree","topics":["rational_approximation_stern_brocot_tree"],"solved":false},{"id":"atcoder_abc333_g","judge":"AtCoder","title":"Nearest Fraction","url":"https://atcoder.jp/contests/abc333/tasks/abc333_g","difficulty":2,"starred":false,"topic":"rational_approximation_stern_brocot_tree","topics":["rational_approximation_stern_brocot_tree"],"solved":false},{"id":"cf_gym_102354i","judge":"CF Gym","title":"From Modular to Rational","url":"https://codeforces.com/gym/102354/problem/I","difficulty":2,"starred":false,"topic":"smallest_nonnegative_integer_x_s_t_l_ax_mod_p_r","topics":["smallest_nonnegative_integer_x_s_t_l_ax_mod_p_r","fraction_binary_search"],"solved":false},{"id":"hdu_6624","judge":"HDU","title":"fraction","url":"http://acm.hdu.edu.cn/showproblem.php?pid=6624","difficulty":3,"starred":false,"topic":"smallest_nonnegative_integer_x_s_t_l_ax_mod_p_r","topics":["smallest_nonnegative_integer_x_s_t_l_ax_mod_p_r"],"solved":false},{"id":"cf_gym_102411g","judge":"CF Gym","title":"Golf Time","url":"https://codeforces.com/gym/102411/problem/G","difficulty":3,"starred":true,"topic":"smallest_nonnegative_integer_x_s_t_l_ax_mod_p_r","topics":["smallest_nonnegative_integer_x_s_t_l_ax_mod_p_r"],"solved":false},{"id":"codeforces_1165e","judge":"Codeforces","title":"Two Arrays and Sum of Functions","url":"https://codeforces.com/contest/1165/problem/E","difficulty":1,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"spoj_tricount","judge":"SPOJ","title":"Counting Triangles","url":"https://vjudge.net/problem/SPOJ-TRICOUNT","difficulty":1,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"toph_easy_peasy_subset_sum","judge":"Toph","title":"Easy Peasy Subset Sum","url":"https://toph.co/p/easy-peasy-subset-sum","difficulty":1,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"spoj_summation","judge":"SPOJ","title":"SUMMATION","url":"https://www.spoj.com/problems/SUMMATION/","difficulty":1,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"gym_104333a","judge":"CF Gym","title":"Convolution XOR SUM","url":"https://vjudge.net/problem/Gym-104333A","difficulty":2,"starred":false,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"baekjoon_23992","judge":"Baekjoon","title":"Math Encoder","url":"https://vjudge.net/problem/Baekjoon-23992","difficulty":2,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"codeforces_1743f","judge":"Codeforces","title":"Intersection and Union","url":"https://codeforces.com/problemset/problem/1743/F","difficulty":2,"starred":false,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"codeforces_1777d","judge":"Codeforces","title":"Score of a Tree","url":"https://codeforces.com/contest/1777/problem/D","difficulty":2,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"codeforces_1824b2","judge":"Codeforces","title":"LuoTianyi and the Floating Islands (Hard Version)","url":"https://codeforces.com/problemset/problem/1824/B2","difficulty":2,"starred":true,"topic":"contribution_technique","topics":["probabilities_and_expected_values","contribution_technique"],"solved":false},{"id":"atcoder_abc312_g","judge":"AtCoder","title":"Avoid Straight Line","url":"https://atcoder.jp/contests/abc312/tasks/abc312_g","difficulty":3,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"codechef_yamp","judge":"CodeChef","title":"Yet Another Mex Problem","url":"https://www.codechef.com/problems/YAMP","difficulty":3,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"cf_gym_104375j","judge":"CF Gym","title":"Jumping Reaction","url":"https://codeforces.com/gym/104375/problem/J","difficulty":1,"starred":false,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"cf_gym_105884j","judge":"CF Gym","title":"LCM Factorization","url":"https://codeforces.com/gym/105884/problem/J","difficulty":1,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"qoj_5566","judge":"QOJ","title":"And Xor Tree","url":"https://qoj.ac/contest/1111/problem/5566","difficulty":2,"starred":true,"topic":"contribution_technique","topics":["contribution_technique"],"solved":false},{"id":"cses_2064","judge":"CSES","title":"Bracket Sequences I","url":"https://cses.fi/problemset/task/2064","difficulty":1,"starred":true,"topic":"catalan_numbers","topics":["catalan_numbers","balanced_brackets"],"solved":false},{"id":"codechef_panstack","judge":"CodeChef","title":"Stacking Pancakes","url":"https://www.codechef.com/APRIL12/problems/PANSTACK/","difficulty":1,"starred":false,"topic":"catalan_numbers","topics":["catalan_numbers"],"solved":false},{"id":"spoj_skyline","judge":"SPOJ","title":"Skyline","url":"https://www.spoj.com/problems/SKYLINE/","difficulty":1,"starred":false,"topic":"catalan_numbers","topics":["catalan_numbers"],"solved":false},{"id":"uva_932","judge":"UVa","title":"Safe Salutations","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=932","difficulty":1,"starred":true,"topic":"catalan_numbers","topics":["catalan_numbers"],"solved":false},{"id":"poj_2084","judge":"POJ","title":"Game of Connections","url":"http://poj.org/problem?id=2084","difficulty":1,"starred":false,"topic":"catalan_numbers","topics":["catalan_numbers"],"solved":false},{"id":"codeforces_9d","judge":"Codeforces","title":"How many trees?","url":"https://codeforces.com/problemset/problem/9/D","difficulty":2,"starred":true,"topic":"catalan_numbers","topics":["catalan_numbers"],"solved":false},{"id":"lightoj_counting_perfect_bst","judge":"LightOJ","title":"Counting Perfect BST","url":"https://lightoj.com/problem/counting-perfect-bst","difficulty":2,"starred":true,"topic":"catalan_numbers","topics":["catalan_numbers"],"solved":false},{"id":"uva_4752","judge":"UVa","title":"The Soldier's Dilemma","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4752","difficulty":2,"starred":false,"topic":"catalan_numbers","topics":["catalan_numbers"],"solved":false},{"id":"atcoder_abc205_e","judge":"AtCoder","title":"White and Black Balls","url":"https://atcoder.jp/contests/abc205/tasks/abc205_e","difficulty":1,"starred":false,"topic":"catalan_numbers","topics":["catalan_convolution","catalan_numbers"],"solved":false},{"id":"codeforces_785d","judge":"Codeforces","title":"Anton and School - 2","url":"https://codeforces.com/contest/785/problem/D","difficulty":2,"starred":true,"topic":"catalan_numbers","topics":["balanced_brackets","catalan_numbers"],"solved":false},{"id":"cses_2187","judge":"CSES","title":"Bracket Sequences II","url":"https://cses.fi/problemset/task/2187","difficulty":2,"starred":true,"topic":"catalan_convolution","topics":["catalan_convolution","balanced_brackets"],"solved":false},{"id":"uva_1266","judge":"UVa","title":"The Lottery","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1266","difficulty":1,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"cses_2185","judge":"CSES","title":"Prime Multiples","url":"https://cses.fi/problemset/task/2185","difficulty":1,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"codeforces_2125c","judge":"Codeforces","title":"Count Good Numbers","url":"https://codeforces.com/contest/2125/problem/C","difficulty":1,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"uva_2906","judge":"UVa","title":"Cheerleaders","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2906","difficulty":1,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"spoj_ngm2","judge":"SPOJ","title":"Another Game With Numbers","url":"https://www.spoj.com/problems/NGM2/","difficulty":1,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"spoj_easymath","judge":"SPOJ","title":"EASY MATH","url":"https://www.spoj.com/problems/EASYMATH/","difficulty":1,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"spoj_momos","judge":"SPOJ","title":"FEASTOFPIGS","url":"https://www.spoj.com/problems/MOMOS/","difficulty":1,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"hdu_4135","judge":"HDU","title":"Co-prime","url":"http://acm.hdu.edu.cn/showproblem.php?pid=4135","difficulty":1,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"atcoder_abc246_f","judge":"AtCoder","title":"Typewriter","url":"https://atcoder.jp/contests/abc246/tasks/abc246_f","difficulty":1,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"spoj_mskycode","judge":"SPOJ","title":"Sky Code","url":"https://www.spoj.com/problems/MSKYCODE/","difficulty":2,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"codechef_countrel","judge":"CodeChef","title":"Count Relations","url":"https://www.codechef.com/JAN11/problems/COUNTREL/","difficulty":2,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"spoj_kprimesb","judge":"SPOJ","title":"Almost Prime Numbers Again","url":"https://www.spoj.com/problems/KPRIMESB/","difficulty":2,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"spoj_iitkwpch","judge":"SPOJ","title":"Find Number Of Pair of Friends","url":"https://www.spoj.com/problems/IITKWPCH/","difficulty":2,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"spoj_subset","judge":"SPOJ","title":"Balanced Cow Subsets","url":"https://www.spoj.com/problems/SUBSET/","difficulty":2,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"atcoder_dp_y","judge":"AtCoder","title":"Grid 2","url":"https://atcoder.jp/contests/dp/tasks/dp_y","difficulty":2,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion","knapsack"],"solved":false},{"id":"codeforces_1750d","judge":"Codeforces","title":"Count GCD","url":"https://codeforces.com/contest/1750/problem/D","difficulty":2,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"hdu_6397","judge":"HDU","title":"Character Encoding","url":"http://acm.hdu.edu.cn/showproblem.php?pid=6397","difficulty":2,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"atcoder_abc152_f","judge":"AtCoder","title":"Tree and Constraints","url":"https://atcoder.jp/contests/abc152/tasks/abc152_f","difficulty":2,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"codeforces_2037g","judge":"Codeforces","title":"Natlan Exploring","url":"https://codeforces.com/contest/2037/problem/G","difficulty":2,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"cf_gym_105631k","judge":"CF Gym","title":"King of Card Games","url":"https://codeforces.com/gym/105631/problem/K","difficulty":2,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"hackerrank_k_inversion_permutations","judge":"HackerRank","title":"K-Inversion Permutations","url":"https://www.hackerrank.com/contests/101hack43/challenges/k-inversion-permutations/problem","difficulty":3,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion","generating_functions","polynomial_exp","polynomial_log"],"solved":false},{"id":"baekjoon_19313","judge":"Baekjoon","title":"Kids Aren't Alright","url":"https://www.acmicpc.net/problem/19313","difficulty":3,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"usaco_862","judge":"USACO","title":"Cowpatibility","url":"https://usaco.org/index.php?page=viewproblem2&cpid=862","difficulty":3,"starred":false,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"codeforces_449d","judge":"Codeforces","title":"Jzzhu and Numbers","url":"https://codeforces.com/contest/449/problem/D","difficulty":3,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion","sos_dp"],"solved":false},{"id":"atcoder_abc423_f","judge":"AtCoder","title":"Loud Cicada","url":"https://atcoder.jp/contests/abc423/tasks/abc423_f","difficulty":2,"starred":true,"topic":"principle_of_inclusion_and_exclusion","topics":["principle_of_inclusion_and_exclusion"],"solved":false},{"id":"cses_1717","judge":"CSES","title":"Christmas Party","url":"https://cses.fi/problemset/task/1717","difficulty":1,"starred":true,"topic":"derangements","topics":["derangements"],"solved":false},{"id":"yosupo_montmort_number_mod","judge":"Library Checker","title":"Montmort Number","url":"https://judge.yosupo.jp/problem/montmort_number_mod","difficulty":1,"starred":true,"topic":"derangements","topics":["derangements"],"solved":false},{"id":"codeforces_888d","judge":"Codeforces","title":"Almost Identity Permutations","url":"https://codeforces.com/problemset/problem/888/D","difficulty":1,"starred":true,"topic":"derangements","topics":["derangements"],"solved":false},{"id":"cf_gym_100971b","judge":"CF Gym","title":"Derangement","url":"https://codeforces.com/gym/100971/problem/B","difficulty":1,"starred":true,"topic":"derangements","topics":["derangements"],"solved":false},{"id":"codeforces_1672f1","judge":"Codeforces","title":"Array Shuffling","url":"https://codeforces.com/contest/1672/problem/F1","difficulty":2,"starred":false,"topic":"derangements","topics":["derangements"],"solved":false},{"id":"codeforces_1900d","judge":"Codeforces","title":"Small GCD","url":"https://codeforces.com/contest/1900/problem/D","difficulty":1,"starred":false,"topic":"inclusion_and_exclusion_on_multiples","topics":["dp_over_divisors","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"codeforces_1043f","judge":"Codeforces","title":"Make It One","url":"https://codeforces.com/contest/1043/problem/F","difficulty":2,"starred":true,"topic":"inclusion_and_exclusion_on_multiples","topics":["inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"atcoder_abc248_g","judge":"AtCoder","title":"GCD cost on the tree","url":"https://atcoder.jp/contests/abc248/tasks/abc248_g","difficulty":3,"starred":true,"topic":"inclusion_and_exclusion_on_multiples","topics":["logarithmic_bruteforce","inclusion_and_exclusion_on_multiples"],"solved":false},{"id":"codechef_chksel","judge":"CodeChef","title":"Help with selection","url":"https://www.codechef.com/problems/CHKSEL","difficulty":1,"starred":true,"topic":"lucas_theorem","topics":["lucas_theorem"],"solved":false},{"id":"spoj_hlp_rams","judge":"SPOJ","title":"Topper Rama Rao","url":"https://www.spoj.com/problems/HLP_RAMS/","difficulty":1,"starred":true,"topic":"lucas_theorem","topics":["lucas_theorem"],"solved":false},{"id":"hackerrank_cheese_and_random_toppings","judge":"HackerRank","title":"Cheese and Random Toppings","url":"https://www.hackerrank.com/contests/infinitum10/challenges/cheese-and-random-toppings","difficulty":2,"starred":false,"topic":"lucas_theorem","topics":["lucas_theorem"],"solved":false},{"id":"spoj_dukkar","judge":"SPOJ","title":"Dukkar and Pikka","url":"https://www.spoj.com/problems/DUKKAR/","difficulty":2,"starred":true,"topic":"lucas_theorem","topics":["lucas_theorem"],"solved":false},{"id":"codeforces_2072f","judge":"Codeforces","title":"Goodbye, Banker Life","url":"https://codeforces.com/contest/2072/problem/F","difficulty":2,"starred":true,"topic":"lucas_theorem","topics":["lucas_theorem"],"solved":false},{"id":"lightoj_strange_game","judge":"LightOJ","title":"Strange Game","url":"https://lightoj.com/problem/strange-game","difficulty":2,"starred":false,"topic":"ncr_modulo_any_mod","topics":["ncr_modulo_any_mod"],"solved":false},{"id":"baekjoon_19124","judge":"Baekjoon","title":"Binomial Coefficient","url":"https://www.acmicpc.net/problem/19124","difficulty":3,"starred":true,"topic":"ncr_modulo_any_mod","topics":["ncr_modulo_any_mod"],"solved":false},{"id":"yosupo_binomial_coefficient_prime_mod","judge":"Library Checker","title":"Binomial Coefficient","url":"https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod","difficulty":1,"starred":true,"topic":"ncr_modulo_any_mod","topics":["ncr_modulo_any_mod"],"solved":false},{"id":"yosupo_factorial","judge":"Library Checker","title":"Factorial","url":"https://judge.yosupo.jp/problem/factorial","difficulty":1,"starred":true,"topic":"large_factorials","topics":["large_factorials"],"solved":false},{"id":"toph_enormous_product","judge":"Toph","title":"Enormous Product","url":"https://toph.co/p/enormous-product","difficulty":1,"starred":true,"topic":"large_factorials","topics":["large_factorials"],"solved":false},{"id":"spoj_factmodp","judge":"SPOJ","title":"Factorial Modulo Prime","url":"https://www.spoj.com/problems/FACTMODP/","difficulty":4,"starred":true,"topic":"large_factorials","topics":["large_factorials"],"solved":false},{"id":"yosupo_many_factorials","judge":"Library Checker","title":"Many Factorials","url":"https://judge.yosupo.jp/problem/many_factorials","difficulty":3,"starred":false,"topic":"large_factorials","topics":["large_factorials"],"solved":false},{"id":"lightoj_trailing_zeroes_iii","judge":"LightOJ","title":"Trailing Zeroes (III)","url":"https://lightoj.com/problem/trailing-zeroes-iii","difficulty":1,"starred":true,"topic":"legendres_formula","topics":["legendres_formula"],"solved":false},{"id":"cses_1618","judge":"CSES","title":"Trailing Zeros","url":"https://cses.fi/problemset/task/1618","difficulty":1,"starred":true,"topic":"legendres_formula","topics":["legendres_formula"],"solved":true},{"id":"hdu_6333","judge":"HDU","title":"Harvest of Apples","url":"https://vjudge.net/problem/HDU-6333","difficulty":1,"starred":true,"topic":"prefix_sum_queries_of_nci","topics":["prefix_sum_queries_of_nci"],"solved":false},{"id":"atcoder_arc190_b","judge":"AtCoder","title":"L Partition","url":"https://atcoder.jp/contests/arc190/tasks/arc190_b","difficulty":2,"starred":true,"topic":"prefix_sum_queries_of_nci","topics":["prefix_sum_queries_of_nci"],"solved":false},{"id":"atcoder_arc061_d","judge":"AtCoder","title":"Card Game for Three","url":"https://atcoder.jp/contests/arc061/tasks/arc061_d","difficulty":3,"starred":false,"topic":"prefix_sum_queries_of_nci","topics":["prefix_sum_queries_of_nci"],"solved":false},{"id":"codeforces_1450h2","judge":"Codeforces","title":"Multithreading (Hard Version)","url":"https://codeforces.com/contest/1450/problem/H2","difficulty":3,"starred":false,"topic":"prefix_sum_queries_of_nci","topics":["prefix_sum_queries_of_nci"],"solved":false},{"id":"codeforces_2030g2","judge":"Codeforces","title":"The Destruction of the Universe (Hard Version)","url":"https://codeforces.com/contest/2030/problem/G2","difficulty":3,"starred":true,"topic":"prefix_sum_queries_of_nci","topics":["prefix_sum_queries_of_nci"],"solved":false},{"id":"toph_abcdefgh","judge":"Toph","title":"You","url":"https://toph.co/p/abcdefgh","difficulty":2,"starred":true,"topic":"sum_of_ncr_over_a_fixed_congruence_class","topics":["sum_of_ncr_over_a_fixed_congruence_class"],"solved":false},{"id":"cf_gym_280379a","judge":"CF Gym","title":"Simple nCr","url":"https://codeforces.com/gym/280379/problem/A","difficulty":3,"starred":true,"topic":"sum_of_ncr_over_a_fixed_congruence_class","topics":["generating_functions","sum_of_ncr_over_a_fixed_congruence_class"],"solved":false},{"id":"cf_gym_102538a","judge":"CF Gym","title":"Airplane Cliques","url":"https://codeforces.com/gym/102538/problem/A","difficulty":3,"starred":true,"topic":"sum_of_ncr_a_i_k_for_each_k_from_1_to_n","topics":["sum_of_ncr_a_i_k_for_each_k_from_1_to_n"],"solved":false},{"id":"atcoder_agc005_f","judge":"AtCoder","title":"Many Easy Problems","url":"https://atcoder.jp/contests/agc005/tasks/agc005_f","difficulty":3,"starred":true,"topic":"sum_of_ncr_a_i_k_for_each_k_from_1_to_n","topics":["sum_of_ncr_a_i_k_for_each_k_from_1_to_n","generating_functions"],"solved":false},{"id":"toph_caching_combinatorics","judge":"Toph","title":"Caching Combinatorics","url":"https://toph.co/p/caching-combinatorics","difficulty":2,"starred":true,"topic":"stirling_numbers","topics":["stirling_numbers"],"solved":false},{"id":"spoj_binstirl","judge":"SPOJ","title":"Binary Stirling Numbers","url":"https://www.spoj.com/problems/BINSTIRL/","difficulty":2,"starred":false,"topic":"stirling_numbers","topics":["stirling_numbers"],"solved":false},{"id":"yosupo_stirling_number_of_the_first_kind_small_p_large_n","judge":"Library Checker","title":"Stirling Number of the First Kind (Small p, Large n)","url":"https://judge.yosupo.jp/problem/stirling_number_of_the_first_kind_small_p_large_n","difficulty":4,"starred":false,"topic":"stirling_numbers","topics":["stirling_numbers"],"solved":false},{"id":"yosupo_stirling_number_of_the_second_kind_small_p_large_n","judge":"Library Checker","title":"Stirling Number of the Second Kind (Small p, Large n)","url":"https://judge.yosupo.jp/problem/stirling_number_of_the_second_kind_small_p_large_n","difficulty":4,"starred":false,"topic":"stirling_numbers","topics":["stirling_numbers"],"solved":false},{"id":"yosupo_stirling_number_of_the_first_kind","judge":"Library Checker","title":"Stirling Number of the First Kind","url":"https://judge.yosupo.jp/problem/stirling_number_of_the_first_kind","difficulty":1,"starred":true,"topic":"stirling_number_of_the_first_kind_for_fixed_n","topics":["stirling_number_of_the_first_kind_for_fixed_n"],"solved":false},{"id":"hackerrank_sasha_and_swaps_ii","judge":"HackerRank","title":"Sasha and the Swaps II","url":"https://www.hackerrank.com/contests/w23/challenges/sasha-and-swaps-ii/problem","difficulty":2,"starred":true,"topic":"stirling_number_of_the_first_kind_for_fixed_n","topics":["stirling_number_of_the_first_kind_for_fixed_n"],"solved":false},{"id":"codeforces_960g","judge":"Codeforces","title":"Bandit Blues","url":"https://codeforces.com/problemset/problem/960/G","difficulty":3,"starred":false,"topic":"stirling_number_of_the_first_kind_for_fixed_n","topics":["stirling_number_of_the_first_kind_for_fixed_n"],"solved":false},{"id":"yosupo_stirling_number_of_the_first_kind_fixed_k","judge":"Library Checker","title":"Stirling Number of the First Kind (Fixed K)","url":"https://judge.yosupo.jp/problem/stirling_number_of_the_first_kind_fixed_k","difficulty":1,"starred":true,"topic":"stirling_number_of_the_first_kind_for_fixed_k","topics":["stirling_number_of_the_first_kind_for_fixed_k"],"solved":false},{"id":"codeforces_1516e","judge":"Codeforces","title":"Baby Ehab Plays with Permutations","url":"https://codeforces.com/contest/1516/problem/E","difficulty":3,"starred":true,"topic":"stirling_number_of_the_first_kind_for_fixed_k","topics":["x2_plus_1_trick","stirling_number_of_the_first_kind_for_fixed_k"],"solved":false},{"id":"yosupo_stirling_number_of_the_second_kind","judge":"Library Checker","title":"Stirling Number of the Second Kind","url":"https://judge.yosupo.jp/problem/stirling_number_of_the_second_kind","difficulty":1,"starred":true,"topic":"stirling_number_of_the_second_kind_for_fixed_n","topics":["stirling_number_of_the_second_kind_for_fixed_n"],"solved":false},{"id":"yosupo_stirling_number_of_the_second_kind_fixed_k","judge":"Library Checker","title":"Stirling Number of the Second Kind (Fixed K)","url":"https://judge.yosupo.jp/problem/stirling_number_of_the_second_kind_fixed_k","difficulty":1,"starred":true,"topic":"stirling_number_of_the_second_kind_for_fixed_k","topics":["stirling_number_of_the_second_kind_for_fixed_k"],"solved":false},{"id":"codeforces_961g","judge":"Codeforces","title":"Partitions","url":"https://codeforces.com/contest/961/problem/G","difficulty":2,"starred":true,"topic":"stirling_number_of_the_second_kind_for_fixed_k","topics":["stirling_number_of_the_second_kind_for_fixed_k"],"solved":false},{"id":"yosupo_partition_function","judge":"Library Checker","title":"Partition Function","url":"https://judge.yosupo.jp/problem/partition_function","difficulty":1,"starred":true,"topic":"partition_function","topics":["partition_function"],"solved":false},{"id":"hackerearth_perfect_permutations_september_clash","judge":"HackerEarth","title":"Perfect Permutations","url":"https://www.hackerearth.com/problem/algorithm/perfect-permutations-september-clash/","difficulty":2,"starred":true,"topic":"partition_function","topics":["partition_function","x2_plus_1_trick"],"solved":false},{"id":"cf_gym_102354e","judge":"CF Gym","title":"Decimal Expansion","url":"https://codeforces.com/gym/102354/problem/E","difficulty":2,"starred":false,"topic":"partition_function","topics":["partition_function"],"solved":false},{"id":"atcoder_abc279_h","judge":"AtCoder","title":"Sum of Prod of Min","url":"https://atcoder.jp/contests/abc279/tasks/abc279_h","difficulty":3,"starred":true,"topic":"partition_function","topics":["partition_function"],"solved":false},{"id":"cf_gym_102268g","judge":"CF Gym","title":"Graph Counting","url":"https://codeforces.com/gym/102268/problem/G","difficulty":3,"starred":true,"topic":"partition_function","topics":["partition_function"],"solved":false},{"id":"yosupo_bell_number","judge":"Library Checker","title":"Bell Number","url":"https://judge.yosupo.jp/problem/bell_number","difficulty":1,"starred":true,"topic":"bell_number","topics":["bell_number"],"solved":false},{"id":"codeforces_568b","judge":"Codeforces","title":"Symmetric and Transitive","url":"https://codeforces.com/contest/568/problem/B","difficulty":2,"starred":true,"topic":"bell_number","topics":["bell_number"],"solved":false},{"id":"cses_2209","judge":"CSES","title":"Counting Necklaces","url":"https://cses.fi/problemset/task/2209","difficulty":1,"starred":true,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"lightoj_necklace","judge":"LightOJ","title":"Necklace","url":"https://lightoj.com/problem/necklace","difficulty":1,"starred":true,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"cses_2210","judge":"CSES","title":"Counting Grids","url":"https://cses.fi/problemset/task/2210","difficulty":1,"starred":true,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"cf_gym_101873b","judge":"CF Gym","title":"Buildings","url":"https://codeforces.com/gym/101873/problem/B","difficulty":1,"starred":true,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"hackerrank_count_the_necklaces","judge":"HackerRank","title":"Count the Necklaces","url":"https://www.hackerrank.com/contests/infinitum12/challenges/count-the-necklaces","difficulty":1,"starred":false,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"csacademy_cube_coloring","judge":"CS Academy","title":"Cube Coloring","url":"https://csacademy.com/contest/beta-round-8/task/cube-coloring/","difficulty":1,"starred":true,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"codeforces_1065e","judge":"Codeforces","title":"Side Transmutations","url":"https://codeforces.com/contest/1065/problem/E","difficulty":2,"starred":true,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"poj_1286","judge":"POJ","title":"Necklace of Beads","url":"http://poj.org/problem?id=1286","difficulty":2,"starred":false,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"codechef_decorate","judge":"CodeChef","title":"Lucy and the Flowers","url":"https://www.codechef.com/problems/DECORATE","difficulty":2,"starred":true,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"poj_2888","judge":"POJ","title":"Magic Bracelet","url":"http://poj.org/problem?id=2888","difficulty":2,"starred":false,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"spoj_srtmach","judge":"SPOJ","title":"Sorting Machine","url":"https://www.spoj.com/problems/SRTMACH/","difficulty":2,"starred":false,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"codechef_icpc16e","judge":"CodeChef","title":"Colorful Grids","url":"https://www.codechef.com/problems/ICPC16E","difficulty":2,"starred":true,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"timus_1661","judge":"Timus","title":"Dodecahedron","url":"https://acm.timus.ru/problem.aspx?space=1&num=1661","difficulty":2,"starred":false,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"atcoder_abc198_f","judge":"AtCoder","title":"Cube","url":"https://atcoder.jp/contests/abc198/tasks/abc198_f","difficulty":3,"starred":false,"topic":"burnside_lemma","topics":["burnside_lemma","berlekamp_messey"],"solved":false},{"id":"codeforces_2040f","judge":"Codeforces","title":"Number of Cubes","url":"https://codeforces.com/contest/2040/problem/F","difficulty":3,"starred":false,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"codeforces_1954f","judge":"Codeforces","title":"Unique Strings","url":"https://codeforces.com/contest/1954/problem/F","difficulty":3,"starred":true,"topic":"burnside_lemma","topics":["burnside_lemma"],"solved":false},{"id":"spoj_funprob","judge":"SPOJ","title":"Yanu in Movie theatre","url":"https://www.spoj.com/problems/FUNPROB/","difficulty":1,"starred":true,"topic":"bertrands_ballot_theorem","topics":["bertrands_ballot_theorem"],"solved":false},{"id":"cf_gym_100579c","judge":"CF Gym","title":"Winning at Sports","url":"https://codeforces.com/gym/100579/problem/C","difficulty":2,"starred":true,"topic":"bertrands_ballot_theorem","topics":["bertrands_ballot_theorem"],"solved":false},{"id":"codechef_vaimin","judge":"CodeChef","title":"Vaibhav and Ministers","url":"https://www.codechef.com/problems/VAIMIN","difficulty":3,"starred":false,"topic":"bertrands_ballot_theorem","topics":["bertrands_ballot_theorem"],"solved":false},{"id":"cf_gym_102538d","judge":"CF Gym","title":"Disjoint LIS","url":"https://codeforces.com/gym/102538/problem/D","difficulty":3,"starred":true,"topic":"young_tableaus","topics":["young_tableaus"],"solved":false},{"id":"yukicoder_2048","judge":"yukicoder","title":"L(I+D)S","url":"https://yukicoder.me/problems/no/2048","difficulty":3,"starred":false,"topic":"young_tableaus","topics":["young_tableaus"],"solved":false},{"id":"cf_gym_103439d","judge":"CF Gym","title":"LIS Counting","url":"https://codeforces.com/gym/103439/problem/D","difficulty":3,"starred":false,"topic":"young_tableaus","topics":["young_tableaus"],"solved":false},{"id":"cses_2111","judge":"CSES","title":"Apples and Bananas","url":"https://cses.fi/problemset/task/2111/","difficulty":1,"starred":true,"topic":"fft","topics":["fft"],"solved":false},{"id":"spoj_polymul","judge":"SPOJ","title":"Polynomial Multiplication","url":"https://www.spoj.com/problems/POLYMUL/","difficulty":1,"starred":true,"topic":"fft","topics":["fft"],"solved":false},{"id":"kattis_aplusb","judge":"Kattis","title":"A+B Problem","url":"https://open.kattis.com/problems/aplusb","difficulty":1,"starred":true,"topic":"fft","topics":["fft"],"solved":false},{"id":"codeforces_632e","judge":"Codeforces","title":"Thief in a Shop","url":"https://codeforces.com/problemset/problem/632/E","difficulty":1,"starred":true,"topic":"fft","topics":["fft"],"solved":false},{"id":"spoj_adamatch","judge":"SPOJ","title":"Ada and Nucleobase","url":"https://www.spoj.com/problems/ADAMATCH/","difficulty":1,"starred":true,"topic":"fft","topics":["fft","string_matching_with_fft"],"solved":false},{"id":"kattis_kinversions","judge":"Kattis","title":"K-Inversions","url":"https://open.kattis.com/problems/kinversions","difficulty":1,"starred":true,"topic":"fft","topics":["fft","string_matching_with_fft"],"solved":false},{"id":"spoj_maxmatch","judge":"SPOJ","title":"Maximum Self-Matching","url":"https://www.spoj.com/problems/MAXMATCH/","difficulty":1,"starred":true,"topic":"fft","topics":["fft","string_matching_with_fft"],"solved":false},{"id":"cses_2113","judge":"CSES","title":"Signal Processing","url":"https://cses.fi/problemset/task/2113","difficulty":1,"starred":true,"topic":"fft","topics":["fft"],"solved":false},{"id":"codechef_notd","judge":"CodeChef","title":"Not Divisible","url":"https://www.codechef.com/problems/NOTD","difficulty":1,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"spoj_vfmul","judge":"SPOJ","title":"Very Fast Multiplication","url":"https://www.spoj.com/problems/VFMUL/","difficulty":1,"starred":true,"topic":"fft","topics":["bigint","fft"],"solved":false},{"id":"atcoder_abc392_g","judge":"AtCoder","title":"Fine Triplets","url":"https://atcoder.jp/contests/abc392/tasks/abc392_g","difficulty":1,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"cses_2112","judge":"CSES","title":"One Bit Positions","url":"https://cses.fi/problemset/task/2112","difficulty":1,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"cf_group_477876n","judge":"Codeforces","title":"Nefertiti","url":"https://codeforces.com/group/Rilx5irOux/contest/477876/problem/N","difficulty":1,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"cf_group_537870g","judge":"Codeforces","title":"Jinin","url":"https://codeforces.com/group/Rilx5irOux/contest/537870/problem/G","difficulty":1,"starred":false,"topic":"fft","topics":["fft","ntt"],"solved":false},{"id":"spoj_tsum","judge":"SPOJ","title":"Triple Sums","url":"https://www.spoj.com/problems/TSUM/","difficulty":2,"starred":true,"topic":"fft","topics":["fft"],"solved":false},{"id":"codeforces_993e","judge":"Codeforces","title":"Nikita and Order Statistics","url":"https://codeforces.com/problemset/problem/993/E","difficulty":2,"starred":true,"topic":"fft","topics":["fft"],"solved":false},{"id":"codeforces_954i","judge":"Codeforces","title":"Yet Another String Matching Problem","url":"https://codeforces.com/problemset/problem/954/I","difficulty":2,"starred":false,"topic":"fft","topics":["fft","string_matching_using_bitsets","string_matching_with_fft"],"solved":false},{"id":"codeforces_958f3","judge":"Codeforces","title":"Lightsabers (hard)","url":"https://codeforces.com/problemset/problem/958/F3","difficulty":2,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"codeforces_1398g","judge":"Codeforces","title":"Running Competition","url":"https://codeforces.com/contest/1398/problem/G","difficulty":2,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"cf_gym_101821f","judge":"CF Gym","title":"Lazy Hash Table","url":"https://codeforces.com/gym/101821/problem/F","difficulty":2,"starred":true,"topic":"fft","topics":["fft"],"solved":false},{"id":"codeforces_528d","judge":"Codeforces","title":"Fuzzy Search","url":"https://codeforces.com/contest/528/problem/D","difficulty":2,"starred":true,"topic":"fft","topics":["fft","string_matching_using_bitsets","string_matching_with_fft"],"solved":false},{"id":"codeforces_827e","judge":"Codeforces","title":"Rusty String","url":"https://codeforces.com/problemset/problem/827/E","difficulty":2,"starred":false,"topic":"fft","topics":["fft","string_matching_with_fft"],"solved":false},{"id":"codeforces_1845f","judge":"Codeforces","title":"Swimmers in the Pool","url":"https://codeforces.com/problemset/problem/1845/F","difficulty":2,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"codeforces_1334g","judge":"Codeforces","title":"Substring Search","url":"https://codeforces.com/problemset/problem/1334/G","difficulty":2,"starred":false,"topic":"fft","topics":["fft","string_matching_using_bitsets","string_matching_with_fft"],"solved":false},{"id":"cses_2115","judge":"CSES","title":"Bit Substrings","url":"https://cses.fi/problemset/task/2115","difficulty":2,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"cf_group_538817g","judge":"Codeforces","title":"Gateways of Beisan","url":"https://codeforces.com/group/Rilx5irOux/contest/538817/problem/G","difficulty":2,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"codeforces_472g","judge":"Codeforces","title":"Design Tutorial: Increase the Constraints","url":"https://codeforces.com/problemset/problem/472/G","difficulty":3,"starred":false,"topic":"fft","topics":["fft","string_matching_using_bitsets"],"solved":false},{"id":"yosupo_convolution_mod_2_64","judge":"Library Checker","title":"Convolution (Mod 2^64)","url":"https://judge.yosupo.jp/problem/convolution_mod_2_64","difficulty":2,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"kattis_tiles","judge":"Kattis","title":"Tile Cutting","url":"https://vjudge.net/problem/Kattis-tiles","difficulty":3,"starred":true,"topic":"fft","topics":["fft"],"solved":false},{"id":"codeforces_1054h","judge":"Codeforces","title":"Epic Convolution","url":"https://codeforces.com/problemset/problem/1054/H","difficulty":4,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"cf_group_605577e","judge":"Codeforces","title":"Piscine today","url":"https://codeforces.com/group/Rilx5irOux/contest/605577/problem/E","difficulty":1,"starred":false,"topic":"fft","topics":["fft"],"solved":false},{"id":"yosupo_convolution_mod","judge":"Library Checker","title":"Convolution","url":"https://judge.yosupo.jp/problem/convolution_mod","difficulty":1,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"yosupo_convolution_mod_1000000007","judge":"Library Checker","title":"Convolution (Mod 1,000,000,007)","url":"https://judge.yosupo.jp/problem/convolution_mod_1000000007","difficulty":1,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codeforces_1096g","judge":"Codeforces","title":"Lucky Tickets","url":"https://codeforces.com/contest/1096/problem/G","difficulty":1,"starred":true,"topic":"ntt","topics":["ntt","polynomial_pow"],"solved":false},{"id":"yosupo_product_of_polynomial_sequence","judge":"Library Checker","title":"Product of Polynomial Sequence","url":"https://judge.yosupo.jp/problem/product_of_polynomial_sequence","difficulty":1,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"toph_play_the_lottery","judge":"Toph","title":"Play the Lottery","url":"https://toph.co/p/play-the-lottery","difficulty":1,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codechef_sumxor2","judge":"CodeChef","title":"XOR Sums","url":"https://www.codechef.com/problems/SUMXOR2","difficulty":2,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"spoj_ovicumsum","judge":"SPOJ","title":"A Cumulative Sum Problem","url":"https://www.spoj.com/problems/OVICUMSUM/","difficulty":2,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codeforces_1218e","judge":"Codeforces","title":"Product Tuples","url":"https://codeforces.com/problemset/problem/1218/E","difficulty":2,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codeforces_1257g","judge":"Codeforces","title":"Divisor Set","url":"https://codeforces.com/problemset/problem/1257/G","difficulty":2,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"spoj_countdio","judge":"SPOJ","title":"Linear Diophantine Equation","url":"https://www.spoj.com/problems/COUNTDIO/","difficulty":2,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codechef_lucasth","judge":"CodeChef","title":"Lucas Theorem","url":"https://www.codechef.com/FEB18/problems/LUCASTH","difficulty":2,"starred":false,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codeforces_1613f","judge":"Codeforces","title":"Tree Coloring","url":"https://codeforces.com/problemset/problem/1613/F","difficulty":2,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codechef_addbyperm","judge":"CodeChef","title":"Add By Permutation","url":"https://www.codechef.com/JUNE221A/problems/ADDBYPERM","difficulty":2,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codechef_psum","judge":"CodeChef","title":"Power Sum","url":"https://www.codechef.com/SEPT19A/problems/PSUM","difficulty":3,"starred":true,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"csacademy_permutations","judge":"CS Academy","title":"Permutations","url":"https://csacademy.com/contest/round-75/task/permutations/","difficulty":3,"starred":false,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codeforces_623e","judge":"Codeforces","title":"Transforming Sequence","url":"https://codeforces.com/problemset/problem/623/E","difficulty":3,"starred":true,"topic":"ntt","topics":["ntt","generating_functions"],"solved":false},{"id":"codeforces_755g","judge":"Codeforces","title":"PolandBall and Many Other Balls","url":"https://codeforces.com/problemset/problem/755/G","difficulty":3,"starred":true,"topic":"ntt","topics":["ntt","matrix_exponentiation"],"solved":false},{"id":"qoj_10980","judge":"QOJ","title":"K-rep Array","url":"https://qoj.ac/contest/2071/problem/10980","difficulty":1,"starred":false,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codechef_binofev","judge":"CodeChef","title":"Binomial Fever","url":"https://www.codechef.com/problems/BINOFEV","difficulty":2,"starred":true,"topic":"ntt","topics":["ntt","polynomial_shift"],"solved":false},{"id":"cf_gym_104555k","judge":"CF Gym","title":"K for More, K for Less","url":"https://codeforces.com/gym/104555/problem/K","difficulty":2,"starred":false,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codeforces_1251f","judge":"Codeforces","title":"Red-White Fence","url":"https://codeforces.com/contest/1251/problem/F","difficulty":2,"starred":false,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"cf_gym_105973d","judge":"CF Gym","title":"Symmetric Swap","url":"https://codeforces.com/gym/105973/problem/D","difficulty":2,"starred":false,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codechef_chefknn","judge":"CodeChef","title":"Chef and Interval Painting","url":"https://www.codechef.com/MARCH18A/problems/CHEFKNN","difficulty":3,"starred":false,"topic":"ntt","topics":["ntt"],"solved":false},{"id":"codechef_buyland","judge":"CodeChef","title":"Buying Land","url":"https://www.codechef.com/problems/BUYLAND/","difficulty":1,"starred":true,"topic":"2d_fft_ntt","topics":["2d_fft_ntt"],"solved":false},{"id":"codeforces_754e","judge":"Codeforces","title":"Dasha and cyclic table","url":"https://codeforces.com/contest/754/problem/E","difficulty":1,"starred":true,"topic":"2d_fft_ntt","topics":["2d_fft_ntt","string_matching_using_bitsets"],"solved":false},{"id":"kattis_matchings","judge":"Kattis","title":"Matchings","url":"https://open.kattis.com/problems/matchings","difficulty":2,"starred":true,"topic":"2d_fft_ntt","topics":["2d_fft_ntt"],"solved":false},{"id":"kattis_mosaicbrowsing","judge":"Kattis","title":"Mosaic Browsing","url":"https://open.kattis.com/problems/mosaicbrowsing","difficulty":2,"starred":true,"topic":"2d_fft_ntt","topics":["2d_fft_ntt","string_matching_with_fft"],"solved":false},{"id":"csacademy_colored_forests","judge":"CS Academy","title":"Colored Forests","url":"https://csacademy.com/contest/round-24/task/colored-forests/","difficulty":2,"starred":true,"topic":"online_ntt","topics":["online_ntt"],"solved":false},{"id":"csacademy_jetpack","judge":"CS Academy","title":"Jetpack","url":"https://csacademy.com/contest/round-9/task/jetpack/statement/","difficulty":2,"starred":false,"topic":"online_ntt","topics":["online_ntt"],"solved":false},{"id":"codechef_mmnn01","judge":"CodeChef","title":"Expected Number of Customers","url":"https://www.codechef.com/COOK112A/problems/MMNN01","difficulty":2,"starred":false,"topic":"online_ntt","topics":["online_ntt"],"solved":false},{"id":"codeforces_1792f2","judge":"Codeforces","title":"Graph Coloring (hard version)","url":"https://codeforces.com/problemset/problem/1792/F2","difficulty":2,"starred":true,"topic":"online_ntt","topics":["online_ntt"],"solved":false},{"id":"atcoder_abc315_h","judge":"AtCoder","title":"Typical Convolution Problem","url":"https://atcoder.jp/contests/abc315/tasks/abc315_h","difficulty":2,"starred":true,"topic":"online_ntt","topics":["online_ntt"],"solved":false},{"id":"codeforces_553e","judge":"Codeforces","title":"Kyoya and Train","url":"https://codeforces.com/problemset/problem/553/E","difficulty":3,"starred":false,"topic":"online_ntt","topics":["online_ntt"],"solved":false},{"id":"baekjoon_18743","judge":"Baekjoon","title":"Bin","url":"https://www.acmicpc.net/problem/18743","difficulty":3,"starred":false,"topic":"online_ntt","topics":["online_ntt"],"solved":false},{"id":"atcoder_abc213_h","judge":"AtCoder","title":"Stroll","url":"https://atcoder.jp/contests/abc213/tasks/abc213_h","difficulty":3,"starred":false,"topic":"online_ntt","topics":["online_ntt"],"solved":false},{"id":"csacademy_maxor","judge":"CS Academy","title":"Maxor","url":"https://csacademy.com/contest/round-53/task/maxor/","difficulty":1,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"csacademy_and_closure","judge":"CS Academy","title":"And Closure","url":"https://csacademy.com/contest/archive/task/and-closure/","difficulty":1,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"uva_13277","judge":"UVa","title":"XOR Path","url":"https://vjudge.net/problem/UVA-13277","difficulty":1,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"csacademy_random_nim_generator","judge":"CS Academy","title":"Random Nim Generator","url":"https://csacademy.com/contest/archive/task/random_nim_generator/statement/","difficulty":1,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"csacademy_token_grid","judge":"CS Academy","title":"Tokens on a grid","url":"https://csacademy.com/contest/archive/task/token-grid/statement/","difficulty":2,"starred":false,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"codeforces_1218d","judge":"Codeforces","title":"Xor Spanning Tree","url":"https://codeforces.com/problemset/problem/1218/D","difficulty":2,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"codeforces_914g","judge":"Codeforces","title":"Sum the Fibonacci","url":"https://codeforces.com/problemset/problem/914/G","difficulty":2,"starred":true,"topic":"fwht","topics":["fwht","subset_convolution"],"solved":false},{"id":"cf_gym_102978g","judge":"CF Gym","title":"Games","url":"https://codeforces.com/gym/102978/problem/G","difficulty":3,"starred":false,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"cf_gym_103202m","judge":"CF Gym","title":"United in Stormwind","url":"https://codeforces.com/gym/103202/problem/M","difficulty":3,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"codeforces_1906k","judge":"Codeforces","title":"Deck-Building Game","url":"https://codeforces.com/contest/1906/problem/K","difficulty":3,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"uoj_310","judge":"UOJ","title":"黎明前的巧克力","url":"https://uoj.ac/problem/310","difficulty":3,"starred":false,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"codechef_mdswin","judge":"CodeChef","title":"Winning Ways","url":"https://www.codechef.com/NOV19A/problems/MDSWIN","difficulty":3,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"codechef_xortreeh","judge":"CodeChef","title":"Chef and Horcrux","url":"https://www.codechef.com/problems/XORTREEH","difficulty":3,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"atcoder_abc396_g","judge":"AtCoder","title":"Flip Row or Col","url":"https://atcoder.jp/contests/abc396/tasks/abc396_g","difficulty":2,"starred":false,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"atcoder_abc220_h","judge":"AtCoder","title":"18. Security Camera","url":"https://atcoder.jp/contests/abc220/tasks/abc220_h","difficulty":3,"starred":false,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"atcoder_abc212_h","judge":"AtCoder","title":"Nim Counting","url":"https://atcoder.jp/contests/abc212/tasks/abc212_h","difficulty":3,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"cf_gym_104479b","judge":"CF Gym","title":"Beautiful XOR Problem","url":"https://codeforces.com/gym/104479/problem/B","difficulty":4,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"atcoder_abc367_g","judge":"AtCoder","title":"Sum of (XOR^K or 0)","url":"https://atcoder.jp/contests/abc367/tasks/abc367_g","difficulty":4,"starred":true,"topic":"fwht","topics":["fwht"],"solved":false},{"id":"yosupo_gcd_convolution","judge":"Library Checker","title":"Gcd Convolution","url":"https://judge.yosupo.jp/problem/gcd_convolution","difficulty":1,"starred":true,"topic":"gcd_convolution","topics":["gcd_convolution"],"solved":false},{"id":"cf_gym_103688e","judge":"CF Gym","title":"Exclusive Multiplication","url":"https://codeforces.com/gym/103688/problem/E","difficulty":2,"starred":true,"topic":"gcd_convolution","topics":["gcd_convolution"],"solved":false},{"id":"codechef_yetgcd","judge":"CodeChef","title":"Yet Another GCD Problem","url":"https://www.codechef.com/CDUN2022/problems/YETGCD","difficulty":2,"starred":true,"topic":"gcd_convolution","topics":["gcd_convolution"],"solved":false},{"id":"yosupo_lcm_convolution","judge":"Library Checker","title":"Lcm Convolution","url":"https://judge.yosupo.jp/problem/lcm_convolution","difficulty":1,"starred":true,"topic":"lcm_convolution","topics":["lcm_convolution"],"solved":false},{"id":"codechef_perfsqrs","judge":"CodeChef","title":"Ppeerrffeecctt Ssqquuaarreess","url":"https://www.codechef.com/PRACTICE/problems/PERFSQRS","difficulty":3,"starred":true,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"codechef_weirdmul","judge":"CodeChef","title":"Weird Product","url":"https://www.codechef.com/JULY20A/problems/WEIRDMUL","difficulty":3,"starred":true,"topic":"generating_functions","topics":["generating_functions","multipoint_evaluation"],"solved":false},{"id":"codechef_rnbwroad","judge":"CodeChef","title":"Chef and Rainbow Road","url":"https://www.codechef.com/problems/RNBWROAD","difficulty":3,"starred":true,"topic":"generating_functions","topics":["generating_functions","multipoint_evaluation"],"solved":false},{"id":"atcoder_arc154_f","judge":"AtCoder","title":"Dice Game","url":"https://atcoder.jp/contests/arc154/tasks/arc154_f","difficulty":3,"starred":true,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"codeforces_438e","judge":"Codeforces","title":"The Child and Binary Tree","url":"https://codeforces.com/problemset/problem/438/E","difficulty":3,"starred":true,"topic":"generating_functions","topics":["polynomial_inverse","polynomial_sqrt","generating_functions"],"solved":false},{"id":"uoj_50","judge":"UOJ","title":"链式反应","url":"https://uoj.ac/problem/50","difficulty":3,"starred":false,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"loj_6703","judge":"LibreOJ","title":"Q 的序列","url":"https://loj.ac/p/6703","difficulty":3,"starred":true,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"cf_group_446227i","judge":"Codeforces","title":"O Andar do Trêbado","url":"https://codeforces.com/group/YgJmumGtHD/contest/446227/problem/I","difficulty":3,"starred":false,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"codeforces_392c","judge":"Codeforces","title":"Yet Another Number Sequence","url":"https://codeforces.com/contest/392/problem/C","difficulty":2,"starred":false,"topic":"generating_functions","topics":["generating_functions","berlekamp_messey","matrix_exponentiation"],"solved":false},{"id":"atcoder_s8pc_3_g","judge":"AtCoder","title":"Sum of Fibonacci Sequence","url":"https://atcoder.jp/contests/s8pc-3/tasks/s8pc_3_g","difficulty":4,"starred":true,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"codechef_qpolysum","judge":"CodeChef","title":"Quasi-Polynomial Sum","url":"https://www.codechef.com/DEC12/problems/QPOLYSUM","difficulty":4,"starred":false,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"codeforces_1349f2","judge":"Codeforces","title":"Slime and Sequences (Hard Version)","url":"https://codeforces.com/contest/1349/problem/F2","difficulty":4,"starred":false,"topic":"generating_functions","topics":["lagrange_inversion_theorem","generating_functions"],"solved":false},{"id":"cf_gym_280379b","judge":"CF Gym","title":"Simple Counting","url":"https://codeforces.com/gym/280379/problem/B","difficulty":4,"starred":true,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"loj_6696","judge":"LibreOJ","title":"Rhyme","url":"https://loj.ac/p/6696","difficulty":4,"starred":true,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"uoj_514","judge":"UOJ","title":"通用测评号","url":"https://uoj.ac/contest/51/problem/514","difficulty":4,"starred":false,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"loj_3120","judge":"LibreOJ","title":"珍珠","url":"https://loj.ac/p/3120","difficulty":4,"starred":false,"topic":"generating_functions","topics":["generating_functions"],"solved":false},{"id":"yosupo_inv_of_formal_power_series","judge":"Library Checker","title":"Inv of Formal Power Series","url":"https://judge.yosupo.jp/problem/inv_of_formal_power_series","difficulty":1,"starred":true,"topic":"polynomial_inverse","topics":["polynomial_inverse"],"solved":false},{"id":"codechef_chefssm","judge":"CodeChef","title":"Chef and the Combination Lock","url":"https://www.codechef.com/problems/CHEFSSM","difficulty":3,"starred":false,"topic":"polynomial_inverse","topics":["lagrange_interpolation","polynomial_inverse"],"solved":false},{"id":"yosupo_inv_of_formal_power_series_sparse","judge":"Library Checker","title":"Inv of Formal Power Series (Sparse)","url":"https://judge.yosupo.jp/problem/inv_of_formal_power_series_sparse","difficulty":3,"starred":false,"topic":"polynomial_inverse","topics":["polynomial_inverse"],"solved":false},{"id":"yosupo_exp_of_formal_power_series","judge":"Library Checker","title":"Exp of Formal Power Series","url":"https://judge.yosupo.jp/problem/exp_of_formal_power_series","difficulty":1,"starred":true,"topic":"polynomial_exp","topics":["polynomial_exp"],"solved":false},{"id":"codechef_pparts","judge":"CodeChef","title":"Perfect Partitions","url":"https://www.codechef.com/problems/PPARTS","difficulty":2,"starred":true,"topic":"polynomial_exp","topics":["polynomial_exp","polynomial_log","subset_sum_problem_using_generating_functions"],"solved":false},{"id":"yosupo_exp_of_formal_power_series_sparse","judge":"Library Checker","title":"Exp of Formal Power Series (Sparse)","url":"https://judge.yosupo.jp/problem/exp_of_formal_power_series_sparse","difficulty":3,"starred":false,"topic":"polynomial_exp","topics":["polynomial_exp"],"solved":false},{"id":"yosupo_log_of_formal_power_series","judge":"Library Checker","title":"Log of Formal Power Series","url":"https://judge.yosupo.jp/problem/log_of_formal_power_series","difficulty":1,"starred":true,"topic":"polynomial_log","topics":["polynomial_log"],"solved":false},{"id":"yosupo_log_of_formal_power_series_sparse","judge":"Library Checker","title":"Log of Formal Power Series (Sparse)","url":"https://judge.yosupo.jp/problem/log_of_formal_power_series_sparse","difficulty":3,"starred":false,"topic":"polynomial_log","topics":["polynomial_log"],"solved":false},{"id":"yosupo_pow_of_formal_power_series","judge":"Library Checker","title":"Pow of Formal Power Series","url":"https://judge.yosupo.jp/problem/pow_of_formal_power_series","difficulty":1,"starred":true,"topic":"polynomial_pow","topics":["polynomial_pow"],"solved":false},{"id":"yosupo_pow_of_formal_power_series_sparse","judge":"Library Checker","title":"Pow of Formal Power Series (Sparse","url":"https://judge.yosupo.jp/problem/pow_of_formal_power_series_sparse","difficulty":2,"starred":false,"topic":"polynomial_pow","topics":["polynomial_pow"],"solved":false},{"id":"yosupo_sqrt_of_formal_power_series","judge":"Library Checker","title":"Sqrt of Formal Power Series","url":"https://judge.yosupo.jp/problem/sqrt_of_formal_power_series","difficulty":1,"starred":true,"topic":"polynomial_sqrt","topics":["polynomial_sqrt"],"solved":false},{"id":"codedrills_perfect_strings","judge":"CodeDrills","title":"Perfect Strings","url":"https://codedrills.io/contests/icpc-asia-west-continent-final-contest-2022/problems/perfect-strings","difficulty":2,"starred":true,"topic":"polynomial_sqrt","topics":["polynomial_sqrt","generating_function_of_a_linear_recurrence"],"solved":false},{"id":"yosupo_sqrt_of_formal_power_series_sparse","judge":"Library Checker","title":"Sqrt of Formal Power Series (Sparse)","url":"https://judge.yosupo.jp/problem/sqrt_of_formal_power_series_sparse","difficulty":3,"starred":false,"topic":"polynomial_sqrt","topics":["polynomial_sqrt"],"solved":false},{"id":"yosupo_composition_of_formal_power_series","judge":"Library Checker","title":"Composition of Formal Power Series","url":"https://judge.yosupo.jp/problem/composition_of_formal_power_series","difficulty":1,"starred":true,"topic":"polynomial_composition","topics":["polynomial_composition"],"solved":false},{"id":"yosupo_compositional_inverse_of_formal_power_series","judge":"Library Checker","title":"Compositional Inverse of Formal Power Series","url":"https://judge.yosupo.jp/problem/compositional_inverse_of_formal_power_series","difficulty":2,"starred":false,"topic":"polynomial_composition","topics":["polynomial_composition"],"solved":false},{"id":"yosupo_multipoint_evaluation","judge":"Library Checker","title":"Multipoint Evaluation","url":"https://judge.yosupo.jp/problem/multipoint_evaluation","difficulty":1,"starred":true,"topic":"multipoint_evaluation","topics":["multipoint_evaluation"],"solved":false},{"id":"codechef_polyeval","judge":"CodeChef","title":"Evaluate the polynomial","url":"https://www.codechef.com/problems/POLYEVAL","difficulty":1,"starred":true,"topic":"multipoint_evaluation","topics":["multipoint_evaluation"],"solved":false},{"id":"codechef_chefequa","judge":"CodeChef","title":"Chef and Equations","url":"https://www.codechef.com/NOV18A/problems/CHEFEQUA","difficulty":2,"starred":false,"topic":"multipoint_evaluation","topics":["multipoint_evaluation"],"solved":false},{"id":"yosupo_multipoint_evaluation_on_geometric_sequence","judge":"Library Checker","title":"Multipoint Evaluation (Geometric Sequence)","url":"https://judge.yosupo.jp/problem/multipoint_evaluation_on_geometric_sequence","difficulty":3,"starred":false,"topic":"multipoint_evaluation","topics":["multipoint_evaluation"],"solved":false},{"id":"luogu_p6828","judge":"Luogu","title":"Chirp Z-Transform (mod 10^9 + 7)","url":"https://www.luogu.com.cn/problem/P6828","difficulty":1,"starred":true,"topic":"chirp_z_transform","topics":["chirp_z_transform"],"solved":false},{"id":"luogu_p6800","judge":"Luogu","title":"Chirp Z-Transform (mod 998244353)","url":"https://www.luogu.com.cn/problem/P6800","difficulty":1,"starred":true,"topic":"chirp_z_transform","topics":["chirp_z_transform"],"solved":false},{"id":"codeforces_901e","judge":"Codeforces","title":"Cyclic Cipher","url":"https://codeforces.com/contest/901/problem/E","difficulty":3,"starred":false,"topic":"chirp_z_transform","topics":["chirp_z_transform","determinant_of_permutant_matrix"],"solved":false},{"id":"codeforces_1184a3","judge":"Codeforces","title":"Heidi Learns Hashing (Hard)","url":"https://codeforces.com/contest/1184/problem/A3","difficulty":3,"starred":false,"topic":"chirp_z_transform","topics":["chirp_z_transform"],"solved":false},{"id":"yosupo_polynomial_interpolation","judge":"Library Checker","title":"Polynomial Interpolation","url":"https://judge.yosupo.jp/problem/polynomial_interpolation","difficulty":1,"starred":true,"topic":"polynomial_interpolation","topics":["polynomial_interpolation"],"solved":false},{"id":"yosupo_polynomial_interpolation_on_geometric_sequence","judge":"Library Checker","title":"Polynomial Interpolation (Geometric Sequence)","url":"https://judge.yosupo.jp/problem/polynomial_interpolation_on_geometric_sequence","difficulty":3,"starred":false,"topic":"polynomial_interpolation","topics":["polynomial_interpolation"],"solved":false},{"id":"codechef_wrdsum","judge":"CodeChef","title":"Weird Sum","url":"https://www.codechef.com/problems/WRDSUM","difficulty":3,"starred":true,"topic":"polynomial_interpolation","topics":["polynomial_interpolation"],"solved":false},{"id":"yosupo_polynomial_taylor_shift","judge":"Library Checker","title":"Polynomial Taylor Shift","url":"https://judge.yosupo.jp/problem/polynomial_taylor_shift","difficulty":1,"starred":true,"topic":"polynomial_shift","topics":["polynomial_shift"],"solved":false},{"id":"yosupo_shift_of_sampling_points_of_polynomial","judge":"Library Checker","title":"Shift of Sampling Points of Polynomial","url":"https://judge.yosupo.jp/problem/shift_of_sampling_points_of_polynomial","difficulty":1,"starred":true,"topic":"polynomial_shift_sampling_points","topics":["polynomial_shift_sampling_points"],"solved":false},{"id":"yosupo_division_of_polynomials","judge":"Library Checker","title":"Division of Polynomials","url":"https://judge.yosupo.jp/problem/division_of_polynomials","difficulty":2,"starred":true,"topic":"polynomial_division_and_remainder","topics":["polynomial_division_and_remainder"],"solved":false},{"id":"cf_gym_102129d","judge":"CF Gym","title":"Basis Change","url":"https://codeforces.com/gym/102129/problem/D","difficulty":3,"starred":false,"topic":"polynomial_division_and_remainder","topics":["polynomial_division_and_remainder","gaussian_elimination"],"solved":false},{"id":"yosupo_polynomial_root_finding","judge":"Library Checker","title":"Polynomial Root Finding (Mod 998244353)","url":"https://judge.yosupo.jp/problem/polynomial_root_finding","difficulty":2,"starred":true,"topic":"polynomial_roots_under_modulo","topics":["polynomial_roots_under_modulo"],"solved":false},{"id":"codechef_aprps","judge":"CodeChef","title":"Irrational Root","url":"https://www.codechef.com/problems/APRPS","difficulty":3,"starred":false,"topic":"polynomial_roots_under_modulo","topics":["polynomial_roots_under_modulo"],"solved":false},{"id":"yosupo_find_linear_recurrence","judge":"Library Checker","title":"Find Linear Recurrence","url":"https://judge.yosupo.jp/problem/find_linear_recurrence","difficulty":2,"starred":true,"topic":"resultant_of_two_polynomials","topics":["resultant_of_two_polynomials","berlekamp_messey"],"solved":false},{"id":"yosupo_inv_of_polynomials","judge":"Library Checker","title":"Inv of Polynomials","url":"https://judge.yosupo.jp/problem/inv_of_polynomials","difficulty":3,"starred":false,"topic":"resultant_of_two_polynomials","topics":["resultant_of_two_polynomials"],"solved":false},{"id":"codeforces_622f","judge":"Codeforces","title":"The Sum of the k-th Powers","url":"https://codeforces.com/problemset/problem/622/F","difficulty":1,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation","polynomial_with_binomial_coefficients"],"solved":false},{"id":"spoj_asumhard","judge":"SPOJ","title":"A Summatory (HARD)","url":"https://www.spoj.com/problems/ASUMHARD/","difficulty":1,"starred":false,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"codechef_countit","judge":"CodeChef","title":"Count Arrays","url":"https://www.codechef.com/problems/COUNTIT","difficulty":2,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"spoj_somesums","judge":"SPOJ","title":"Some Sums","url":"https://www.spoj.com/problems/SOMESUMS/","difficulty":2,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"hdu_4059","judge":"HDU","title":"The Boss on Mars","url":"http://acm.hdu.edu.cn/showproblem.php?pid=4059","difficulty":2,"starred":false,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"spoj_asumextr","judge":"SPOJ","title":"A Summatory (Extreme)","url":"https://www.spoj.com/problems/ASUMEXTR/","difficulty":2,"starred":false,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"atcoder_arc033_4","judge":"AtCoder","title":"見たことのない多項式","url":"https://atcoder.jp/contests/arc033/tasks/arc033_4","difficulty":2,"starred":false,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"codeforces_995f","judge":"Codeforces","title":"Cowmpany Cowmpensation","url":"https://codeforces.com/contest/995/problem/F","difficulty":2,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"spoj_battlecry","judge":"SPOJ","title":"Battle Of The Bastards - Kings Vs Rooks","url":"https://www.spoj.com/problems/BATTLECRY/","difficulty":2,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"codeforces_1155e","judge":"Codeforces","title":"Guess the Root","url":"https://codeforces.com/problemset/problem/1155/E","difficulty":2,"starred":true,"topic":"lagrange_interpolation","topics":["gaussian_elimination","lagrange_interpolation"],"solved":false},{"id":"codechef_gcdmask","judge":"CodeChef","title":"GCD of the Submasks","url":"https://www.codechef.com/LTIME84A/problems/GCDMASK","difficulty":3,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"spoj_pwsumc","judge":"SPOJ","title":"Power Sum","url":"https://www.spoj.com/problems/PWSUMC/","difficulty":3,"starred":false,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"codechef_xetf","judge":"CodeChef","title":"Euler Totient Function Extended","url":"https://www.codechef.com/problems/XETF","difficulty":3,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"luogu_p4463","judge":"Luogu","title":"calc","url":"https://www.luogu.com.cn/problem/P4463","difficulty":3,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"hdu_7217","judge":"HDU","title":"Counting Good Arrays","url":"https://vjudge.net/problem/HDU-7217","difficulty":4,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"toph_lots_of_cubes","judge":"Toph","title":"A Lazy Statement","url":"https://toph.co/p/lots-of-cubes","difficulty":4,"starred":true,"topic":"lagrange_interpolation","topics":["lagrange_interpolation"],"solved":false},{"id":"yosupo_sum_of_exponential_times_polynomial","judge":"Library Checker","title":"Sum of exponential times polynomial","url":"https://judge.yosupo.jp/problem/sum_of_exponential_times_polynomial","difficulty":1,"starred":true,"topic":"polynomial_sum","topics":["polynomial_sum"],"solved":false},{"id":"yosupo_sharp_p_subset_sum","judge":"Library Checker","title":"Subset Sum","url":"https://judge.yosupo.jp/problem/sharp_p_subset_sum","difficulty":1,"starred":true,"topic":"subset_sum_problem_using_generating_functions","topics":["subset_sum_problem_using_generating_functions"],"solved":false},{"id":"cf_gym_102114c","judge":"CF Gym","title":"Call It What You Want","url":"https://codeforces.com/gym/102114/problem/C","difficulty":2,"starred":true,"topic":"polynomial_factorization_of_xn_minus_1","topics":["polynomial_factorization_of_xn_minus_1"],"solved":false},{"id":"atcoder_abc222_h","judge":"AtCoder","title":"Beautiful Binary Tree","url":"https://atcoder.jp/contests/abc222/tasks/abc222_h","difficulty":3,"starred":false,"topic":"lagrange_inversion_theorem","topics":["lagrange_inversion_theorem"],"solved":false},{"id":"yosupo_matrix_product","judge":"Library Checker","title":"Matrix Product","url":"https://judge.yosupo.jp/problem/matrix_product","difficulty":1,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"yosupo_pow_of_matrix","judge":"Library Checker","title":"Pow of Matrix","url":"https://judge.yosupo.jp/problem/pow_of_matrix","difficulty":1,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation","frobenius_form_of_a_matrix"],"solved":false},{"id":"uva_10229","judge":"UVa","title":"Modular Fibonacci","url":"https://vjudge.net/problem/UVA-10229","difficulty":1,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cf_gym_102644a","judge":"CF Gym","title":"Random Mood","url":"https://codeforces.com/gym/102644/problem/A","difficulty":1,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"uva_10870","judge":"UVa","title":"Recurrences","url":"https://vjudge.net/problem/UVA-10870","difficulty":1,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"uva_10754","judge":"UVa","title":"Fantastic Sequence","url":"https://vjudge.net/problem/UVA-10754","difficulty":1,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"uva_11551","judge":"UVa","title":"Experienced Endeavour","url":"https://vjudge.net/problem/UVA-11551","difficulty":1,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"spoj_summul","judge":"SPOJ","title":"Sum of products","url":"https://www.spoj.com/problems/SUMMUL/","difficulty":1,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cf_gym_102644b","judge":"CF Gym","title":"String Mood","url":"https://codeforces.com/gym/102644/problem/B","difficulty":1,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cses_1723","judge":"CSES","title":"Graph Paths I","url":"https://cses.fi/problemset/task/1723","difficulty":1,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cses_1724","judge":"CSES","title":"Graph Paths II","url":"https://cses.fi/problemset/task/1724","difficulty":1,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"spoj_tetrahrd","judge":"SPOJ","title":"Sum of Tetranacci numbers","url":"https://www.spoj.com/problems/TETRAHRD/","difficulty":1,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"spoj_seq","judge":"SPOJ","title":"Recursive Sequence","url":"https://www.spoj.com/problems/SEQ/","difficulty":1,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"spoj_fibpwsum","judge":"SPOJ","title":"Fibonacci Power Sum","url":"https://www.spoj.com/problems/FIBPWSUM/","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["berlekamp_messey","matrix_exponentiation"],"solved":false},{"id":"spoj_itrix12e","judge":"SPOJ","title":"R Numbers","url":"https://www.spoj.com/problems/ITRIX12E/","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation","berlekamp_messey"],"solved":false},{"id":"cf_gym_316783b","judge":"CF Gym","title":"Decoding Genome","url":"https://codeforces.com/gym/316783/problem/B","difficulty":2,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cf_gym_316783c","judge":"CF Gym","title":"Magic Gems","url":"https://codeforces.com/gym/316783/problem/C","difficulty":2,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation","linear_recurrence_using_cayley_hamilton_theorem"],"solved":false},{"id":"cf_gym_316783d","judge":"CF Gym","title":"Wet Shark and Blocks","url":"https://codeforces.com/gym/316783/problem/D","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation","berlekamp_messey"],"solved":false},{"id":"cf_gym_316783e","judge":"CF Gym","title":"Product Oriented Recurrence","url":"https://codeforces.com/gym/316783/problem/E","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"codechef_hlpmil","judge":"CodeChef","title":"Help Milo!","url":"https://www.codechef.com/problems/HLPMIL","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"codeforces_821e","judge":"Codeforces","title":"Okabe and El Psy Kongroo","url":"https://codeforces.com/problemset/problem/821/E","difficulty":2,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"spoj_pboard","judge":"SPOJ","title":"Blocks for kids","url":"https://www.spoj.com/problems/PBOARD/","difficulty":2,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cf_gym_100199e","judge":"CF Gym","title":"Nice Patterns Strike Back","url":"https://codeforces.com/gym/100199/problem/E","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"lightoj_tiles","judge":"LightOJ","title":"Tiles","url":"https://lightoj.com/problem/tiles","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"lightoj_unlucky_strings","judge":"LightOJ","title":"Unlucky Strings","url":"https://lightoj.com/problem/unlucky-strings","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation","substring_dp","kmp"],"solved":false},{"id":"lightoj_kings_in_chessboard","judge":"LightOJ","title":"Kings in Chessboard","url":"https://lightoj.com/problem/kings-in-chessboard","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"hackerearth_abcd_strings","judge":"HackerEarth","title":"ABCD Strings","url":"https://www.hackerearth.com/problem/algorithm/abcd-strings/","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation","aho_corasick"],"solved":false},{"id":"codeforces_147b","judge":"Codeforces","title":"Smile House","url":"https://codeforces.com/contest/147/problem/B","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cf_gym_102644e","judge":"CF Gym","title":"Knight Paths","url":"https://codeforces.com/gym/102644/problem/E","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cf_gym_102644g","judge":"CF Gym","title":"Recurrence With Square","url":"https://codeforces.com/gym/102644/problem/G","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation","berlekamp_messey"],"solved":false},{"id":"cf_gym_102644h","judge":"CF Gym","title":"String Mood Updates","url":"https://codeforces.com/gym/102644/problem/H","difficulty":2,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cf_gym_102644i","judge":"CF Gym","title":"Count Paths Queries","url":"https://codeforces.com/gym/102644/problem/I","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"spoj_flib","judge":"SPOJ","title":"Flibonakki","url":"https://www.spoj.com/problems/FLIB/","difficulty":2,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"cf_gym_105164b","judge":"CF Gym","title":"Bacterial Sampling","url":"https://codeforces.com/gym/105164/problem/B","difficulty":2,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"codeforces_691e","judge":"Codeforces","title":"Xor-sequences","url":"https://codeforces.com/contest/691/problem/E","difficulty":2,"starred":true,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"uva_11651","judge":"UVa","title":"Krypton Number System","url":"https://vjudge.net/problem/UVA-11651","difficulty":1,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"atcoder_dp_r","judge":"AtCoder","title":"Walk","url":"https://atcoder.jp/contests/dp/tasks/dp_r","difficulty":2,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"atcoder_abc293_e","judge":"AtCoder","title":"Geometric Progression","url":"https://atcoder.jp/contests/abc293/tasks/abc293_e","difficulty":1,"starred":false,"topic":"matrix_exponentiation","topics":["matrix_exponentiation"],"solved":false},{"id":"codeforces_468e","judge":"Codeforces","title":"Permanent","url":"https://codeforces.com/problemset/problem/468/E","difficulty":4,"starred":true,"topic":"permanent_of_a_matrix","topics":["permanent_of_a_matrix"],"solved":false},{"id":"cf_gym_101341i","judge":"CF Gym","title":"Matrix God","url":"https://codeforces.com/gym/101341/problem/I","difficulty":1,"starred":true,"topic":"freivalds_algorithm","topics":["freivalds_algorithm","randomized_algorithms"],"solved":false},{"id":"codechef_sata05","judge":"CodeChef","title":"Lopymonials","url":"https://www.codechef.com/problems/SATA05","difficulty":2,"starred":true,"topic":"vandermonde_matrix","topics":["vandermonde_matrix"],"solved":false},{"id":"yosupo_hafnian_of_matrix","judge":"Library Checker","title":"Hafnian of Matrix","url":"https://judge.yosupo.jp/problem/hafnian_of_matrix","difficulty":1,"starred":true,"topic":"hafnian_of_a_matrix","topics":["hafnian_of_a_matrix"],"solved":false},{"id":"codeforces_506e","judge":"Codeforces","title":"Mr. Kitayuta's Gift","url":"https://codeforces.com/contest/506/problem/E","difficulty":3,"starred":false,"topic":"linear_recurrence_using_cayley_hamilton_theorem","topics":["berlekamp_messey","linear_recurrence_using_cayley_hamilton_theorem"],"solved":false},{"id":"hackerearth_costly_strings","judge":"HackerEarth","title":"Costly Strings","url":"https://www.hackerearth.com/problem/approximate/costly-strings/","difficulty":3,"starred":false,"topic":"linear_recurrence_using_cayley_hamilton_theorem","topics":["linear_recurrence_using_cayley_hamilton_theorem"],"solved":false},{"id":"yosupo_kth_term_of_linearly_recurrent_sequence","judge":"Library Checker","title":"Kth term of Linearly Recurrent Sequence","url":"https://judge.yosupo.jp/problem/kth_term_of_linearly_recurrent_sequence","difficulty":1,"starred":true,"topic":"linear_recurrence_using_generating_functions","topics":["linear_recurrence_using_generating_functions"],"solved":false},{"id":"codechef_rng","judge":"CodeChef","title":"Random Number Generator","url":"https://www.codechef.com/problems/RNG","difficulty":2,"starred":true,"topic":"linear_recurrence_using_generating_functions","topics":["linear_recurrence_using_generating_functions"],"solved":false},{"id":"atcoder_typical90_cl","judge":"AtCoder","title":"Tenkei90's Last Problem","url":"https://atcoder.jp/contests/typical90/tasks/typical90_cl","difficulty":4,"starred":true,"topic":"linear_recurrence_using_generating_functions","topics":["linear_recurrence_using_generating_functions"],"solved":false},{"id":"cf_gym_102268e","judge":"CF Gym","title":"Expected Value","url":"https://codeforces.com/gym/102268/problem/E","difficulty":3,"starred":true,"topic":"generating_function_of_a_linear_recurrence","topics":["berlekamp_messey","generating_function_of_a_linear_recurrence"],"solved":false},{"id":"codechef_partn01","judge":"CodeChef","title":"Even Odd Partition","url":"https://www.codechef.com/JULY21A/problems/PARTN01","difficulty":2,"starred":false,"topic":"berlekamp_messey","topics":["berlekamp_messey"],"solved":false},{"id":"codechef_rec20f","judge":"CodeChef","title":"A Way Out","url":"https://www.codechef.com/problems/REC20F","difficulty":2,"starred":false,"topic":"berlekamp_messey","topics":["berlekamp_messey"],"solved":false},{"id":"loj_2463","judge":"LibreOJ","title":"完美的旅行","url":"https://loj.ac/p/2463","difficulty":3,"starred":false,"topic":"berlekamp_messey","topics":["berlekamp_messey"],"solved":false},{"id":"cf_gym_102141i","judge":"CF Gym","title":"IFibonacci Power Sum","url":"https://codeforces.com/gym/102141/problem/I","difficulty":2,"starred":true,"topic":"berlekamp_messey","topics":["berlekamp_messey"],"solved":false},{"id":"spoj_findlr","judge":"SPOJ","title":"Find Linear Recurrence","url":"https://www.spoj.com/problems/FINDLR/","difficulty":1,"starred":true,"topic":"reeds_sloane_algorithm","topics":["reeds_sloane_algorithm"],"solved":false},{"id":"spoj_kn2","judge":"SPOJ","title":"Travelling Knight 2","url":"https://www.spoj.com/problems/KN2/","difficulty":3,"starred":false,"topic":"reeds_sloane_algorithm","topics":["reeds_sloane_algorithm"],"solved":false},{"id":"yosupo_system_of_linear_equations","judge":"Library Checker","title":"System of Linear Equations","url":"https://judge.yosupo.jp/problem/system_of_linear_equations","difficulty":1,"starred":true,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"lightoj_graph_coloring","judge":"LightOJ","title":"Graph Coloring","url":"https://lightoj.com/problem/graph-coloring","difficulty":1,"starred":true,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"spoj_gs","judge":"SPOJ","title":"Going to school","url":"https://www.spoj.com/problems/GS/","difficulty":1,"starred":true,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"codechef_knghtmov","judge":"CodeChef","title":"Knight Moving","url":"https://www.codechef.com/SEP12/problems/KNGHTMOV","difficulty":1,"starred":false,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"timus_1042","judge":"Timus","title":"Central Heating","url":"https://acm.timus.ru/problem.aspx?space=1&num=1042","difficulty":1,"starred":false,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"uva_4775","judge":"UVa","title":"Snakes and Ladders","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4775","difficulty":1,"starred":false,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"timus_1766","judge":"Timus","title":"Humpty Dumpty","url":"https://acm.timus.ru/problem.aspx?space=1&num=1766","difficulty":2,"starred":false,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"timus_1266","judge":"Timus","title":"Kirchhoff's Law","url":"https://acm.timus.ru/problem.aspx?space=1&num=1266","difficulty":2,"starred":false,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"yosupo_matrix_rank","judge":"Library Checker","title":"Rank of Matrix","url":"https://judge.yosupo.jp/problem/matrix_rank","difficulty":2,"starred":true,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"timus_1041","judge":"Timus","title":"Nikifor","url":"https://acm.timus.ru/problem.aspx?space=1&num=1041","difficulty":2,"starred":true,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"codeforces_1411g","judge":"Codeforces","title":"No Game No Life","url":"https://codeforces.com/problemset/problem/1411/G","difficulty":3,"starred":true,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"kattis_costofliving","judge":"Kattis","title":"Cost of Living","url":"https://naipc19.kattis.com/contests/naipc19/problems/costofliving","difficulty":3,"starred":true,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"codeforces_963e","judge":"Codeforces","title":"Circles of Waiting","url":"https://codeforces.com/contest/963/problem/E","difficulty":3,"starred":false,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"toph_boom_bot","judge":"Toph","title":"Boom Bot","url":"https://toph.co/p/boom-bot","difficulty":2,"starred":false,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"spoj_codesptf","judge":"SPOJ","title":"Palindromes","url":"https://www.spoj.com/problems/CODESPTF/","difficulty":2,"starred":false,"topic":"gaussian_elimination","topics":["gaussian_elimination"],"solved":false},{"id":"lightoj_subsets_forming_perfect_squar","judge":"LightOJ","title":"Subsets Forming Perfect Squares","url":"https://lightoj.com/problem/subsets-forming-perfect-squar","difficulty":2,"starred":true,"topic":"gaussian_elimination_modulo_2","topics":["basis_vector","gaussian_elimination_modulo_2"],"solved":false},{"id":"yosupo_matrix_rank_mod_2","judge":"Library Checker","title":"Rank of Matrix (Mod 2)","url":"https://judge.yosupo.jp/problem/matrix_rank_mod_2","difficulty":2,"starred":true,"topic":"gaussian_elimination_modulo_2","topics":["gaussian_elimination_modulo_2"],"solved":false},{"id":"cf_gym_101908m","judge":"CF Gym","title":"Modifying SAT","url":"https://codeforces.com/gym/101908/problem/M","difficulty":2,"starred":true,"topic":"gaussian_elimination_modulo_2","topics":["gaussian_elimination_modulo_2"],"solved":false},{"id":"yosupo_matrix_det","judge":"Library Checker","title":"Determinant of Matrix","url":"https://judge.yosupo.jp/problem/matrix_det","difficulty":1,"starred":true,"topic":"determinant_under_prime_modulo","topics":["determinant_under_prime_modulo"],"solved":false},{"id":"yosupo_matrix_det_mod_2","judge":"Library Checker","title":"Determinant of Matrix (Mod 2)","url":"https://judge.yosupo.jp/problem/matrix_det_mod_2","difficulty":2,"starred":true,"topic":"determinant_under_prime_modulo","topics":["determinant_under_prime_modulo"],"solved":false},{"id":"codeforces_167e","judge":"Codeforces","title":"Wizards and Bets","url":"https://codeforces.com/contest/167/problem/E","difficulty":3,"starred":false,"topic":"determinant_under_prime_modulo","topics":["determinant_under_prime_modulo"],"solved":false},{"id":"yosupo_matrix_det_arbitrary_mod","judge":"Library Checker","title":"Determinant of Matrix (Arbitrary Mod)","url":"https://judge.yosupo.jp/problem/matrix_det_arbitrary_mod","difficulty":1,"starred":true,"topic":"determinant_under_composite_modulo","topics":["determinant_under_composite_modulo"],"solved":false},{"id":"spoj_deter3","judge":"SPOJ","title":"Find The Determinant III","url":"https://www.spoj.com/problems/DETER3","difficulty":1,"starred":false,"topic":"determinant_under_composite_modulo","topics":["determinant_under_composite_modulo"],"solved":false},{"id":"timus_1845","judge":"Timus","title":"Integer-valued Complex Determinant","url":"https://acm.timus.ru/problem.aspx?space=1&num=1845","difficulty":2,"starred":false,"topic":"determinant_under_composite_modulo","topics":["determinant_under_composite_modulo"],"solved":false},{"id":"yosupo_characteristic_polynomial","judge":"Library Checker","title":"Characteristic Polynomial","url":"https://judge.yosupo.jp/problem/characteristic_polynomial","difficulty":2,"starred":true,"topic":"characteristic_polynomial","topics":["characteristic_polynomial"],"solved":false},{"id":"cf_gym_102984k","judge":"CF Gym","title":"Determinant","url":"https://codeforces.com/gym/102984/problem/K","difficulty":2,"starred":true,"topic":"characteristic_polynomial","topics":["characteristic_polynomial"],"solved":false},{"id":"yandex_23124d","judge":"Yandex","title":"Determinant Strikes Back","url":"https://official.contest.yandex.ru/opencupXXI/contest/23124/problems/D/","difficulty":1,"starred":true,"topic":"determinant_of_product_matrix","topics":["determinant_of_product_matrix"],"solved":false},{"id":"yosupo_sparse_matrix_det","judge":"Library Checker","title":"Determinant of Sparse Matrix","url":"https://judge.yosupo.jp/problem/sparse_matrix_det","difficulty":1,"starred":true,"topic":"determinant_of_sparse_matrix","topics":["determinant_of_sparse_matrix"],"solved":false},{"id":"codechef_treewalk","judge":"CodeChef","title":"Walk on Tree","url":"https://www.codechef.com/OCT18A/problems/TREEWALK","difficulty":3,"starred":false,"topic":"determinant_of_sparse_matrix","topics":["determinant_of_sparse_matrix"],"solved":false},{"id":"cf_gym_102129g","judge":"CF Gym","title":"Permutant","url":"https://codeforces.com/gym/102129/problem/G","difficulty":1,"starred":true,"topic":"determinant_of_permutant_matrix","topics":["determinant_of_permutant_matrix"],"solved":false},{"id":"spoj_deter","judge":"SPOJ","title":"Find The Determinant","url":"https://www.spoj.com/problems/DETER/","difficulty":1,"starred":true,"topic":"gcd_determinant","topics":["gcd_determinant"],"solved":false},{"id":"spoj_deter2","judge":"SPOJ","title":"Find The Determinant II","url":"https://www.spoj.com/problems/DETER2/","difficulty":1,"starred":true,"topic":"gcd_determinant","topics":["gcd_determinant"],"solved":false},{"id":"codechef_cucumber","judge":"CodeChef","title":"Cucumber Boy and Cucumber Girl","url":"https://www.codechef.com/problems/CUCUMBER","difficulty":2,"starred":true,"topic":"cauchy_binet_formula","topics":["cauchy_binet_formula"],"solved":false},{"id":"yosupo_inverse_matrix","judge":"Library Checker","title":"Inverse Matrix","url":"https://judge.yosupo.jp/problem/inverse_matrix","difficulty":1,"starred":true,"topic":"inverse_of_a_matrix","topics":["inverse_of_a_matrix"],"solved":false},{"id":"yosupo_inverse_matrix_mod_2","judge":"Library Checker","title":"Inverse Matrix (Mod 2)","url":"https://judge.yosupo.jp/problem/inverse_matrix_mod_2","difficulty":1,"starred":true,"topic":"inverse_of_a_matrix_modulo_2","topics":["inverse_of_a_matrix_modulo_2"],"solved":false},{"id":"codeforces_736d","judge":"Codeforces","title":"Permutations","url":"https://codeforces.com/contest/736/problem/D","difficulty":2,"starred":true,"topic":"inverse_of_a_matrix_modulo_2","topics":["inverse_of_a_matrix_modulo_2"],"solved":false},{"id":"codeforces_1349d","judge":"Codeforces","title":"Slime and Biscuits","url":"https://codeforces.com/contest/1349/problem/D","difficulty":2,"starred":true,"topic":"thomas_algorithm","topics":["the_slime_trick","thomas_algorithm","martingale"],"solved":false},{"id":"lightoj_maximum_subset_sum","judge":"LightOJ","title":"Maximum Subset Sum","url":"https://lightoj.com/problem/maximum-subset-sum","difficulty":1,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"spoj_xmax","judge":"SPOJ","title":"XOR Maximization","url":"https://www.spoj.com/problems/XMAX/","difficulty":1,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"cf_group_203881s","judge":"Codeforces","title":"Godzilla and Pretty XOR","url":"https://codeforces.com/group/qcIqFPYhVr/contest/203881/problem/S","difficulty":1,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_895c","judge":"Codeforces","title":"Square Subsets","url":"https://codeforces.com/contest/895/problem/C","difficulty":2,"starred":true,"topic":"basis_vector","topics":["basis_vector","bitmask_dp","xor_hashing"],"solved":false},{"id":"atcoder_agc045_a","judge":"AtCoder","title":"Xor Battle","url":"https://atcoder.jp/contests/agc045/tasks/agc045_a","difficulty":2,"starred":false,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_1101g","judge":"Codeforces","title":"(Zero XOR Subset)-less","url":"https://codeforces.com/contest/1101/problem/G","difficulty":2,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_845g","judge":"Codeforces","title":"Shortest Path Problem?","url":"https://codeforces.com/contest/845/problem/G","difficulty":2,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_1163e","judge":"Codeforces","title":"Magical Permutation","url":"https://codeforces.com/contest/1163/problem/E","difficulty":2,"starred":false,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codechef_xorcmpnt","judge":"CodeChef","title":"Bitsetbaba and Power Grid","url":"https://www.codechef.com/COOK106A/problems/XORCMPNT","difficulty":2,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"hackerearth_chef_f59c8115","judge":"HackerEarth","title":"Chef & Chutneys","url":"https://www.hackerearth.com/problem/algorithm/chef-f59c8115","difficulty":2,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"atcoder_abc223_h","judge":"AtCoder","title":"Xor Query","url":"https://atcoder.jp/contests/abc223/tasks/abc223_h","difficulty":2,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"atcoder_abc236_f","judge":"AtCoder","title":"Spices","url":"https://atcoder.jp/contests/abc236/tasks/abc236_f","difficulty":2,"starred":false,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"atcoder_abc141_f","judge":"AtCoder","title":"Xor Sum 3","url":"https://atcoder.jp/contests/abc141/tasks/abc141_f","difficulty":2,"starred":false,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_662a","judge":"Codeforces","title":"Gambling Nim","url":"https://codeforces.com/problemset/problem/662/A","difficulty":2,"starred":false,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"cf_gym_103414g","judge":"CF Gym","title":"Maximaze XOR sum","url":"https://codeforces.com/gym/103414/problem/G","difficulty":3,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_587e","judge":"Codeforces","title":"Duff as a Queen","url":"https://codeforces.com/contest/587/problem/E","difficulty":3,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"csacademy_xor_closure","judge":"CS Academy","title":"Xor Closure","url":"https://csacademy.com/contest/archive/task/xor-closure/statement/","difficulty":1,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"atcoder_arc146_c","judge":"AtCoder","title":"Even XOR","url":"https://atcoder.jp/contests/arc146/tasks/arc146_c","difficulty":2,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_1778e","judge":"Codeforces","title":"The Tree Has Fallen!","url":"https://codeforces.com/contest/1778/problem/E","difficulty":2,"starred":true,"topic":"basis_vector","topics":["basis_vector_ft_lexicographically_largest_basis","basis_vector"],"solved":false},{"id":"cf_gym_104147j","judge":"CF Gym","title":"Two Faced Hobz","url":"https://codeforces.com/gym/104147/problem/J","difficulty":2,"starred":false,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"lightoj_uncle_bob_xor_sum","judge":"LightOJ","title":"Uncle Bob and XOR Sum","url":"https://lightoj.com/problem/uncle-bob-xor-sum","difficulty":2,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_1299d","judge":"Codeforces","title":"Around the World","url":"https://codeforces.com/contest/1299/problem/D","difficulty":3,"starred":false,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_1336e1","judge":"Codeforces","title":"Chiori and Doll Picking (easy version)","url":"https://codeforces.com/contest/1336/problem/E1","difficulty":3,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_2116f","judge":"Codeforces","title":"Gellyfish and Forget-Me-Not","url":"https://codeforces.com/contest/2116/problem/F","difficulty":3,"starred":false,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"codeforces_2143f","judge":"Codeforces","title":"Increasing Xor","url":"https://codeforces.com/contest/2143/problem/F","difficulty":3,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"atcoder_cf16_exhibition_final_h","judge":"AtCoder","title":"AB=C Problem","url":"https://atcoder.jp/contests/cf16-exhibition-final/tasks/cf16_exhibition_final_h","difficulty":4,"starred":true,"topic":"basis_vector","topics":["basis_vector"],"solved":false},{"id":"cf_gym_102979f","judge":"CF Gym","title":"Find the XOR","url":"https://codeforces.com/gym/102979/problem/F","difficulty":3,"starred":true,"topic":"basis_vector_reduced_row_echelon_form","topics":["basis_vector_reduced_row_echelon_form"],"solved":false},{"id":"cf_gym_102331e","judge":"CF Gym","title":"Easy Win","url":"https://codeforces.com/gym/102331/problem/E","difficulty":2,"starred":true,"topic":"basis_vector_ft_lexicographically_largest_basis","topics":["basis_vector_ft_lexicographically_largest_basis"],"solved":false},{"id":"codeforces_1902f","judge":"Codeforces","title":"Trees and XOR Queries Again","url":"https://codeforces.com/contest/1902/problem/F","difficulty":2,"starred":true,"topic":"basis_vector_ft_lexicographically_largest_basis","topics":["basis_vector_ft_lexicographically_largest_basis"],"solved":false},{"id":"eolymp_11732","judge":"Eolymp","title":"Beauty Permutation Queries","url":"https://basecamp.eolymp.com/en/problems/11732","difficulty":2,"starred":true,"topic":"basis_vector_with_deletions","topics":["basis_vector_with_deletions"],"solved":false},{"id":"codeforces_1916h2","judge":"Codeforces","title":"Matrix Rank (Hard Version)","url":"https://codeforces.com/contest/1916/problem/H2","difficulty":2,"starred":true,"topic":"q_binomial","topics":["q_binomial"],"solved":false},{"id":"codeforces_1603f","judge":"Codeforces","title":"October 18, 2017","url":"https://codeforces.com/contest/1603/problem/F","difficulty":2,"starred":true,"topic":"q_binomial","topics":["q_binomial"],"solved":false},{"id":"atcoder_arc139_f","judge":"AtCoder","title":"Many Xor Optimization Problems","url":"https://atcoder.jp/contests/arc139/tasks/arc139_f","difficulty":3,"starred":false,"topic":"q_binomial","topics":["q_binomial"],"solved":false},{"id":"atcoder_abc278_h","judge":"AtCoder","title":"make 1","url":"https://atcoder.jp/contests/abc278/tasks/abc278_h","difficulty":3,"starred":true,"topic":"q_binomial","topics":["q_binomial"],"solved":false},{"id":"yosupo_q_binomial_coefficient_prime_mod","judge":"Library Checker","title":"q-Binomial Coefficient (Prime Mod)","url":"https://judge.yosupo.jp/problem/q_binomial_coefficient_prime_mod","difficulty":1,"starred":true,"topic":"q_binomial","topics":["q_binomial"],"solved":false},{"id":"cf_gym_103150f","judge":"CF Gym","title":"Palindromicity","url":"https://codeforces.com/gym/103150/problem/F","difficulty":1,"starred":true,"topic":"gausss_eureka_theorem","topics":["gausss_eureka_theorem"],"solved":false},{"id":"toph_betting_business","judge":"Toph","title":"Betting Business","url":"https://toph.co/p/betting-business","difficulty":1,"starred":true,"topic":"titus_lemma","topics":["titus_lemma","lagrange_multiplier"],"solved":false},{"id":"gym_102821i","judge":"CF Gym","title":"Inventory","url":"https://vjudge.net/problem/Gym-102821I","difficulty":1,"starred":true,"topic":"titus_lemma","topics":["titus_lemma"],"solved":false},{"id":"hackerrank_demidenko_black_hole","judge":"HackerRank","title":"Black Hole","url":"https://www.hackerrank.com/contests/infinitum8/challenges/demidenko-black-hole","difficulty":2,"starred":false,"topic":"faulhabers_formula","topics":["faulhabers_formula"],"solved":false},{"id":"codechef_sersum","judge":"CodeChef","title":"Series Sum","url":"https://www.codechef.com/problems/SERSUM","difficulty":3,"starred":true,"topic":"faulhabers_formula","topics":["faulhabers_formula"],"solved":false},{"id":"hackerrank_coprime_power_sum","judge":"HackerRank","title":"Coprime Power Sum","url":"https://www.hackerrank.com/challenges/coprime-power-sum/problem","difficulty":3,"starred":true,"topic":"faulhabers_formula","topics":["faulhabers_formula","lagrange_multiplier"],"solved":false},{"id":"gym_423724b","judge":"CF Gym","title":"Simple Differentiation","url":"https://vjudge.net/problem/Gym-423724B","difficulty":1,"starred":true,"topic":"integration","topics":["integration"],"solved":false},{"id":"gym_101807d","judge":"CF Gym","title":"Differentiation","url":"https://vjudge.net/problem/Gym-101807D","difficulty":1,"starred":false,"topic":"integration","topics":["integration"],"solved":false},{"id":"uva_12997","judge":"UVa","title":"Train Station","url":"https://vjudge.net/problem/UVA-12997","difficulty":1,"starred":true,"topic":"integration","topics":["integration"],"solved":false},{"id":"uva_3973","judge":"UVa","title":"Environment Protection","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=441&page=show_problem&problem=3973","difficulty":2,"starred":false,"topic":"integration","topics":["integration"],"solved":false},{"id":"uva_3838","judge":"UVa","title":"Speed Zones","url":"https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=3838","difficulty":2,"starred":true,"topic":"integration","topics":["integration","lagrange_multiplier"],"solved":false},{"id":"uva_3893","judge":"UVa","title":"Curvy Little Bottles","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3893","difficulty":2,"starred":false,"topic":"integration","topics":["integration"],"solved":false},{"id":"timus_1562","judge":"Timus","title":"GM-pineapple","url":"https://acm.timus.ru/problem.aspx?space=1&num=1562","difficulty":2,"starred":false,"topic":"integration","topics":["integration"],"solved":false},{"id":"spoj_cerc07w","judge":"SPOJ","title":"Tough Water Level","url":"https://www.spoj.com/problems/CERC07W/","difficulty":2,"starred":false,"topic":"integration","topics":["integration"],"solved":false},{"id":"uva_1116","judge":"UVa","title":"Sphere","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1116","difficulty":2,"starred":false,"topic":"integration","topics":["integration"],"solved":false},{"id":"spoj_ciru","judge":"SPOJ","title":"The area of the union of circles","url":"https://www.spoj.com/problems/CIRU/","difficulty":3,"starred":true,"topic":"integration","topics":["integration","circle_union_2d"],"solved":false},{"id":"codechef_mindist","judge":"CodeChef","title":"Minimize the Distance","url":"https://vjudge.net/problem/CodeChef-MINDIST","difficulty":4,"starred":true,"topic":"integration","topics":["lines_and_segments_2d","integration"],"solved":false},{"id":"codechef_impo","judge":"CodeChef","title":"Imagine Polygons","url":"https://vjudge.net/problem/CodeChef-IMPO","difficulty":4,"starred":false,"topic":"integration","topics":["integration"],"solved":false},{"id":"codeforces_9a","judge":"Codeforces","title":"Die Roll","url":"https://codeforces.com/problemset/problem/9/A","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":true},{"id":"codeforces_312b","judge":"Codeforces","title":"Archer","url":"https://codeforces.com/problemset/problem/312/B","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_476b","judge":"Codeforces","title":"Dreamoon and WiFi","url":"https://codeforces.com/problemset/problem/476/B","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values","backtracking"],"solved":false},{"id":"codeforces_453a","judge":"Codeforces","title":"Little Pony and Expected Maximum","url":"https://codeforces.com/problemset/problem/453/A","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1461c","judge":"Codeforces","title":"Random Events","url":"https://codeforces.com/problemset/problem/1461/C","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_621c","judge":"Codeforces","title":"Wet Shark and Flowers","url":"https://codeforces.com/contest/621/problem/C","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_540d","judge":"Codeforces","title":"Bad Luck Island","url":"https://codeforces.com/problemset/problem/540/D","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_442b","judge":"Codeforces","title":"Andrey and Problem","url":"https://codeforces.com/problemset/problem/442/B","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"uva_997","judge":"UVa","title":"What is the Probability ?","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=997","difficulty":1,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codechef_marting1","judge":"CodeChef","title":"Martingale","url":"https://www.codechef.com/AMR18ROL/problems/MARTING1","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_839c","judge":"Codeforces","title":"Journey","url":"https://codeforces.com/problemset/problem/839/C","difficulty":1,"starred":false,"topic":"probabilities_and_expected_values","topics":["dp_on_trees_and_dags","probabilities_and_expected_values"],"solved":false},{"id":"codeforces_518d","judge":"Codeforces","title":"Ilya and Escalator","url":"https://codeforces.com/problemset/problem/518/D","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_148d","judge":"Codeforces","title":"Bag of mice","url":"https://codeforces.com/problemset/problem/148/D","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"uva_3904","judge":"UVa","title":"Airplane","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=3904","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"uva_12004","judge":"UVa","title":"Bubble Sort","url":"https://vjudge.net/problem/UVA-12004","difficulty":1,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_280c","judge":"Codeforces","title":"Game on Tree","url":"https://codeforces.com/problemset/problem/280/C","difficulty":2,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codechef_kaladin","judge":"CodeChef","title":"Proprietary Probabilistic Problem","url":"https://www.codechef.com/GWR17ROL/problems/KALADIN","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"atcoder_abc189_f","judge":"AtCoder","title":"Sugoroku2","url":"https://atcoder.jp/contests/abc189/tasks/abc189_f","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1864e","judge":"Codeforces","title":"Guess Game","url":"https://codeforces.com/problemset/problem/1864/E","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1778d","judge":"Codeforces","title":"Flexible String Revisit","url":"https://codeforces.com/problemset/problem/1778/D","difficulty":2,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1612e","judge":"Codeforces","title":"Messages","url":"https://codeforces.com/problemset/problem/1612/E","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1599c","judge":"Codeforces","title":"Bubble Strike","url":"https://codeforces.com/problemset/problem/1599/C","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1525e","judge":"Codeforces","title":"Assimilation IV","url":"https://codeforces.com/problemset/problem/1525/E","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1418e","judge":"Codeforces","title":"Expected Damage","url":"https://codeforces.com/problemset/problem/1418/E","difficulty":2,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1096f","judge":"Codeforces","title":"Inversion Expectation","url":"https://codeforces.com/problemset/problem/1096/F","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1097d","judge":"Codeforces","title":"Makoto and a Blackboard","url":"https://codeforces.com/problemset/problem/1097/D","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_16e","judge":"Codeforces","title":"Fish","url":"https://codeforces.com/problemset/problem/16/E","difficulty":2,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values","bitmask_dp"],"solved":false},{"id":"codeforces_26d","judge":"Codeforces","title":"Tickets","url":"https://codeforces.com/contest/26/problem/D","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_749e","judge":"Codeforces","title":"Inversions After Shuffle","url":"https://codeforces.com/problemset/problem/749/E","difficulty":1,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_107b","judge":"Codeforces","title":"Basketball Team","url":"https://codeforces.com/problemset/problem/107/B","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_77b","judge":"Codeforces","title":"Falling Anvils","url":"https://codeforces.com/problemset/problem/77/B","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_626d","judge":"Codeforces","title":"Jerry's Protest","url":"https://codeforces.com/problemset/problem/626/D","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_351b","judge":"Codeforces","title":"Jeff and Furik","url":"https://codeforces.com/problemset/problem/351/B","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_235b","judge":"Codeforces","title":"Let's Play Osu!","url":"https://codeforces.com/problemset/problem/235/B","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_167b","judge":"Codeforces","title":"Wizards and Huge Prize","url":"https://codeforces.com/problemset/problem/167/B","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_109b","judge":"Codeforces","title":"Lucky Probability","url":"https://codeforces.com/problemset/problem/109/B","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_30c","judge":"Codeforces","title":"Shooting Gallery","url":"https://codeforces.com/problemset/problem/30/C","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"lightoj_birthday_paradox","judge":"LightOJ","title":"Birthday Paradox","url":"https://lightoj.com/problem/birthday-paradox","difficulty":2,"starred":true,"topic":"probabilities_and_expected_values","topics":["birthday_paradox","probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1295f","judge":"Codeforces","title":"Good Contest","url":"https://codeforces.com/problemset/problem/1295/F","difficulty":3,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"cf_gym_102059c","judge":"CF Gym","title":"Dstorv","url":"https://codeforces.com/gym/102059/problem/C","difficulty":3,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_123e","judge":"Codeforces","title":"Maze","url":"https://codeforces.com/problemset/problem/123/E","difficulty":3,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_113d","judge":"Codeforces","title":"Museum","url":"https://codeforces.com/problemset/problem/113/D","difficulty":3,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_623d","judge":"Codeforces","title":"Birthday","url":"https://codeforces.com/problemset/problem/623/D","difficulty":3,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"kattis_gemisland","judge":"Kattis","title":"Gem Island","url":"https://icpc.kattis.com/problems/gemisland","difficulty":4,"starred":true,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_1392h","judge":"Codeforces","title":"ZS Shuffles Cards","url":"https://codeforces.com/contest/1392/problem/H","difficulty":3,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values","martingale"],"solved":false},{"id":"codeforces_2008f","judge":"Codeforces","title":"Sakurako's Box","url":"https://codeforces.com/contest/2008/problem/F","difficulty":1,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_678e","judge":"Codeforces","title":"Another Sith Tournament","url":"https://codeforces.com/contest/678/problem/E","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["bitmask_dp","probabilities_and_expected_values"],"solved":false},{"id":"codeforces_28c","judge":"Codeforces","title":"Bath Queue","url":"https://codeforces.com/problemset/problem/28/C","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_2020e","judge":"Codeforces","title":"Expected Power","url":"https://codeforces.com/contest/2020/problem/E","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"cf_gym_102861a","judge":"CF Gym","title":"Sticker Album","url":"https://codeforces.com/gym/102861/problem/A","difficulty":2,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"cses_1728","judge":"CSES","title":"Inversion Probability","url":"https://cses.fi/problemset/task/1728","difficulty":3,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codeforces_183d","judge":"Codeforces","title":"T-shirt","url":"https://codeforces.com/contest/183/problem/D","difficulty":3,"starred":false,"topic":"probabilities_and_expected_values","topics":["probabilities_and_expected_values"],"solved":false},{"id":"codechef_cuttree","judge":"CodeChef","title":"Chef Cuts Tree","url":"https://www.codechef.com/problems/CUTTREE","difficulty":1,"starred":true,"topic":"expected_value_powers_technique","topics":["expected_value_powers_technique"],"solved":false},{"id":"codeforces_1278f","judge":"Codeforces","title":"Cards","url":"https://codeforces.com/problemset/problem/1278/F","difficulty":2,"starred":true,"topic":"expected_value_powers_technique","topics":["expected_value_powers_technique"],"solved":false},{"id":"cf_gym_102012d","judge":"CF Gym","title":"Rikka with Subsequences","url":"https://codeforces.com/gym/102012/problem/D","difficulty":2,"starred":false,"topic":"expected_value_powers_technique","topics":["expected_value_powers_technique"],"solved":false},{"id":"lightoj_guna_guni","judge":"LightOJ","title":"Guna Guni","url":"https://lightoj.com/problem/guna-guni","difficulty":3,"starred":true,"topic":"expected_value_powers_technique","topics":["expected_value_powers_technique"],"solved":false},{"id":"codeforces_1025g","judge":"Codeforces","title":"Company Acquisitions","url":"https://codeforces.com/contest/1025/problem/G","difficulty":3,"starred":true,"topic":"the_slime_trick","topics":["martingale","the_slime_trick"],"solved":false},{"id":"baekjoon_19338","judge":"Baekjoon","title":"Flip a Coin","url":"https://www.acmicpc.net/problem/19338","difficulty":2,"starred":false,"topic":"expected_occurrence_time_as_substring","topics":["expected_occurrence_time_as_substring"],"solved":false},{"id":"timus_1677","judge":"Timus","title":"Monkey at the Keyboard","url":"https://acm.timus.ru/problem.aspx?space=1&num=1677","difficulty":2,"starred":true,"topic":"expected_occurrence_time_as_substring","topics":["expected_occurrence_time_as_substring"],"solved":false},{"id":"cf_gym_102832g","judge":"CF Gym","title":"Monkey's Keyboard","url":"https://codeforces.com/gym/102832/problem/G","difficulty":3,"starred":false,"topic":"expected_occurrence_time_as_substring","topics":["expected_occurrence_time_as_substring"],"solved":false},{"id":"topcoder_1849","judge":"TopCoder","title":"PointSystem","url":"https://community.topcoder.com/stat?c=problem_statement&pm=1849&rd=4675","difficulty":2,"starred":false,"topic":"gamblers_ruin","topics":["gamblers_ruin"],"solved":false},{"id":"topcoder_13643","judge":"TopCoder","title":"CatsOnTheCircle","url":"https://community.topcoder.com/stat?c=problem_statement&pm=13643&rd=16547","difficulty":2,"starred":false,"topic":"gamblers_ruin","topics":["gamblers_ruin"],"solved":false},{"id":"usaco_864","judge":"USACO","title":"Balance Beam","url":"https://usaco.org/index.php?page=viewproblem2&cpid=864","difficulty":3,"starred":false,"topic":"martingale","topics":["martingale"],"solved":false},{"id":"codeforces_1575f","judge":"Codeforces","title":"Finding Expected Value","url":"https://codeforces.com/contest/1575/problem/F","difficulty":3,"starred":false,"topic":"martingale","topics":["martingale"],"solved":false},{"id":"codeforces_850f","judge":"Codeforces","title":"Rainbow Balls","url":"https://codeforces.com/contest/850/problem/F","difficulty":4,"starred":false,"topic":"martingale","topics":["martingale"],"solved":false},{"id":"codeforces_1479e","judge":"Codeforces","title":"School Clubs","url":"https://codeforces.com/contest/1479/problem/E","difficulty":4,"starred":false,"topic":"martingale","topics":["martingale"],"solved":false},{"id":"codeforces_186d","judge":"Codeforces","title":"Mushroom Scientists","url":"https://codeforces.com/contest/186/problem/D","difficulty":1,"starred":false,"topic":"lagrange_multiplier","topics":["lagrange_multiplier"],"solved":false},{"id":"wcipeg_noi12p2","judge":"PEG","title":"Highway Cycling","url":"https://wcipeg.com/problem/noi12p2","difficulty":2,"starred":true,"topic":"lagrange_multiplier","topics":["lagrange_multiplier"],"solved":false},{"id":"hackerrank_samantha_and_portfolio_management","judge":"HackerRank","title":"Samantha and Portfolio Management","url":"https://www.hackerrank.com/contests/morgan-stanley-2016/challenges/samantha-and-portfolio-management","difficulty":2,"starred":false,"topic":"lagrange_multiplier","topics":["lagrange_multiplier"],"solved":false},{"id":"hackerrank_random_number_generator_1","judge":"HackerRank","title":"Random Number Generator","url":"https://www.hackerrank.com/contests/infinitum14/challenges/random-number-generator-1","difficulty":3,"starred":true,"topic":"lagrange_multiplier","topics":["lagrange_multiplier"],"solved":false},{"id":"codeforces_605c","judge":"Codeforces","title":"Freelancer's Dreams","url":"https://codeforces.com/problemset/problem/605/C","difficulty":2,"starred":true,"topic":"simplex_algorithm","topics":["simplex_algorithm","linear_combination_of_vectors","duality_in_linear_programming"],"solved":false},{"id":"spoj_seq1","judge":"SPOJ","title":"01 Sequence","url":"https://www.spoj.com/problems/SEQ1/","difficulty":2,"starred":false,"topic":"simplex_algorithm","topics":["simplex_algorithm"],"solved":false},{"id":"codeforces_375e","judge":"Codeforces","title":"Red and Black Tree","url":"https://codeforces.com/problemset/problem/375/E","difficulty":3,"starred":true,"topic":"simplex_algorithm","topics":["simplex_algorithm"],"solved":false},{"id":"codeforces_1696g","judge":"Codeforces","title":"Fishingprince Plays With Array Again","url":"https://codeforces.com/contest/1696/problem/G","difficulty":3,"starred":false,"topic":"duality_in_linear_programming","topics":["duality_in_linear_programming"],"solved":false},{"id":"wcipeg_noi08p3","judge":"PEG","title":"Hiring Employees","url":"https://wcipeg.com/problem/noi08p3","difficulty":3,"starred":false,"topic":"duality_in_linear_programming","topics":["duality_in_linear_programming"],"solved":false},{"id":"acmsguru_99999206","judge":"Codeforces","title":"Roads","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/206","difficulty":3,"starred":false,"topic":"duality_in_linear_programming","topics":["duality_in_linear_programming"],"solved":false},{"id":"atcoder_arc125_e","judge":"AtCoder","title":"Snack","url":"https://atcoder.jp/contests/arc125/tasks/arc125_e","difficulty":3,"starred":false,"topic":"duality_in_linear_programming","topics":["duality_in_linear_programming"],"solved":false},{"id":"cf_gym_102059m","judge":"CF Gym","title":"Utilitarianism","url":"https://codeforces.com/gym/102059/problem/M","difficulty":3,"starred":false,"topic":"duality_in_linear_programming","topics":["duality_in_linear_programming"],"solved":false},{"id":"codeforces_1430g","judge":"Codeforces","title":"Yet Another DAG Problem","url":"https://codeforces.com/problemset/problem/1430/G","difficulty":3,"starred":false,"topic":"duality_in_linear_programming","topics":["duality_in_linear_programming","dp_on_trees_and_dags"],"solved":false},{"id":"atcoder_abc224_h","judge":"AtCoder","title":"Security Camera 2","url":"https://atcoder.jp/contests/abc224/tasks/abc224_h","difficulty":4,"starred":false,"topic":"duality_in_linear_programming","topics":["duality_in_linear_programming"],"solved":false},{"id":"codeforces_305b","judge":"Codeforces","title":"Continued Fractions","url":"https://codeforces.com/problemset/problem/305/B","difficulty":1,"starred":false,"topic":"continued_fractions","topics":["continued_fractions"],"solved":false},{"id":"uva_1369","judge":"UVa","title":"The Roots","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=16&page=show_problem&problem=1369","difficulty":1,"starred":true,"topic":"polynomial_root_finding","topics":["polynomial_root_finding"],"solved":false},{"id":"codechef_evenpoly","judge":"CodeChef","title":"Even Coefficients","url":"https://www.codechef.com/DEC10/problems/EVENPOLY/","difficulty":2,"starred":true,"topic":"finite_field_arithmetic_binary","topics":["finite_field_arithmetic_binary"],"solved":false},{"id":"cses_1753","judge":"CSES","title":"String Matching","url":"https://cses.fi/problemset/task/1753","difficulty":1,"starred":true,"topic":"kmp","topics":["kmp","z_algorithm","string_hashing"],"solved":false},{"id":"cses_1732","judge":"CSES","title":"Finding Border","url":"https://cses.fi/problemset/task/1732","difficulty":1,"starred":true,"topic":"kmp","topics":["kmp","z_algorithm","string_hashing"],"solved":false},{"id":"cses_1733","judge":"CSES","title":"Finding Periods","url":"https://cses.fi/problemset/task/1733","difficulty":1,"starred":true,"topic":"kmp","topics":["kmp","z_algorithm","string_hashing"],"solved":false},{"id":"uva_396","judge":"UVa","title":"Periodic Strings","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=396","difficulty":1,"starred":true,"topic":"kmp","topics":["kmp","z_algorithm"],"solved":false},{"id":"uva_1963","judge":"UVa","title":"String Factoring","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1963","difficulty":1,"starred":true,"topic":"kmp","topics":["kmp","z_algorithm"],"solved":false},{"id":"uva_2447","judge":"UVa","title":"Dancing the Cheeky-Cheeky","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=2447","difficulty":1,"starred":false,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"uva_4282","judge":"UVa","title":"Caesar Cipher","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4282","difficulty":1,"starred":false,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"spoj_najpf","judge":"SPOJ","title":"Pattern Find","url":"https://www.spoj.com/problems/NAJPF/","difficulty":1,"starred":true,"topic":"kmp","topics":["kmp","z_algorithm","string_hashing"],"solved":false},{"id":"spoj_nhay","judge":"SPOJ","title":"A Needle in the Haystack","url":"https://www.spoj.com/problems/NHAY/","difficulty":1,"starred":false,"topic":"kmp","topics":["kmp","z_algorithm","string_hashing"],"solved":false},{"id":"uva_3911","judge":"UVa","title":"Secret Word","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3911","difficulty":1,"starred":false,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"codeforces_471d","judge":"Codeforces","title":"MUH and Cube Walls","url":"https://codeforces.com/problemset/problem/471/D","difficulty":1,"starred":true,"topic":"kmp","topics":["kmp","z_algorithm","string_hashing"],"solved":false},{"id":"codeforces_625b","judge":"Codeforces","title":"War of the Corporations","url":"https://codeforces.com/contest/625/problem/B","difficulty":1,"starred":false,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"cses_2107","judge":"CSES","title":"String Functions","url":"https://cses.fi/problemset/task/2107","difficulty":1,"starred":false,"topic":"kmp","topics":["kmp","z_algorithm"],"solved":false},{"id":"codeforces_432d","judge":"Codeforces","title":"Prefixes and Suffixes","url":"https://codeforces.com/problemset/problem/432/D","difficulty":2,"starred":false,"topic":"kmp","topics":["kmp","z_algorithm"],"solved":false},{"id":"spoj_epalin","judge":"SPOJ","title":"Extend to Palindrome","url":"https://www.spoj.com/problems/EPALIN/","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp","z_algorithm","string_hashing"],"solved":false},{"id":"uva_1239","judge":"UVa","title":"Power Strings","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1239","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp","string_hashing"],"solved":false},{"id":"spoj_period","judge":"SPOJ","title":"Period","url":"https://www.spoj.com/problems/PERIOD/","difficulty":2,"starred":false,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"codeforces_808g","judge":"Codeforces","title":"Anthem of Berland","url":"https://codeforces.com/contest/808/problem/G","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp","substring_dp"],"solved":false},{"id":"cses_1112","judge":"CSES","title":"Required Substring","url":"https://cses.fi/problemset/task/1112","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp","substring_dp"],"solved":false},{"id":"codeforces_346b","judge":"Codeforces","title":"Lucky Common Subsequence","url":"https://codeforces.com/problemset/problem/346/B","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp","substring_dp"],"solved":false},{"id":"uva_1960","judge":"UVa","title":"Matrix Matcher","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1960","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp","2d_string_hashing"],"solved":false},{"id":"codeforces_126b","judge":"Codeforces","title":"Password","url":"https://codeforces.com/problemset/problem/126/B","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp","string_hashing","z_algorithm"],"solved":false},{"id":"codeforces_535d","judge":"Codeforces","title":"Tavas and Malekas","url":"https://codeforces.com/problemset/problem/535/D","difficulty":2,"starred":false,"topic":"kmp","topics":["kmp","z_algorithm"],"solved":false},{"id":"codeforces_494b","judge":"Codeforces","title":"Obsessive String","url":"https://codeforces.com/contest/494/problem/B","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"codeforces_631d","judge":"Codeforces","title":"Messenger","url":"https://codeforces.com/problemset/problem/631/D","difficulty":2,"starred":false,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"codeforces_119d","judge":"Codeforces","title":"String Transformation","url":"https://codeforces.com/problemset/problem/119/D","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp","z_algorithm","string_hashing"],"solved":false},{"id":"spoj_vpalin","judge":"SPOJ","title":"Finding Palindromes","url":"https://www.spoj.com/problems/VPALIN/","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"codeforces_1015f","judge":"Codeforces","title":"Bracket Substring","url":"https://codeforces.com/problemset/problem/1015/F","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp","substring_dp","balanced_brackets"],"solved":false},{"id":"spoj_cpattern","judge":"SPOJ","title":"Cow Patterns","url":"https://www.spoj.com/problems/CPATTERN/","difficulty":2,"starred":false,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"codeforces_291e","judge":"Codeforces","title":"Tree-String Problem","url":"https://codeforces.com/contest/291/problem/E","difficulty":2,"starred":true,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"codeforces_2010c2","judge":"Codeforces","title":"Message Transmission Error (hard version)","url":"https://codeforces.com/contest/2010/problem/C2","difficulty":1,"starred":false,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"cf_gym_100212c","judge":"CF Gym","title":"Order-Preserving Codes","url":"https://codeforces.com/gym/100212/problem/C","difficulty":1,"starred":false,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"codeforces_825f","judge":"Codeforces","title":"String Compression","url":"https://codeforces.com/contest/825/problem/F","difficulty":2,"starred":false,"topic":"kmp","topics":["string_hashing","kmp"],"solved":false},{"id":"codeforces_25e","judge":"Codeforces","title":"Test","url":"https://codeforces.com/problemset/problem/25/E","difficulty":2,"starred":false,"topic":"kmp","topics":["string_hashing","kmp"],"solved":false},{"id":"hdu_7084","judge":"HDU","title":"Pty loves string","url":"https://vjudge.net/problem/HDU-7084","difficulty":3,"starred":true,"topic":"kmp","topics":["kmp"],"solved":false},{"id":"yosupo_zalgorithm","judge":"Library Checker","title":"Z Algorithm","url":"https://judge.yosupo.jp/problem/zalgorithm","difficulty":1,"starred":true,"topic":"z_algorithm","topics":["z_algorithm"],"solved":false},{"id":"spoj_querystr","judge":"SPOJ","title":"Query Problem","url":"https://www.spoj.com/problems/QUERYSTR/","difficulty":1,"starred":false,"topic":"z_algorithm","topics":["z_algorithm"],"solved":false},{"id":"codeforces_1968g2","judge":"Codeforces","title":"Division + LCP (hard version)","url":"https://codeforces.com/problemset/problem/1968/G2","difficulty":2,"starred":true,"topic":"z_algorithm","topics":["z_algorithm","sqrt_n_sequence_recovery"],"solved":false},{"id":"cf_gym_104385g","judge":"CF Gym","title":"Copy and Paste","url":"https://codeforces.com/gym/104385/problem/G","difficulty":3,"starred":true,"topic":"z_algorithm","topics":["z_algorithm"],"solved":false},{"id":"codeforces_963d","judge":"Codeforces","title":"Frequency of String","url":"https://codeforces.com/problemset/problem/963/D","difficulty":2,"starred":true,"topic":"string_matching_using_bitsets","topics":["string_matching_using_bitsets","suffix_array","aho_corasick"],"solved":false},{"id":"toph_inter_university_sust_cse_carnival_2024","judge":"Toph","title":"Another Repeated String Problem","url":"https://toph.co/c/inter-university-sust-cse-carnival-2024","difficulty":2,"starred":true,"topic":"string_matching_with_fft","topics":["string_matching_with_fft"],"solved":false},{"id":"yosupo_wildcard_pattern_matching","judge":"Library Checker","title":"Wildcard Pattern Matching","url":"https://judge.yosupo.jp/problem/wildcard_pattern_matching","difficulty":2,"starred":true,"topic":"string_matching_with_fft","topics":["string_matching_with_fft"],"solved":false},{"id":"codeforces_1975g","judge":"Codeforces","title":"Zimpha Fan Club","url":"https://codeforces.com/contest/1975/problem/G","difficulty":3,"starred":true,"topic":"string_matching_with_fft","topics":["string_matching_with_fft"],"solved":false},{"id":"kattis_hashing","judge":"Kattis","title":"String Hashing","url":"https://open.kattis.com/problems/hashing","difficulty":1,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"cses_1110","judge":"CSES","title":"Minimal Rotation","url":"https://cses.fi/problemset/task/1110","difficulty":1,"starred":true,"topic":"string_hashing","topics":["string_hashing","lyndon_factorization"],"solved":false},{"id":"cses_1111","judge":"CSES","title":"Longest Palindrome","url":"https://cses.fi/problemset/task/1111","difficulty":1,"starred":true,"topic":"string_hashing","topics":["string_hashing","palindromic_tree","manachers_algorithm"],"solved":false},{"id":"yosupo_enumerate_palindromes","judge":"Library Checker","title":"Enumerate Palindromes","url":"https://judge.yosupo.jp/problem/enumerate_palindromes","difficulty":1,"starred":true,"topic":"string_hashing","topics":["manachers_algorithm","string_hashing"],"solved":false},{"id":"yosupo_longest_common_substring","judge":"Library Checker","title":"Longest Common Substring","url":"https://judge.yosupo.jp/problem/longest_common_substring","difficulty":1,"starred":true,"topic":"string_hashing","topics":["suffix_array","suffix_automaton","string_hashing"],"solved":false},{"id":"spoj_adaclean","judge":"SPOJ","title":"Ada and Spring Cleaning","url":"https://www.spoj.com/problems/ADACLEAN/","difficulty":1,"starred":true,"topic":"string_hashing","topics":["string_hashing","suffix_array"],"solved":false},{"id":"toph_unique_substrings_query","judge":"Toph","title":"Unique Substrings Query","url":"https://toph.co/p/unique-substrings-query","difficulty":2,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"cses_2420","judge":"CSES","title":"Palindrome Queries","url":"https://cses.fi/problemset/task/2420","difficulty":2,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"codeforces_154c","judge":"Codeforces","title":"Double Profiles","url":"https://codeforces.com/problemset/problem/154/C","difficulty":2,"starred":false,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"codechef_insq15_a","judge":"CodeChef","title":"The Gift Of Raksha Bandhan","url":"https://www.codechef.com/problems/INSQ15_A","difficulty":2,"starred":false,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"uva_3163","judge":"UVa","title":"Detection of Extraterrestrial","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=3163","difficulty":2,"starred":false,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"codeforces_727e","judge":"Codeforces","title":"Games on a CD","url":"https://codeforces.com/contest/727/problem/E","difficulty":2,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"uva_2955","judge":"UVa","title":"Buzzwords","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2955","difficulty":2,"starred":false,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"codeforces_835d","judge":"Codeforces","title":"Palindromic characteristics","url":"https://codeforces.com/contest/835/problem/D","difficulty":2,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"hackerrank_gift_boxes","judge":"HackerRank","title":"Gift Boxes","url":"https://www.hackerrank.com/contests/womens-codesprint-5/challenges/gift-boxes/problem","difficulty":2,"starred":false,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"codeforces_19c","judge":"Codeforces","title":"Deletion of Repeats","url":"https://codeforces.com/contest/19/problem/C","difficulty":2,"starred":false,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"codeforces_7d","judge":"Codeforces","title":"Palindrome Degree","url":"https://codeforces.com/contest/7/problem/D","difficulty":2,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"hackerrank_jitu_and_strings","judge":"HackerRank","title":"Jitu and Strings","url":"https://www.hackerrank.com/contests/ab-yeh-kar-ke-dikhao/challenges/jitu-and-strings/problem","difficulty":2,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"acmp_829","judge":"ACMP","title":"Strings - 3","url":"https://acmp.ru/index.asp?main=task&id_task=829&locale=en","difficulty":2,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"dmoj_ccc20s3","judge":"DMOJ","title":"Searching for Strings","url":"https://dmoj.ca/problem/ccc20s3","difficulty":2,"starred":true,"topic":"string_hashing","topics":["string_hashing","multiset_hashing"],"solved":false},{"id":"codeforces_1056e","judge":"Codeforces","title":"Check Transcription","url":"https://codeforces.com/problemset/problem/1056/E","difficulty":2,"starred":false,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"cf_gym_104048k","judge":"CF Gym","title":"Fullmetal Alchemist II","url":"https://codeforces.com/gym/104048/problem/K","difficulty":2,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"codeforces_1943b","judge":"Codeforces","title":"Non-Palindromic Substring","url":"https://codeforces.com/contest/1943/problem/B","difficulty":1,"starred":true,"topic":"string_hashing","topics":["manachers_algorithm","string_hashing"],"solved":false},{"id":"ceoi17_palindromic","judge":"oj.uz","title":"Palindromic Partitions","url":"https://oj.uz/problem/view/CEOI17_palindromic","difficulty":1,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"atcoder_abc339_f","judge":"AtCoder","title":"Product Equality","url":"https://atcoder.jp/contests/abc339/tasks/abc339_f","difficulty":1,"starred":true,"topic":"string_hashing","topics":["string_hashing"],"solved":false},{"id":"cf_gym_105446g","judge":"CF Gym","title":"Grid search","url":"https://codeforces.com/gym/105446/problem/G","difficulty":1,"starred":true,"topic":"2d_string_hashing","topics":["2d_string_hashing"],"solved":false},{"id":"codeforces_1418g","judge":"Codeforces","title":"Three Occurrences","url":"https://codeforces.com/problemset/problem/1418/G","difficulty":2,"starred":true,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"codeforces_1175f","judge":"Codeforces","title":"The Number of Subpermutations","url":"https://codeforces.com/problemset/problem/1175/F","difficulty":2,"starred":true,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"toph_ep_palindromes","judge":"Toph","title":"EP-Palindromes","url":"https://toph.co/p/ep-palindromes","difficulty":2,"starred":false,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"atcoder_abc250_e","judge":"AtCoder","title":"Prefix Equality","url":"https://atcoder.jp/contests/abc250/tasks/abc250_e","difficulty":2,"starred":true,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"codeforces_1914g2","judge":"Codeforces","title":"G2. Light Bulbs (Hard Version)","url":"https://codeforces.com/contest/1914/problem/G2","difficulty":2,"starred":false,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"codeforces_1830c","judge":"Codeforces","title":"Hyperregular Bracket Strings","url":"https://codeforces.com/problemset/problem/1830/C","difficulty":3,"starred":true,"topic":"xor_hashing","topics":["balanced_brackets","xor_hashing"],"solved":false},{"id":"hackerrank_number_game_on_a_tree","judge":"HackerRank","title":"Number Game on a Tree","url":"https://www.hackerrank.com/contests/hourrank-17/challenges/number-game-on-a-tree/problem","difficulty":3,"starred":true,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"codeforces_1622f","judge":"Codeforces","title":"Quadratic Set","url":"https://codeforces.com/contest/1622/problem/F","difficulty":3,"starred":false,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"codeforces_1746f","judge":"Codeforces","title":"Kazaee","url":"https://codeforces.com/contest/1746/problem/F","difficulty":3,"starred":true,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"toph_is_it_a_square","judge":"Toph","title":"Is It A Square?","url":"https://toph.co/p/is-it-a-square","difficulty":2,"starred":true,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"codeforces_1977d","judge":"Codeforces","title":"XORificator","url":"https://codeforces.com/contest/1977/problem/D","difficulty":2,"starred":true,"topic":"xor_hashing","topics":["xor_hashing"],"solved":false},{"id":"atcoder_abc367_f","judge":"AtCoder","title":"Rearrange Query","url":"https://atcoder.jp/contests/abc367/tasks/abc367_f","difficulty":1,"starred":true,"topic":"multiset_hashing","topics":["multiset_hashing"],"solved":false},{"id":"cses_2102","judge":"CSES","title":"Finding Patterns","url":"https://cses.fi/problemset/task/2102","difficulty":1,"starred":true,"topic":"aho_corasick","topics":["aho_corasick","suffix_automaton"],"solved":false},{"id":"cses_2103","judge":"CSES","title":"Counting Patterns","url":"https://cses.fi/problemset/task/2103","difficulty":1,"starred":true,"topic":"aho_corasick","topics":["aho_corasick","suffix_array","suffix_automaton"],"solved":false},{"id":"lightoj_substring_frequency_ii","judge":"LightOJ","title":"Substring Frequency (II)","url":"https://lightoj.com/problem/substring-frequency-ii","difficulty":1,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"kattis_stringmultimatching","judge":"Kattis","title":"String Multimatching","url":"https://open.kattis.com/problems/stringmultimatching","difficulty":1,"starred":true,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"uva_2637","judge":"UVa","title":"Prefix Lookup","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2637","difficulty":1,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"uva_2112","judge":"UVa","title":"SMS","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2112","difficulty":1,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"uva_1620","judge":"UVa","title":"I Love Strings!!","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1620","difficulty":1,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"timus_1269","judge":"Timus","title":"Obscene Words Filter","url":"https://acm.timus.ru/problem.aspx?space=1&num=1269","difficulty":1,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"timus_1158","judge":"Timus","title":"Censored!","url":"https://acm.timus.ru/problem.aspx?space=1&num=1158","difficulty":1,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"codeforces_163e","judge":"Codeforces","title":"e-Government","url":"https://codeforces.com/contest/163/problem/E","difficulty":2,"starred":true,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"cf_gym_101174e","judge":"CF Gym","title":"Passwords","url":"https://codeforces.com/gym/101174/problem/E","difficulty":2,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"codeforces_1400f","judge":"Codeforces","title":"x-prime Substrings","url":"https://codeforces.com/problemset/problem/1400/F","difficulty":2,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"codechef_twostrs","judge":"CodeChef","title":"Buying a New String","url":"https://www.codechef.com/MAY20A/problems/TWOSTRS","difficulty":2,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"codeforces_2144f","judge":"Codeforces","title":"Bracket Groups","url":"https://codeforces.com/contest/2144/problem/F","difficulty":2,"starred":true,"topic":"aho_corasick","topics":["aho_corasick","balanced_brackets"],"solved":false},{"id":"codeforces_1801g","judge":"Codeforces","title":"A task for substrings","url":"https://codeforces.com/contest/1801/problem/G","difficulty":3,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"codeforces_1207g","judge":"Codeforces","title":"Indie Album","url":"https://codeforces.com/contest/1207/problem/G","difficulty":3,"starred":false,"topic":"aho_corasick","topics":["aho_corasick"],"solved":false},{"id":"yosupo_suffixarray","judge":"Library Checker","title":"Suffix Array","url":"https://judge.yosupo.jp/problem/suffixarray","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"cf_edu_269119a","judge":"Codeforces","title":"Suffix Array and LCP","url":"https://codeforces.com/edu/course/2/lesson/2/4/practice/contest/269119/problem/A","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"cf_edu_269118a","judge":"Codeforces","title":"Substring Search","url":"https://codeforces.com/edu/course/2/lesson/2/3/practice/contest/269118/problem/A","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"cses_2105","judge":"CSES","title":"Distinct Substrings","url":"https://cses.fi/problemset/task/2105","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"cses_2106","judge":"CSES","title":"Repeating Substring","url":"https://cses.fi/problemset/task/2106","difficulty":1,"starred":true,"topic":"suffix_array","topics":["main_lorentz_algorithm","suffix_array"],"solved":false},{"id":"cf_edu_269656c","judge":"Codeforces","title":"Sorting Substrings","url":"https://codeforces.com/edu/course/2/lesson/2/5/practice/contest/269656/problem/C","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"cses_2108","judge":"CSES","title":"Substring Order I","url":"https://cses.fi/problemset/task/2108","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"cses_2109","judge":"CSES","title":"Substring Order II","url":"https://cses.fi/problemset/task/2109","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"spoj_sublex","judge":"SPOJ","title":"Lexicographical Substring Search","url":"https://www.spoj.com/problems/SUBLEX/","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"cses_2110","judge":"CSES","title":"Substring Distribution","url":"https://cses.fi/problemset/task/2110","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"yosupo_number_of_substrings","judge":"Library Checker","title":"Number of Substrings","url":"https://judge.yosupo.jp/problem/number_of_substrings","difficulty":1,"starred":false,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"spoj_lcs2","judge":"SPOJ","title":"Longest Common Substring II","url":"https://www.spoj.com/problems/LCS2/","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"cses_2104","judge":"CSES","title":"Pattern Positions","url":"https://cses.fi/problemset/task/2104","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_automaton","suffix_array"],"solved":false},{"id":"uva_3664","judge":"UVa","title":"Editor","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=3664","difficulty":1,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codechef_anusar","judge":"CodeChef","title":"Substrings and Repetitions","url":"https://www.codechef.com/problems/ANUSAR","difficulty":1,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"spoj_adaphoto","judge":"SPOJ","title":"Ada and Terramorphing","url":"https://www.spoj.com/problems/ADAPHOTO/","difficulty":1,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codechef_insq16f","judge":"CodeChef","title":"JARVIS and LCP","url":"https://www.codechef.com/problems/INSQ16F","difficulty":1,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"uva_3668","judge":"UVa","title":"The longest constant gene","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=3668","difficulty":1,"starred":false,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"codeforces_149e","judge":"Codeforces","title":"Martian Strings","url":"https://codeforces.com/problemset/problem/149/E","difficulty":1,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"cf_gym_105973h","judge":"CF Gym","title":"Substring Symphony","url":"https://codeforces.com/gym/105973/problem/H","difficulty":2,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codeforces_822e","judge":"Codeforces","title":"Liar","url":"https://codeforces.com/contest/822/problem/E","difficulty":2,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codechef_tangled","judge":"CodeChef","title":"Entangled Strings","url":"https://www.codechef.com/problems/TANGLED","difficulty":2,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"uva_3695","judge":"UVa","title":"Top 10","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3695","difficulty":2,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"uva_3343","judge":"UVa","title":"File Recover","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3343","difficulty":2,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"uva_3358","judge":"UVa","title":"Stammering Aliens","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=3358","difficulty":2,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codeforces_873f","judge":"Codeforces","title":"Forbidden Indices","url":"https://codeforces.com/contest/873/problem/F","difficulty":2,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"codeforces_802g3","judge":"Codeforces","title":"Fake News (hard)","url":"https://codeforces.com/problemset/problem/802/G3","difficulty":2,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"cf_edu_269656d","judge":"Codeforces","title":"Borders","url":"https://codeforces.com/edu/course/2/lesson/2/5/practice/contest/269656/problem/D","difficulty":2,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"cf_edu_269656e","judge":"Codeforces","title":"Refrain","url":"https://codeforces.com/edu/course/2/lesson/2/5/practice/contest/269656/problem/E","difficulty":2,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"cf_edu_269656f","judge":"Codeforces","title":"Periodic Substring","url":"https://codeforces.com/edu/course/2/lesson/2/5/practice/contest/269656/problem/F","difficulty":2,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codeforces_1090j","judge":"Codeforces","title":"Two Prefixes","url":"https://codeforces.com/contest/1090/problem/J","difficulty":2,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"usaco_768","judge":"USACO","title":"Standing Out from the Herd","url":"https://usaco.org/index.php?page=viewproblem2&cpid=768","difficulty":2,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"atcoder_abc213_f","judge":"AtCoder","title":"Common Prefixes","url":"https://atcoder.jp/contests/abc213/tasks/abc213_f","difficulty":2,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"hdu_5030","judge":"HDU","title":"Rabbit's String","url":"https://vjudge.net/problem/HDU-5030","difficulty":3,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codeforces_653f","judge":"Codeforces","title":"Paper task","url":"https://codeforces.com/problemset/problem/653/F","difficulty":3,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codechef_tandem","judge":"CodeChef","title":"Tandem","url":"https://www.codechef.com/problems/TANDEM","difficulty":3,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codeforces_30e","judge":"Codeforces","title":"Tricky and Clever Password","url":"https://codeforces.com/contest/30/problem/E","difficulty":3,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"codeforces_204e","judge":"Codeforces","title":"Little Elephant and Strings","url":"https://codeforces.com/problemset/problem/204/E","difficulty":3,"starred":true,"topic":"suffix_array","topics":["suffix_array","suffix_automaton"],"solved":false},{"id":"codeforces_504e","judge":"Codeforces","title":"Misha and LCP on Tree","url":"https://codeforces.com/contest/504/problem/E","difficulty":3,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"dmoj_coci14c5p6","judge":"DMOJ","title":"Divljak","url":"https://dmoj.ca/problem/coci14c5p6","difficulty":4,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"cses_3225","judge":"CSES","title":"Inverse Suffix Array","url":"https://cses.fi/problemset/task/3225","difficulty":3,"starred":true,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"cf_group_479250k","judge":"Codeforces","title":"K-th similar password","url":"https://codeforces.com/group/Rilx5irOux/contest/479250/problem/K","difficulty":3,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"toph_the_story_of_stringland","judge":"Toph","title":"The Story of Stringland","url":"https://toph.co/p/the-story-of-stringland","difficulty":3,"starred":false,"topic":"suffix_array","topics":["suffix_array"],"solved":false},{"id":"hackerrank_similar_strings","judge":"HackerRank","title":"Similar Strings","url":"https://www.hackerrank.com/challenges/similar-strings/problem","difficulty":2,"starred":true,"topic":"isomorphic_suffix_array","topics":["isomorphic_suffix_array"],"solved":false},{"id":"cf_gym_103185m","judge":"CF Gym","title":"May I Add a Letter?","url":"https://codeforces.com/gym/103185/problem/M","difficulty":2,"starred":true,"topic":"dynamic_suffix_array","topics":["dynamic_suffix_array"],"solved":false},{"id":"codeforces_235c","judge":"Codeforces","title":"Cyclical Quest","url":"https://codeforces.com/problemset/problem/235/C","difficulty":2,"starred":true,"topic":"suffix_automaton","topics":["suffix_automaton"],"solved":false},{"id":"codeforces_1780g","judge":"Codeforces","title":"Delicious Dessert","url":"https://codeforces.com/contest/1780/problem/G","difficulty":1,"starred":true,"topic":"suffix_automaton","topics":["suffix_automaton"],"solved":false},{"id":"codechef_prdraw","judge":"CodeChef","title":"Drawing","url":"https://www.codechef.com/problems/PRDRAW","difficulty":2,"starred":true,"topic":"suffix_automaton","topics":["suffix_automaton"],"solved":false},{"id":"codechef_gerald3","judge":"CodeChef","title":"Chef and Substrings","url":"https://www.codechef.com/problems/GERALD3","difficulty":2,"starred":false,"topic":"suffix_automaton_ft_distinct_substring_queries_in_range","topics":["suffix_automaton_ft_distinct_substring_queries_in_range"],"solved":false},{"id":"hackerrank_how_many_substrings","judge":"HackerRank","title":"How Many Substrings?","url":"https://www.hackerrank.com/challenges/how-many-substrings/problem","difficulty":2,"starred":true,"topic":"suffix_automaton_ft_distinct_substring_queries_in_range","topics":["suffix_automaton_ft_distinct_substring_queries_in_range"],"solved":false},{"id":"codechef_tmp01","judge":"CodeChef","title":"To Queue or not to Queue","url":"https://www.codechef.com/problems/TMP01","difficulty":2,"starred":true,"topic":"suffix_automaton_ft_distinct_substring_queries_in_range","topics":["suffix_automaton_ft_distinct_substring_queries_in_range"],"solved":false},{"id":"cf_gym_102129i","judge":"CF Gym","title":"Incomparable Pairs","url":"https://codeforces.com/gym/102129/problem/I","difficulty":3,"starred":true,"topic":"suffix_automaton_ft_distinct_substring_queries_in_range","topics":["suffix_automaton_ft_distinct_substring_queries_in_range"],"solved":false},{"id":"codechef_est","judge":"CodeChef","title":"Equivalent Suffix Tries","url":"https://www.codechef.com/JULY12/problems/EST","difficulty":2,"starred":false,"topic":"suffix_tree","topics":["suffix_tree"],"solved":false},{"id":"spoj_lcs","judge":"SPOJ","title":"Longest Common Substring","url":"https://www.spoj.com/problems/LCS/","difficulty":2,"starred":true,"topic":"suffix_tree","topics":["suffix_tree"],"solved":false},{"id":"yosupo_eertree","judge":"Library Checker","title":"Eertree","url":"https://judge.yosupo.jp/problem/eertree","difficulty":1,"starred":true,"topic":"palindromic_tree","topics":["palindromic_tree"],"solved":false},{"id":"hdu_3948","judge":"HDU","title":"The Number of Palindromes","url":"http://acm.hdu.edu.cn/showproblem.php?pid=3948","difficulty":1,"starred":true,"topic":"palindromic_tree","topics":["palindromic_tree","manachers_algorithm"],"solved":false},{"id":"ural_1960","judge":"Timus","title":"Palindromes and Super Abilities","url":"https://vjudge.net/problem/URAL-1960","difficulty":1,"starred":true,"topic":"palindromic_tree","topics":["palindromic_tree"],"solved":false},{"id":"ural_2040","judge":"Timus","title":"Palindromes and Super Abilities 2","url":"https://vjudge.net/problem/URAL-2040","difficulty":1,"starred":true,"topic":"palindromic_tree","topics":["palindromic_tree"],"solved":false},{"id":"codeforces_17e","judge":"Codeforces","title":"Palisection","url":"https://codeforces.com/contest/17/problem/E","difficulty":2,"starred":false,"topic":"palindromic_tree","topics":["palindromic_tree"],"solved":false},{"id":"cf_gym_100543g","judge":"CF Gym","title":"Virus synthesis","url":"https://codeforces.com/gym/100543/problem/G","difficulty":2,"starred":true,"topic":"palindromic_tree","topics":["palindromic_tree"],"solved":false},{"id":"cf_gym_100548g","judge":"CF Gym","title":"The Problem to Slow Down You","url":"https://codeforces.com/gym/100548/problem/G","difficulty":2,"starred":true,"topic":"palindromic_tree","topics":["palindromic_tree"],"solved":false},{"id":"ural_2058","judge":"Timus","title":"100500 palidnromes","url":"https://vjudge.net/problem/URAL-2058","difficulty":1,"starred":true,"topic":"palindromic_tree","topics":["palindromic_tree","minimum_palindrome_factorization"],"solved":false},{"id":"cf_gym_102141f","judge":"CF Gym","title":"Palindromadness","url":"https://codeforces.com/gym/102141/problem/F","difficulty":3,"starred":true,"topic":"palindromic_tree","topics":["palindromic_tree"],"solved":false},{"id":"codechef_binpalin","judge":"CodeChef","title":"Binary Palindrome","url":"https://www.codechef.com/problems/BINPALIN","difficulty":1,"starred":true,"topic":"persistent_palindromic_tree","topics":["persistent_palindromic_tree"],"solved":false},{"id":"cf_gym_101806q","judge":"CF Gym","title":"QueryreuQ","url":"https://codeforces.com/gym/101806/problem/Q","difficulty":1,"starred":true,"topic":"persistent_palindromic_tree","topics":["manachers_algorithm","persistent_palindromic_tree"],"solved":false},{"id":"yosupo_palindromes_in_deque","judge":"Library Checker","title":"Palindromes in Deque","url":"https://judge.yosupo.jp/problem/palindromes_in_deque","difficulty":3,"starred":true,"topic":"persistent_palindromic_tree","topics":["persistent_palindromic_tree"],"solved":false},{"id":"dmoj_mmcc15p3","judge":"DMOJ","title":"Momoka","url":"https://dmoj.ca/problem/mmcc15p3","difficulty":2,"starred":true,"topic":"persistent_palindromic_tree","topics":["persistent_palindromic_tree"],"solved":false},{"id":"uva_2470","judge":"UVa","title":"Extend to Palindrome","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=26&page=show_problem&problem=2470","difficulty":1,"starred":true,"topic":"manachers_algorithm","topics":["manachers_algorithm"],"solved":false},{"id":"codeforces_1326d2","judge":"Codeforces","title":"Prefix-Suffix Palindrome (Hard version)","url":"https://codeforces.com/contest/1326/problem/D2","difficulty":1,"starred":false,"topic":"manachers_algorithm","topics":["manachers_algorithm"],"solved":false},{"id":"kattis_palindromes","judge":"Kattis","title":"Palindromes","url":"https://open.kattis.com/problems/palindromes","difficulty":2,"starred":true,"topic":"manachers_algorithm","topics":["number_of_palindromes_in_range","manachers_algorithm"],"solved":false},{"id":"codeforces_906e","judge":"Codeforces","title":"Reverses","url":"https://codeforces.com/problemset/problem/906/E","difficulty":2,"starred":true,"topic":"minimum_palindrome_factorization","topics":["minimum_palindrome_factorization"],"solved":false},{"id":"codeforces_245h","judge":"Codeforces","title":"Queries for Number of Palindromes","url":"https://codeforces.com/contest/245/problem/H","difficulty":2,"starred":true,"topic":"number_of_palindromes_in_range","topics":["number_of_palindromes_in_range","mcm"],"solved":false},{"id":"atcoder_dp_f","judge":"AtCoder","title":"LCS","url":"https://atcoder.jp/contests/dp/tasks/dp_f","difficulty":1,"starred":true,"topic":"lcs","topics":["knapsack","lcs"],"solved":true},{"id":"leetcode_longest_common_subsequence","judge":"LeetCode","title":"Longest Common Subsequence","url":"https://leetcode.com/problems/longest-common-subsequence/","difficulty":1,"starred":true,"topic":"lcs","topics":["lcs"],"solved":true},{"id":"codeforces_2050e","judge":"Codeforces","title":"Three Strings","url":"https://codeforces.com/contest/2050/problem/E","difficulty":1,"starred":false,"topic":"lcs","topics":["lcs"],"solved":false},{"id":"codeforces_463d","judge":"Codeforces","title":"Gargari and Permutations","url":"https://codeforces.com/problemset/problem/463/D","difficulty":2,"starred":true,"topic":"lcs","topics":["lcs"],"solved":false},{"id":"cf_gym_104349d","judge":"CF Gym","title":"Yet another permutation problem","url":"https://codeforces.com/gym/104349/problem/D","difficulty":2,"starred":true,"topic":"lcs","topics":["lcs"],"solved":false},{"id":"baekjoon_25954","judge":"Baekjoon","title":"LCS 9","url":"https://www.acmicpc.net/problem/25954","difficulty":1,"starred":false,"topic":"all_substring_longest_common_subsequence","topics":["all_substring_longest_common_subsequence"],"solved":false},{"id":"izho13_rowords","judge":"oj.uz","title":"Round words","url":"https://oj.uz/problem/view/IZhO13_rowords","difficulty":1,"starred":false,"topic":"all_substring_longest_common_subsequence","topics":["all_substring_longest_common_subsequence"],"solved":false},{"id":"cf_gym_101237g","judge":"CF Gym","title":"Total LCS","url":"https://codeforces.com/gym/101237/problem/G","difficulty":1,"starred":true,"topic":"all_substring_longest_common_subsequence","topics":["all_substring_longest_common_subsequence"],"solved":false},{"id":"yosupo_prefix_substring_lcs","judge":"Library Checker","title":"Prefix-Substring LCS","url":"https://judge.yosupo.jp/problem/prefix_substring_lcs","difficulty":2,"starred":true,"topic":"all_substring_longest_common_subsequence","topics":["all_substring_longest_common_subsequence"],"solved":false},{"id":"cf_gym_103652f","judge":"CF Gym","title":"Square Subsequences","url":"https://codeforces.com/gym/103652/problem/F","difficulty":2,"starred":true,"topic":"all_substring_longest_common_subsequence","topics":["all_substring_longest_common_subsequence"],"solved":false},{"id":"spoj_lcs0","judge":"SPOJ","title":"Longest Common Subsequence","url":"https://www.spoj.com/problems/LCS0/","difficulty":1,"starred":true,"topic":"bit_lcs","topics":["bit_lcs"],"solved":false},{"id":"codeforces_1726c","judge":"Codeforces","title":"Jatayu's Balanced Bracket Sequence","url":"https://codeforces.com/problemset/problem/1726/C","difficulty":1,"starred":false,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"codeforces_1023c","judge":"Codeforces","title":"Bracket Subsequence","url":"https://codeforces.com/problemset/problem/1023/C","difficulty":1,"starred":true,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"codeforces_1153c","judge":"Codeforces","title":"Serval and Parenthesis Sequence","url":"https://codeforces.com/contest/1153/problem/C","difficulty":1,"starred":false,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"kattis_piecesofparentheses","judge":"Kattis","title":"Pieces of Parentheses","url":"https://open.kattis.com/problems/piecesofparentheses","difficulty":2,"starred":true,"topic":"balanced_brackets","topics":["balanced_brackets","exchange_arguments"],"solved":false},{"id":"codeforces_670e","judge":"Codeforces","title":"Correct Bracket Sequence Editor","url":"https://codeforces.com/problemset/problem/670/E","difficulty":2,"starred":true,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"codeforces_223a","judge":"Codeforces","title":"Bracket Sequence","url":"https://codeforces.com/problemset/problem/223/A","difficulty":1,"starred":false,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"cf_gym_101341a","judge":"CF Gym","title":"Streets of Working Lanterns - 2","url":"https://codeforces.com/gym/101341/problem/A","difficulty":2,"starred":true,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"atcoder_abc223_f","judge":"AtCoder","title":"Parenthesis Checking","url":"https://atcoder.jp/contests/abc223/tasks/abc223_f","difficulty":2,"starred":true,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"codeforces_612c","judge":"Codeforces","title":"Replace To Make Regular Bracket Sequence","url":"https://codeforces.com/problemset/problem/612/C","difficulty":1,"starred":false,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"codeforces_1976d","judge":"Codeforces","title":"Invertible Bracket Sequences","url":"https://codeforces.com/contest/1976/problem/D","difficulty":2,"starred":false,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"atcoder_abc407_e","judge":"AtCoder","title":"Most Valuable Parentheses","url":"https://atcoder.jp/contests/abc407/tasks/abc407_e","difficulty":2,"starred":false,"topic":"balanced_brackets","topics":["balanced_brackets"],"solved":false},{"id":"uva_668","judge":"UVa","title":"Equation","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=668","difficulty":1,"starred":false,"topic":"expression_parsing","topics":["expression_parsing"],"solved":false},{"id":"spoj_rpneval","judge":"SPOJ","title":"Evaluate simple RPN expression","url":"https://www.spoj.com/problems/RPNEVAL/","difficulty":1,"starred":true,"topic":"expression_parsing","topics":["expression_parsing"],"solved":false},{"id":"codechef_cdm01","judge":"CodeChef","title":"Expression Parsing","url":"https://www.codechef.com/problems/CDM01","difficulty":1,"starred":true,"topic":"expression_parsing","topics":["expression_parsing"],"solved":false},{"id":"spoj_sbe201a6","judge":"SPOJ","title":"Tertiary Calculator","url":"https://www.spoj.com/problems/SBE201A6/","difficulty":1,"starred":false,"topic":"expression_parsing","topics":["expression_parsing"],"solved":false},{"id":"spoj_onp","judge":"SPOJ","title":"Transform the Expression","url":"https://www.spoj.com/problems/ONP/","difficulty":1,"starred":true,"topic":"expression_parsing","topics":["expression_parsing"],"solved":false},{"id":"lightoj_children_s_math","judge":"LightOJ","title":"Children's Math","url":"https://lightoj.com/problem/children-s-math","difficulty":2,"starred":true,"topic":"expression_parsing","topics":["expression_parsing"],"solved":false},{"id":"lightoj_equivalent_boolean_expression","judge":"LightOJ","title":"Equivalent Boolean Expressions","url":"https://lightoj.com/problem/equivalent-boolean-expression","difficulty":2,"starred":false,"topic":"expression_parsing","topics":["expression_parsing"],"solved":false},{"id":"codeforces_552e","judge":"Codeforces","title":"Vanya and Brackets","url":"https://codeforces.com/problemset/problem/552/E","difficulty":2,"starred":true,"topic":"expression_parsing","topics":["expression_parsing"],"solved":false},{"id":"yosupo_lyndon_factorization","judge":"Library Checker","title":"Lyndon Factorization","url":"https://judge.yosupo.jp/problem/lyndon_factorization","difficulty":1,"starred":true,"topic":"lyndon_factorization","topics":["lyndon_factorization"],"solved":false},{"id":"uva_660","judge":"UVa","title":"Glass Beads","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=660","difficulty":1,"starred":false,"topic":"lyndon_factorization","topics":["lyndon_factorization"],"solved":false},{"id":"baekjoon_23495","judge":"Baekjoon","title":"Longest Lyndon Prefix","url":"https://www.acmicpc.net/problem/23495","difficulty":1,"starred":true,"topic":"lyndon_factorization","topics":["lyndon_factorization"],"solved":false},{"id":"codeforces_100162g","judge":"CF Gym","title":"Lyndon Words","url":"https://codeforces.com/problemset/gymProblem/100162/G","difficulty":1,"starred":false,"topic":"lyndon_factorization","topics":["lyndon_factorization"],"solved":false},{"id":"baekjoon_25111","judge":"Baekjoon","title":"Repetitions","url":"https://www.acmicpc.net/problem/25111","difficulty":2,"starred":false,"topic":"lyndon_factorization","topics":["lyndon_factorization","main_lorentz_algorithm"],"solved":false},{"id":"codeforces_594e","judge":"Codeforces","title":"Cutting the Line","url":"https://codeforces.com/contest/594/problem/E","difficulty":3,"starred":false,"topic":"lyndon_factorization","topics":["lyndon_factorization"],"solved":false},{"id":"baekjoon_19403","judge":"Baekjoon","title":"Cyclic Shifts","url":"https://www.acmicpc.net/problem/19403","difficulty":3,"starred":true,"topic":"lyndon_factorization","topics":["lyndon_factorization"],"solved":false},{"id":"baekjoon_19020","judge":"Baekjoon","title":"Decomposition","url":"https://www.acmicpc.net/problem/19020","difficulty":3,"starred":true,"topic":"lyndon_factorization","topics":["lyndon_factorization"],"solved":false},{"id":"yosupo_runenumerate","judge":"Library Checker","title":"Run Enumerate","url":"https://judge.yosupo.jp/problem/runenumerate","difficulty":3,"starred":true,"topic":"lyndon_factorization","topics":["main_lorentz_algorithm","lyndon_factorization"],"solved":false},{"id":"uoj_219","judge":"UOJ","title":"优秀的拆分","url":"https://uoj.ac/problem/219","difficulty":3,"starred":false,"topic":"lyndon_factorization","topics":["lyndon_factorization"],"solved":false},{"id":"codeforces_1621i","judge":"Codeforces","title":"Two Sequences","url":"https://codeforces.com/contest/1621/problem/I","difficulty":4,"starred":false,"topic":"lyndon_factorization","topics":["lyndon_factorization"],"solved":false},{"id":"cses_1692","judge":"CSES","title":"De Bruijn Sequence","url":"https://cses.fi/problemset/task/1692","difficulty":1,"starred":true,"topic":"de_bruijn_sequence","topics":["de_bruijn_sequence"],"solved":false},{"id":"cses_1633","judge":"CSES","title":"Dice Combinations","url":"https://cses.fi/problemset/task/1633","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"atcoder_dp_d","judge":"AtCoder","title":"Knapsack 1","url":"https://atcoder.jp/contests/dp/tasks/dp_d","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_1635","judge":"CSES","title":"Coin Combinations I","url":"https://cses.fi/problemset/task/1635","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"atcoder_dp_a","judge":"AtCoder","title":"Frog 1","url":"https://atcoder.jp/contests/dp/tasks/dp_a","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"atcoder_dp_b","judge":"AtCoder","title":"Frog 2","url":"https://atcoder.jp/contests/dp/tasks/dp_b","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_1634","judge":"CSES","title":"Minimizing Coins","url":"https://cses.fi/problemset/task/1634","difficulty":2,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_1637","judge":"CSES","title":"Removing Digits","url":"https://cses.fi/problemset/task/1637","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"codeforces_687c","judge":"Codeforces","title":"The Values You Can Make","url":"https://codeforces.com/contest/687/problem/C","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_1638","judge":"CSES","title":"Grid Paths","url":"https://cses.fi/problemset/task/1638","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_1158","judge":"CSES","title":"Book Shop","url":"https://cses.fi/problemset/task/1158","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_1746","judge":"CSES","title":"Array Description","url":"https://cses.fi/problemset/task/1746","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_2413","judge":"CSES","title":"Counting Towers","url":"https://cses.fi/problemset/task/2413","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_1745","judge":"CSES","title":"Money Sums","url":"https://cses.fi/problemset/task/1745","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack","subset_sum_in_sqrt"],"solved":true},{"id":"cses_1097","judge":"CSES","title":"Removal Game","url":"https://cses.fi/problemset/task/1097","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_1093","judge":"CSES","title":"Two Sets II","url":"https://cses.fi/problemset/task/1093","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack","subset_sum_in_sqrt"],"solved":true},{"id":"usaco_574","judge":"USACO","title":"Fruit Feast","url":"https://usaco.org/index.php?page=viewproblem2&cpid=574","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"atcoder_dp_c","judge":"AtCoder","title":"Vacation","url":"https://atcoder.jp/contests/dp/tasks/dp_c","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"atcoder_dp_h","judge":"AtCoder","title":"Grid 1","url":"https://atcoder.jp/contests/dp/tasks/dp_h","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"atcoder_dp_i","judge":"AtCoder","title":"Coins","url":"https://atcoder.jp/contests/dp/tasks/dp_i","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"cses_1636","judge":"CSES","title":"Coin Combinations II","url":"https://cses.fi/problemset/task/1636","difficulty":2,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"atcoder_abc321_f","judge":"AtCoder","title":"#(subset sum = K) with Add and Erase","url":"https://atcoder.jp/contests/abc321/tasks/abc321_f","difficulty":2,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"usaco_839","judge":"USACO","title":"Talent Show","url":"https://usaco.org/index.php?page=viewproblem2&cpid=839","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_837d","judge":"Codeforces","title":"Round Subset","url":"https://codeforces.com/contest/837/problem/D","difficulty":2,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"usaco_897","judge":"USACO","title":"Cow Poetry","url":"https://usaco.org/index.php?page=viewproblem2&cpid=897","difficulty":2,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"usaco_1043","judge":"USACO","title":"Exercise","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1043","difficulty":2,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"szkopul_lgqks9uritmjtxhpdahqyoel","judge":"Szkopuł","title":"Maximal Orders of Permutations","url":"https://szkopul.edu.pl/problemset/problem/lGqKS9urITMjTXhpdaHqyoEL/site/?key=statement","difficulty":2,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"atcoder_dp_e","judge":"AtCoder","title":"Knapsack 2","url":"https://atcoder.jp/contests/dp/tasks/dp_e","difficulty":2,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"atcoder_dp_k","judge":"AtCoder","title":"Stones","url":"https://atcoder.jp/contests/dp/tasks/dp_k","difficulty":2,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"atcoder_dp_l","judge":"AtCoder","title":"Deque","url":"https://atcoder.jp/contests/dp/tasks/dp_l","difficulty":2,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":true},{"id":"atcoder_dp_m","judge":"AtCoder","title":"Candies","url":"https://atcoder.jp/contests/dp/tasks/dp_m","difficulty":2,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"atcoder_dp_n","judge":"AtCoder","title":"Slimes","url":"https://atcoder.jp/contests/dp/tasks/dp_n","difficulty":2,"starred":true,"topic":"knapsack","topics":["knapsack","mcm"],"solved":false},{"id":"ceoi18_clo","judge":"oj.uz","title":"Cloud computing","url":"https://oj.uz/problem/view/CEOI18_clo","difficulty":3,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_742d","judge":"Codeforces","title":"Arpa's weak amphitheater and Mehrdad's valuable Hoses","url":"https://codeforces.com/contest/742/problem/D","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_1954d","judge":"Codeforces","title":"Colored Balls","url":"https://codeforces.com/problemset/problem/1954/D","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_1446a","judge":"Codeforces","title":"Knapsack","url":"https://codeforces.com/contest/1446/problem/A","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_1969c","judge":"Codeforces","title":"Minimizing the Sum","url":"https://codeforces.com/problemset/problem/1969/C","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_1418c","judge":"Codeforces","title":"Mortal Kombat Tower","url":"https://codeforces.com/problemset/problem/1418/C","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_2029c","judge":"Codeforces","title":"New Rating","url":"https://codeforces.com/contest/2029/problem/C","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_1077f1","judge":"Codeforces","title":"Pictures with Kittens (easy version)","url":"https://codeforces.com/contest/1077/problem/F1","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_1989d","judge":"Codeforces","title":"Smithing Skill","url":"https://codeforces.com/contest/1989/problem/D","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_2b","judge":"Codeforces","title":"The least round way","url":"https://codeforces.com/contest/2/problem/B","difficulty":1,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"toph_where_is_the_ghost","judge":"Toph","title":"Where is the Ghost","url":"https://toph.co/p/where-is-the-ghost","difficulty":1,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_1132e","judge":"Codeforces","title":"Knapsack","url":"https://codeforces.com/problemset/problem/1132/E","difficulty":2,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_506a","judge":"Codeforces","title":"Mr. Kitayuta, the Treasure Hunter","url":"https://codeforces.com/problemset/problem/506/A","difficulty":2,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_148e","judge":"Codeforces","title":"Porcelain","url":"https://codeforces.com/contest/148/problem/E","difficulty":2,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"baekjoon_6114","judge":"Baekjoon","title":"Ski Lessons","url":"https://www.acmicpc.net/problem/6114","difficulty":2,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_1078b","judge":"Codeforces","title":"The Unbearable Lightness of Weights","url":"https://codeforces.com/contest/1078/problem/B","difficulty":2,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_1637d","judge":"Codeforces","title":"Yet Another Minimization Problem","url":"https://codeforces.com/contest/1637/problem/D","difficulty":2,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"atcoder_abc345_e","judge":"AtCoder","title":"Colorful Subsequence","url":"https://atcoder.jp/contests/abc345/tasks/abc345_e","difficulty":3,"starred":true,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"usaco_925","judge":"USACO","title":"Moorio Kart","url":"https://usaco.org/index.php?page=viewproblem2&cpid=925","difficulty":3,"starred":false,"topic":"knapsack","topics":["knapsack"],"solved":false},{"id":"codeforces_755f","judge":"Codeforces","title":"PolandBall and Gifts","url":"https://codeforces.com/contest/755/problem/F","difficulty":2,"starred":true,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"codeforces_1856e2","judge":"Codeforces","title":"PermuTree (hard version)","url":"https://codeforces.com/contest/1856/problem/E2","difficulty":2,"starred":true,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt","dynamic_bitsets"],"solved":false},{"id":"atcoder_agc020_c","judge":"AtCoder","title":"Median Sum","url":"https://atcoder.jp/contests/agc020/tasks/agc020_c","difficulty":2,"starred":true,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"codeforces_1839e","judge":"Codeforces","title":"Decreasing Game","url":"https://codeforces.com/problemset/problem/1839/E","difficulty":1,"starred":true,"topic":"subset_sum_in_sqrt","topics":["interactive_problems","subset_sum_in_sqrt"],"solved":false},{"id":"codechef_minfund","judge":"CodeChef","title":"Min-Fund Country","url":"https://www.codechef.com/problems/MINFUND","difficulty":1,"starred":false,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"noi18_knapsack","judge":"oj.uz","title":"Knapsack","url":"https://oj.uz/problem/view/NOI18_knapsack","difficulty":2,"starred":false,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"codechef_treups","judge":"CodeChef","title":"Tree Upshot","url":"https://www.codechef.com/LTIME101B/problems/TREUPS","difficulty":2,"starred":false,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"codeforces_95e","judge":"Codeforces","title":"Lucky Country","url":"https://codeforces.com/contest/95/problem/E","difficulty":2,"starred":false,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"kattis_eavesdropperevasion","judge":"Kattis","title":"Eavesdropper Evasion","url":"https://ncpc21.kattis.com/problems/eavesdropperevasion","difficulty":2,"starred":false,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"yandex_18290f","judge":"Yandex","title":"Subset Sum","url":"https://official.contest.yandex.ru/opencupXX/contest/18290/problems/F/","difficulty":2,"starred":true,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"atcoder_abc221_g","judge":"AtCoder","title":"Jumping sequence","url":"https://atcoder.jp/contests/abc221/tasks/abc221_g","difficulty":2,"starred":true,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"codeforces_1481f","judge":"Codeforces","title":"AB Tree","url":"https://codeforces.com/problemset/problem/1481/F","difficulty":3,"starred":true,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"spoj_adacoins","judge":"SPOJ","title":"Ada and Coins","url":"https://vjudge.net/problem/SPOJ-ADACOINS","difficulty":1,"starred":true,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"spoj_ild18acp","judge":"SPOJ","title":"Count Pairs","url":"https://vjudge.net/problem/SPOJ-ILD18ACP","difficulty":2,"starred":true,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"boi2021_statement_boi2021_0_keyboard_en.pdf","judge":"Olympiad","title":"Keyboard","url":"https://www.boi2021.de/wp-content/uploads/2021/04/statement-boi2021-0-keyboard-en.pdf","difficulty":2,"starred":true,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"cses_1706","judge":"CSES","title":"School Excursion","url":"https://cses.fi/problemset/task/1706","difficulty":2,"starred":false,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":false},{"id":"codeforces_688e","judge":"Codeforces","title":"The Values You Can Make","url":"https://codeforces.com/contest/688/problem/E","difficulty":2,"starred":false,"topic":"subset_sum_in_sqrt","topics":["subset_sum_in_sqrt"],"solved":true},{"id":"cses_2220","judge":"CSES","title":"Counting Numbers","url":"https://cses.fi/problemset/task/2220","difficulty":1,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"lightoj_1068","judge":"LightOJ","title":"Investigation","url":"https://vjudge.net/problem/LightOJ-1068","difficulty":1,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"atcoder_dp_s","judge":"AtCoder","title":"Digit Sum","url":"https://atcoder.jp/contests/dp/tasks/dp_s","difficulty":1,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"cf_gym_100886g","judge":"CF Gym","title":"Maximum Product","url":"https://codeforces.com/gym/100886/problem/G","difficulty":1,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"codeforces_628d","judge":"Codeforces","title":"Magic Numbers","url":"https://codeforces.com/contest/628/problem/D","difficulty":1,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"lightoj_1122","judge":"LightOJ","title":"Digit Count","url":"https://vjudge.net/problem/LightOJ-1122","difficulty":1,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"spoj_cpcrc1c","judge":"SPOJ","title":"Sum of Digits","url":"https://www.spoj.com/problems/CPCRC1C/","difficulty":1,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"spoj_raone","judge":"SPOJ","title":"Ra-One Numbers","url":"https://www.spoj.com/problems/RAONE/","difficulty":1,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"spoj_lucifer","judge":"SPOJ","title":"LUCIFER Number","url":"https://www.spoj.com/problems/LUCIFER/","difficulty":1,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"spoj_numtsn","judge":"SPOJ","title":"369 Numbers","url":"https://www.spoj.com/problems/NUMTSN/","difficulty":1,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"atcoder_abc154_e","judge":"AtCoder","title":"Almost Everywhere Zero","url":"https://atcoder.jp/contests/abc154/tasks/abc154_e","difficulty":1,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"toph_noora_number","judge":"Toph","title":"Noora Number","url":"https://toph.co/p/noora-number","difficulty":2,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"codeforces_1036c","judge":"Codeforces","title":"Classy Numbers","url":"https://codeforces.com/contest/1036/problem/C","difficulty":2,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"codeforces_1073e","judge":"Codeforces","title":"Segment Sum","url":"https://codeforces.com/contest/1073/problem/E","difficulty":2,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"toph_lids","judge":"Toph","title":"LIDS","url":"https://toph.co/p/lids","difficulty":2,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"lightoj_1205","judge":"LightOJ","title":"Palindromic Numbers","url":"https://vjudge.net/problem/LightOJ-1205","difficulty":2,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"codechef_dgtcnt","judge":"CodeChef","title":"Chef and Digits","url":"https://www.codechef.com/problems/DGTCNT","difficulty":2,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"codechef_digimu","judge":"CodeChef","title":"Logan and DIGIT IMMUNE numbers","url":"https://www.codechef.com/problems/DIGIMU","difficulty":2,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"codechef_workchef","judge":"CodeChef","title":"Chef and special numbers","url":"https://www.codechef.com/problems/WORKCHEF","difficulty":2,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"hackerearth_sallu_bhai_and_ias_8838ac8d","judge":"HackerEarth","title":"The Great Ninja War","url":"https://www.hackerearth.com/problem/algorithm/sallu-bhai-and-ias-8838ac8d/","difficulty":2,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"spoj_balnum","judge":"SPOJ","title":"Balanced Numbers","url":"https://www.spoj.com/problems/BALNUM/","difficulty":2,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"spoj_pr003004","judge":"SPOJ","title":"Digit Sum","url":"https://www.spoj.com/problems/PR003004/en/","difficulty":1,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"codeforces_204a","judge":"Codeforces","title":"Little Elephant and Interval","url":"https://codeforces.com/problemset/problem/204/A","difficulty":1,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"cf_gym_102040b","judge":"CF Gym","title":"Counting Inversion","url":"https://codeforces.com/gym/102040/problem/B","difficulty":2,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"atcoder_abc336_e","judge":"AtCoder","title":"Digit Sum Divisible","url":"https://atcoder.jp/contests/abc336/tasks/abc336_e","difficulty":2,"starred":true,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"usaco_en","judge":"USACO","title":"Odometer","url":"https://usaco.org/index.php?page=viewproblem2&cpid=435&lang=en","difficulty":2,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"codeforces_509c","judge":"Codeforces","title":"Sums of Digits","url":"https://codeforces.com/problemset/problem/509/C","difficulty":2,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"codeforces_2086e","judge":"Codeforces","title":"Zebra-like Numbers","url":"https://codeforces.com/contest/2086/problem/E","difficulty":2,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"spoj_sanvi","judge":"SPOJ","title":"Sanvi and Magical Numbers","url":"https://www.spoj.com/problems/SANVI/","difficulty":3,"starred":false,"topic":"digit_dp","topics":["digit_dp"],"solved":false},{"id":"cses_2086","judge":"CSES","title":"Subarray Squares","url":"https://cses.fi/problemset/task/2086","difficulty":1,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"codeforces_321e","judge":"Codeforces","title":"Ciel and Gondolas","url":"https://codeforces.com/contest/321/problem/E","difficulty":1,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"hackerrank_guardians_lunatics_ioi14","judge":"HackerRank","title":"Guardians of the Lunatic","url":"https://www.hackerrank.com/contests/ioi-2014-practice-contest-2/challenges/guardians-lunatics-ioi14/problem","difficulty":1,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"codeforces_833b","judge":"Codeforces","title":"The Bakery","url":"https://codeforces.com/contest/833/problem/B","difficulty":1,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"codeforces_673e","judge":"Codeforces","title":"Levels and Regions","url":"https://codeforces.com/contest/673/problem/E","difficulty":1,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization","aliens_trick","cht"],"solved":false},{"id":"cf_gym_103536a","judge":"CF Gym","title":"Guards","url":"https://codeforces.com/gym/103536/problem/A","difficulty":1,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"spoj_adamold","judge":"SPOJ","title":"Ada and Mold","url":"https://www.spoj.com/problems/ADAMOLD/","difficulty":1,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"timus_1167","judge":"Timus","title":"Bicolored Horses","url":"https://acm.timus.ru/problem.aspx?space=1&num=1167","difficulty":1,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"usaco_616","judge":"USACO","title":"Circular Barn","url":"https://usaco.org/index.php?page=viewproblem2&cpid=616","difficulty":1,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"codeforces_1527e","judge":"Codeforces","title":"Partition Game","url":"https://codeforces.com/contest/1527/problem/E","difficulty":2,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"atcoder_arc067_d","judge":"AtCoder","title":"Yakiniku Restaurants","url":"https://atcoder.jp/contests/arc067/tasks/arc067_d","difficulty":2,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"codeforces_868f","judge":"Codeforces","title":"Yet Another Minimization Problem","url":"https://codeforces.com/contest/868/problem/F","difficulty":2,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"codechef_chefaor","judge":"CodeChef","title":"Chef and Bitwise OR Operation","url":"https://www.codechef.com/problems/CHEFAOR","difficulty":2,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"hackerrank_mining","judge":"HackerRank","title":"Mining","url":"https://www.hackerrank.com/contests/world-codesprint-5/challenges/mining","difficulty":2,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"kattis_money","judge":"Kattis","title":"Money for Nothing","url":"https://vjudge.net/problem/Kattis-money","difficulty":2,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"spoj_larmy","judge":"SPOJ","title":"Lannister Army","url":"https://www.spoj.com/problems/LARMY/","difficulty":2,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"cses_2087","judge":"CSES","title":"Houses and Schools","url":"https://cses.fi/problemset/task/2087/","difficulty":1,"starred":false,"topic":"divide_and_conquer_optimization","topics":["cht","divide_and_conquer_optimization"],"solved":false},{"id":"spoj_nkleaves","judge":"SPOJ","title":"Leaves","url":"https://www.spoj.com/problems/NKLEAVES/en/","difficulty":1,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"gym_101242b","judge":"CF Gym","title":"Branch Assignment","url":"https://vjudge.net/problem/Gym-101242B","difficulty":2,"starred":true,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"coi15_nafta","judge":"oj.uz","title":"Nafta","url":"https://oj.uz/problem/view/COI15_nafta","difficulty":2,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"codeforces_1101f","judge":"Codeforces","title":"Trucks and Cities","url":"https://codeforces.com/contest/1101/problem/F","difficulty":2,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"szkopul_ovriplfk3ihyfpjnvxeztgxh","judge":"Szkopuł","title":"Two Sawmills","url":"https://szkopul.edu.pl/problemset/problem/ovRIpLFK3IhyFPjnVXeZtGxH/site/?key=statement","difficulty":2,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization","cht"],"solved":false},{"id":"codeforces_101e","judge":"Codeforces","title":"Candies and Stones","url":"https://codeforces.com/contest/101/problem/E","difficulty":3,"starred":false,"topic":"divide_and_conquer_optimization","topics":["divide_and_conquer_optimization"],"solved":false},{"id":"zoj_2860","judge":"ZOJ","title":"Breaking Strings","url":"https://vjudge.net/problem/ZOJ-2860","difficulty":1,"starred":true,"topic":"knuth_optimization","topics":["knuth_optimization"],"solved":false},{"id":"cses_2088","judge":"CSES","title":"Knuth Division","url":"https://cses.fi/problemset/task/2088","difficulty":1,"starred":true,"topic":"knuth_optimization","topics":["knuth_optimization"],"solved":false},{"id":"uva_944","judge":"UVa","title":"Cutting Sticks","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=944","difficulty":1,"starred":true,"topic":"knuth_optimization","topics":["knuth_optimization"],"solved":false},{"id":"uva_12057","judge":"UVa","title":"Prefix Codes","url":"https://vjudge.net/problem/UVA-12057","difficulty":1,"starred":false,"topic":"knuth_optimization","topics":["knuth_optimization"],"solved":false},{"id":"uva_1245","judge":"UVa","title":"Optimal Binary Search Tree","url":"https://onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&problem=1245","difficulty":1,"starred":true,"topic":"knuth_optimization","topics":["knuth_optimization"],"solved":false},{"id":"trucks and cities","judge":"Codeforces","title":"Trucks and Cities","url":"https://codeforces.com/problemset/problem/1101/F","difficulty":1,"starred":false,"topic":"knuth_optimization","topics":["knuth_optimization"],"solved":false},{"id":"uva_4701","judge":"UVa","title":"Gain Battle Power","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4701","difficulty":2,"starred":false,"topic":"knuth_optimization","topics":["knuth_optimization"],"solved":false},{"id":"noi19_feast","judge":"oj.uz","title":"Feast","url":"https://oj.uz/problem/view/NOI19_feast","difficulty":2,"starred":true,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"codeforces_1279f","judge":"Codeforces","title":"New Year and Handle Change","url":"https://codeforces.com/contest/1279/problem/F","difficulty":1,"starred":true,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"usaco_697","judge":"USACO","title":"Building a Tall Barn","url":"https://usaco.org/index.php?page=viewproblem2&cpid=697","difficulty":2,"starred":false,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"codeforces_739e","judge":"Codeforces","title":"Gosha is hunting","url":"https://codeforces.com/contest/739/problem/E","difficulty":2,"starred":true,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"ioi16_aliens","judge":"oj.uz","title":"Aliens","url":"https://oj.uz/problem/view/IOI16_aliens","difficulty":3,"starred":true,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"csacademy_popcorn","judge":"CS Academy","title":"Popcorn","url":"https://csacademy.com/contest/romanian-ioi-2017-selection-2/task/popcorn/","difficulty":3,"starred":false,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"cf_gym_102331h","judge":"CF Gym","title":"Honorable Mention","url":"https://codeforces.com/gym/102331/problem/H","difficulty":3,"starred":false,"topic":"aliens_trick","topics":["aliens_trick","slope_trick"],"solved":false},{"id":"spoj_companys","judge":"SPOJ","title":"Two Famous Companies","url":"https://www.spoj.com/problems/COMPANYS/","difficulty":1,"starred":false,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"dmoj_coci18c4p5","judge":"DMOJ","title":"Akvizna","url":"https://dmoj.ca/problem/coci18c4p5","difficulty":2,"starred":false,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"kattis_blazingnewtrails","judge":"Kattis","title":"Blazing New Trails","url":"https://open.kattis.com/problems/blazingnewtrails","difficulty":2,"starred":false,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"codeforces_1661f","judge":"Codeforces","title":"Teleporters","url":"https://codeforces.com/problemset/problem/1661/F","difficulty":2,"starred":true,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"codeforces_2125f","judge":"Codeforces","title":"Timofey and Docker","url":"https://codeforces.com/contest/2125/problem/F","difficulty":3,"starred":false,"topic":"aliens_trick","topics":["aliens_trick"],"solved":false},{"id":"openj_bailian_1180","judge":"Vjudge","title":"Batch Scheduling","url":"https://vjudge.net/problem/OpenJ_Bailian-1180","difficulty":1,"starred":true,"topic":"1d1d_dp_optimization","topics":["1d1d_dp_optimization"],"solved":false},{"id":"codeforces_319c","judge":"Codeforces","title":"Kalila and Dimna in the Logging Industry","url":"https://codeforces.com/contest/319/problem/C","difficulty":1,"starred":true,"topic":"1d1d_dp_optimization","topics":["1d1d_dp_optimization","cht","li_chao_tree"],"solved":false},{"id":"cses_1145","judge":"CSES","title":"Increasing Subsequence","url":"https://cses.fi/problemset/task/1145","difficulty":1,"starred":true,"topic":"dp_optimization_using_data_structures","topics":["lis","dp_optimization_using_data_structures"],"solved":true},{"id":"cses_1140","judge":"CSES","title":"Projects","url":"https://cses.fi/problemset/task/1140","difficulty":1,"starred":true,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures","activity_selection_problem"],"solved":true},{"id":"atcoder_dp_q","judge":"AtCoder","title":"Flowers","url":"https://atcoder.jp/contests/dp/tasks/dp_q","difficulty":1,"starred":true,"topic":"dp_optimization_using_data_structures","topics":["lis","dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_474e","judge":"Codeforces","title":"Pillars","url":"https://codeforces.com/contest/474/problem/E","difficulty":2,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_629d","judge":"Codeforces","title":"Babaei and Birthday Cake","url":"https://codeforces.com/contest/629/problem/D","difficulty":2,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_960f","judge":"Codeforces","title":"Pathwalks","url":"https://codeforces.com/problemset/problem/960/F","difficulty":2,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"atcoder_dp_w","judge":"AtCoder","title":"Intervals","url":"https://atcoder.jp/contests/dp/tasks/dp_w","difficulty":2,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"atcoder_abl_d","judge":"AtCoder","title":"Flat Subsequence","url":"https://atcoder.jp/contests/abl/tasks/abl_d","difficulty":1,"starred":true,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"atcoder_abc339_e","judge":"AtCoder","title":"Smooth Subsequence","url":"https://atcoder.jp/contests/abc339/tasks/abc339_e","difficulty":1,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_1918d","judge":"Codeforces","title":"Blocking Elements","url":"https://codeforces.com/contest/1918/problem/D","difficulty":2,"starred":true,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_939f","judge":"Codeforces","title":"Cutlet","url":"https://codeforces.com/contest/939/problem/F","difficulty":2,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_56e","judge":"Codeforces","title":"Domino Principle","url":"https://codeforces.com/contest/56/problem/E","difficulty":2,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_777e","judge":"Codeforces","title":"Hanoi Factory","url":"https://codeforces.com/problemset/problem/777/E","difficulty":2,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"timus_1523","judge":"Timus","title":"K-inversions","url":"https://acm.timus.ru/problem.aspx?space=1&num=1523","difficulty":2,"starred":true,"topic":"dp_optimization_using_data_structures","topics":["inversions","dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_372c","judge":"Codeforces","title":"Watching Fireworks is Fun","url":"https://codeforces.com/contest/372/problem/C","difficulty":2,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"codeforces_930e","judge":"Codeforces","title":"Coins Exhibition","url":"https://codeforces.com/problemset/problem/930/E","difficulty":3,"starred":false,"topic":"dp_optimization_using_data_structures","topics":["dp_optimization_using_data_structures"],"solved":false},{"id":"atcoder_dp_z","judge":"AtCoder","title":"Frog 3","url":"https://atcoder.jp/contests/dp/tasks/dp_z","difficulty":1,"starred":true,"topic":"cht","topics":["cht","li_chao_tree"],"solved":false},{"id":"codeforces_660f","judge":"Codeforces","title":"Bear and Bowling 4","url":"https://codeforces.com/problemset/problem/660/F","difficulty":1,"starred":true,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_1083e","judge":"Codeforces","title":"The Fair Nut and Rectangles","url":"https://codeforces.com/contest/1083/problem/E","difficulty":2,"starred":true,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_631e","judge":"Codeforces","title":"Product Sum","url":"https://codeforces.com/problemset/problem/631/E","difficulty":1,"starred":true,"topic":"cht","topics":["cht"],"solved":false},{"id":"cf_gym_103536b","judge":"CF Gym","title":"Troubles","url":"https://codeforces.com/gym/103536/problem/B","difficulty":1,"starred":true,"topic":"cht","topics":["cht"],"solved":false},{"id":"dmoj_apio10p1","judge":"DMOJ","title":"Commando","url":"https://dmoj.ca/problem/apio10p1","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"csacademy_squared_ends","judge":"CS Academy","title":"Squared Ends","url":"https://csacademy.com/contest/archive/task/squared-ends","difficulty":1,"starred":true,"topic":"cht","topics":["cht","li_chao_tree"],"solved":false},{"id":"codechef_cyclrace","judge":"CodeChef","title":"Cyclist Race","url":"https://www.codechef.com/JAN16/problems/CYCLRACE","difficulty":1,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"kattis_coveredwalkway","judge":"Kattis","title":"Covered Walkway","url":"https://open.kattis.com/problems/coveredwalkway","difficulty":1,"starred":true,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_932f","judge":"Codeforces","title":"Escape Through Leaf","url":"https://codeforces.com/contest/932/problem/F","difficulty":3,"starred":true,"topic":"cht","topics":["cht","li_chao_tree"],"solved":false},{"id":"codeforces_1627e","judge":"Codeforces","title":"Not Escaping","url":"https://codeforces.com/contest/1627/problem/E","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_1388e","judge":"Codeforces","title":"Uncle Bogdan and Projections","url":"https://codeforces.com/contest/1388/problem/E","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_311b","judge":"Codeforces","title":"Cats Transport","url":"https://codeforces.com/contest/311/problem/B","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"kattis_avoidingairports","judge":"Kattis","title":"Avoiding Airports","url":"https://open.kattis.com/problems/avoidingairports","difficulty":2,"starred":false,"topic":"cht","topics":["cht","li_chao_tree"],"solved":false},{"id":"codechef_jump","judge":"CodeChef","title":"Jump mission","url":"https://www.codechef.com/OCT15/problems/JUMP/","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codechef_pdeliv","judge":"CodeChef","title":"Pizza Delivery","url":"https://www.codechef.com/JULY18A/problems/PDELIV","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"spoj_acquire","judge":"SPOJ","title":"Land Acquisition","url":"https://www.spoj.com/problems/ACQUIRE/","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"poj_3266","judge":"POJ","title":"Cow School","url":"http://poj.org/problem?id=3266","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"spoj_goodg","judge":"SPOJ","title":"Good Inflation","url":"https://www.spoj.com/problems/GOODG/","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"ceoi09_harbingers","judge":"oj.uz","title":"Harbingers","url":"https://oj.uz/problem/view/CEOI09_harbingers","difficulty":2,"starred":false,"topic":"cht","topics":["cht","persistent_cht","persistent_li_chao_tree"],"solved":false},{"id":"apio14_sequence","judge":"oj.uz","title":"Split the sequence","url":"https://oj.uz/problem/view/APIO14_sequence","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"szkopul_iyvwsachhcrzzatqh0qfkbsu","judge":"Szkopuł","title":"Lightning Conductor","url":"https://szkopul.edu.pl/problemset/problem/iYVwsAcHHCRZzAtQh0QFKbsu/site/?key=statement","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"szkopul_hh7lqvrvhom1g8yre9423d1p","judge":"Szkopuł","title":"Frogs","url":"https://szkopul.edu.pl/problemset/problem/HH7LQVRVHom1g8YRe9423d1P/site/?key=statement","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codechef_poly","judge":"CodeChef","title":"Polynomials","url":"https://www.codechef.com/NOV17/problems/POLY","difficulty":3,"starred":false,"topic":"cht","topics":["li_chao_tree","cht"],"solved":false},{"id":"kattis_yatp","judge":"Kattis","title":"YATP","url":"https://open.kattis.com/problems/yatp","difficulty":3,"starred":true,"topic":"cht","topics":["cht"],"solved":false},{"id":"codechef_weaselsc","judge":"CodeChef","title":"Weasel finds Staircase","url":"https://www.codechef.com/SEPT17/problems/WEASELSC","difficulty":3,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codechef_ccc","judge":"CodeChef","title":"Hit the Coconuts","url":"https://www.codechef.com/problems/CCC","difficulty":1,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"uva_3547","judge":"UVa","title":"Machine Works","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3547","difficulty":1,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"yosupo_segment_add_get_min","judge":"Library Checker","title":"Segment Add Get Min","url":"https://judge.yosupo.jp/problem/segment_add_get_min","difficulty":1,"starred":true,"topic":"cht","topics":["li_chao_tree","cht"],"solved":false},{"id":"cf_gym_104252b","judge":"CF Gym","title":"Board Game","url":"https://codeforces.com/gym/104252/problem/B","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"spoj_bunnies","judge":"SPOJ","title":"Bunnies","url":"https://www.spoj.com/problems/BUNNIES/","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"cf_gym_105811e","judge":"CF Gym","title":"Cable Plan","url":"https://codeforces.com/gym/105811/problem/E","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_377e","judge":"Codeforces","title":"Cookie Clicker","url":"https://codeforces.com/problemset/problem/377/E","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_91e","judge":"Codeforces","title":"Igloo Skyscraper","url":"https://codeforces.com/contest/91/problem/E","difficulty":2,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_2107f2","judge":"Codeforces","title":"Cycling (Hard Version)","url":"https://codeforces.com/contest/2107/problem/F2","difficulty":3,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_678f","judge":"Codeforces","title":"Lena and Queries","url":"https://codeforces.com/contest/678/problem/F","difficulty":3,"starred":false,"topic":"cht","topics":["cht"],"solved":false},{"id":"codeforces_1137e","judge":"Codeforces","title":"Train Car Selection","url":"https://codeforces.com/contest/1137/problem/E","difficulty":3,"starred":false,"topic":"cht","topics":["extended_li_chao_tree","cht"],"solved":false},{"id":"hackerrank_expert_computation","judge":"HackerRank","title":"Expert Computation","url":"https://www.hackerrank.com/contests/w36/challenges/expert-computation/problem","difficulty":2,"starred":true,"topic":"persistent_cht","topics":["persistent_cht"],"solved":false},{"id":"cf_gym_105056g","judge":"CF Gym","title":"Giant Community","url":"https://codeforces.com/gym/105056/problem/G","difficulty":2,"starred":false,"topic":"persistent_cht","topics":["persistent_cht"],"solved":false},{"id":"cses_3429","judge":"CSES","title":"Lines and Queries I","url":"https://cses.fi/problemset/task/3429","difficulty":1,"starred":false,"topic":"li_chao_tree","topics":["li_chao_tree"],"solved":false},{"id":"cses_3430","judge":"CSES","title":"Lines and Queries II","url":"https://cses.fi/problemset/task/3430","difficulty":1,"starred":true,"topic":"li_chao_tree","topics":["li_chao_tree"],"solved":false},{"id":"cses_3427","judge":"CSES","title":"Line Segments Trace I","url":"https://cses.fi/problemset/task/3427","difficulty":1,"starred":false,"topic":"li_chao_tree","topics":["li_chao_tree"],"solved":false},{"id":"cses_3428","judge":"CSES","title":"Line Segments Trace II","url":"https://cses.fi/problemset/task/3428","difficulty":1,"starred":true,"topic":"li_chao_tree","topics":["li_chao_tree"],"solved":false},{"id":"hackerearth_do_you_order_queries_27a70fdd","judge":"HackerEarth","title":"Do you order queries?","url":"https://www.hackerearth.com/practice/data-structures/advanced-data-structures/segment-trees/practice-problems/algorithm/do-you-order-queries-27a70fdd/","difficulty":2,"starred":true,"topic":"persistent_li_chao_tree","topics":["persistent_li_chao_tree"],"solved":false},{"id":"cf_group_572352e","judge":"Codeforces","title":"Scrolls of Eternal Wisdom","url":"https://codeforces.com/group/Rilx5irOux/contest/572352/problem/E","difficulty":2,"starred":false,"topic":"persistent_li_chao_tree","topics":["persistent_li_chao_tree"],"solved":false},{"id":"tlx_troc_13_div_1d","judge":"TLX","title":"Mall and Transportation","url":"https://tlx.toki.id/contests/troc-13-div-1/problems/D","difficulty":3,"starred":true,"topic":"extended_li_chao_tree","topics":["extended_li_chao_tree"],"solved":false},{"id":"noi20_progression","judge":"oj.uz","title":"Progression","url":"https://oj.uz/problem/view/NOI20_progression","difficulty":2,"starred":true,"topic":"extended_li_chao_tree","topics":["extended_li_chao_tree"],"solved":false},{"id":"atcoder_abc177_f","judge":"AtCoder","title":"I hate Shortest Path Problem","url":"https://atcoder.jp/contests/abc177/tasks/abc177_f","difficulty":2,"starred":true,"topic":"extended_li_chao_tree","topics":["extended_li_chao_tree"],"solved":false},{"id":"training_statement","judge":"Olinfo","title":"Reazione a candela","url":"https://training.olinfo.it/#/task/oii_candele/statement","difficulty":2,"starred":false,"topic":"extended_li_chao_tree","topics":["extended_li_chao_tree"],"solved":false},{"id":"dmoj_ioi05p3","judge":"DMOJ","title":"Mean Sequence","url":"https://dmoj.ca/problem/ioi05p3","difficulty":3,"starred":false,"topic":"extended_li_chao_tree","topics":["extended_li_chao_tree"],"solved":false},{"id":"ioi18_meetings","judge":"oj.uz","title":"Meetings","url":"https://oj.uz/problem/view/IOI18_meetings","difficulty":4,"starred":false,"topic":"extended_li_chao_tree","topics":["extended_li_chao_tree"],"solved":false},{"id":"atcoder_dp_o","judge":"AtCoder","title":"Matching","url":"https://atcoder.jp/contests/dp/tasks/dp_o","difficulty":1,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"spoj_pesada04","judge":"SPOJ","title":"Travelling Salesman Problem","url":"https://vjudge.net/problem/SPOJ-PESADA04","difficulty":1,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_11d","judge":"Codeforces","title":"A Simple Task","url":"https://codeforces.com/contest/11/problem/D","difficulty":1,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_1316e","judge":"Codeforces","title":"Team Building","url":"https://codeforces.com/contest/1316/problem/E","difficulty":1,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"usaco_494","judge":"USACO","title":"Guard Mark","url":"https://usaco.org/index.php?page=viewproblem2&cpid=494","difficulty":1,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"usaco_515","judge":"USACO","title":"Moovie Mooving","url":"https://usaco.org/index.php?page=viewproblem2&cpid=515","difficulty":1,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_8c","judge":"Codeforces","title":"Looking for Order","url":"https://codeforces.com/problemset/problem/8/C","difficulty":1,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"atcoder_dp_u","judge":"AtCoder","title":"Grouping","url":"https://atcoder.jp/contests/dp/tasks/dp_u","difficulty":2,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_453b","judge":"Codeforces","title":"Little Pony and Harmony Chest","url":"https://codeforces.com/contest/453/problem/B","difficulty":2,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codechef_tshirts","judge":"CodeChef","title":"Little Elephant and T-Shirts","url":"https://www.codechef.com/problems/TSHIRTS","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codechef_lealco","judge":"CodeChef","title":"Little Elephant and Alcohol","url":"https://www.codechef.com/JAN13/problems/LEALCO","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"spoj_hist2","judge":"SPOJ","title":"Histogram","url":"https://www.spoj.com/problems/HIST2/","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_757d","judge":"Codeforces","title":"Felicity's Big Secret Revealed","url":"https://codeforces.com/problemset/problem/757/D","difficulty":2,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codechef_seagcd2","judge":"CodeChef","title":"Sereja and GCD 2","url":"https://www.codechef.com/problems/SEAGCD2","difficulty":2,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"hackerearth_hasan_and_points_pairing","judge":"HackerEarth","title":"Hasan and Points Pairing","url":"https://www.hackerearth.com/practice/algorithms/dynamic-programming/introduction-to-dynamic-programming-1/practice-problems/algorithm/hasan-and-points-pairing/","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"hackerearth_sherlock_and_coprime_subset","judge":"HackerEarth","title":"Sherlock and Coprime Subset","url":"https://www.hackerearth.com/practice/algorithms/dynamic-programming/bit-masking/practice-problems/algorithm/sherlock-and-coprime-subset/","difficulty":2,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"usaco_1089","judge":"USACO","title":"Uddered but not Herd","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1089","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"izho14_bank","judge":"oj.uz","title":"Bank","url":"https://oj.uz/problem/view/IZhO14_bank","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"kattis_catandmice","judge":"Kattis","title":"Cat and Mice","url":"https://open.kattis.com/problems/catandmice","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_71e","judge":"Codeforces","title":"Nuclear Fusion","url":"https://codeforces.com/problemset/problem/71/E","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"cses_1653","judge":"CSES","title":"Elevator Rides","url":"https://cses.fi/problemset/task/1653","difficulty":3,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_662c","judge":"Codeforces","title":"Binary Table","url":"https://codeforces.com/contest/662/problem/C","difficulty":3,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"spoj_baby","judge":"SPOJ","title":"Baby","url":"https://www.spoj.com/problems/BABY/","difficulty":3,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"usaco_1282","judge":"USACO","title":"Lights Off","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1282","difficulty":3,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_1103d","judge":"Codeforces","title":"Professional layer","url":"https://codeforces.com/contest/1103/problem/D","difficulty":4,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_1148g","judge":"Codeforces","title":"Gold Experience","url":"https://codeforces.com/contest/1148/problem/G","difficulty":4,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_580d","judge":"Codeforces","title":"Kefa and Dishes","url":"https://codeforces.com/problemset/problem/580/D","difficulty":1,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_1950g","judge":"Codeforces","title":"Shuffling Songs","url":"https://codeforces.com/contest/1950/problem/G","difficulty":1,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp","coordinate_compression"],"solved":false},{"id":"codeforces_413d","judge":"Codeforces","title":"2048","url":"https://codeforces.com/problemset/problem/413/D","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"cf_gym_104493a","judge":"CF Gym","title":"Gym Plates","url":"https://codeforces.com/gym/104493/problem/A","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"codeforces_762d","judge":"Codeforces","title":"Maximum path","url":"https://codeforces.com/contest/762/problem/D","difficulty":2,"starred":false,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"leetcode_partition_to_k_equal_sum_subsets","judge":"LeetCode","title":"Partition to K Equal Sum Subsets","url":"https://leetcode.com/problems/partition-to-k-equal-sum-subsets/","difficulty":2,"starred":true,"topic":"bitmask_dp","topics":["bitmask_dp"],"solved":false},{"id":"cses_1654","judge":"CSES","title":"Bit Problem","url":"https://cses.fi/problemset/task/1654","difficulty":1,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_165e","judge":"Codeforces","title":"Compatible Numbers","url":"https://codeforces.com/contest/165/problem/E","difficulty":1,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_383e","judge":"Codeforces","title":"Vowels","url":"https://codeforces.com/contest/383/problem/E","difficulty":1,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"cses_3141","judge":"CSES","title":"And Subset Count","url":"https://cses.fi/problemset/task/3141/","difficulty":1,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codechef_covering","judge":"CodeChef","title":"Covering Sets","url":"https://www.codechef.com/problems/COVERING","difficulty":1,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"hackerearth_find_the_number_of_ordered_pairs_1","judge":"HackerEarth","title":"Ordered Pairs","url":"https://www.hackerearth.com/problem/algorithm/find-the-number-of-ordered-pairs-1/","difficulty":1,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"usaco_1309","judge":"USACO","title":"Problem Setting","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1309","difficulty":1,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"cf_group_203881k","judge":"Codeforces","title":"Pepsi Cola","url":"https://codeforces.com/group/qcIqFPYhVr/contest/203881/problem/K","difficulty":2,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"atcoder_abc187_f","judge":"AtCoder","title":"Close Group","url":"https://atcoder.jp/contests/abc187/tasks/abc187_f","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_599e","judge":"Codeforces","title":"Sandy and Nuts","url":"https://codeforces.com/problemset/problem/599/E","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"hackerrank_vim_war","judge":"HackerRank","title":"Vim War","url":"https://www.hackerrank.com/contests/w16/challenges/vim-war","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codechef_beauty","judge":"CodeChef","title":"Beautiful Sandwich","url":"https://www.codechef.com/SNFL16MR/problems/BEAUTY","difficulty":2,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codechef_str_func","judge":"CodeChef","title":"Strange Functions","url":"https://www.codechef.com/IPC15P2B/problems/STR_FUNC","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codechef_maxor","judge":"CodeChef","title":"Good Pairs","url":"https://www.codechef.com/LTIME50/problems/MAXOR","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codechef_monster","judge":"CodeChef","title":"Killing Monsters","url":"https://www.codechef.com/problems/MONSTER","difficulty":2,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codechef_amr14f","judge":"CodeChef","title":"Jersey Number","url":"https://www.codechef.com/problems/AMR14F","difficulty":2,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"cf_gym_102128b","judge":"CF Gym","title":"Cake Tasting","url":"https://codeforces.com/gym/102128/problem/B","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"csacademy_good_permurations","judge":"CS Academy","title":"Good Permutations","url":"https://csacademy.com/contest/archive/task/good-permurations/statement/","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"cf_gym_101666g","judge":"CF Gym","title":"Going Dutch","url":"https://codeforces.com/gym/101666/problem/G","difficulty":2,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codechef_andpref","judge":"CodeChef","title":"Prefix And","url":"https://www.codechef.com/COOK126A/problems/ANDPREF","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_1523d","judge":"Codeforces","title":"Love-Hate","url":"https://codeforces.com/contest/1523/problem/D","difficulty":2,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_1903d2","judge":"Codeforces","title":"Maximum And Queries (hard version)","url":"https://codeforces.com/contest/1903/problem/D2","difficulty":1,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_1620g","judge":"Codeforces","title":"Subsequences Galore","url":"https://codeforces.com/contest/1620/problem/G","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_1208f","judge":"Codeforces","title":"Bits And Pieces","url":"https://codeforces.com/contest/1208/problem/F","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"spoj_tle","judge":"SPOJ","title":"Time Limit Exceeded","url":"https://www.spoj.com/problems/TLE/","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"cf_gym_105755c","judge":"CF Gym","title":"Count Pairs","url":"https://codeforces.com/gym/105755/problem/C","difficulty":2,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"cf_gym_102006f","judge":"CF Gym","title":"Pretests","url":"https://codeforces.com/gym/102006/problem/F","difficulty":2,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_800d","judge":"Codeforces","title":"Varying Kibibits","url":"https://codeforces.com/contest/800/problem/D","difficulty":3,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codechef_danyanum","judge":"CodeChef","title":"Danya and Numbers","url":"https://www.codechef.com/problems/DANYANUM","difficulty":3,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"atcoder_arc100_c","judge":"AtCoder","title":"Or Plus Max","url":"https://atcoder.jp/contests/arc100/tasks/arc100_c","difficulty":3,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"joi18_snake_escaping","judge":"oj.uz","title":"Snake Escaping","url":"https://oj.uz/problem/view/JOI18_snake_escaping","difficulty":3,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"toph_peculiar_partitioning_ii","judge":"Toph","title":"Peculiar Partitioning II","url":"https://toph.co/p/peculiar-partitioning-ii","difficulty":3,"starred":true,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_1326f2","judge":"Codeforces","title":"Wise Men (Hard Version)","url":"https://codeforces.com/contest/1326/problem/F2","difficulty":4,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"codeforces_1995d","judge":"Codeforces","title":"Cases","url":"https://codeforces.com/contest/1995/problem/D","difficulty":2,"starred":false,"topic":"sos_dp","topics":["sos_dp"],"solved":false},{"id":"tlx_troc_16f","judge":"TLX","title":"Radio Radius","url":"https://tlx.toki.id/contests/troc-16/problems/F","difficulty":1,"starred":true,"topic":"subset_union_of_bitsets","topics":["subset_union_of_bitsets"],"solved":false},{"id":"codeforces_2070f","judge":"Codeforces","title":"Friends and Pizza","url":"https://codeforces.com/contest/2070/problem/F","difficulty":2,"starred":false,"topic":"subset_convolution","topics":["subset_convolution"],"solved":false},{"id":"hackerrank_subset","judge":"HackerRank","title":"Subset","url":"https://www.hackerrank.com/contests/countercode/challenges/subset","difficulty":1,"starred":true,"topic":"dynamic_submask_count","topics":["dynamic_submask_count"],"solved":false},{"id":"dmoj_utso18p6","judge":"DMOJ","title":"Subset Sum","url":"https://dmoj.ca/problem/utso18p6","difficulty":2,"starred":true,"topic":"dynamic_submask_count","topics":["dynamic_submask_count"],"solved":false},{"id":"izho17_subsequence","judge":"oj.uz","title":"Longest beautiful sequence","url":"https://oj.uz/problem/view/IZhO17_subsequence","difficulty":3,"starred":true,"topic":"dynamic_submask_count","topics":["dynamic_submask_count"],"solved":false},{"id":"poj_3986","judge":"POJ","title":"Math teacher's homework","url":"http://poj.org/problem?id=3986","difficulty":2,"starred":true,"topic":"xor_equation","topics":["xor_equation"],"solved":false},{"id":"hackerrank_stonegame","judge":"HackerRank","title":"Stone Game","url":"https://www.hackerrank.com/challenges/stonegame/problem","difficulty":2,"starred":true,"topic":"xor_equation","topics":["xor_equation"],"solved":false},{"id":"cf_gym_102114i","judge":"CF Gym","title":"Innocence","url":"https://codeforces.com/gym/102114/problem/I","difficulty":3,"starred":true,"topic":"xor_equation","topics":["xor_equation"],"solved":false},{"id":"codeforces_626f","judge":"Codeforces","title":"Group Projects","url":"https://codeforces.com/contest/626/problem/F","difficulty":1,"starred":true,"topic":"open_and_close_interval_trick","topics":["open_and_close_interval_trick"],"solved":false},{"id":"cses_1665","judge":"CSES","title":"Coding Company","url":"https://cses.fi/problemset/task/1665","difficulty":1,"starred":true,"topic":"open_and_close_interval_trick","topics":["open_and_close_interval_trick"],"solved":false},{"id":"codeforces_466d","judge":"Codeforces","title":"Increase Sequence","url":"https://codeforces.com/contest/466/problem/D","difficulty":1,"starred":true,"topic":"open_and_close_interval_trick","topics":["open_and_close_interval_trick"],"solved":false},{"id":"codeforces_367e","judge":"Codeforces","title":"Sereja and Intervals","url":"https://codeforces.com/contest/367/problem/E","difficulty":2,"starred":false,"topic":"open_and_close_interval_trick","topics":["open_and_close_interval_trick"],"solved":false},{"id":"codeforces_713c","judge":"Codeforces","title":"Sonya and Problem Wihtout a Legend","url":"https://codeforces.com/contest/713/problem/C","difficulty":1,"starred":true,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"cses_2132","judge":"CSES","title":"Increasing Array II","url":"https://cses.fi/problemset/task/2132","difficulty":1,"starred":true,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"codeforces_865d","judge":"Codeforces","title":"Buy Low Sell High","url":"https://codeforces.com/problemset/problem/865/D","difficulty":1,"starred":true,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"apio16_fireworks","judge":"oj.uz","title":"Fireworks","url":"https://oj.uz/problem/view/APIO16_fireworks","difficulty":2,"starred":true,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"atcoder_arc070_c","judge":"AtCoder","title":"NarrowRectangles","url":"http://arc070.contest.atcoder.jp/tasks/arc070_c","difficulty":2,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"noi18_safety","judge":"oj.uz","title":"Safety","url":"https://oj.uz/problem/view/NOI18_safety","difficulty":2,"starred":true,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"lmio19_bulves","judge":"oj.uz","title":"Potatoes and fertilizers","url":"https://oj.uz/problem/view/LMIO19_bulves","difficulty":2,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"cf_gym_101806t","judge":"CF Gym","title":"Touch The Sky","url":"https://codeforces.com/gym/101806/problem/T","difficulty":2,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"cf_gym_102391j","judge":"CF Gym","title":"Parklife","url":"https://codeforces.com/gym/102391/problem/J","difficulty":2,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"atcoder_jag2017autumn_j","judge":"AtCoder","title":"Farm Village","url":"https://atcoder.jp/contests/jag2017autumn/tasks/jag2017autumn_j","difficulty":2,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"atcoder_kupc2016_h","judge":"AtCoder","title":"WAAAAAAAAAAAAALL","url":"https://atcoder.jp/contests/kupc2016/tasks/kupc2016_h","difficulty":2,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"codeforces_1209h","judge":"Codeforces","title":"Moving Walkways","url":"https://codeforces.com/contest/1209/problem/H","difficulty":4,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"codeforces_1229f","judge":"Codeforces","title":"Mateusz and Escape Room","url":"https://codeforces.com/contest/1229/problem/F","difficulty":4,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"kattis_conquertheworld","judge":"Kattis","title":"Conquer The World","url":"https://icpc.kattis.com/problems/conquertheworld","difficulty":4,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"cf_gym_102576c","judge":"CF Gym","title":"Bookface","url":"https://codeforces.com/gym/102576/problem/C","difficulty":2,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"atcoder_arc123_d","judge":"AtCoder","title":"Inc, Dec - Decomposition","url":"https://atcoder.jp/contests/arc123/tasks/arc123_d","difficulty":2,"starred":true,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"kattis_socialdistancing","judge":"Kattis","title":"Social Distancing","url":"https://nus.kattis.com/courses/CS3233/CS3233_S2_AY2122/assignments/qs926n/problems/socialdistancing","difficulty":2,"starred":true,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"codechef_ccdsap","judge":"CodeChef","title":"CCDSAP Exam","url":"https://www.codechef.com/problems/CCDSAP","difficulty":3,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"cf_gym_102538f","judge":"CF Gym","title":"Farm of Monsters","url":"https://codeforces.com/gym/102538/problem/F","difficulty":3,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"usaco_650","judge":"USACO","title":"Landscaping","url":"https://usaco.org/index.php?page=viewproblem2&cpid=650","difficulty":3,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"ceoi19_magictree","judge":"oj.uz","title":"Magic Tree","url":"https://oj.uz/problem/view/CEOI19_magictree","difficulty":3,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"rmi21_paths","judge":"oj.uz","title":"Paths","url":"https://oj.uz/problem/view/RMI21_paths","difficulty":3,"starred":false,"topic":"slope_trick","topics":["slope_trick"],"solved":false},{"id":"kattis_kthsubtree","judge":"Kattis","title":"Kth Subtree","url":"https://vjudge.net/problem/Kattis-kthsubtree","difficulty":1,"starred":true,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"ceoi17_museum","judge":"oj.uz","title":"Museum","url":"https://oj.uz/problem/view/CEOI17_museum","difficulty":1,"starred":true,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"codeforces_815c","judge":"Codeforces","title":"Karen and Supermarket","url":"https://codeforces.com/problemset/problem/815/C","difficulty":2,"starred":false,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"coci19_dzumbus","judge":"oj.uz","title":"Džumbus","url":"https://oj.uz/problem/view/COCI19_dzumbus","difficulty":2,"starred":false,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"cf_gym_103886q","judge":"CF Gym","title":"Cereal Trees II","url":"https://codeforces.com/gym/103886/problem/Q","difficulty":2,"starred":false,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"codeforces_1249f","judge":"Codeforces","title":"Maximum Weight Subset","url":"https://codeforces.com/contest/1249/problem/F","difficulty":2,"starred":true,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"dmoj_ioi05p6","judge":"DMOJ","title":"Rivers","url":"https://dmoj.ca/problem/ioi05p6","difficulty":2,"starred":false,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"atcoder_abc207_f","judge":"AtCoder","title":"Tree Patrolling","url":"https://atcoder.jp/contests/abc207/tasks/abc207_f","difficulty":2,"starred":true,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"codeforces_735e","judge":"Codeforces","title":"Ostap and Tree","url":"https://codeforces.com/contest/735/problem/E","difficulty":2,"starred":true,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"codeforces_1280d","judge":"Codeforces","title":"Miss Punyverse","url":"https://codeforces.com/contest/1280/problem/D","difficulty":2,"starred":false,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"atcoder_aising2019_e","judge":"AtCoder","title":"Attack to a Tree","url":"https://atcoder.jp/contests/aising2019/tasks/aising2019_e","difficulty":2,"starred":true,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"dmoj_coci08c4p6","judge":"DMOJ","title":"Periodni","url":"https://dmoj.ca/problem/coci08c4p6","difficulty":3,"starred":false,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"codeforces_1097g","judge":"Codeforces","title":"Vladislav and a Great Legend","url":"https://codeforces.com/contest/1097/problem/G","difficulty":3,"starred":true,"topic":"combining_subtrees_technique","topics":["combining_subtrees_technique"],"solved":false},{"id":"leetcode_longest_increasing_subsequence","judge":"LeetCode","title":"Longest Increasing Subsequence","url":"https://leetcode.com/problems/longest-increasing-subsequence/","difficulty":1,"starred":true,"topic":"lis","topics":["lis"],"solved":true},{"id":"spoj_dosa","judge":"SPOJ","title":"Dosa","url":"https://www.spoj.com/problems/DOSA/","difficulty":1,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"spoj_hmlis","judge":"SPOJ","title":"HowManyLis","url":"https://www.spoj.com/problems/HMLIS/","difficulty":1,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"spoj_onexlis","judge":"SPOJ","title":"One X LIS","url":"https://www.spoj.com/problems/ONEXLIS/","difficulty":1,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"uva_4600","judge":"UVa","title":"Back to Edit Distance","url":"https://onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&problem=4600","difficulty":1,"starred":false,"topic":"lis","topics":["lis","edit_distance"],"solved":false},{"id":"codeforces_1304d","judge":"Codeforces","title":"Shortest and Longest LIS","url":"https://codeforces.com/problemset/problem/1304/D","difficulty":1,"starred":false,"topic":"lis","topics":["lis"],"solved":false},{"id":"codeforces_1682c","judge":"Codeforces","title":"LIS or Reverse LIS?","url":"https://codeforces.com/problemset/problem/1682/C","difficulty":1,"starred":false,"topic":"lis","topics":["lis"],"solved":false},{"id":"atcoder_abc237_f","judge":"AtCoder","title":"|LIS| = 3","url":"https://atcoder.jp/contests/abc237/tasks/abc237_f","difficulty":1,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"atcoder_arc091_c","judge":"AtCoder","title":"LISDL","url":"https://atcoder.jp/contests/arc091/tasks/arc091_c","difficulty":2,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"codeforces_10d","judge":"Codeforces","title":"LCIS","url":"https://codeforces.com/problemset/problem/10/D","difficulty":2,"starred":false,"topic":"lis","topics":["lis"],"solved":true},{"id":"codeforces_76f","judge":"Codeforces","title":"Tourist","url":"https://codeforces.com/contest/76/problem/F","difficulty":2,"starred":false,"topic":"lis","topics":["lis"],"solved":false},{"id":"acmsguru_99999521","judge":"Codeforces","title":"North-East","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/521","difficulty":2,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"spoj_supper","judge":"SPOJ","title":"Supernumbers in a permutation","url":"https://www.spoj.com/problems/SUPPER/","difficulty":2,"starred":false,"topic":"lis","topics":["lis"],"solved":false},{"id":"uva_3153","judge":"UVa","title":"Happy Birthday","url":"https://onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&problem=3153","difficulty":2,"starred":false,"topic":"lis","topics":["lis"],"solved":false},{"id":"atcoder_arc149_b","judge":"AtCoder","title":"Two LIS Sum","url":"https://atcoder.jp/contests/arc149/tasks/arc149_b","difficulty":2,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"uva_3637","judge":"UVa","title":"Tiling Up Blocks","url":"https://onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&problem=3637","difficulty":2,"starred":false,"topic":"lis","topics":["lis"],"solved":false},{"id":"codeforces_486e","judge":"Codeforces","title":"LIS of Sequence","url":"https://codeforces.com/problemset/problem/486/E","difficulty":2,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"atcoder_abc165_f","judge":"AtCoder","title":"LIS on Tree","url":"https://atcoder.jp/contests/abc165/tasks/abc165_f","difficulty":2,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"codeforces_101821b","judge":"CF Gym","title":"LIS vs. LDS","url":"https://codeforces.com/problemset/gymProblem/101821/B","difficulty":2,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"atcoder_arc175_d","judge":"AtCoder","title":"LIS on Tree 2","url":"https://atcoder.jp/contests/arc175/tasks/arc175_d","difficulty":2,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"atcoder_agc059_f","judge":"AtCoder","title":"LIDS","url":"https://atcoder.jp/contests/agc059/tasks/agc059_f","difficulty":4,"starred":false,"topic":"lis","topics":["lis"],"solved":false},{"id":"codeforces_977f","judge":"Codeforces","title":"Consecutive Subsequence","url":"https://codeforces.com/contest/977/problem/F","difficulty":1,"starred":false,"topic":"lis","topics":["lis"],"solved":false},{"id":"spoj_nds","judge":"SPOJ","title":"Increasing numbers","url":"https://www.spoj.com/problems/NDS/","difficulty":1,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"spoj_altseq","judge":"SPOJ","title":"Alternating Sequences","url":"https://www.spoj.com/problems/ALTSEQ/","difficulty":2,"starred":false,"topic":"lis","topics":["lis"],"solved":false},{"id":"atcoder_abc369_f","judge":"AtCoder","title":"Gather Coins","url":"https://atcoder.jp/contests/abc369/tasks/abc369_f","difficulty":2,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"lightoj_binary_sort","judge":"LightOJ","title":"Binary Sort","url":"https://lightoj.com/problem/binary-sort","difficulty":3,"starred":true,"topic":"lis","topics":["lis"],"solved":false},{"id":"aizu_alds1_10_b","judge":"Aizu","title":"Matrix-chain Multiplication","url":"https://vjudge.net/problem/Aizu-ALDS1_10_B","difficulty":1,"starred":true,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"spoj_mixtures","judge":"SPOJ","title":"Mixtures","url":"https://www.spoj.com/problems/MIXTURES/","difficulty":1,"starred":true,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"usaco_647","judge":"USACO","title":"248","url":"https://usaco.org/index.php?page=viewproblem2&cpid=647","difficulty":1,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"usaco_1114","judge":"USACO","title":"Modern Art 3","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1114","difficulty":1,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"usaco_265","judge":"USACO","title":"The Cow Run","url":"https://usaco.org/index.php?page=viewproblem2&cpid=265","difficulty":1,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_1312e","judge":"Codeforces","title":"Array Shrinking","url":"https://codeforces.com/contest/1312/problem/E","difficulty":2,"starred":true,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codechef_inoi1602","judge":"CodeChef","title":"Brackets","url":"https://www.codechef.com/INOIPRAC/problems/INOI1602","difficulty":2,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_1132f","judge":"Codeforces","title":"Clear the String","url":"https://codeforces.com/problemset/problem/1132/F","difficulty":2,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_476e","judge":"Codeforces","title":"Dreamoon and Strings","url":"https://codeforces.com/contest/476/problem/E","difficulty":2,"starred":true,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"cses_1080","judge":"CSES","title":"Empty String","url":"https://cses.fi/problemset/task/1080","difficulty":2,"starred":true,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_1303e","judge":"Codeforces","title":"Erase Subsequences","url":"https://codeforces.com/contest/1303/problem/E","difficulty":2,"starred":true,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"usaco_994","judge":"USACO","title":"Farmer John Solves 3SUM","url":"https://usaco.org/index.php?page=viewproblem2&cpid=994","difficulty":2,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_2074g","judge":"Codeforces","title":"Game With Triangles: Season 2","url":"https://codeforces.com/problemset/problem/2074/G","difficulty":2,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_1337e","judge":"Codeforces","title":"Kaavi and Magic Spell","url":"https://codeforces.com/contest/1337/problem/E","difficulty":2,"starred":true,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_1927g","judge":"Codeforces","title":"Paint Charges","url":"https://codeforces.com/problemset/problem/1927/G","difficulty":2,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_1025d","judge":"Codeforces","title":"Recovering BST","url":"https://codeforces.com/contest/1025/problem/D","difficulty":2,"starred":true,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_1509c","judge":"Codeforces","title":"The Sports Festival","url":"https://codeforces.com/problemset/problem/1509/C","difficulty":2,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"codeforces_607b","judge":"Codeforces","title":"Zuma","url":"https://codeforces.com/problemset/problem/607/B","difficulty":2,"starred":true,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"usaco_972","judge":"USACO","title":"Greedy Pie Eaters","url":"https://usaco.org/index.php?page=viewproblem2&cpid=972","difficulty":3,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"usaco_602","judge":"USACO","title":"Lights Out","url":"https://usaco.org/index.php?page=viewproblem2&cpid=602","difficulty":4,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"ceoi12_race","judge":"oj.uz","title":"Paimon's Tree","url":"https://oj.uz/problem/view/CEOI12_race","difficulty":4,"starred":false,"topic":"mcm","topics":["mcm"],"solved":false},{"id":"cf_gym_102001a","judge":"CF Gym","title":"Edit Distance","url":"https://codeforces.com/gym/102001/problem/A","difficulty":1,"starred":true,"topic":"edit_distance","topics":["edit_distance"],"solved":false},{"id":"cses_1639","judge":"CSES","title":"Edit Distance","url":"https://cses.fi/problemset/task/1639","difficulty":1,"starred":true,"topic":"edit_distance","topics":["edit_distance"],"solved":true},{"id":"codeforces_530g","judge":"Codeforces","title":"Levenshtein distance","url":"https://codeforces.com/problemset/problem/530/G","difficulty":1,"starred":false,"topic":"edit_distance","topics":["edit_distance"],"solved":false},{"id":"codeforces_1282d","judge":"Codeforces","title":"Enchanted Artifact","url":"https://codeforces.com/problemset/problem/1282/D","difficulty":2,"starred":false,"topic":"edit_distance","topics":["edit_distance","interactive_problems"],"solved":false},{"id":"codeforces_461b","judge":"Codeforces","title":"Appleman and Tree","url":"https://codeforces.com/contest/461/problem/B","difficulty":1,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1592c","judge":"Codeforces","title":"Bakry and Partitioning","url":"https://codeforces.com/contest/1592/problem/C","difficulty":1,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"usaco_766","judge":"USACO","title":"Barn Painting","url":"https://usaco.org/index.php?page=viewproblem2&cpid=766","difficulty":1,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_161d","judge":"Codeforces","title":"Distance in Tree","url":"https://codeforces.com/contest/161/problem/D","difficulty":1,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_61d","judge":"Codeforces","title":"Eternal Victory","url":"https://codeforces.com/contest/61/problem/D","difficulty":1,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"cses_1681","judge":"CSES","title":"Game Routes","url":"https://cses.fi/problemset/task/1681","difficulty":1,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":true},{"id":"atcoder_dp_p","judge":"AtCoder","title":"Independent Set","url":"https://atcoder.jp/contests/dp/tasks/dp_p","difficulty":1,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"cses_1680","judge":"CSES","title":"Longest Flight Route","url":"https://cses.fi/problemset/task/1680","difficulty":1,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"atcoder_dp_g","judge":"AtCoder","title":"Longest Path","url":"https://atcoder.jp/contests/dp/tasks/dp_g","difficulty":1,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_2014f","judge":"Codeforces","title":"Sheriff's Defense","url":"https://codeforces.com/contest/2014/problem/F","difficulty":1,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1083a","judge":"Codeforces","title":"The Fair Nut and the Best Path","url":"https://codeforces.com/contest/1083/problem/A","difficulty":1,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_2070d","judge":"Codeforces","title":"Tree Jumps","url":"https://codeforces.com/problemset/problem/2070/D","difficulty":1,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"cses_1130","judge":"CSES","title":"Tree Matching","url":"https://cses.fi/problemset/task/1130","difficulty":1,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":true},{"id":"timus_1039","judge":"Timus","title":"Anniversary Party","url":"https://acm.timus.ru/problem.aspx?space=1&num=1039","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_440d","judge":"Codeforces","title":"Berland Federalization","url":"https://codeforces.com/contest/440/problem/D","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"timus_1018","judge":"Timus","title":"Binary Apple Tree","url":"https://acm.timus.ru/problem.aspx?space=1&num=1018","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"usaco_1019","judge":"USACO","title":"Delegation","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1019","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1521d","judge":"Codeforces","title":"Nastia Plays with a Tree","url":"https://codeforces.com/contest/1521/problem/D","difficulty":2,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"szkopul_1qauwe_epamitzjgaszovd1u","judge":"Szkopuł","title":"Parade","url":"https://szkopul.edu.pl/problemset/problem/1QaUWE_ePAmitZjgAszOVD1U/site/?key=statement","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1528a","judge":"Codeforces","title":"Parsa's Humongous Tree","url":"https://codeforces.com/problemset/problem/1528/A","difficulty":2,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"cf_gym_105556d","judge":"CF Gym","title":"Protection","url":"https://codeforces.com/gym/105556/problem/D","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"atcoder_abc259_f","judge":"AtCoder","title":"Select Edges","url":"https://atcoder.jp/contests/abc259/tasks/abc259_f","difficulty":2,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"hackerrank_tree_pruning","judge":"HackerRank","title":"Tree Pruning","url":"https://www.hackerrank.com/challenges/tree-pruning/problem","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1078c","judge":"Codeforces","title":"Vasya and Maximum Matching","url":"https://codeforces.com/contest/1078/problem/C","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1387b1","judge":"Codeforces","title":"Village (Minimum)","url":"https://codeforces.com/contest/1387/problem/B1","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1646d","judge":"Codeforces","title":"Weight the Tree","url":"https://codeforces.com/contest/1646/problem/D","difficulty":2,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"atcoder_abc394_f","judge":"AtCoder","title":"Alkane","url":"https://atcoder.jp/contests/abc394/tasks/abc394_f","difficulty":3,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1394d","judge":"Codeforces","title":"Boboniu and Jianghu","url":"https://codeforces.com/contest/1394/problem/D","difficulty":3,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"szkopul_w3yaoat3ej27yeianwjk57_g","judge":"Szkopuł","title":"Mafia","url":"https://szkopul.edu.pl/problemset/problem/w3YAoAT3ej27YeiaNWjK57_G/site/?key=statement","difficulty":3,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"szkopul_r6tmtfvqfpaefqioymcqndqe","judge":"Szkopuł","title":"Spies","url":"https://szkopul.edu.pl/problemset/problem/r6tMTfvQFPAEfQioYMCQndQe/site/?key=statement","difficulty":3,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"cses_1752","judge":"CSES","title":"Creating Offices","url":"https://cses.fi/problemset/task/1752","difficulty":4,"starred":true,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"boi16_swap","judge":"oj.uz","title":"Swap","url":"https://oj.uz/problem/view/BOI16_swap","difficulty":4,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"coi16_torrent","judge":"oj.uz","title":"Torrent","url":"https://oj.uz/problem/view/COI16_torrent","difficulty":4,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"ioi07_training","judge":"oj.uz","title":"Training","url":"https://oj.uz/problem/view/IOI07_training","difficulty":4,"starred":false,"topic":"dp_on_trees_and_dags","topics":["dp_on_trees_and_dags"],"solved":false},{"id":"codeforces_1973f","judge":"Codeforces","title":"Maximum GCD Sum Queries","url":"https://codeforces.com/contest/1973/problem/F","difficulty":3,"starred":true,"topic":"dp_over_divisors","topics":["dp_over_divisors"],"solved":false},{"id":"toph_nitu_and_her_lucky_string","judge":"Toph","title":"Nitu and Her Lucky String","url":"https://toph.co/p/nitu-and-her-lucky-string","difficulty":2,"starred":true,"topic":"substring_dp","topics":["substring_dp"],"solved":false},{"id":"timus_1002","judge":"Timus","title":"Phone Numbers","url":"https://acm.timus.ru/problem.aspx?space=1&num=1002","difficulty":2,"starred":false,"topic":"substring_dp","topics":["substring_dp"],"solved":false},{"id":"spoj_pstring","judge":"SPOJ","title":"Remove The String","url":"https://www.spoj.com/problems/PSTRING/","difficulty":2,"starred":true,"topic":"substring_dp","topics":["substring_dp"],"solved":false},{"id":"atcoder_abc295_f","judge":"AtCoder","title":"substr = S","url":"https://atcoder.jp/contests/abc295/tasks/abc295_f","difficulty":2,"starred":false,"topic":"substring_dp","topics":["substring_dp"],"solved":false},{"id":"toph_cold_rainy_night_in_stoke","judge":"Toph","title":"Cold Rainy Night in Stoke","url":"https://toph.co/p/cold-rainy-night-in-stoke","difficulty":1,"starred":true,"topic":"dp_on_convex_hulls","topics":["dp_on_convex_hulls"],"solved":false},{"id":"atcoder_arc082_c","judge":"AtCoder","title":"ConvexScore","url":"https://atcoder.jp/contests/arc082/tasks/arc082_c","difficulty":2,"starred":true,"topic":"dp_on_convex_hulls","topics":["dp_on_convex_hulls"],"solved":false},{"id":"atcoder_abc202_f","judge":"AtCoder","title":"Integer Convex Hull","url":"https://atcoder.jp/contests/abc202/tasks/abc202_f","difficulty":2,"starred":true,"topic":"dp_on_convex_hulls","topics":["dp_on_convex_hulls"],"solved":false},{"id":"kattis_peggame","judge":"Kattis","title":"Pegs","url":"https://open.kattis.com/problems/peggame","difficulty":2,"starred":false,"topic":"dp_on_convex_hulls","topics":["dp_on_convex_hulls"],"solved":false},{"id":"toph_profitable_home","judge":"Toph","title":"Profitable Home","url":"https://toph.co/p/profitable-home","difficulty":2,"starred":true,"topic":"dp_on_convex_hulls","topics":["dp_on_convex_hulls"],"solved":false},{"id":"qoj_5443","judge":"QOJ","title":"Security at Museums","url":"https://qoj.ac/contest/1096/problem/5443","difficulty":2,"starred":false,"topic":"dp_on_convex_hulls","topics":["dp_on_convex_hulls"],"solved":false},{"id":"cses_1075","judge":"CSES","title":"Permutations II","url":"https://cses.fi/problemset/task/1075","difficulty":1,"starred":true,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"joi16_skyscraper","judge":"oj.uz","title":"Skyscraper","url":"https://oj.uz/problem/view/JOI16_skyscraper","difficulty":2,"starred":true,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"ceoi16_kangaroo","judge":"oj.uz","title":"Kangaroo","url":"https://oj.uz/problem/view/CEOI16_kangaroo","difficulty":2,"starred":false,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"codeforces_704b","judge":"Codeforces","title":"Ant Man","url":"https://codeforces.com/contest/704/problem/B","difficulty":2,"starred":false,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"codeforces_1515e","judge":"Codeforces","title":"Phoenix and Computers","url":"https://codeforces.com/contest/1515/problem/E","difficulty":2,"starred":false,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"lightoj_network","judge":"LightOJ","title":"Network","url":"https://lightoj.com/problem/network","difficulty":2,"starred":true,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"dmoj_utso21p7","judge":"DMOJ","title":"April Fools","url":"https://dmoj.ca/problem/utso21p7","difficulty":2,"starred":false,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"cf_gym_103081f","judge":"CF Gym","title":"Mentors","url":"https://codeforces.com/gym/103081/problem/F","difficulty":2,"starred":false,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"cf_group_213171r","judge":"Codeforces","title":"Magical Teleporter (Subtask 4)","url":"https://codeforces.com/group/R2SERIff4f/contest/213171/problem/R","difficulty":2,"starred":false,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"cf_group_293254d","judge":"Codeforces","title":"Reading Novels","url":"https://codeforces.com/group/IO0c6wbyI8/contest/293254/problem/D","difficulty":2,"starred":false,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"atcoder_arc117_e","judge":"AtCoder","title":"Zero-Sum Ranges 2","url":"https://atcoder.jp/contests/arc117/tasks/arc117_e","difficulty":2,"starred":true,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"tlx_troc_11h","judge":"TLX","title":"Route Defense","url":"https://tlx.toki.id/problems/troc-11/H","difficulty":3,"starred":true,"topic":"connected_component_dp","topics":["connected_component_dp"],"solved":false},{"id":"cses_2181","judge":"CSES","title":"Counting Tilings","url":"https://cses.fi/problemset/task/2181","difficulty":1,"starred":true,"topic":"broken_profile_dp","topics":["broken_profile_dp"],"solved":false},{"id":"ceoi06_connect","judge":"oj.uz","title":"Connect","url":"https://oj.uz/problem/view/CEOI06_connect","difficulty":2,"starred":false,"topic":"broken_profile_dp","topics":["broken_profile_dp"],"solved":false},{"id":"codeforces_845f","judge":"Codeforces","title":"Guards In The Storehouse","url":"https://codeforces.com/problemset/problem/845/F","difficulty":2,"starred":false,"topic":"broken_profile_dp","topics":["broken_profile_dp"],"solved":false},{"id":"usaco_949","judge":"USACO","title":"Compound Escape","url":"https://usaco.org/index.php?page=viewproblem2&cpid=949","difficulty":4,"starred":false,"topic":"broken_profile_dp","topics":["broken_profile_dp"],"solved":false},{"id":"csacademy_classic_task","judge":"CS Academy","title":"Classic Task","url":"https://csacademy.com/contest/archive/task/classic-task/","difficulty":1,"starred":true,"topic":"hirschbergs_algorithm","topics":["hirschbergs_algorithm"],"solved":false},{"id":"cf_group_307527j","judge":"Codeforces","title":"Подарок","url":"https://codeforces.com/group/NOwIbqv33y/contest/307527/problem/J","difficulty":1,"starred":true,"topic":"number_of_subsequences_having_product_at_least_k","topics":["number_of_subsequences_having_product_at_least_k","meet_in_the_middle"],"solved":false},{"id":"codechef_seaincr","judge":"CodeChef","title":"Sereja and Increasing subsequence","url":"https://www.codechef.com/DEC16/problems/SEAINCR/","difficulty":1,"starred":true,"topic":"lis_range_query","topics":["lis_range_query"],"solved":false},{"id":"yosupo_static_range_lis_query","judge":"Library Checker","title":"Static Range LIS Query","url":"https://judge.yosupo.jp/problem/static_range_lis_query","difficulty":1,"starred":true,"topic":"lis_range_query","topics":["lis_range_query"],"solved":false},{"id":"loj_184","judge":"LibreOJ","title":"Product of Unit Monge Matrices","url":"https://loj.ac/p/184","difficulty":1,"starred":false,"topic":"lis_range_query","topics":["lis_range_query"],"solved":false},{"id":"cf_gym_101237i","judge":"CF Gym","title":"Form the Maximal Set","url":"https://codeforces.com/gym/101237/problem/I","difficulty":2,"starred":false,"topic":"lis_range_query","topics":["lis_range_query"],"solved":false},{"id":"baekjoon_26164","judge":"Baekjoon","title":"싱싱미역","url":"https://www.acmicpc.net/problem/26164","difficulty":2,"starred":false,"topic":"lis_range_query","topics":["lis_range_query"],"solved":false},{"id":"hackerrank_a_game_of_stones","judge":"HackerRank","title":"Day 1: Game of Stones","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/a-game-of-stones/problem","difficulty":1,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_tower_breakers","judge":"HackerRank","title":"Day 1: Tower Breakers","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/tower-breakers/problem","difficulty":1,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_day_1_a_chessboard_game","judge":"HackerRank","title":"Day 1: A Chessboard Game","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/day-1-a-chessboard-game","difficulty":1,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cses_1729","judge":"CSES","title":"Stick Game","url":"https://cses.fi/problemset/task/1729","difficulty":1,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_day_2_nim_game","judge":"HackerRank","title":"Day 2: Nim Game","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/day-2-nim-game/problem","difficulty":1,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cses_1730","judge":"CSES","title":"Nim Game I","url":"https://cses.fi/problemset/task/1730","difficulty":1,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_misere_nim","judge":"HackerRank","title":"Day 2: Misère Nim","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/misere-nim","difficulty":1,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cses_1098","judge":"CSES","title":"Nim Game II","url":"https://cses.fi/problemset/task/1098","difficulty":1,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"kattis_snim","judge":"Kattis","title":"S-Nim","url":"https://open.kattis.com/problems/snim","difficulty":1,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_nimble","judge":"HackerRank","title":"Day 2: Nimble Game","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/nimble","difficulty":1,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_day_2_poker_nim","judge":"HackerRank","title":"Day 2: Poker Nim","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/day-2-poker-nim","difficulty":1,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_1965a","judge":"Codeforces","title":"Everything Nim","url":"https://codeforces.com/contest/1965/problem/A","difficulty":1,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_tower_breakers_2","judge":"HackerRank","title":"Day 2: Tower Breakers, Revisited!","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/tower-breakers-2/problem","difficulty":1,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_tower_breakers_3","judge":"HackerRank","title":"Day 3: Tower Breakers, Again!","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/tower-breakers-3/problem","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_a_chessboard_game","judge":"HackerRank","title":"Day 3: Chessboard Game, Again!","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/a-chessboard-game/problem","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_digits_square_board","judge":"HackerRank","title":"Day 3: Digits Square Board","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/digits-square-board/problem","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_fun_game","judge":"HackerRank","title":"Day 4: Fun Game","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/fun-game","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_powers_of_two_game","judge":"HackerRank","title":"Day 4: Powers Game","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/powers-of-two-game","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"hackerrank_final_tower_breakers","judge":"HackerRank","title":"Day 5: Tower Breakers - The Final Battle","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/final-tower-breakers/problem","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cses_1099","judge":"CSES","title":"Stair Game","url":"https://cses.fi/problemset/task/1099","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cses_2207","judge":"CSES","title":"Grundy's Game","url":"https://cses.fi/problemset/task/2207","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cf_group_622715d","judge":"Codeforces","title":"Temporal Paradox","url":"https://codeforces.com/group/Rilx5irOux/contest/622715/problem/D","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codechef_fdivgame","judge":"CodeChef","title":"Floor Division Game","url":"https://www.codechef.com/problems/FDIVGAME","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cses_2208","judge":"CSES","title":"Another Game","url":"https://cses.fi/problemset/task/2208","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"uva_1482","judge":"UVa","title":"Playing With Stones","url":"https://vjudge.net/problem/UVA-1482","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_305e","judge":"Codeforces","title":"Playing with String","url":"https://codeforces.com/contest/305/problem/E","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"atcoder_arc168_b","judge":"AtCoder","title":"Arbitrary Nim","url":"https://atcoder.jp/contests/arc168/tasks/arc168_b","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"kattis_cuboidslicinggame","judge":"Kattis","title":"Cuboid Slicing Game","url":"https://open.kattis.com/problems/cuboidslicinggame","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cf_gym_101908b","judge":"CF Gym","title":"Marbles","url":"https://codeforces.com/gym/101908/problem/B","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"spoj_matgame","judge":"SPOJ","title":"Matrix Game","url":"https://www.spoj.com/problems/MATGAME/","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"timus_1465","judge":"Timus","title":"Pawn Game","url":"https://acm.timus.ru/problem.aspx?space=1&num=1465","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cf_gym_100500e","judge":"CF Gym","title":"IBM Chill Zone","url":"https://codeforces.com/gym/100500/problem/E","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_812e","judge":"Codeforces","title":"Sagheer and Apple Tree","url":"https://codeforces.com/contest/812/problem/E","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_768e","judge":"Codeforces","title":"Game of Stones","url":"https://codeforces.com/problemset/problem/768/E","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_850c","judge":"Codeforces","title":"Arpa and a game with Mojtaba","url":"https://codeforces.com/contest/850/problem/C","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"atcoder_abc206_f","judge":"AtCoder","title":"Interval Game 2","url":"https://atcoder.jp/contests/abc206/tasks/abc206_f","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codechef_astrgame","judge":"CodeChef","title":"A String Game","url":"https://www.codechef.com/problems/ASTRGAME","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_2004e","judge":"Codeforces","title":"Not a Nim Problem","url":"https://codeforces.com/contest/2004/problem/E","difficulty":2,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"spoj_blbono","judge":"SPOJ","title":"Bono v3","url":"https://www.spoj.com/problems/BLBONO/","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"cf_group_626784j","judge":"Codeforces","title":"Hagras Game","url":"https://codeforces.com/group/Rilx5irOux/contest/626784/problem/J","difficulty":2,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"atcoder_arc091_d","judge":"AtCoder","title":"Strange Nim","url":"https://atcoder.jp/contests/arc091/tasks/arc091_d","difficulty":3,"starred":true,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_1312f","judge":"Codeforces","title":"Attack on Red Kingdom","url":"https://codeforces.com/contest/1312/problem/F","difficulty":3,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_1451f","judge":"Codeforces","title":"Nullify The Matrix","url":"https://codeforces.com/contest/1451/problem/F","difficulty":3,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_2032f","judge":"Codeforces","title":"Peanuts","url":"https://codeforces.com/contest/2032/problem/F","difficulty":3,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"codeforces_2043f","judge":"Codeforces","title":"Nim","url":"https://codeforces.com/contest/2043/problem/F","difficulty":3,"starred":false,"topic":"grundy_number","topics":["grundy_number"],"solved":false},{"id":"yosupo_nim_product_64","judge":"Library Checker","title":"Nim Product","url":"https://judge.yosupo.jp/problem/nim_product_64","difficulty":1,"starred":true,"topic":"nimber","topics":["nimber"],"solved":false},{"id":"codeforces_1310f","judge":"Codeforces","title":"Bad Cryptography","url":"https://codeforces.com/contest/1310/problem/F","difficulty":3,"starred":true,"topic":"nimber","topics":["nimber"],"solved":false},{"id":"hackerrank_deforestation","judge":"HackerRank","title":"Day 5: Deforestation","url":"https://www.hackerrank.com/contests/5-days-of-game-theory/challenges/deforestation/problem","difficulty":1,"starred":true,"topic":"green_hackenbush_on_trees_and_graphs","topics":["green_hackenbush_on_trees_and_graphs"],"solved":false},{"id":"atcoder_agc017_d","judge":"AtCoder","title":"Game on Tree","url":"https://atcoder.jp/contests/agc017/tasks/agc017_d","difficulty":1,"starred":true,"topic":"green_hackenbush_on_trees_and_graphs","topics":["green_hackenbush_on_trees_and_graphs"],"solved":false},{"id":"spoj_pt07a","judge":"SPOJ","title":"Play with a Tree","url":"https://www.spoj.com/PT07/problems/PT07A/","difficulty":1,"starred":false,"topic":"green_hackenbush_on_trees_and_graphs","topics":["green_hackenbush_on_trees_and_graphs"],"solved":false},{"id":"codechef_amr16j","judge":"CodeChef","title":"Bob vs ATM","url":"https://www.codechef.com/AMR16MOS/problems/AMR16J","difficulty":1,"starred":false,"topic":"green_hackenbush_on_trees_and_graphs","topics":["green_hackenbush_on_trees_and_graphs"],"solved":false},{"id":"lightoj_game_of_cs","judge":"LightOJ","title":"Game of CS","url":"https://lightoj.com/problem/game-of-cs","difficulty":2,"starred":false,"topic":"green_hackenbush_on_trees_and_graphs","topics":["green_hackenbush_on_trees_and_graphs"],"solved":false},{"id":"uva_3184","judge":"UVa","title":"Game of CS","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3184","difficulty":2,"starred":false,"topic":"green_hackenbush_on_trees_and_graphs","topics":["green_hackenbush_on_trees_and_graphs"],"solved":false},{"id":"codechef_gerald08","judge":"CodeChef","title":"Chef and Tree Game","url":"https://www.codechef.com/problems/GERALD08","difficulty":2,"starred":true,"topic":"blue_red_hackenbush","topics":["blue_red_hackenbush"],"solved":false},{"id":"leetcode_cat_and_mouse","judge":"LeetCode","title":"Cat and Mouse","url":"https://leetcode.com/problems/cat-and-mouse/","difficulty":2,"starred":false,"topic":"games_on_arbitrary_graphs","topics":["games_on_arbitrary_graphs"],"solved":false},{"id":"scribd_ruet_iupc_2022c","judge":"Scribd","title":"Some Game","url":"https://www.scribd.com/document/637040478/RUET-IUPC-2022-Problemset","difficulty":2,"starred":true,"topic":"alpha_beta_pruning","topics":["alpha_beta_pruning"],"solved":false},{"id":"uva_11854","judge":"UVa","title":"Egypt","url":"https://vjudge.net/problem/UVA-11854","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_11936","judge":"UVa","title":"The Lazy Lumberjacks","url":"https://vjudge.net/problem/UVA-11936","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_12578","judge":"UVa","title":"10:6:2","url":"https://vjudge.net/problem/UVA-12578","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_1022","judge":"LightOJ","title":"Circle in Square","url":"https://vjudge.net/problem/LightOJ-1022","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_11455","judge":"UVa","title":"Behold my quadrangle","url":"https://vjudge.net/problem/UVA-11455","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_10221","judge":"UVa","title":"Satellites","url":"https://vjudge.net/problem/UVA-10221","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_476","judge":"UVa","title":"Points in Figures: Rectangles","url":"https://vjudge.net/problem/UVA-476","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_477","judge":"UVa","title":"Points in Figures: Rectangles and Circles","url":"https://vjudge.net/problem/UVA-477","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_11909","judge":"UVa","title":"Soya Milk","url":"https://vjudge.net/problem/UVA-11909","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_11579","judge":"UVa","title":"Triangle Trouble","url":"https://vjudge.net/problem/UVA-11579","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_1043","judge":"LightOJ","title":"Triangle Partitioning","url":"https://vjudge.net/problem/LightOJ-1043","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_1062","judge":"LightOJ","title":"Crossed Ladders","url":"https://vjudge.net/problem/LightOJ-1062","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"spoj_circle_e","judge":"SPOJ","title":"Three Circle Problem (EASY)","url":"https://www.spoj.com/problems/CIRCLE_E/","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_1388","judge":"UVa","title":"Graveyard","url":"https://vjudge.net/problem/UVA-1388","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_11479","judge":"UVa","title":"Is this the easiest problem?","url":"https://vjudge.net/problem/UVA-11479","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_10347","judge":"UVa","title":"Medians","url":"https://vjudge.net/problem/UVA-10347","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_1178","judge":"LightOJ","title":"Trapezium","url":"https://vjudge.net/problem/LightOJ-1178","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_10195","judge":"UVa","title":"The Knights Of The Round Table","url":"https://vjudge.net/problem/UVA-10195","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_how_cow","judge":"LightOJ","title":"How Cow","url":"https://lightoj.com/problem/how-cow","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_1305","judge":"LightOJ","title":"Area of a Parallelogram","url":"https://vjudge.net/problem/LightOJ-1305","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_juice_in_the_glass","judge":"LightOJ","title":"Juice in the Glass","url":"https://lightoj.com/problem/juice-in-the-glass","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"spoj_unir","judge":"SPOJ","title":"Universal Radius","url":"https://www.spoj.com/problems/UNIR/","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_calm_down","judge":"LightOJ","title":"Calm Down","url":"https://lightoj.com/problem/calm-down","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_olympics","judge":"LightOJ","title":"Olympics","url":"https://lightoj.com/problem/olympics","difficulty":1,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"gym_102267h","judge":"CF Gym","title":"Circle of Polygon","url":"https://vjudge.net/problem/Gym-102267H","difficulty":1,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_10991","judge":"UVa","title":"Region","url":"https://vjudge.net/problem/UVA-10991","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_10283","judge":"UVa","title":"The Kissing Circles","url":"https://vjudge.net/problem/UVA-10283","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_10432","judge":"UVa","title":"Polygon Inside A Circle","url":"https://vjudge.net/problem/UVA-10432","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_1331","judge":"LightOJ","title":"Agent J","url":"https://vjudge.net/problem/LightOJ-1331","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_1433","judge":"LightOJ","title":"Minimum Arc Distance","url":"https://vjudge.net/problem/LightOJ-1433","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_10466","judge":"UVa","title":"How Far?","url":"https://vjudge.net/problem/UVA-10466","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_10287","judge":"UVa","title":"Gifts in a Hexagonal Box","url":"https://vjudge.net/problem/UVA-10287","difficulty":2,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"toph_weird_cake","judge":"Toph","title":"Weird Cake","url":"https://toph.co/p/weird-cake","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"toph_i_scream_you_scream","judge":"Toph","title":"I Scream, You Scream!","url":"https://toph.co/p/i-scream-you-scream","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"toph_hexagonal_packing","judge":"Toph","title":"Hexagonal Packing","url":"https://toph.co/p/hexagonal-packing","difficulty":2,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_parallelogram_counting","judge":"LightOJ","title":"Parallelogram Counting","url":"https://lightoj.com/problem/parallelogram-counting","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_expanding_rods","judge":"LightOJ","title":"Expanding Rods","url":"https://lightoj.com/problem/expanding-rods","difficulty":2,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_intersection_of_cubes","judge":"LightOJ","title":"Intersection of Cubes","url":"https://lightoj.com/problem/intersection-of-cubes","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_kingdom_division","judge":"LightOJ","title":"Kingdom Division","url":"https://lightoj.com/problem/kingdom-division","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_overtake","judge":"LightOJ","title":"Overtake","url":"https://lightoj.com/problem/overtake","difficulty":2,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"uva_10574","judge":"UVa","title":"Counting Rectangles","url":"https://vjudge.net/problem/UVA-10574","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"lightoj_pair_of_touching_circles","judge":"LightOJ","title":"Pair of Touching Circles","url":"https://lightoj.com/problem/pair-of-touching-circles","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["circles_2d","euclidean_geometry"],"solved":false},{"id":"lightoj_trapezium_drawing","judge":"LightOJ","title":"Trapezium Drawing","url":"https://lightoj.com/problem/trapezium-drawing","difficulty":3,"starred":false,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"spoj_maxln","judge":"SPOJ","title":"THE MAX LINES","url":"https://www.spoj.com/problems/MAXLN","difficulty":2,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"cf_gym_102141h","judge":"CF Gym","title":"Triangle Inside Rectangle Inside Pentagon","url":"https://codeforces.com/gym/102141/problem/H","difficulty":3,"starred":true,"topic":"euclidean_geometry","topics":["euclidean_geometry"],"solved":false},{"id":"cses_2189","judge":"CSES","title":"Point Location Test","url":"https://cses.fi/problemset/task/2189","difficulty":1,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"gym_100168l","judge":"CF Gym","title":"Length of vector","url":"https://vjudge.net/problem/Gym-100168L","difficulty":1,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"uva_10242","judge":"UVa","title":"Fourth Point!","url":"https://vjudge.net/problem/UVA-10242","difficulty":1,"starred":false,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"uva_10927","judge":"UVa","title":"Bright Lights","url":"https://vjudge.net/problem/UVA-10927","difficulty":1,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"gym_100168a","judge":"CF Gym","title":"Polar angle of point","url":"https://vjudge.net/problem/Gym-100168A","difficulty":1,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"gym_100168b","judge":"CF Gym","title":"Angle between vectors","url":"https://vjudge.net/problem/Gym-100168B","difficulty":1,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"toph_once_upon_a_time_in_child_hood","judge":"Toph","title":"Once Upon A Time In Child Hood","url":"https://toph.co/p/once-upon-a-time-in-child-hood","difficulty":1,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"yosupo_sort_points_by_argument","judge":"Library Checker","title":"Sort Points by Argument","url":"https://judge.yosupo.jp/problem/sort_points_by_argument","difficulty":1,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"uva_920","judge":"UVa","title":"Sunny Mountains","url":"https://vjudge.net/problem/UVA-920","difficulty":1,"starred":false,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"spoj_chase","judge":"SPOJ","title":"A Chase In WonderLand","url":"https://vjudge.net/problem/SPOJ-CHASE","difficulty":2,"starred":false,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"lightoj_1383","judge":"LightOJ","title":"Underwater Snipers","url":"https://vjudge.net/problem/LightOJ-1383","difficulty":2,"starred":false,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"gym_102361a","judge":"CF Gym","title":"Angle Beats","url":"https://vjudge.net/problem/Gym-102361A","difficulty":2,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"codeforces_1025f","judge":"Codeforces","title":"Disjoint Triangles","url":"https://vjudge.net/problem/CodeForces-1025F","difficulty":2,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"kattis_maxcolinear","judge":"Kattis","title":"Maximum Number of Colinear Points","url":"https://open.kattis.com/problems/maxcolinear","difficulty":2,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"toph_simple","judge":"Toph","title":"Simple","url":"https://toph.co/p/simple","difficulty":1,"starred":false,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"lightoj_closest_distance","judge":"LightOJ","title":"Closest Distance","url":"https://lightoj.com/problem/closest-distance","difficulty":2,"starred":true,"topic":"points_and_vectors_2d","topics":["ternary_search","points_and_vectors_2d"],"solved":false},{"id":"toph_sofdor_ali_and_attack_optimization","judge":"Toph","title":"Sofdor Ali and Attack Optimization","url":"https://toph.co/p/sofdor-ali-and-attack-optimization","difficulty":2,"starred":false,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"yosupo_count_points_in_triangle","judge":"Library Checker","title":"Count Points in Triangles","url":"https://judge.yosupo.jp/problem/count_points_in_triangle","difficulty":3,"starred":true,"topic":"points_and_vectors_2d","topics":["points_and_vectors_2d"],"solved":false},{"id":"gym_100168f","judge":"CF Gym","title":"Distance from a point to a straight line","url":"https://vjudge.net/problem/Gym-100168F","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168e","judge":"CF Gym","title":"Bisector","url":"https://vjudge.net/problem/Gym-100168E","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168i","judge":"CF Gym","title":"Distance from point to line","url":"https://vjudge.net/problem/Gym-100168I","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168g","judge":"CF Gym","title":"Distance from point to line 2","url":"https://vjudge.net/problem/Gym-100168G","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168h","judge":"CF Gym","title":"Distance from a point to a ray","url":"https://vjudge.net/problem/Gym-100168H","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168m","judge":"CF Gym","title":"The equation of the straight line I","url":"https://vjudge.net/problem/Gym-100168M","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168n","judge":"CF Gym","title":"The equation of the straight line II","url":"https://vjudge.net/problem/Gym-100168N","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168o","judge":"CF Gym","title":"Parallel line","url":"https://vjudge.net/problem/Gym-100168O","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168j","judge":"CF Gym","title":"Distance between segments","url":"https://vjudge.net/problem/Gym-100168J","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168k","judge":"CF Gym","title":"Intersection of two lines","url":"https://vjudge.net/problem/Gym-100168K","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168p","judge":"CF Gym","title":"Belonging to a point of straight line","url":"https://vjudge.net/problem/Gym-100168P","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168r","judge":"CF Gym","title":"Belonging of a point to a segment","url":"https://vjudge.net/problem/Gym-100168R","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168q","judge":"CF Gym","title":"Belonging to the point of the ray","url":"https://vjudge.net/problem/Gym-100168Q","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168s","judge":"CF Gym","title":"The position of the points outside the line","url":"https://vjudge.net/problem/Gym-100168S","difficulty":1,"starred":false,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"cses_2190","judge":"CSES","title":"Line Segment Intersection","url":"https://cses.fi/problemset/task/2190","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"kattis_segmentintersection","judge":"Kattis","title":"Line Segment Intersection","url":"https://open.kattis.com/problems/segmentintersection","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"kattis_segmentdistance","judge":"Kattis","title":"Line Segment Distance","url":"https://open.kattis.com/problems/segmentdistance","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"uva_12301","judge":"UVa","title":"An Angular Puzzle","url":"https://vjudge.net/problem/UVA-12301","difficulty":1,"starred":false,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"uva_191","judge":"UVa","title":"Intersection","url":"https://vjudge.net/problem/UVA-191","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"uva_378","judge":"UVa","title":"Intersecting Lines","url":"https://vjudge.net/problem/UVA-378","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"uva_11343","judge":"UVa","title":"Isolated Segments","url":"https://vjudge.net/problem/UVA-11343","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"uva_10902","judge":"UVa","title":"Pick-up Sticks","url":"https://vjudge.net/problem/UVA-10902","difficulty":1,"starred":false,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"uva_858","judge":"UVa","title":"Berry Picking","url":"https://vjudge.net/problem/UVA-858","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"spoj_anttt","judge":"SPOJ","title":"The Ant","url":"https://vjudge.net/problem/SPOJ-ANTTT","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"kattis_birthdaycake","judge":"Kattis","title":"Birthday Cake","url":"https://open.kattis.com/problems/birthdaycake","difficulty":1,"starred":false,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_100168t","judge":"CF Gym","title":"Distance between rays","url":"https://vjudge.net/problem/Gym-100168T","difficulty":2,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"uva_10122","judge":"UVa","title":"Mysterious Mountain","url":"https://vjudge.net/problem/UVA-10122","difficulty":2,"starred":false,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"spoj_litepipe","judge":"SPOJ","title":"GX Light Pipeline Inc","url":"https://vjudge.net/problem/SPOJ-LITEPIPE","difficulty":2,"starred":false,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"ural_1710","judge":"Timus","title":"Boris, You Are Wrong!","url":"https://vjudge.net/problem/URAL-1710","difficulty":2,"starred":false,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"lightoj_1432","judge":"LightOJ","title":"Overlapping Sticks","url":"https://vjudge.net/problem/LightOJ-1432","difficulty":2,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"toph_lfr","judge":"Toph","title":"LFR","url":"https://toph.co/p/lfr","difficulty":1,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"toph_alien_invasion","judge":"Toph","title":"Alien Invasion","url":"https://toph.co/p/alien-invasion","difficulty":2,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"lightoj_laser_shot","judge":"LightOJ","title":"Laser Shot","url":"https://lightoj.com/problem/laser-shot","difficulty":2,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"gym_105170d","judge":"CF Gym","title":"Parallel Lines","url":"https://vjudge.net/problem/Gym-105170D","difficulty":2,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"toph_rectangle_division","judge":"Toph","title":"Rectangle Division","url":"https://toph.co/p/rectangle-division","difficulty":2,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"lightoj_aladdin_and_the_rocky_mountai","judge":"LightOJ","title":"Aladdin and the Rocky Mountains","url":"https://lightoj.com/problem/aladdin-and-the-rocky-mountai","difficulty":3,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"lightoj_farmers_tale","judge":"LightOJ","title":"Farmers' Tale","url":"https://lightoj.com/problem/farmers-tale","difficulty":3,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d","planar_graph_faces"],"solved":false},{"id":"lightoj_race_track","judge":"LightOJ","title":"Race Track","url":"https://lightoj.com/problem/race-track","difficulty":3,"starred":true,"topic":"lines_and_segments_2d","topics":["lines_and_segments_2d"],"solved":false},{"id":"uva_438","judge":"UVa","title":"The Circumference of the Circle","url":"https://vjudge.net/problem/UVA-438","difficulty":1,"starred":true,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"uva_190","judge":"UVa","title":"Circle Through Three Points","url":"https://vjudge.net/problem/UVA-190","difficulty":1,"starred":true,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"uva_11152","judge":"UVa","title":"Colourful Flowers","url":"https://vjudge.net/problem/UVA-11152","difficulty":1,"starred":true,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"codechef_andoor","judge":"CodeChef","title":"A New Door","url":"https://www.codechef.com/problems/ANDOOR","difficulty":1,"starred":true,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"spoj_circint","judge":"SPOJ","title":"Intersecting Circles","url":"https://www.spoj.com/problems/CIRCINT/","difficulty":1,"starred":true,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"lightoj_1118","judge":"LightOJ","title":"Incredible Molecules","url":"https://vjudge.net/problem/LightOJ-1118","difficulty":1,"starred":true,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"spoj_anarc09f","judge":"SPOJ","title":"Air Strike","url":"https://vjudge.net/problem/SPOJ-ANARC09F","difficulty":1,"starred":false,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"uva_1242","judge":"UVa","title":"Rings and Glue","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1242","difficulty":2,"starred":false,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"codeforces_681e","judge":"Codeforces","title":"Runaway to a Shadow","url":"https://codeforces.com/problemset/problem/681/E","difficulty":2,"starred":false,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"cf_gym_100199f","judge":"CF Gym","title":"Get Out!","url":"https://codeforces.com/gym/100199/problem/F","difficulty":2,"starred":false,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"timus_1429","judge":"Timus","title":"Biscuits","url":"https://acm.timus.ru/problem.aspx?space=1&num=1429","difficulty":2,"starred":false,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"codeforces_933c","judge":"Codeforces","title":"A Colourful Prospect","url":"https://codeforces.com/problemset/problem/933/C","difficulty":3,"starred":true,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"poj_3743","judge":"POJ","title":"LL’s cake","url":"https://vjudge.net/problem/POJ-3743","difficulty":3,"starred":true,"topic":"circles_2d","topics":["circles_2d","planar_graph_faces"],"solved":false},{"id":"toph_circle_of_boltu","judge":"Toph","title":"Circle of Boltu","url":"https://toph.co/p/circle-of-boltu","difficulty":1,"starred":false,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"spoj_smpcirc","judge":"SPOJ","title":"Two Circles","url":"https://www.spoj.com/problems/SMPCIRC/","difficulty":1,"starred":true,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"lightoj_the_falling_circle","judge":"LightOJ","title":"The Falling Circle","url":"https://lightoj.com/problem/the-falling-circle","difficulty":3,"starred":true,"topic":"circles_2d","topics":["circles_2d"],"solved":false},{"id":"uva_12304","judge":"UVa","title":"2D Geometry 110 in 1!","url":"https://vjudge.net/problem/UVA-12304","difficulty":2,"starred":true,"topic":"tangent_2d","topics":["tangent_2d"],"solved":false},{"id":"timus_1163","judge":"Timus","title":"Chapaev","url":"https://acm.timus.ru/problem.aspx?space=1&num=1163","difficulty":2,"starred":false,"topic":"tangent_2d","topics":["tangent_2d"],"solved":false},{"id":"codeforces_2c","judge":"Codeforces","title":"Commentator problem","url":"https://codeforces.com/problemset/problem/2/C","difficulty":2,"starred":true,"topic":"circles_of_apollonius_2d","topics":["hill_climbing","circles_of_apollonius_2d"],"solved":false},{"id":"spoj_vcircles","judge":"SPOJ","title":"Area of circles","url":"https://www.spoj.com/problems/VCIRCLES/","difficulty":1,"starred":true,"topic":"circle_union_2d","topics":["circle_union_2d"],"solved":false},{"id":"cf_gym_100443j","judge":"CF Gym","title":"Cleaning the Hallway","url":"https://codeforces.com/gym/100443/problem/J","difficulty":3,"starred":true,"topic":"circle_union_2d","topics":["sweep_line_algorithm","circle_union_2d"],"solved":false},{"id":"cses_2191","judge":"CSES","title":"Polygon Area","url":"https://cses.fi/problemset/task/2191","difficulty":1,"starred":true,"topic":"polygons_2d","topics":["polygons_2d"],"solved":false},{"id":"kattis_polygonarea","judge":"Kattis","title":"Polygon Area","url":"https://open.kattis.com/problems/polygonarea","difficulty":1,"starred":true,"topic":"polygons_2d","topics":["polygons_2d"],"solved":false},{"id":"uva_12300","judge":"UVa","title":"Smallest Regular Polygon","url":"https://vjudge.net/problem/UVA-12300","difficulty":1,"starred":false,"topic":"polygons_2d","topics":["polygons_2d"],"solved":false},{"id":"uva_478","judge":"UVa","title":"Points in Figures: Rectangles, Circles, Triangles","url":"https://vjudge.net/problem/UVA-478","difficulty":1,"starred":false,"topic":"polygons_2d","topics":["polygons_2d"],"solved":false},{"id":"uva_11800","judge":"UVa","title":"Determine the Shape","url":"https://vjudge.net/problem/UVA-11800","difficulty":1,"starred":false,"topic":"polygons_2d","topics":["polygons_2d"],"solved":false},{"id":"gym_101845d","judge":"CF Gym","title":"Divorce","url":"https://vjudge.net/problem/Gym-101845D","difficulty":1,"starred":true,"topic":"polygons_2d","topics":["polygons_2d"],"solved":false},{"id":"kattis_pieceofcake","judge":"Kattis","title":"Piece of Cake","url":"https://vjudge.net/problem/Kattis-pieceofcake","difficulty":2,"starred":true,"topic":"polygons_2d","topics":["polygons_2d"],"solved":false},{"id":"codechef_chefpoly","judge":"CodeChef","title":"Chef and Polygons","url":"https://www.codechef.com/problems/CHEFPOLY","difficulty":3,"starred":false,"topic":"polygons_2d","topics":["polygons_2d"],"solved":false},{"id":"lightoj_drawing_simple_polygon","judge":"LightOJ","title":"Drawing Simple Polygon","url":"https://lightoj.com/problem/drawing-simple-polygon","difficulty":1,"starred":true,"topic":"polygons_2d","topics":["polygons_2d"],"solved":false},{"id":"spoj_stone","judge":"SPOJ","title":"Lifting the Stone","url":"https://www.spoj.com/problems/STONE/","difficulty":1,"starred":false,"topic":"centroid_of_a_polygon_2d","topics":["centroid_of_a_polygon_2d"],"solved":false},{"id":"kattis_crane","judge":"Kattis","title":"Crane Balancing","url":"https://vjudge.net/problem/Kattis-crane","difficulty":2,"starred":true,"topic":"centroid_of_a_polygon_2d","topics":["centroid_of_a_polygon_2d"],"solved":false},{"id":"poj_2420","judge":"POJ","title":"A Star not a Tree?","url":"https://vjudge.net/problem/POJ-2420","difficulty":1,"starred":true,"topic":"geometric_median_2d","topics":["geometric_median_2d"],"solved":false},{"id":"cses_2195","judge":"CSES","title":"Convex Hull","url":"https://cses.fi/problemset/task/2195","difficulty":1,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"kattis_convexhull","judge":"Kattis","title":"Convex Hull","url":"https://open.kattis.com/problems/convexhull","difficulty":1,"starred":false,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"yosupo_static_convex_hull","judge":"Library Checker","title":"Static Convex Hull","url":"https://judge.yosupo.jp/problem/static_convex_hull","difficulty":1,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"lightoj_1203","judge":"LightOJ","title":"Guarding Bananas","url":"https://vjudge.net/problem/LightOJ-1203","difficulty":1,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"uva_109","judge":"UVa","title":"SCUD Busters","url":"https://vjudge.net/problem/UVA-109","difficulty":1,"starred":false,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"uva_10065","judge":"UVa","title":"Useless Tile Packers","url":"https://vjudge.net/problem/UVA-10065","difficulty":1,"starred":false,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"codedrills_palindromic_polygon","judge":"Vjudge","title":"Palindromic Polygon","url":"https://vjudge.net/problem/QOJ-9417","difficulty":1,"starred":false,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"lightoj_1239","judge":"LightOJ","title":"Convex Fence","url":"https://vjudge.net/problem/LightOJ-1239","difficulty":2,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"codechef_dartsegm","judge":"CodeChef","title":"Darts","url":"https://vjudge.net/problem/CodeChef-DARTSEGM","difficulty":2,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"gym_100517k","judge":"CF Gym","title":"Kingdom Division 2","url":"https://vjudge.net/problem/Gym-100517K","difficulty":2,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"timus_1185","judge":"Timus","title":"Wall","url":"https://acm.timus.ru/problem.aspx?space=1&num=1185","difficulty":2,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"kattis_parade","judge":"Kattis","title":"Keep the Parade Safe","url":"https://open.kattis.com/problems/parade","difficulty":2,"starred":false,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"codeforces_1143f","judge":"Codeforces","title":"U2","url":"https://codeforces.com/problemset/problem/1143/F","difficulty":2,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"usaco_382","judge":"USACO","title":"Cow Curling","url":"https://usaco.org/index.php?page=viewproblem2&cpid=382","difficulty":2,"starred":false,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"poj_2079","judge":"POJ","title":"Triangle","url":"https://vjudge.net/problem/POJ-2079","difficulty":2,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d","rotating_calipers"],"solved":false},{"id":"codeforces_1299c","judge":"Codeforces","title":"Water Balance","url":"https://codeforces.com/problemset/problem/1299/C","difficulty":2,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"toph_consephull","judge":"Toph","title":"CONSEPHULL","url":"https://toph.co/p/consephull","difficulty":2,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d","minkowski_sum"],"solved":false},{"id":"toph_towers_of_wadia","judge":"Toph","title":"Towers of Wadia","url":"https://toph.co/p/towers-of-wadia","difficulty":3,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"toph_chop_chop","judge":"Toph","title":"Chop Chop","url":"https://toph.co/p/chop-chop","difficulty":3,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"lightoj_protect_the_mines","judge":"LightOJ","title":"Protect the Mines","url":"https://lightoj.com/problem/protect-the-mines","difficulty":3,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"cf_gym_105884c","judge":"CF Gym","title":"Triangle Trap","url":"https://codeforces.com/gym/105884/problem/C","difficulty":1,"starred":true,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"kattis_kingdomofkittens","judge":"Kattis","title":"Kingdom Of Kittens","url":"https://vjudge.net/problem/Kattis-kingdomofkittens","difficulty":3,"starred":false,"topic":"convex_hull_2d","topics":["convex_hull_2d"],"solved":false},{"id":"atcoder_abc296_g","judge":"AtCoder","title":"Polygon and Points","url":"https://atcoder.jp/contests/abc296/tasks/abc296_g","difficulty":1,"starred":true,"topic":"check_if_point_is_in_convex_2d","topics":["check_if_point_is_in_convex_2d"],"solved":false},{"id":"codeforces_166b","judge":"Codeforces","title":"Polygons","url":"https://codeforces.com/contest/166/problem/B","difficulty":1,"starred":true,"topic":"check_if_point_is_in_convex_2d","topics":["check_if_point_is_in_convex_2d"],"solved":false},{"id":"acmsguru_99999253","judge":"Codeforces","title":"Theodore Roosevelt","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/253","difficulty":1,"starred":true,"topic":"check_if_point_is_in_convex_2d","topics":["check_if_point_is_in_convex_2d"],"solved":false},{"id":"codeforces_55e","judge":"Codeforces","title":"Very simple problem","url":"https://codeforces.com/contest/55/problem/E","difficulty":2,"starred":false,"topic":"check_if_point_is_in_convex_2d","topics":["check_if_point_is_in_convex_2d"],"solved":false},{"id":"codeforces_87e","judge":"Codeforces","title":"Mogohu-Rea Idol","url":"https://codeforces.com/problemset/problem/87/E","difficulty":2,"starred":true,"topic":"check_if_point_is_in_convex_2d","topics":["minkowski_sum","check_if_point_is_in_convex_2d"],"solved":false},{"id":"cses_2192","judge":"CSES","title":"Point in Polygon","url":"https://cses.fi/problemset/task/2192","difficulty":1,"starred":false,"topic":"winding_number_2d","topics":["winding_number_2d"],"solved":false},{"id":"kattis_pointinpolygon","judge":"Kattis","title":"Point in Polygon","url":"https://open.kattis.com/problems/pointinpolygon","difficulty":1,"starred":false,"topic":"winding_number_2d","topics":["winding_number_2d"],"solved":false},{"id":"timus_1599","judge":"Timus","title":"Winding Number","url":"https://acm.timus.ru/problem.aspx?space=1&num=1599","difficulty":1,"starred":true,"topic":"winding_number_2d","topics":["winding_number_2d"],"solved":false},{"id":"kattis_roberthood","judge":"Kattis","title":"Robert Hood","url":"https://open.kattis.com/problems/roberthood","difficulty":1,"starred":true,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"uva_12311","judge":"UVa","title":"All-Pair Farthest Points","url":"https://vjudge.net/problem/UVA-12311","difficulty":1,"starred":true,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"yosupo_furthest_pair","judge":"Library Checker","title":"Furthest Pair of Points","url":"https://judge.yosupo.jp/problem/furthest_pair","difficulty":1,"starred":true,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"uva_1111","judge":"UVa","title":"Trash Removal","url":"https://vjudge.net/problem/UVA-1111","difficulty":1,"starred":true,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"spoj_tfoss","judge":"SPOJ","title":"Fossil in the Ice","url":"https://www.spoj.com/problems/TFOSS/","difficulty":1,"starred":true,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"kattis_fenceortho","judge":"Kattis","title":"Fence Orthogonality","url":"https://open.kattis.com/problems/fenceortho","difficulty":1,"starred":true,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"kattis_largesttriangle","judge":"Kattis","title":"Largest Triangle","url":"https://open.kattis.com/problems/largesttriangle","difficulty":1,"starred":false,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"uva_12307","judge":"UVa","title":"Smallest Enclosing Rectangle","url":"https://vjudge.net/problem/UVA-12307","difficulty":1,"starred":true,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"uva_10173","judge":"UVa","title":"Smallest Bounding Rectangle","url":"https://vjudge.net/problem/UVA-10173","difficulty":1,"starred":true,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"cf_gym_101635k","judge":"CF Gym","title":"Blowing Candles","url":"https://codeforces.com/gym/101635/problem/K","difficulty":1,"starred":true,"topic":"rotating_calipers","topics":["rotating_calipers"],"solved":false},{"id":"poj_3608","judge":"POJ","title":"Bridge Across Islands","url":"https://vjudge.net/problem/POJ-3608","difficulty":2,"starred":true,"topic":"rotating_calipers","topics":["dist_from_point_to_polygon_2d","rotating_calipers"],"solved":false},{"id":"atcoder_abc151_f","judge":"AtCoder","title":"Enclose All","url":"https://atcoder.jp/contests/abc151/tasks/abc151_f","difficulty":1,"starred":true,"topic":"minimum_enclosing_circle_2d","topics":["minimum_enclosing_circle_2d"],"solved":false},{"id":"spoj_qcj4","judge":"SPOJ","title":"Minimum Diameter Circle","url":"https://www.spoj.com/problems/QCJ4/","difficulty":1,"starred":true,"topic":"minimum_enclosing_circle_2d","topics":["minimum_enclosing_circle_2d"],"solved":false},{"id":"spoj_aliens","judge":"SPOJ","title":"Aliens","url":"https://www.spoj.com/problems/ALIENS/","difficulty":1,"starred":false,"topic":"minimum_enclosing_circle_2d","topics":["minimum_enclosing_circle_2d"],"solved":false},{"id":"gym_102006i","judge":"CF Gym","title":"Rise of the Robots","url":"https://vjudge.net/problem/Gym-102006I","difficulty":1,"starred":true,"topic":"minimum_enclosing_circle_2d","topics":["minimum_enclosing_circle_2d"],"solved":false},{"id":"kattis_weirdflecksbutok","judge":"Kattis","title":"Weird Flecks, But OK","url":"https://open.kattis.com/problems/weirdflecksbutok","difficulty":1,"starred":false,"topic":"minimum_enclosing_circle_2d","topics":["minimum_enclosing_circle_2d"],"solved":false},{"id":"toph_n_ta_gon_has_a_problem","judge":"Toph","title":"N-Ta-Gon Has a Problem","url":"https://toph.co/p/n-ta-gon-has-a-problem","difficulty":2,"starred":false,"topic":"minimum_enclosing_circle_2d","topics":["minimum_enclosing_circle_2d","hill_climbing"],"solved":false},{"id":"codeforces_598f","judge":"Codeforces","title":"Cut Length","url":"https://codeforces.com/contest/598/problem/F","difficulty":1,"starred":true,"topic":"polygon_line_intersection_2d","topics":["polygon_line_intersection_2d"],"solved":false},{"id":"kattis_airport","judge":"Kattis","title":"Airport Construction","url":"https://vjudge.net/problem/Kattis-airport","difficulty":2,"starred":true,"topic":"polygon_line_intersection_2d","topics":["polygon_line_intersection_2d"],"solved":false},{"id":"atcoder_abc356_g","judge":"AtCoder","title":"Freestyle","url":"https://atcoder.jp/contests/abc356/tasks/abc356_g","difficulty":3,"starred":true,"topic":"polygon_line_intersection_2d","topics":["polygon_line_intersection_2d"],"solved":false},{"id":"toph_cover_the_points","judge":"Toph","title":"Cover the Points","url":"https://toph.co/p/cover-the-points","difficulty":1,"starred":true,"topic":"tangents_from_point_to_polygon_2d","topics":["tangents_from_point_to_polygon_2d"],"solved":false},{"id":"cf_gym_101370d","judge":"CF Gym","title":"Circular Island","url":"https://codeforces.com/gym/101370/problem/D","difficulty":3,"starred":true,"topic":"tangents_from_point_to_polygon_2d","topics":["tangents_from_point_to_polygon_2d"],"solved":false},{"id":"cf_gym_101201e","judge":"CF Gym","title":"Enclosure","url":"https://codeforces.com/gym/101201/problem/E","difficulty":3,"starred":true,"topic":"tangents_from_point_to_polygon_2d","topics":["tangents_from_point_to_polygon_2d"],"solved":false},{"id":"codeforces_1906d","judge":"Codeforces","title":"Spaceship Exploration","url":"https://codeforces.com/contest/1906/problem/D","difficulty":3,"starred":false,"topic":"tangents_from_point_to_polygon_2d","topics":["tangents_from_point_to_polygon_2d"],"solved":false},{"id":"codeforces_107e","judge":"Codeforces","title":"Darts","url":"https://codeforces.com/contest/107/problem/E","difficulty":1,"starred":true,"topic":"polygon_union_2d","topics":["polygon_union_2d","vertical_decomposition"],"solved":false},{"id":"spoj_backtpol","judge":"SPOJ","title":"Back To The Polygon","url":"https://www.spoj.com/problems/BACKTPOL/","difficulty":2,"starred":false,"topic":"triangulation_2d","topics":["triangulation_2d"],"solved":false},{"id":"codeforces_497d","judge":"Codeforces","title":"Gears","url":"https://codeforces.com/contest/497/problem/D","difficulty":3,"starred":true,"topic":"triangulation_2d","topics":["triangulation_2d","minkowski_sum","polygon_circle_intersection_2d"],"solved":false},{"id":"poj_1981","judge":"POJ","title":"Circle and Points","url":"http://poj.org/problem?id=1981","difficulty":1,"starred":true,"topic":"maximum_circle_cover_2d","topics":["maximum_circle_cover_2d"],"solved":false},{"id":"codechef_chefcirc","judge":"CodeChef","title":"Chef and Circle","url":"https://www.codechef.com/JAN17/problems/CHEFCIRC","difficulty":2,"starred":true,"topic":"maximum_circle_cover_2d","topics":["maximum_circle_cover_2d","sweep_line_algorithm"],"solved":false},{"id":"codechef_inf16l","judge":"CodeChef","title":"WiFi Expenses","url":"https://vjudge.net/problem/CodeChef-INF16L","difficulty":2,"starred":true,"topic":"maximum_circle_cover_2d","topics":["maximum_circle_cover_2d","sweep_line_algorithm"],"solved":false},{"id":"poj_3525","judge":"POJ","title":"Most Distant Point from the Sea","url":"https://vjudge.net/problem/POJ-3525","difficulty":1,"starred":false,"topic":"maximum_inscribed_circle_2d","topics":["maximum_inscribed_circle_2d","half_plane_intersection"],"solved":false},{"id":"baekjoon_3903","judge":"Baekjoon","title":"제주도","url":"https://www.acmicpc.net/problem/3903","difficulty":1,"starred":false,"topic":"maximum_inscribed_circle_2d","topics":["half_plane_intersection","maximum_inscribed_circle_2d"],"solved":false},{"id":"lightoj_intersection_between_circle_a","judge":"LightOJ","title":"Intersection between Circle and Rectangle","url":"https://lightoj.com/problem/intersection-between-circle-a","difficulty":1,"starred":true,"topic":"polygon_circle_intersection_2d","topics":["polygon_circle_intersection_2d"],"solved":false},{"id":"lightoj_1358","judge":"LightOJ","title":"Fukushima Nuclear Blast","url":"https://vjudge.net/problem/LightOJ-1358","difficulty":1,"starred":true,"topic":"polygon_circle_intersection_2d","topics":["polygon_circle_intersection_2d"],"solved":false},{"id":"codechef_areafigr","judge":"CodeChef","title":"Area of an amazing figure","url":"https://www.codechef.com/CHN17ROL/problems/AREAFIGR","difficulty":3,"starred":true,"topic":"polygon_circle_intersection_2d","topics":["polygon_circle_intersection_2d"],"solved":false},{"id":"gym_101208j","judge":"CF Gym","title":"Pollution Solution","url":"https://vjudge.net/problem/Gym-101208J","difficulty":1,"starred":true,"topic":"polygon_circle_intersection_2d","topics":["polygon_circle_intersection_2d"],"solved":false},{"id":"cf_gym_101158j","judge":"CF Gym","title":"Cover the Polygon with Your Disk","url":"https://codeforces.com/gym/101158/problem/J","difficulty":3,"starred":false,"topic":"polygon_circle_intersection_2d","topics":["polygon_circle_intersection_2d"],"solved":false},{"id":"poj_3129","judge":"POJ","title":"How I Wonder What You Are!","url":"https://vjudge.net/problem/POJ-3129","difficulty":1,"starred":true,"topic":"points_and_vectors_3d","topics":["points_and_vectors_3d"],"solved":false},{"id":"codeforces_18a","judge":"Codeforces","title":"Triangle","url":"https://codeforces.com/problemset/problem/18/A","difficulty":1,"starred":true,"topic":"points_and_vectors_3d","topics":["points_and_vectors_3d"],"solved":false},{"id":"uva_12303","judge":"UVa","title":"Composite Transformations","url":"https://vjudge.net/problem/UVA-12303","difficulty":2,"starred":true,"topic":"planes_3d","topics":["planes_3d"],"solved":false},{"id":"toph_bikpik_colony","judge":"Toph","title":"Bikpik Colony","url":"https://toph.co/p/bikpik-colony","difficulty":3,"starred":true,"topic":"plane_based_coordinate_system_3d","topics":["plane_based_coordinate_system_3d"],"solved":false},{"id":"kattis_starsinacan","judge":"Kattis","title":"Stars in a Can","url":"https://naipc17.kattis.com/contests/naipc17/problems/starsinacan","difficulty":3,"starred":true,"topic":"plane_based_coordinate_system_3d","topics":["plane_based_coordinate_system_3d","convex_hull_3d"],"solved":false},{"id":"uva_1469","judge":"UVa","title":"Ardenia","url":"https://vjudge.net/problem/UVA-1469","difficulty":1,"starred":true,"topic":"lines_3d","topics":["lines_3d"],"solved":false},{"id":"uva_11836","judge":"UVa","title":"Star War","url":"https://vjudge.net/problem/UVA-11836","difficulty":2,"starred":true,"topic":"lines_3d","topics":["lines_3d"],"solved":false},{"id":"uva_10794","judge":"UVa","title":"The Deadly Olympic Returns!!!","url":"https://vjudge.net/problem/UVA-10794","difficulty":2,"starred":false,"topic":"lines_3d","topics":["lines_3d"],"solved":false},{"id":"codechef_circles","judge":"CodeChef","title":"Entangled Circles","url":"https://vjudge.net/problem/CodeChef-CIRCLES","difficulty":3,"starred":true,"topic":"lines_3d","topics":["lines_3d"],"solved":false},{"id":"uva_11275","judge":"UVa","title":"3D Triangles","url":"https://vjudge.net/problem/UVA-11275","difficulty":1,"starred":true,"topic":"distance_from_triangle_to_triangle_3d","topics":["distance_from_triangle_to_triangle_3d"],"solved":false},{"id":"cf_gym_102040i","judge":"CF Gym","title":"Triangles","url":"https://codeforces.com/gym/102040/problem/I","difficulty":1,"starred":true,"topic":"distance_from_triangle_to_triangle_3d","topics":["distance_from_triangle_to_triangle_3d"],"solved":false},{"id":"uva_1100","judge":"UVa","title":"Paperweight","url":"https://vjudge.net/problem/UVA-1100","difficulty":3,"starred":false,"topic":"distance_from_triangle_to_triangle_3d","topics":["distance_from_triangle_to_triangle_3d"],"solved":false},{"id":"lightoj_der_stern","judge":"LightOJ","title":"Der Stern","url":"https://lightoj.com/problem/der-stern","difficulty":2,"starred":true,"topic":"spheres_3d","topics":["spheres_3d"],"solved":false},{"id":"uva_13281","judge":"UVa","title":"Bermuda Polygon","url":"https://vjudge.net/problem/UVA-13281","difficulty":2,"starred":true,"topic":"spheres_3d","topics":["spheres_3d"],"solved":false},{"id":"kattis_cheese","judge":"Kattis","title":"Cutting Cheese","url":"https://vjudge.net/problem/Kattis-cheese","difficulty":2,"starred":true,"topic":"spheres_3d","topics":["spheres_3d"],"solved":false},{"id":"toph_minimizing_sphere","judge":"Toph","title":"Minimizing Sphere","url":"https://toph.co/p/minimizing-sphere","difficulty":1,"starred":true,"topic":"minimum_enclosing_sphere_3d","topics":["minimum_enclosing_sphere_3d"],"solved":false},{"id":"codeforces_106e","judge":"Codeforces","title":"Space Rescuers","url":"https://codeforces.com/problemset/problem/106/E","difficulty":1,"starred":true,"topic":"minimum_enclosing_sphere_3d","topics":["minimum_enclosing_sphere_3d","hill_climbing"],"solved":false},{"id":"lightoj_pyramid","judge":"LightOJ","title":"Pyramid","url":"https://lightoj.com/problem/pyramid","difficulty":1,"starred":false,"topic":"polyhedron_3d","topics":["polyhedron_3d","ternary_search"],"solved":false},{"id":"hdu_4617","judge":"HDU","title":"Weapon","url":"https://vjudge.net/problem/HDU-4617","difficulty":2,"starred":false,"topic":"polyhedron_3d","topics":["polyhedron_3d"],"solved":false},{"id":"uva_11887","judge":"UVa","title":"Tetrahedrons and Spheres","url":"https://vjudge.net/problem/UVA-11887","difficulty":4,"starred":false,"topic":"polyhedron_3d","topics":["polyhedron_3d"],"solved":false},{"id":"hdu_3662","judge":"HDU","title":"3D Convex Hull","url":"https://vjudge.net/problem/HDU-3662","difficulty":1,"starred":true,"topic":"convex_hull_3d","topics":["convex_hull_3d"],"solved":false},{"id":"spoj_ch3d","judge":"SPOJ","title":"Convex Hull 3D","url":"https://www.spoj.com/problems/CH3D/","difficulty":1,"starred":false,"topic":"convex_hull_3d","topics":["convex_hull_3d"],"solved":false},{"id":"poj_3528","judge":"POJ","title":"Ultimate Weapon","url":"https://vjudge.net/problem/POJ-3528","difficulty":1,"starred":false,"topic":"convex_hull_3d","topics":["convex_hull_3d"],"solved":false},{"id":"poj_3862","judge":"POJ","title":"Asteroids","url":"https://vjudge.net/problem/POJ-3862","difficulty":2,"starred":true,"topic":"convex_hull_3d","topics":["convex_hull_3d"],"solved":false},{"id":"dmoj_cco08p6","judge":"DMOJ","title":"Landing","url":"https://dmoj.ca/problem/cco08p6","difficulty":1,"starred":true,"topic":"delaunay_triangulation","topics":["delaunay_triangulation"],"solved":false},{"id":"timus_1520","judge":"Timus","title":"Empire Strikes Back","url":"https://acm.timus.ru/problem.aspx?space=1&num=1520","difficulty":2,"starred":false,"topic":"delaunay_triangulation","topics":["delaunay_triangulation"],"solved":false},{"id":"timus_1504","judge":"Timus","title":"Good Manners","url":"https://acm.timus.ru/problem.aspx?space=1&num=1504","difficulty":2,"starred":false,"topic":"delaunay_triangulation","topics":["delaunay_triangulation"],"solved":false},{"id":"kattis_pandapreserve","judge":"Kattis","title":"Panda Preserve","url":"https://icpc.kattis.com/problems/pandapreserve","difficulty":3,"starred":true,"topic":"delaunay_triangulation","topics":["delaunay_triangulation"],"solved":false},{"id":"poj_1474","judge":"POJ","title":"Video Surveillance","url":"https://vjudge.net/problem/POJ-1474","difficulty":1,"starred":true,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"cf_gym_100952j","judge":"CF Gym","title":"Polygons Intersection","url":"https://codeforces.com/gym/100952/problem/J","difficulty":1,"starred":true,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"codechef_allpoly","judge":"CodeChef","title":"Defend the Recipe","url":"https://www.codechef.com/problems/ALLPOLY","difficulty":1,"starred":true,"topic":"half_plane_intersection","topics":["half_plane_intersection","dynamic_half_plane_intersection"],"solved":false},{"id":"poj_2451","judge":"POJ","title":"Uyuw's Concert","url":"https://vjudge.net/problem/POJ-2451","difficulty":1,"starred":true,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"codechef_chn02","judge":"CodeChef","title":"Animesh decides to settle down","url":"https://www.codechef.com/problems/CHN02","difficulty":1,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"poj_3335","judge":"POJ","title":"Rotating Scoreboard","url":"http://poj.org/problem?id=3335","difficulty":1,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"poj_3130","judge":"POJ","title":"How I Mathematician Wonder What You Are!","url":"http://poj.org/problem?id=3130","difficulty":1,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"poj_1279","judge":"POJ","title":"Art Gallery","url":"http://poj.org/problem?id=1279","difficulty":1,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"uva_137","judge":"UVa","title":"Polygons","url":"https://vjudge.net/problem/UVA-137","difficulty":1,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"kattis_domes","judge":"Kattis","title":"Domes","url":"https://vjudge.net/problem/Kattis-domes","difficulty":1,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"cf_gym_105973e","judge":"CF Gym","title":"The Perfect Spider Web","url":"https://codeforces.com/gym/105973/problem/E","difficulty":2,"starred":true,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"poj_3384","judge":"POJ","title":"Feng Shui","url":"http://poj.org/problem?id=3384","difficulty":2,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"cf_gym_104736h","judge":"CF Gym","title":"Health in Hazard","url":"https://codeforces.com/gym/104736/problem/H","difficulty":2,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"poj_1755","judge":"POJ","title":"Triathlon","url":"http://poj.org/problem?id=1755","difficulty":3,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"dmoj_ccoprep3p3","judge":"DMOJ","title":"Arrow","url":"https://dmoj.ca/problem/ccoprep3p3","difficulty":3,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"poj_3968","judge":"POJ","title":"Jungle Outpost","url":"http://poj.org/problem?id=3968","difficulty":3,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"eolymp_11100","judge":"Eolymp","title":"(Almost) Fair Cake-Cutting","url":"https://basecamp.eolymp.com/en/problems/11100","difficulty":4,"starred":false,"topic":"half_plane_intersection","topics":["half_plane_intersection"],"solved":false},{"id":"codeforces_1195f","judge":"Codeforces","title":"Geometers Anonymous Club","url":"https://codeforces.com/contest/1195/problem/F","difficulty":2,"starred":true,"topic":"minkowski_sum","topics":["minkowski_sum"],"solved":false},{"id":"openj_bailian_3851","judge":"Vjudge","title":"Bridge Across Islands","url":"https://vjudge.net/problem/OpenJ_Bailian-3851","difficulty":1,"starred":false,"topic":"minkowski_sum","topics":["minkowski_sum"],"solved":false},{"id":"timus_1894","judge":"Timus","title":"Non-Flying Weather","url":"https://acm.timus.ru/problem.aspx?space=1&num=1894","difficulty":2,"starred":true,"topic":"minkowski_sum","topics":["minkowski_sum"],"solved":false},{"id":"toph_rotation_dilemma","judge":"Toph","title":"Rotation Dilemma","url":"https://toph.co/p/rotation-dilemma","difficulty":2,"starred":true,"topic":"minkowski_sum","topics":["minkowski_sum"],"solved":false},{"id":"cf_gym_104252g","judge":"CF Gym","title":"Gravitational Wave Detector","url":"https://codeforces.com/gym/104252/problem/G","difficulty":2,"starred":true,"topic":"minkowski_sum","topics":["minkowski_sum"],"solved":false},{"id":"yosupo_convex_layers","judge":"Library Checker","title":"Convex Layers","url":"https://judge.yosupo.jp/problem/convex_layers","difficulty":1,"starred":true,"topic":"onion_decomposition","topics":["onion_decomposition"],"solved":false},{"id":"codeforces_1158d","judge":"Codeforces","title":"Winding polygonal line","url":"https://codeforces.com/problemset/problem/1158/D","difficulty":2,"starred":false,"topic":"onion_decomposition","topics":["onion_decomposition"],"solved":false},{"id":"codeforces_1599d","judge":"Codeforces","title":"Bubble Popping","url":"https://codeforces.com/contest/1599/problem/D","difficulty":3,"starred":false,"topic":"onion_decomposition","topics":["onion_decomposition"],"solved":false},{"id":"cses_2193","judge":"CSES","title":"Polygon Lattice Points","url":"https://cses.fi/problemset/task/2193","difficulty":1,"starred":true,"topic":"picks_theorem","topics":["picks_theorem"],"solved":false},{"id":"lightoj_trees_on_my_island","judge":"LightOJ","title":"Trees on My Island","url":"https://lightoj.com/problem/trees-on-my-island","difficulty":1,"starred":true,"topic":"picks_theorem","topics":["picks_theorem"],"solved":false},{"id":"cf_gym_101161d","judge":"CF Gym","title":"Find C","url":"https://codeforces.com/gym/101161/problem/D","difficulty":2,"starred":true,"topic":"picks_theorem","topics":["picks_theorem"],"solved":false},{"id":"gym_101982f","judge":"CF Gym","title":"Rectangles","url":"https://vjudge.net/problem/Gym-101982F","difficulty":1,"starred":true,"topic":"sweep_line_algorithm","topics":["rectangle_union","sweep_line_algorithm"],"solved":false},{"id":"cses_1740","judge":"CSES","title":"Intersection Points","url":"https://cses.fi/problemset/task/1740","difficulty":1,"starred":true,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"kattis_closestpair2","judge":"Kattis","title":"Closest Pair","url":"https://open.kattis.com/problems/closestpair2","difficulty":1,"starred":true,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm","closest_pair_of_points"],"solved":false},{"id":"gym_101987a","judge":"CF Gym","title":"Circuits","url":"https://vjudge.net/problem/Gym-101987A","difficulty":1,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"usaco_227","judge":"USACO","title":"Square Overlap","url":"https://usaco.org/index.php?page=viewproblem2&cpid=227","difficulty":1,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"uva_4376","judge":"UVa","title":"Balloon","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=4376","difficulty":1,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"cf_gym_104114b","judge":"CF Gym","title":"Birthday Cake","url":"https://codeforces.com/gym/104114/problem/B","difficulty":2,"starred":true,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"usaco_943","judge":"USACO","title":"Cow Steeplechase II","url":"https://usaco.org/index.php?page=viewproblem2&cpid=943","difficulty":2,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"usaco_266","judge":"USACO","title":"Hill Walk","url":"https://usaco.org/index.php?page=viewproblem2&cpid=266","difficulty":2,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"dmoj_ioi03p6","judge":"DMOJ","title":"Seeing the Boundary","url":"https://dmoj.ca/problem/ioi03p6","difficulty":2,"starred":true,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"szkopul_nzscuwz2acepsbkuvcivzrrt","judge":"Szkopuł","title":"Pionek","url":"https://szkopul.edu.pl/problemset/problem/NZSCUwz2ACePsBKuVCIVzrRt/site/?key=statement","difficulty":2,"starred":true,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"uva_4413","judge":"UVa","title":"Hide and seek","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=4413","difficulty":2,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"gym_101242g","judge":"CF Gym","title":"Oil","url":"https://vjudge.net/problem/Gym-101242G","difficulty":2,"starred":true,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"coci17_plahte","judge":"oj.uz","title":"Plahte","url":"https://oj.uz/problem/view/COCI17_plahte","difficulty":3,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"ceoi06_walk","judge":"oj.uz","title":"Walk","url":"https://oj.uz/problem/view/CEOI06_walk","difficulty":3,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"dmoj_apio10p3","judge":"DMOJ","title":"Signaling","url":"https://dmoj.ca/problem/apio10p3","difficulty":3,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"codeforces_1402b","judge":"Codeforces","title":"Roads","url":"https://codeforces.com/contest/1402/problem/B","difficulty":4,"starred":true,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"cf_gym_105505j","judge":"CF Gym","title":"Jigsaw of Shadows","url":"https://codeforces.com/gym/105505/problem/J","difficulty":1,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"codeforces_1666g","judge":"Codeforces","title":"Global Warming","url":"https://codeforces.com/contest/1666/problem/G","difficulty":4,"starred":false,"topic":"sweep_line_algorithm","topics":["sweep_line_algorithm"],"solved":false},{"id":"cses_2194","judge":"CSES","title":"Minimum Euclidean Distance","url":"https://cses.fi/problemset/task/2194","difficulty":1,"starred":true,"topic":"closest_pair_of_points","topics":["closest_pair_of_points"],"solved":false},{"id":"yosupo_closest_pair","judge":"Library Checker","title":"Closest Pair of Points","url":"https://judge.yosupo.jp/problem/closest_pair","difficulty":1,"starred":true,"topic":"closest_pair_of_points","topics":["closest_pair_of_points"],"solved":false},{"id":"uva_10245","judge":"UVa","title":"The Closest Pair Problem","url":"https://vjudge.net/problem/UVA-10245","difficulty":1,"starred":false,"topic":"closest_pair_of_points","topics":["closest_pair_of_points"],"solved":false},{"id":"codeforces_120j","judge":"Codeforces","title":"Minimum Sum","url":"https://codeforces.com/contest/120/problem/J","difficulty":2,"starred":false,"topic":"closest_pair_of_points","topics":["closest_pair_of_points"],"solved":false},{"id":"spoj_closest","judge":"SPOJ","title":"Closest Triplet","url":"https://www.spoj.com/problems/CLOSEST/","difficulty":2,"starred":true,"topic":"closest_pair_of_points","topics":["closest_pair_of_points"],"solved":false},{"id":"timus_1514","judge":"Timus","title":"National Park","url":"https://acm.timus.ru/problem.aspx?space=1&num=1514","difficulty":2,"starred":false,"topic":"closest_pair_of_points","topics":["closest_pair_of_points"],"solved":false},{"id":"cses_1741","judge":"CSES","title":"Area of Rectangles","url":"https://cses.fi/problemset/task/1741","difficulty":1,"starred":true,"topic":"rectangle_union","topics":["rectangle_union"],"solved":false},{"id":"yosupo_area_of_union_of_rectangles","judge":"Library Checker","title":"Area of Union of Rectangles","url":"https://judge.yosupo.jp/problem/area_of_union_of_rectangles","difficulty":1,"starred":true,"topic":"rectangle_union","topics":["rectangle_union"],"solved":false},{"id":"kattis_kingdomofants","judge":"Kattis","title":"Kingdom of Ants","url":"https://vjudge.net/problem/Kattis-kingdomofants","difficulty":1,"starred":true,"topic":"rectangle_union","topics":["rectangle_union"],"solved":false},{"id":"codeforces_1359f","judge":"Codeforces","title":"RC Kaboom Show","url":"https://codeforces.com/contest/1359/problem/F","difficulty":2,"starred":true,"topic":"all_pair_segment_intersection","topics":["all_pair_segment_intersection"],"solved":false},{"id":"timus_1469","judge":"Timus","title":"No Smoking!","url":"https://acm.timus.ru/problem.aspx?space=1&num=1469","difficulty":2,"starred":true,"topic":"all_pair_segment_intersection","topics":["all_pair_segment_intersection"],"solved":false},{"id":"codeforces_62c","judge":"Codeforces","title":"Inquisition","url":"https://codeforces.com/contest/62/problem/C","difficulty":2,"starred":true,"topic":"vertical_decomposition","topics":["vertical_decomposition"],"solved":false},{"id":"timus_1664","judge":"Timus","title":"Pipeline Transportation","url":"https://acm.timus.ru/problem.aspx?space=1&num=1664","difficulty":2,"starred":false,"topic":"planar_graph_faces","topics":["planar_graph_faces"],"solved":false},{"id":"timus_1681","judge":"Timus","title":"Brother Bear's Garden","url":"https://acm.timus.ru/problem.aspx?space=1&num=1681","difficulty":2,"starred":false,"topic":"planar_graph_faces","topics":["planar_graph_faces"],"solved":false},{"id":"cf_gym_105112i","judge":"CF Gym","title":"Isolated Island","url":"https://codeforces.com/gym/105112/problem/I","difficulty":2,"starred":true,"topic":"planar_graph_faces","topics":["planar_graph_faces"],"solved":false},{"id":"timus_en","judge":"Timus","title":"Football Goal","url":"https://acm.timus.ru/problem.aspx?space=1&num=1874&locale=en","difficulty":2,"starred":false,"topic":"point_location","topics":["point_location"],"solved":false},{"id":"uva_12310","judge":"UVa","title":"Point Location","url":"https://vjudge.net/problem/UVA-12310","difficulty":1,"starred":true,"topic":"point_location","topics":["point_location"],"solved":false},{"id":"spoj_runaway","judge":"SPOJ","title":"Run Away","url":"https://vjudge.net/problem/SPOJ-RUNAWAY","difficulty":1,"starred":false,"topic":"hill_climbing","topics":["hill_climbing"],"solved":false},{"id":"dmoj_dmopc21c5p5","judge":"DMOJ","title":"Permutations & Primes","url":"https://dmoj.ca/problem/dmopc21c5p5","difficulty":2,"starred":false,"topic":"hill_climbing","topics":["hill_climbing"],"solved":false},{"id":"usaco_698","judge":"USACO","title":"Subsequence Reversal","url":"https://usaco.org/index.php?page=viewproblem2&cpid=698","difficulty":3,"starred":false,"topic":"hill_climbing","topics":["hill_climbing"],"solved":false},{"id":"codeforces_1556h","judge":"Codeforces","title":"DIY Tree","url":"https://codeforces.com/contest/1556/problem/H","difficulty":4,"starred":false,"topic":"hill_climbing","topics":["hill_climbing","matroid_intersection"],"solved":false},{"id":"codeforces_1765f","judge":"Codeforces","title":"Chemistry Lab","url":"https://codeforces.com/problemset/problem/1765/F","difficulty":2,"starred":true,"topic":"linear_combination_of_vectors","topics":["linear_combination_of_vectors"],"solved":false},{"id":"codeforces_724c","judge":"Codeforces","title":"Ray Tracing","url":"https://codeforces.com/problemset/problem/724/C","difficulty":1,"starred":false,"topic":"reflections_on_a_rectangle","topics":["reflections_on_a_rectangle"],"solved":false},{"id":"toph_energy_production","judge":"Toph","title":"Energy Production","url":"https://toph.co/p/energy-production","difficulty":2,"starred":true,"topic":"reflections_on_a_rectangle","topics":["reflections_on_a_rectangle"],"solved":false},{"id":"codeforces_241c","judge":"Codeforces","title":"Mirror Box","url":"https://codeforces.com/problemset/problem/241/C","difficulty":2,"starred":false,"topic":"reflections_on_a_rectangle","topics":["reflections_on_a_rectangle"],"solved":false},{"id":"codedrills_pocket_less_billiards","judge":"CodeDrills","title":"Pocket-less Billiards","url":"https://codedrills.io/contests/icpc-kanpur-2021-regional-round/problems/pocket-less-billiards","difficulty":2,"starred":true,"topic":"reflections_on_a_rectangle","topics":["reflections_on_a_rectangle"],"solved":false},{"id":"cf_gym_100956l","judge":"CF Gym","title":"Triangle","url":"https://codeforces.com/gym/100956/problem/L","difficulty":2,"starred":true,"topic":"maximum_area_of_a_triangle_from_given_lengths","topics":["maximum_area_of_a_triangle_from_given_lengths"],"solved":false},{"id":"kattis_bomas","judge":"Kattis","title":"Bomas","url":"https://open.kattis.com/problems/bomas","difficulty":2,"starred":true,"topic":"circle_inclusion_hierarchy","topics":["circle_inclusion_hierarchy"],"solved":false},{"id":"cf_gym_103388f","judge":"CF Gym","title":"Freedom from Prison","url":"https://codeforces.com/gym/103388/problem/F","difficulty":3,"starred":true,"topic":"circle_inclusion_hierarchy","topics":["circle_inclusion_hierarchy"],"solved":false},{"id":"cses_1632","judge":"CSES","title":"Movie Festival II","url":"https://cses.fi/problemset/task/1632","difficulty":1,"starred":true,"topic":"activity_selection_problem","topics":["activity_selection_problem"],"solved":false},{"id":"spoj_busyman","judge":"SPOJ","title":"I AM VERY BUSY","url":"https://www.spoj.com/problems/BUSYMAN/","difficulty":1,"starred":true,"topic":"activity_selection_problem","topics":["activity_selection_problem"],"solved":false},{"id":"aizu_alds1_15_b","judge":"Aizu","title":"Fractional Knapsack Problem","url":"https://vjudge.net/problem/Aizu-ALDS1_15_B","difficulty":1,"starred":true,"topic":"fractional_knapsack_problem","topics":["fractional_knapsack_problem"],"solved":false},{"id":"uva_1072","judge":"UVa","title":"Huffman Codes","url":"https://vjudge.net/problem/UVA-1072","difficulty":1,"starred":true,"topic":"huffman_coding","topics":["huffman_coding"],"solved":false},{"id":"zoj_2339","judge":"ZOJ","title":"Hyperhuffman","url":"https://vjudge.net/problem/ZOJ-2339","difficulty":1,"starred":true,"topic":"huffman_coding","topics":["huffman_coding"],"solved":false},{"id":"codeforces_700d","judge":"Codeforces","title":"Huffman Coding on Segment","url":"https://codeforces.com/problemset/problem/700/D","difficulty":3,"starred":false,"topic":"huffman_coding","topics":["huffman_coding"],"solved":false},{"id":"kattis_weather","judge":"Kattis","title":"Weather Report","url":"https://vjudge.net/problem/Kattis-weather","difficulty":3,"starred":true,"topic":"huffman_coding","topics":["huffman_coding"],"solved":false},{"id":"cf_gym_101149b","judge":"CF Gym","title":"No Time for Dragons","url":"https://codeforces.com/gym/101149/problem/B","difficulty":1,"starred":true,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"atcoder_abc366_f","judge":"AtCoder","title":"Maximum Composition","url":"https://atcoder.jp/contests/abc366/tasks/abc366_f","difficulty":2,"starred":true,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"cf_gym_100113k","judge":"CF Gym","title":"The Merry Student Life During the Term...","url":"https://codeforces.com/gym/100113/problem/K","difficulty":2,"starred":true,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"cf_gym_100026j","judge":"CF Gym","title":"Annihilate the Beetles","url":"https://codeforces.com/gym/100026/problem/J","difficulty":2,"starred":true,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"kattis_altruisticamphibians","judge":"Kattis","title":"Altruistic Amphibians","url":"https://open.kattis.com/problems/altruisticamphibians","difficulty":2,"starred":false,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"atcoder_cf17_final_d","judge":"AtCoder","title":"Zabuton","url":"https://atcoder.jp/contests/cf17-final/tasks/cf17_final_d","difficulty":2,"starred":false,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"codeforces_1793e","judge":"Codeforces","title":"Velepin and Marketing","url":"https://codeforces.com/problemset/problem/1793/E","difficulty":2,"starred":false,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"cf_gym_100971i","judge":"CF Gym","title":"Deadline","url":"https://codeforces.com/gym/100971/problem/I","difficulty":3,"starred":false,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"toph_fuel_finance","judge":"Toph","title":"Fuel Finance","url":"https://toph.co/p/fuel-finance","difficulty":3,"starred":false,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"codeforces_2143b","judge":"Codeforces","title":"Discounts","url":"https://codeforces.com/contest/2143/problem/B","difficulty":1,"starred":true,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"noi22_gymbadges","judge":"oj.uz","title":"Gym Badges","url":"https://oj.uz/problem/view/NOI22_gymbadges","difficulty":2,"starred":false,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"atcoder_dp_x","judge":"AtCoder","title":"Tower","url":"https://atcoder.jp/contests/dp/tasks/dp_x","difficulty":2,"starred":false,"topic":"exchange_arguments","topics":["exchange_arguments"],"solved":false},{"id":"codechef_amcs03","judge":"CodeChef","title":"Race Time!","url":"https://www.codechef.com/problems/AMCS03","difficulty":1,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"cf_gym_101309d","judge":"CF Gym","title":"Dome of Circus","url":"https://codeforces.com/gym/101309/problem/D","difficulty":1,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codeforces_439d","judge":"Codeforces","title":"Devu and his Brother","url":"https://codeforces.com/problemset/problem/439/D","difficulty":1,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codechef_icm2003","judge":"CodeChef","title":"Is This JEE","url":"https://www.codechef.com/problems/ICM2003","difficulty":1,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codeforces_578c","judge":"Codeforces","title":"Weakness and Poorness","url":"https://codeforces.com/problemset/problem/578/C","difficulty":2,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"uva_4898","judge":"UVa","title":"Galactic taxes","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4898","difficulty":2,"starred":false,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"cf_gym_100829a","judge":"CF Gym","title":"Chasing the Cheetahs","url":"https://codeforces.com/gym/100829/problem/A","difficulty":2,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codeforces_1848d","judge":"Codeforces","title":"Vika and Bonuses","url":"https://codeforces.com/problemset/problem/1848/D","difficulty":2,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"uva_3349","judge":"UVa","title":"Trick or Treat","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3349","difficulty":2,"starred":false,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"spoj_kopc12a","judge":"SPOJ","title":"Building Construction","url":"http://www.spoj.com/problems/KOPC12A/","difficulty":2,"starred":false,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codeforces_1059d","judge":"Codeforces","title":"Nature Reserve","url":"https://codeforces.com/problemset/problem/1059/D","difficulty":2,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codeforces_1355e","judge":"Codeforces","title":"Restorer Distance","url":"https://codeforces.com/contest/1355/problem/E","difficulty":2,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"timus_1719","judge":"Timus","title":"Kill the Shaitan-Boss","url":"https://acm.timus.ru/problem.aspx?space=1&num=1719","difficulty":2,"starred":false,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codeforces_626e","judge":"Codeforces","title":"Simple Skewness","url":"https://codeforces.com/contest/626/problem/E","difficulty":2,"starred":true,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codeforces_1928d","judge":"Codeforces","title":"Lonely Mountain Dungeons","url":"https://codeforces.com/contest/1928/problem/D","difficulty":2,"starred":false,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"toph_life_is_dark_and_full_of_error","judge":"Toph","title":"Life Is Dark and Full of Error","url":"https://toph.co/p/life-is-dark-and-full-of-error","difficulty":3,"starred":false,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codeforces_1999g2","judge":"Codeforces","title":"Ruler (hard version)","url":"https://codeforces.com/contest/1999/problem/G2","difficulty":1,"starred":false,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"codechef_gridpathhd","judge":"CodeChef","title":"Grid Path (Hard)","url":"https://www.codechef.com/problems/GRIDPATHHD","difficulty":2,"starred":false,"topic":"ternary_search","topics":["ternary_search"],"solved":false},{"id":"spoj_meteors","judge":"SPOJ","title":"Meteors","url":"https://www.spoj.com/problems/METEORS/","difficulty":1,"starred":true,"topic":"parallel_binary_search","topics":["parallel_binary_search"],"solved":false},{"id":"hackerearth_make_n00b_land_great_again_circuits","judge":"HackerEarth","title":"Make n00b land great again","url":"https://www.hackerearth.com/challenges/competitive/may-circuits/algorithm/make-n00b_land-great-again-circuits/","difficulty":1,"starred":false,"topic":"parallel_binary_search","topics":["parallel_binary_search"],"solved":false},{"id":"atcoder_agc002_d","judge":"AtCoder","title":"Stamp Rally","url":"https://atcoder.jp/contests/agc002/tasks/agc002_d","difficulty":2,"starred":true,"topic":"parallel_binary_search","topics":["parallel_binary_search"],"solved":false},{"id":"dmoj_coci20c6p5","judge":"DMOJ","title":"Index","url":"https://dmoj.ca/problem/coci20c6p5","difficulty":2,"starred":false,"topic":"parallel_binary_search","topics":["parallel_binary_search"],"solved":false},{"id":"hackerrank_travel_in_hackerland","judge":"HackerRank","title":"Travel in HackerLand","url":"https://www.hackerrank.com/contests/may-world-codesprint/challenges/travel-in-hackerland","difficulty":3,"starred":false,"topic":"parallel_binary_search","topics":["parallel_binary_search"],"solved":false},{"id":"hackerrank_selective_additions","judge":"HackerRank","title":"Selective Additions","url":"https://www.hackerrank.com/contests/hourrank-23/challenges/selective-additions/problem","difficulty":3,"starred":true,"topic":"parallel_binary_search","topics":["parallel_binary_search"],"solved":false},{"id":"dmoj_oly18novp11","judge":"DMOJ","title":"AQT's Tree Game","url":"https://dmoj.ca/problem/oly18novp11","difficulty":3,"starred":false,"topic":"parallel_binary_search","topics":["parallel_binary_search"],"solved":false},{"id":"atcoder_abc233_h?lang=en","judge":"AtCoder","title":"Manhattan Christmas Tree","url":"https://atcoder.jp/contests/abc233/tasks/abc233_h?lang=en","difficulty":3,"starred":false,"topic":"parallel_binary_search","topics":["parallel_binary_search","manhattan_chebyshev"],"solved":false},{"id":"vnoi_icpc23_national_i","judge":"Vnoi","title":"Infinite Fraction Sequence","url":"https://oj.vnoi.info/problem/icpc23_national_i","difficulty":3,"starred":false,"topic":"fraction_binary_search","topics":["fraction_binary_search"],"solved":false},{"id":"leetcode_find_k_pairs_with_smallest_sums","judge":"LeetCode","title":"Find K Pairs with Smallest Sums","url":"https://leetcode.com/problems/find-k-pairs-with-smallest-sums/","difficulty":1,"starred":true,"topic":"fracturing_search","topics":["fracturing_search"],"solved":false},{"id":"ojuz_boi19_olympiads","judge":"Vjudge","title":"Olympiads","url":"https://vjudge.net/problem/OJUZ-BOI19_olympiads","difficulty":2,"starred":true,"topic":"fracturing_search","topics":["fracturing_search"],"solved":false},{"id":"usaco_674","judge":"USACO","title":"Robotic Cow Herd","url":"https://usaco.org/index.php?page=viewproblem2&cpid=674","difficulty":2,"starred":false,"topic":"fracturing_search","topics":["fracturing_search"],"solved":false},{"id":"dmoj_cco20p6","judge":"DMOJ","title":"Shopping Plans","url":"https://dmoj.ca/problem/cco20p6","difficulty":4,"starred":false,"topic":"fracturing_search","topics":["fracturing_search"],"solved":false},{"id":"cf_gym_1010211","judge":"CF Gym","title":"Guess the Number","url":"https://codeforces.com/gym/101021/problem/1","difficulty":1,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1807e","judge":"Codeforces","title":"Interview","url":"https://codeforces.com/problemset/problem/1807/E","difficulty":1,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"csacademy_prime_factors","judge":"CS Academy","title":"Prime Factors","url":"https://csacademy.com/contest/round-64/task/prime-factors/statement/","difficulty":1,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1486c1","judge":"Codeforces","title":"Guessing the Greatest (easy version)","url":"https://codeforces.com/problemset/problem/1486/C1","difficulty":1,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_679a","judge":"Codeforces","title":"Bear and Prime 100","url":"https://codeforces.com/problemset/problem/679/A","difficulty":1,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1621c","judge":"Codeforces","title":"Hidden Permutations","url":"https://codeforces.com/problemset/problem/1621/C","difficulty":1,"starred":false,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1207e","judge":"Codeforces","title":"XOR Guessing","url":"https://codeforces.com/problemset/problem/1207/E","difficulty":1,"starred":false,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1583d","judge":"Codeforces","title":"Omkar and the Meaning of Life","url":"https://codeforces.com/problemset/problem/1583/D","difficulty":1,"starred":false,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1780d","judge":"Codeforces","title":"Bit Guessing Game","url":"https://codeforces.com/problemset/problem/1780/D","difficulty":1,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1534d","judge":"Codeforces","title":"Lost Tree","url":"https://codeforces.com/contest/1534/problem/D","difficulty":2,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"toph_missing_string","judge":"Toph","title":"Missing String","url":"https://toph.co/p/missing-string","difficulty":2,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1407c","judge":"Codeforces","title":"Chocolate Bunny","url":"https://codeforces.com/problemset/problem/1407/C","difficulty":2,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1451e1","judge":"Codeforces","title":"Bitwise Queries (Easy Version)","url":"https://codeforces.com/problemset/problem/1451/E1","difficulty":2,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1364e","judge":"Codeforces","title":"X-OR","url":"https://codeforces.com/problemset/problem/1364/E","difficulty":2,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1355f","judge":"Codeforces","title":"Guess Divisors Count","url":"https://codeforces.com/problemset/problem/1355/F","difficulty":3,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1061f","judge":"Codeforces","title":"Lost Root","url":"https://codeforces.com/problemset/problem/1061/F","difficulty":3,"starred":true,"topic":"interactive_problems","topics":["interactive_problems","randomized_algorithms"],"solved":false},{"id":"csacademy_create_tree","judge":"CS Academy","title":"Create Tree","url":"https://csacademy.com/contest/round-64/task/create-tree/statement/","difficulty":1,"starred":false,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"cf_gym_100851j","judge":"CF Gym","title":"Jump","url":"https://codeforces.com/gym/100851/problem/J","difficulty":1,"starred":true,"topic":"interactive_problems","topics":["randomized_algorithms","interactive_problems"],"solved":false},{"id":"csacademy_trailing_zeros","judge":"CS Academy","title":"Trailing Zeros","url":"https://csacademy.com/contest/round-64/task/trailing-zeros/statement/","difficulty":1,"starred":false,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"csacademy_limited_moves","judge":"CS Academy","title":"Limited Moves","url":"https://csacademy.com/contest/round-64/task/limited-moves/statement/","difficulty":2,"starred":false,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1999g1","judge":"Codeforces","title":"Ruler (easy version)","url":"https://codeforces.com/contest/1999/problem/G1","difficulty":2,"starred":false,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"cf_gym_100502b","judge":"CF Gym","title":"Basin City Surveillance","url":"https://codeforces.com/gym/100502/problem/B","difficulty":3,"starred":false,"topic":"interactive_problems","topics":["randomized_algorithms","interactive_problems"],"solved":false},{"id":"csacademy_election_spies","judge":"CS Academy","title":"Election Spies","url":"https://csacademy.com/contest/round-64/task/election-spies/statement/","difficulty":3,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_753c","judge":"Codeforces","title":"Interactive Bulls and Cows (Hard)","url":"https://codeforces.com/contest/753/problem/C","difficulty":3,"starred":false,"topic":"interactive_problems","topics":["randomized_algorithms","interactive_problems"],"solved":false},{"id":"csacademy_eliminate_edges","judge":"CS Academy","title":"Eliminate Edges","url":"https://csacademy.com/contest/round-64/task/eliminate-edges/statement/","difficulty":4,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"csacademy_find_the_tree","judge":"CS Academy","title":"Find the Tree","url":"https://csacademy.com/contest/round-64/task/find-the-tree/statement/","difficulty":4,"starred":true,"topic":"interactive_problems","topics":["interactive_problems"],"solved":false},{"id":"codeforces_1174f","judge":"Codeforces","title":"Ehab and the Big Finale","url":"https://codeforces.com/contest/1174/problem/F","difficulty":1,"starred":true,"topic":"interactive_problems_on_centroids","topics":["interactive_problems_on_centroids"],"solved":false},{"id":"codechef_spcnode","judge":"CodeChef","title":"Find the Special Node","url":"https://www.codechef.com/START17B/problems-old/SPCNODE","difficulty":1,"starred":true,"topic":"interactive_problems_on_centroids","topics":["interactive_problems_on_centroids"],"solved":false},{"id":"codeforces_1761g","judge":"Codeforces","title":"Centroid Guess","url":"https://codeforces.com/problemset/problem/1761/G","difficulty":4,"starred":false,"topic":"interactive_problems_on_centroids","topics":["interactive_problems_on_centroids"],"solved":false},{"id":"codechef_pcycle","judge":"CodeChef","title":"Permutation Cycles","url":"https://www.codechef.com/problems/PCYCLE","difficulty":1,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":false},{"id":"poj_1674","judge":"POJ","title":"Sorting by Swapping","url":"https://vjudge.net/problem/POJ-1674","difficulty":1,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":false},{"id":"codeforces_48d","judge":"Codeforces","title":"Permutations","url":"https://vjudge.net/problem/CodeForces-48D","difficulty":1,"starred":false,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":true},{"id":"timus_1024","judge":"Timus","title":"Permutations","url":"http://acm.timus.ru/problem.aspx?space=1&num=1024","difficulty":2,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":false},{"id":"codeforces_1768d","judge":"Codeforces","title":"Lucky Permutation","url":"https://codeforces.com/contest/1768/problem/D","difficulty":2,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":false},{"id":"codeforces_1327d","judge":"Codeforces","title":"Infinite Path","url":"https://codeforces.com/problemset/problem/1327/D","difficulty":2,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":false},{"id":"codeforces_612e","judge":"Codeforces","title":"Square Root of Permutation","url":"https://codeforces.com/contest/612/problem/E","difficulty":2,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles","kth_root_of_a_permutation"],"solved":false},{"id":"codeforces_1591d","judge":"Codeforces","title":"Yet Another Sorting Problem","url":"https://codeforces.com/contest/1591/problem/D","difficulty":2,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles","invariants_and_monovariants"],"solved":false},{"id":"codeforces_911d","judge":"Codeforces","title":"Inversion Counting","url":"https://codeforces.com/contest/911/problem/D","difficulty":2,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles","inversions"],"solved":false},{"id":"codeforces_987e","judge":"Codeforces","title":"Petr and Permutations","url":"https://codeforces.com/contest/987/problem/E","difficulty":2,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":false},{"id":"codechef_dpowperm","judge":"CodeChef","title":"D-Power Permutations","url":"https://www.codechef.com/problems/DPOWPERM/","difficulty":3,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":false},{"id":"codeforces_2033e","judge":"Codeforces","title":"Sakurako, Kosuke, and the Permutation","url":"https://codeforces.com/contest/2033/problem/E","difficulty":1,"starred":true,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":false},{"id":"codechef_p_cost_sum","judge":"CodeChef","title":"Permutation Cost Sum","url":"https://www.codechef.com/problems/P_COST_SUM","difficulty":2,"starred":false,"topic":"permutation_cycles","topics":["permutation_cycles"],"solved":false},{"id":"hackerrank_sasha_and_swaps","judge":"HackerRank","title":"Sasha and Swaps","url":"https://www.hackerrank.com/contests/infinitum14/challenges/sasha-and-swaps/problem","difficulty":2,"starred":true,"topic":"kth_root_of_a_permutation","topics":["kth_root_of_a_permutation"],"solved":false},{"id":"cf_gym_421334a","judge":"CF Gym","title":"Permutations","url":"https://codeforces.com/gym/421334/problem/A","difficulty":1,"starred":true,"topic":"schreier_sims_algorithm","topics":["schreier_sims_algorithm"],"solved":false},{"id":"cf_gym_102156d","judge":"CF Gym","title":"Pick Your Own Nim","url":"https://codeforces.com/gym/102156/problem/D","difficulty":1,"starred":true,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"spoj_coin","judge":"SPOJ","title":"Coin Collecting","url":"https://www.spoj.com/problems/COIN/","difficulty":1,"starred":true,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"uri_2128","judge":"Com","title":"Demonstration of Honesty!","url":"https://www.urionlinejudge.com.br/judge/en/problems/view/2128","difficulty":1,"starred":false,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"codechef_servers","judge":"CodeChef","title":"Communicating Servers","url":"https://www.codechef.com/problems/SERVERS","difficulty":1,"starred":false,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"codechef_cnnct2","judge":"CodeChef","title":"Faulty System","url":"https://www.codechef.com/problems/CNNCT2","difficulty":2,"starred":true,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"qoj_6402","judge":"QOJ","title":"MEXimum Spanning Tree","url":"https://qoj.ac/contest/1221/problem/6402","difficulty":2,"starred":true,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"cf_gym_103373i","judge":"CF Gym","title":"ICPC Kingdom","url":"https://codeforces.com/gym/103373/problem/I","difficulty":2,"starred":false,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"kattis_rainbowgraph","judge":"Kattis","title":"Rainbow Graph","url":"https://naipc18.kattis.com/problems/rainbowgraph","difficulty":2,"starred":true,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"codeforces_1284g","judge":"Codeforces","title":"Seollal","url":"https://codeforces.com/contest/1284/problem/G","difficulty":3,"starred":false,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"uva_3080","judge":"UVa","title":"Ambiguous Forests","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3080","difficulty":2,"starred":false,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"atcoder_abc399_g","judge":"AtCoder","title":"Colorful Spanning Tree","url":"https://atcoder.jp/contests/abc399/tasks/abc399_g","difficulty":2,"starred":true,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"codechef_hamel","judge":"CodeChef","title":"Hamel Paths","url":"https://www.codechef.com/problems/HAMEL","difficulty":3,"starred":true,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"dmoj_dmopc19c3p6","judge":"DMOJ","title":"TST","url":"https://dmoj.ca/problem/dmopc19c3p6","difficulty":4,"starred":false,"topic":"matroid_intersection","topics":["matroid_intersection"],"solved":false},{"id":"cses_1689","judge":"CSES","title":"Knight's Tour","url":"https://cses.fi/problemset/task/1689","difficulty":1,"starred":false,"topic":"knights_tour_problem","topics":["knights_tour_problem","backtracking"],"solved":false},{"id":"cses_2176","judge":"CSES","title":"Counting Bishops","url":"https://cses.fi/problemset/task/2176","difficulty":1,"starred":true,"topic":"bishop_placement","topics":["bishop_placement"],"solved":false},{"id":"codeforces_1000c","judge":"Codeforces","title":"Covered Points Count","url":"https://codeforces.com/problemset/problem/1000/C","difficulty":1,"starred":true,"topic":"coordinate_compression","topics":["coordinate_compression"],"solved":false},{"id":"usaco_viewproblem2","judge":"USACO","title":"Crazy Fences","url":"https://usaco.org/index.php?cpid=207&page=viewproblem2","difficulty":2,"starred":false,"topic":"coordinate_compression","topics":["coordinate_compression"],"solved":false},{"id":"usaco_1063","judge":"USACO","title":"Rectangular Pasture","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1063","difficulty":2,"starred":true,"topic":"coordinate_compression","topics":["coordinate_compression"],"solved":false},{"id":"codeforces_510b","judge":"Codeforces","title":"Fox And Two Dots","url":"https://codeforces.com/contest/510/problem/B","difficulty":1,"starred":false,"topic":"direction_array","topics":["direction_array"],"solved":true},{"id":"codeforces_2069b","judge":"Codeforces","title":"Set of Strangers","url":"https://codeforces.com/contest/2069/problem/B","difficulty":1,"starred":false,"topic":"direction_array","topics":["direction_array"],"solved":false},{"id":"codeforces_1365d","judge":"Codeforces","title":"Solve The Maze","url":"https://codeforces.com/contest/1365/problem/D","difficulty":1,"starred":false,"topic":"direction_array","topics":["direction_array"],"solved":false},{"id":"codeforces_129c","judge":"Codeforces","title":"Statues","url":"https://codeforces.com/contest/129/problem/C","difficulty":1,"starred":false,"topic":"direction_array","topics":["direction_array"],"solved":false},{"id":"cses_1628","judge":"CSES","title":"Meet in the Middle","url":"https://cses.fi/problemset/task/1628/","difficulty":1,"starred":true,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"spoj_subsums","judge":"SPOJ","title":"Subset Sums","url":"https://www.spoj.com/problems/SUBSUMS/","difficulty":1,"starred":true,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"codeforces_888e","judge":"Codeforces","title":"Maximum Subsequence","url":"https://codeforces.com/contest/888/problem/E","difficulty":1,"starred":true,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"usaco_1207","judge":"USACO","title":"Robot Instructions","url":"https://usaco.org/index.php?page=viewproblem2&cpid=1207","difficulty":1,"starred":false,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"codeforces_1006f","judge":"Codeforces","title":"Xor-Paths","url":"https://codeforces.com/contest/1006/problem/F","difficulty":2,"starred":true,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"codeforces_585d","judge":"Codeforces","title":"Lizard Era: Beginning","url":"https://codeforces.com/problemset/problem/585/D","difficulty":3,"starred":false,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"codeforces_912e","judge":"Codeforces","title":"Prime Gift","url":"https://codeforces.com/contest/912/problem/E","difficulty":2,"starred":true,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"codeforces_1767e","judge":"Codeforces","title":"Algebra Flash","url":"https://codeforces.com/problemset/problem/1767/E","difficulty":2,"starred":true,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"codeforces_1257f","judge":"Codeforces","title":"Make Them Similar","url":"https://codeforces.com/problemset/problem/1257/F","difficulty":2,"starred":true,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"atcoder_tokiomarine2020_d","judge":"AtCoder","title":"Knapsack Queries on a tree","url":"https://atcoder.jp/contests/tokiomarine2020/tasks/tokiomarine2020_d","difficulty":3,"starred":false,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"kattis_playlist","judge":"Kattis","title":"Playlist","url":"https://open.kattis.com/problems/playlist","difficulty":3,"starred":false,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"codeforces_995e","judge":"Codeforces","title":"Number Clicker","url":"https://codeforces.com/contest/995/problem/E","difficulty":3,"starred":true,"topic":"meet_in_the_middle","topics":["meet_in_the_middle","birthday_paradox"],"solved":false},{"id":"atcoder_abc402_f","judge":"AtCoder","title":"Path to Integer","url":"https://atcoder.jp/contests/abc402/tasks/abc402_f","difficulty":2,"starred":true,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"cf_gym_105698a","judge":"CF Gym","title":"actGenshinImp","url":"https://codeforces.com/gym/105698/problem/A","difficulty":3,"starred":false,"topic":"meet_in_the_middle","topics":["meet_in_the_middle"],"solved":false},{"id":"cses_1754","judge":"CSES","title":"Coin Piles","url":"https://cses.fi/problemset/task/1754","difficulty":1,"starred":true,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":true},{"id":"codeforces_1973a","judge":"Codeforces","title":"Chess For Three","url":"https://codeforces.com/contest/1973/problem/A","difficulty":1,"starred":true,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"atcoder_abc178_f","judge":"AtCoder","title":"Contrast","url":"https://atcoder.jp/contests/abc178/tasks/abc178_f","difficulty":2,"starred":true,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"codeforces_1775e","judge":"Codeforces","title":"The Human Equation","url":"https://codeforces.com/problemset/problem/1775/E","difficulty":2,"starred":false,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"codeforces_1983b","judge":"Codeforces","title":"Corner Twist","url":"https://codeforces.com/contest/1983/problem/B","difficulty":2,"starred":false,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"leetcode_find_the_maximum_sum_of_node_values","judge":"LeetCode","title":"Find the Maximum Sum of Node Values","url":"https://leetcode.com/problems/find-the-maximum-sum-of-node-values/","difficulty":2,"starred":true,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"codeforces_1983d","judge":"Codeforces","title":"Swap Dilemma","url":"https://codeforces.com/contest/1983/problem/D","difficulty":2,"starred":true,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"atcoder_abc296_f","judge":"AtCoder","title":"Simultaneous Swap","url":"https://atcoder.jp/contests/abc296/tasks/abc296_f","difficulty":2,"starred":false,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"codeforces_1110e","judge":"Codeforces","title":"Magic Stones","url":"https://codeforces.com/contest/1110/problem/E","difficulty":2,"starred":true,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"codeforces_1906b","judge":"Codeforces","title":"Button Pressing","url":"https://codeforces.com/contest/1906/problem/B","difficulty":2,"starred":false,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"codechef_atbo","judge":"CodeChef","title":"Operating on A","url":"https://www.codechef.com/problems/ATBO","difficulty":2,"starred":false,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"codeforces_1630d","judge":"Codeforces","title":"Flipping Range","url":"https://codeforces.com/contest/1630/problem/D","difficulty":3,"starred":false,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"codeforces_1365f","judge":"Codeforces","title":"Swaps Again","url":"https://codeforces.com/contest/1365/problem/F","difficulty":3,"starred":false,"topic":"invariants_and_monovariants","topics":["invariants_and_monovariants"],"solved":false},{"id":"atcoder_abc178_e","judge":"AtCoder","title":"Dist Max","url":"https://atcoder.jp/contests/abc178/tasks/abc178_e","difficulty":1,"starred":true,"topic":"manhattan_chebyshev","topics":["manhattan_chebyshev"],"solved":false},{"id":"spoj_distance","judge":"SPOJ","title":"Manhattan","url":"https://www.spoj.com/problems/DISTANCE","difficulty":1,"starred":true,"topic":"manhattan_chebyshev","topics":["manhattan_chebyshev"],"solved":false},{"id":"atcoder_code_festival_2017_quala_d","judge":"AtCoder","title":"Four Coloring","url":"https://atcoder.jp/contests/code-festival-2017-quala/tasks/code_festival_2017_quala_d","difficulty":2,"starred":false,"topic":"manhattan_chebyshev","topics":["manhattan_chebyshev"],"solved":false},{"id":"codeforces_944f","judge":"Codeforces","title":"Game with Tokens","url":"https://codeforces.com/contest/944/problem/F","difficulty":2,"starred":false,"topic":"manhattan_chebyshev","topics":["manhattan_chebyshev"],"solved":false},{"id":"codechef_teleport","judge":"CodeChef","title":"Teleports","url":"https://www.codechef.com/problems/TELEPORT","difficulty":2,"starred":false,"topic":"manhattan_chebyshev","topics":["manhattan_chebyshev"],"solved":false},{"id":"ioi07_pairs","judge":"oj.uz","title":"Pairs","url":"https://oj.uz/problem/view/IOI07_pairs","difficulty":4,"starred":true,"topic":"manhattan_chebyshev","topics":["manhattan_chebyshev"],"solved":false},{"id":"toph_lcm_divisible_subsequence","judge":"Toph","title":"LCM Divisible Subsequence","url":"https://toph.co/p/lcm-divisible-subsequence","difficulty":2,"starred":true,"topic":"lcm_or_technique","topics":["lcm_or_technique"],"solved":false},{"id":"atcoder_abc349_f","judge":"AtCoder","title":"Subsequence LCM","url":"https://atcoder.jp/contests/abc349/tasks/abc349_f","difficulty":2,"starred":true,"topic":"lcm_or_technique","topics":["lcm_or_technique"],"solved":false},{"id":"cf_gym_102141b","judge":"CF Gym","title":"Mysterious LCM","url":"https://codeforces.com/gym/102141/problem/B","difficulty":3,"starred":true,"topic":"lcm_or_technique","topics":["lcm_or_technique"],"solved":false},{"id":"leetcode_bitwise_ors_of_subarrays","judge":"LeetCode","title":"Bitwise ORs of Subarrays","url":"https://leetcode.com/problems/bitwise-ors-of-subarrays/","difficulty":1,"starred":true,"topic":"logarithmic_bruteforce","topics":["logarithmic_bruteforce"],"solved":false},{"id":"codeforces_243a","judge":"Codeforces","title":"The Brand New Function","url":"https://codeforces.com/problemset/problem/243/A","difficulty":1,"starred":true,"topic":"logarithmic_bruteforce","topics":["logarithmic_bruteforce"],"solved":false},{"id":"codeforces_2005d","judge":"Codeforces","title":"Alter the GCD","url":"https://codeforces.com/contest/2005/problem/D","difficulty":2,"starred":true,"topic":"logarithmic_bruteforce","topics":["logarithmic_bruteforce"],"solved":false},{"id":"codeforces_2007f","judge":"Codeforces","title":"Eri and Expanded Sets","url":"https://codeforces.com/contest/2007/problem/F","difficulty":2,"starred":false,"topic":"logarithmic_bruteforce","topics":["logarithmic_bruteforce"],"solved":false},{"id":"toph_cuet_inter_university_codestorm_1_0","judge":"Toph","title":"Have Some Water","url":"https://toph.co/c/cuet-inter-university-codestorm-1-0","difficulty":2,"starred":true,"topic":"logarithmic_bruteforce","topics":["logarithmic_bruteforce"],"solved":false},{"id":"codechef_ksizegcd","judge":"CodeChef","title":"Maximum of GCDs","url":"https://www.codechef.com/problems/KSIZEGCD","difficulty":2,"starred":true,"topic":"logarithmic_bruteforce","topics":["logarithmic_bruteforce"],"solved":false},{"id":"hdu_5869","judge":"HDU","title":"Different GCD Subarray Query","url":"https://vjudge.net/problem/HDU-5869","difficulty":3,"starred":true,"topic":"logarithmic_bruteforce","topics":["logarithmic_bruteforce"],"solved":false},{"id":"ceoi16_icc","judge":"oj.uz","title":"ICC","url":"https://oj.uz/problem/view/CEOI16_icc","difficulty":2,"starred":true,"topic":"bitwise_disjoint_partitioning","topics":["bitwise_disjoint_partitioning"],"solved":false},{"id":"szkopul_xnjwuvwdhqoqtfbrmyg8vd1o","judge":"Szkopuł","title":"Remont","url":"https://szkopul.edu.pl/problemset/problem/xNjwUvwdHQoQTFBrmyG8vD1O/site/?key=statement","difficulty":2,"starred":false,"topic":"bitwise_disjoint_partitioning","topics":["bitwise_disjoint_partitioning"],"solved":false},{"id":"codeforces_835e","judge":"Codeforces","title":"The penguin's game","url":"https://codeforces.com/problemset/problem/835/E","difficulty":2,"starred":true,"topic":"bitwise_disjoint_partitioning","topics":["bitwise_disjoint_partitioning"],"solved":false},{"id":"codeforces_1039d","judge":"Codeforces","title":"You Are Given a Tree","url":"https://codeforces.com/contest/1039/problem/D","difficulty":1,"starred":true,"topic":"sqrt_n_sequence_recovery","topics":["sqrt_n_sequence_recovery"],"solved":false},{"id":"codeforces_2018e2","judge":"Codeforces","title":"Complex Segments (Hard Version)","url":"https://codeforces.com/contest/2018/problem/E2","difficulty":3,"starred":false,"topic":"sqrt_n_sequence_recovery","topics":["sqrt_n_sequence_recovery"],"solved":false},{"id":"yosupo_min_plus_convolution_convex_convex","judge":"Library Checker","title":"Min Plus Convolution (Convex and Convex)","url":"https://judge.yosupo.jp/problem/min_plus_convolution_convex_convex","difficulty":1,"starred":true,"topic":"min_plus_convolution_convex_and_convex","topics":["min_plus_convolution_convex_and_convex"],"solved":false},{"id":"joi18_candies","judge":"oj.uz","title":"Candies","url":"https://oj.uz/problem/view/JOI18_candies","difficulty":2,"starred":false,"topic":"min_plus_convolution_convex_and_convex","topics":["min_plus_convolution_convex_and_convex"],"solved":false},{"id":"atcoder_abc218_h","judge":"AtCoder","title":"Red and Blue Lamps","url":"https://atcoder.jp/contests/abc218/tasks/abc218_h","difficulty":3,"starred":false,"topic":"min_plus_convolution_convex_and_convex","topics":["min_plus_convolution_convex_and_convex"],"solved":false},{"id":"yosupo_min_plus_convolution_convex_arbitrary","judge":"Library Checker","title":"Min Plus Convolution (Convex and Arbitrary)","url":"https://judge.yosupo.jp/problem/min_plus_convolution_convex_arbitrary","difficulty":1,"starred":true,"topic":"min_plus_convolution_convex_and_arbitrary","topics":["min_plus_convolution_convex_and_arbitrary"],"solved":false},{"id":"ioi14_holiday","judge":"oj.uz","title":"Holiday","url":"https://oj.uz/problem/view/IOI14_holiday","difficulty":3,"starred":false,"topic":"min_plus_convolution_convex_and_arbitrary","topics":["min_plus_convolution_convex_and_arbitrary"],"solved":false},{"id":"codeforces_1423m","judge":"Codeforces","title":"Milutin's Plums","url":"https://codeforces.com/problemset/problem/1423/M","difficulty":3,"starred":false,"topic":"min_plus_convolution_convex_and_arbitrary","topics":["min_plus_convolution_convex_and_arbitrary"],"solved":false},{"id":"cf_gym_104283c","judge":"CF Gym","title":"Johnny English Strikes Again","url":"https://codeforces.com/gym/104283/problem/C","difficulty":1,"starred":true,"topic":"randomized_algorithms","topics":["randomized_algorithms"],"solved":false},{"id":"codeforces_1305f","judge":"Codeforces","title":"Kuroni and the Punishment","url":"https://codeforces.com/contest/1305/problem/F","difficulty":1,"starred":true,"topic":"randomized_algorithms","topics":["randomized_algorithms"],"solved":false},{"id":"codechef_nopi","judge":"CodeChef","title":"Node Picking","url":"https://www.codechef.com/IPC15P2B/problems/NOPI","difficulty":2,"starred":false,"topic":"randomized_algorithms","topics":["randomized_algorithms"],"solved":false},{"id":"kattis_findinglines","judge":"Kattis","title":"Finding Lines","url":"https://vjudge.net/problem/Kattis-findinglines","difficulty":2,"starred":true,"topic":"randomized_algorithms","topics":["randomized_algorithms"],"solved":false},{"id":"codeforces_2003f","judge":"Codeforces","title":"Turtle and Three Sequences","url":"https://codeforces.com/contest/2003/problem/F","difficulty":2,"starred":true,"topic":"randomized_algorithms","topics":["randomized_algorithms"],"solved":false},{"id":"codeforces_364d","judge":"Codeforces","title":"Ghd","url":"https://codeforces.com/contest/364/problem/D","difficulty":2,"starred":true,"topic":"randomized_algorithms","topics":["randomized_algorithms"],"solved":false},{"id":"cf_gym_101741f","judge":"CF Gym","title":"GCD","url":"https://codeforces.com/gym/101741/problem/F","difficulty":2,"starred":true,"topic":"randomized_algorithms","topics":["randomized_algorithms"],"solved":false},{"id":"codeforces_2149g","judge":"Codeforces","title":"Buratsuta 3","url":"https://codeforces.com/contest/2149/problem/G","difficulty":1,"starred":true,"topic":"randomized_algorithms","topics":["randomized_algorithms","boyer_moore_voting_algorithm_and_misra_gries_algorithm"],"solved":false},{"id":"yosupo_addition_of_big_integers","judge":"Library Checker","title":"Addition of Big Integers","url":"https://judge.yosupo.jp/problem/addition_of_big_integers","difficulty":1,"starred":true,"topic":"bigint","topics":["bigint"],"solved":false},{"id":"codechef_multisrm","judge":"CodeChef","title":"Simple Multiplication","url":"https://vjudge.net/problem/CodeChef-MULTISRM","difficulty":1,"starred":false,"topic":"bigint","topics":["bigint"],"solved":false},{"id":"spoj_mul","judge":"SPOJ","title":"Fast Multiplication","url":"https://www.spoj.com/problems/MUL/","difficulty":1,"starred":true,"topic":"bigint","topics":["bigint"],"solved":false},{"id":"yosupo_multiplication_of_big_integers","judge":"Library Checker","title":"Multiplication of Big Integers","url":"https://judge.yosupo.jp/problem/multiplication_of_big_integers","difficulty":1,"starred":true,"topic":"bigint","topics":["bigint"],"solved":false},{"id":"yosupo_division_of_big_integers","judge":"Library Checker","title":"Division of Big Integers","url":"https://judge.yosupo.jp/problem/division_of_big_integers","difficulty":2,"starred":true,"topic":"bigint","topics":["bigint"],"solved":false},{"id":"codeforces_986d","judge":"Codeforces","title":"Perfect Encoding","url":"https://codeforces.com/problemset/problem/986/D","difficulty":2,"starred":true,"topic":"bigint","topics":["bigint"],"solved":false},{"id":"codeforces_98b","judge":"Codeforces","title":"Help King","url":"https://codeforces.com/contest/98/problem/B","difficulty":2,"starred":false,"topic":"bigint","topics":["bigint"],"solved":false},{"id":"tlx_inc_2022c","judge":"TLX","title":"Powers of Two","url":"https://tlx.toki.id/problems/inc-2022/C/","difficulty":1,"starred":false,"topic":"trygub_numbers","topics":["trygub_numbers"],"solved":false},{"id":"loj_2302","judge":"LibreOJ","title":"整数","url":"https://loj.ac/p/2302","difficulty":2,"starred":false,"topic":"trygub_numbers","topics":["trygub_numbers"],"solved":false},{"id":"codeforces_1817e","judge":"Codeforces","title":"Half-sum","url":"https://codeforces.com/contest/1817/problem/E","difficulty":4,"starred":false,"topic":"trygub_numbers","topics":["trygub_numbers"],"solved":false},{"id":"codeforces_1810f","judge":"Codeforces","title":"M-tree","url":"https://codeforces.com/contest/1810/problem/F","difficulty":4,"starred":false,"topic":"trygub_numbers","topics":["trygub_numbers"],"solved":false},{"id":"hackerearth_move_minimization_8a9d3991","judge":"HackerEarth","title":"Swapping numbers","url":"https://www.hackerearth.com/practice/data-structures/advanced-data-structures/fenwick-binary-indexed-trees/practice-problems/algorithm/move-minimization-8a9d3991/","difficulty":1,"starred":true,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"codeforces_1918b","judge":"Codeforces","title":"Minimize Inversions","url":"https://codeforces.com/problemset/problem/1918/B","difficulty":1,"starred":true,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"hackerearth_make_them_equal_too_89585e71","judge":"HackerEarth","title":"Make the strings equal","url":"https://www.hackerearth.com/practice/algorithms/string-algorithm/string-searching/practice-problems/algorithm/make-them-equal-too-89585e71/","difficulty":1,"starred":true,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"codeforces_1430e","judge":"Codeforces","title":"String Reversal","url":"https://codeforces.com/contest/1430/problem/E","difficulty":2,"starred":true,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"atcoder_arc120_c","judge":"AtCoder","title":"Swaps 2","url":"https://atcoder.jp/contests/arc120/tasks/arc120_c","difficulty":2,"starred":true,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"cf_gym_103148b","judge":"CF Gym","title":"Luna Likes Love","url":"https://codeforces.com/gym/103148/problem/B","difficulty":2,"starred":false,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"atcoder_arc088_c","judge":"AtCoder","title":"Papple Sort","url":"https://atcoder.jp/contests/arc088/tasks/arc088_c","difficulty":2,"starred":true,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"atcoder_arc097_c","judge":"AtCoder","title":"Sorted and Sorted","url":"https://atcoder.jp/contests/arc097/tasks/arc097_c","difficulty":2,"starred":false,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"ioi19_shoes","judge":"oj.uz","title":"Arranging Shoes","url":"https://oj.uz/problem/view/IOI19_shoes","difficulty":2,"starred":false,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"codeforces_1526d","judge":"Codeforces","title":"Kill Anton","url":"https://codeforces.com/contest/1526/problem/D","difficulty":2,"starred":false,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"codeforces_513g1","judge":"Codeforces","title":"Inversions problem","url":"https://vjudge.net/problem/CodeForces-513G1","difficulty":2,"starred":false,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"codechef_iiti15","judge":"CodeChef","title":"Sherlock and Inversions","url":"https://www.codechef.com/problems/IITI15","difficulty":null,"starred":true,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"atcoder_joi2021ho_c","judge":"AtCoder","title":"Group Photo","url":"https://atcoder.jp/contests/joi2021ho/tasks/joi2021ho_c","difficulty":3,"starred":false,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"spoj_swaps","judge":"SPOJ","title":"Counting inversions","url":"https://vjudge.net/problem/SPOJ-SWAPS","difficulty":3,"starred":true,"topic":"inversions","topics":["inversions"],"solved":false},{"id":"codechef_josephus","judge":"CodeChef","title":"Josephus Again","url":"https://www.codechef.com/problems/JOSEPHUS","difficulty":1,"starred":true,"topic":"josephus_problem","topics":["josephus_problem"],"solved":false},{"id":"cses_2162","judge":"CSES","title":"Josephus Problem I","url":"https://cses.fi/problemset/task/2162","difficulty":1,"starred":true,"topic":"josephus_problem","topics":["josephus_problem"],"solved":true},{"id":"cses_2163","judge":"CSES","title":"Josephus Problem II","url":"https://cses.fi/problemset/task/2163","difficulty":1,"starred":true,"topic":"josephus_problem","topics":["josephus_problem"],"solved":true},{"id":"cses_2164","judge":"CSES","title":"Josephus Queries","url":"https://cses.fi/problemset/task/2164","difficulty":1,"starred":true,"topic":"josephus_problem","topics":["josephus_problem"],"solved":false},{"id":"codechef_ignus15b","judge":"CodeChef","title":"Lucky Number","url":"https://www.codechef.com/IGNU2015/problems/IGNUS15B","difficulty":1,"starred":false,"topic":"josephus_problem","topics":["josephus_problem"],"solved":false},{"id":"cses_2205","judge":"CSES","title":"Gray Code","url":"https://cses.fi/problemset/task/2205","difficulty":1,"starred":true,"topic":"gray_code","topics":["gray_code"],"solved":true},{"id":"uva_2114","judge":"UVa","title":"Grey Codes","url":"https://onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&problem=2114","difficulty":1,"starred":true,"topic":"gray_code","topics":["gray_code"],"solved":false},{"id":"cf_gym_100209d","judge":"CF Gym","title":"Тест","url":"https://codeforces.com/gym/100209/problem/D","difficulty":1,"starred":true,"topic":"gray_code","topics":["gray_code"],"solved":false},{"id":"acmsguru_99999249","judge":"Codeforces","title":"Matrix","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/249","difficulty":2,"starred":false,"topic":"gray_code","topics":["gray_code"],"solved":false},{"id":"uva_569","judge":"UVa","title":"Passwords","url":"https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=569","difficulty":1,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"poj_1979","judge":"POJ","title":"Red and Black","url":"https://vjudge.net/problem/POJ-1979","difficulty":1,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"uva_750","judge":"UVa","title":"8 Queens Chess Problem","url":"https://vjudge.net/problem/UVA-750","difficulty":1,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"uva_167","judge":"UVa","title":"The Sultan's Successors","url":"https://vjudge.net/problem/UVA-167","difficulty":1,"starred":false,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"poj_1315","judge":"POJ","title":"Don't Get Rooked","url":"https://vjudge.net/problem/POJ-1315","difficulty":1,"starred":false,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"kattis_mapcolouring","judge":"Kattis","title":"Map Colouring","url":"https://vjudge.net/problem/Kattis-mapcolouring","difficulty":1,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"uva_524","judge":"UVa","title":"Prime Ring Problem","url":"https://vjudge.net/problem/UVA-524","difficulty":1,"starred":false,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"uva_571","judge":"UVa","title":"Jugs","url":"https://vjudge.net/problem/UVA-571","difficulty":1,"starred":false,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"uva_11085","judge":"UVa","title":"Back to the 8-Queens","url":"https://vjudge.net/problem/UVA-11085","difficulty":1,"starred":false,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"uva_10344","judge":"UVa","title":"23 out of 5","url":"https://vjudge.net/problem/UVA-10344","difficulty":1,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"uva_677","judge":"UVa","title":"All Walks of length \"n\" from the first node","url":"https://vjudge.net/problem/UVA-677","difficulty":1,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"kattis_randomdigitalexponentiation","judge":"Kattis","title":"Random Digital Exponentiation","url":"https://open.kattis.com/problems/randomdigitalexponentiation","difficulty":2,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"lightoj_c_icpc_dhk_2021","judge":"LightOJ","title":"Codovid Virus","url":"https://lightoj.com/problem/c-icpc-dhk-2021","difficulty":2,"starred":false,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"spoj_btck","judge":"SPOJ","title":"A problem of Backtracking","url":"https://vjudge.net/problem/SPOJ-BTCK","difficulty":2,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"uva_574","judge":"UVa","title":"Sum It Up","url":"https://vjudge.net/problem/UVA-574","difficulty":2,"starred":false,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"lightoj_1061","judge":"LightOJ","title":"N Queen Again","url":"https://vjudge.net/problem/LightOJ-1061","difficulty":3,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"cf_gym_102040d","judge":"CF Gym","title":"Faketorial Hashing","url":"https://codeforces.com/gym/102040/problem/D","difficulty":4,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"cses_1624","judge":"CSES","title":"Chessboard and Queens","url":"https://cses.fi/problemset/task/1624","difficulty":1,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":false},{"id":"cses_1622","judge":"CSES","title":"Creating Strings","url":"https://cses.fi/problemset/task/1622","difficulty":1,"starred":true,"topic":"backtracking","topics":["backtracking"],"solved":true},{"id":"codeforces_1436e","judge":"Codeforces","title":"Complicated Computations","url":"https://codeforces.com/contest/1436/problem/E","difficulty":1,"starred":true,"topic":"mex_of_all_subarrays","topics":["mex_of_all_subarrays"],"solved":false},{"id":"toph_f","judge":"Toph","title":"F","url":"https://toph.co/p/f","difficulty":3,"starred":true,"topic":"mex_of_all_subarrays","topics":["mex_of_all_subarrays"],"solved":false},{"id":"codeforces_1148h","judge":"Codeforces","title":"Holy Diver","url":"https://codeforces.com/contest/1148/problem/H","difficulty":3,"starred":true,"topic":"mex_of_all_subarrays","topics":["mex_of_all_subarrays"],"solved":false},{"id":"codeforces_348d","judge":"Codeforces","title":"Turtles","url":"https://codeforces.com/problemset/problem/348/D","difficulty":1,"starred":true,"topic":"lindstrom_gessel_viennot_lemma","topics":["lindstrom_gessel_viennot_lemma"],"solved":false},{"id":"atcoder_abc258_g","judge":"AtCoder","title":"Triangle","url":"https://atcoder.jp/contests/abc258/tasks/abc258_g","difficulty":1,"starred":false,"topic":"dynamic_bitsets","topics":["dynamic_bitsets"],"solved":false},{"id":"codechef_songif","judge":"CodeChef","title":"Sonya and Gifts","url":"https://www.codechef.com/MAY19A/problems/SONGIF","difficulty":2,"starred":true,"topic":"pragmas","topics":["pragmas"],"solved":false},{"id":"codeforces_925e","judge":"Codeforces","title":"May Holidays","url":"https://codeforces.com/contest/925/problem/E","difficulty":2,"starred":false,"topic":"pragmas","topics":["pragmas"],"solved":false},{"id":"codeforces_1270f","judge":"Codeforces","title":"Awesome Substrings","url":"https://codeforces.com/contest/1270/problem/F","difficulty":1,"starred":true,"topic":"pragmas","topics":["pragmas"],"solved":false},{"id":"leetcode_majority_element","judge":"LeetCode","title":"Majority Element","url":"https://leetcode.com/problems/majority-element/","difficulty":1,"starred":true,"topic":"boyer_moore_voting_algorithm_and_misra_gries_algorithm","topics":["boyer_moore_voting_algorithm_and_misra_gries_algorithm"],"solved":true},{"id":"leetcode_majority_element_ii","judge":"LeetCode","title":"Majority Element II","url":"https://leetcode.com/problems/majority-element-ii/","difficulty":1,"starred":true,"topic":"boyer_moore_voting_algorithm_and_misra_gries_algorithm","topics":["boyer_moore_voting_algorithm_and_misra_gries_algorithm"],"solved":false},{"id":"asas","judge":"Other","title":"aassas","url":"asas","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"spoj_adastrng","judge":"SPOJ","title":"Ada and Substring","url":"https://www.spoj.com/problems/ADASTRNG/","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"hackerrank_python_arithmetic_operators","judge":"HackerRank","title":"Arithmetic Operators","url":"https://vjudge.net/problem/HackerRank-python-arithmetic-operators","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"spoj_bac","judge":"SPOJ","title":"Bacterial","url":"https://www.spoj.com/problems/BAC/","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"topcoder_10875","judge":"TopCoder","title":"CarelessSecretary","url":"https://community.topcoder.com/stat?c=problem_statement&pm=10875","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"gym_381668e","judge":"CF Gym","title":"Chat Order","url":"https://vjudge.net/problem/Gym-381668E","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"yosupo_convolution_mod_large","judge":"Library Checker","title":"Convolution (Large)","url":"https://judge.yosupo.jp/problem/convolution_mod_large","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"cf_gym_102644d","judge":"CF Gym","title":"Count Paths","url":"https://codeforces.com/gym/102644/problem/D","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"spoj_csumq","judge":"SPOJ","title":"Cumulative Sum Query","url":"https://www.spoj.com/problems/CSUMQ/","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":true},{"id":"hackerrank_js10_arithmetic_operators","judge":"HackerRank","title":"Day 1: Arithmetic Operators","url":"https://vjudge.net/problem/HackerRank-js10-arithmetic-operators","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"dfdf","judge":"Other","title":"dfdf","url":"sdfsdf","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"codeforces_103260m","judge":"CF Gym","title":"Discrete Logarithm is a Joke","url":"https://codeforces.com/gym/103260/problem/M","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"cf_edu_289390a","judge":"Codeforces","title":"Disjoint Sets Union","url":"https://codeforces.com/edu/course/2/lesson/7/1/practice/contest/289390/problem/A","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"topcoder_6658","judge":"TopCoder","title":"Divisibility","url":"https://community.topcoder.com/stat?c=problem_statement&pm=6658&rd=10068","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"cf_edu_289392c","judge":"Codeforces","title":"Dynamic Connectivity Offline","url":"https://codeforces.com/edu/course/2/lesson/7/3/practice/contest/289392/problem/C","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"cf_gym_102644c","judge":"CF Gym","title":"Fibonacci","url":"https://codeforces.com/gym/102644/problem/C","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"acmsguru_99999203","judge":"Codeforces","title":"Hyperhuffman","url":"https://codeforces.com/problemsets/acmsguru/problem/99999/203","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"hackerrank_si_implement_queue","judge":"HackerRank","title":"Implement Queue","url":"https://vjudge.net/problem/HackerRank-si-implement-queue","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"hackerrank_si_implement_stack","judge":"HackerRank","title":"Implement Stack","url":"https://vjudge.net/problem/HackerRank-si-implement-stack","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"codeforces_1181d","judge":"Codeforces","title":"Irrigation","url":"https://codeforces.com/contest/1181/problem/D","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"leetcode_kth_ancestor_of_a_tree_node","judge":"LeetCode","title":"Kth Ancestor of a Tree Node","url":"https://leetcode.com/problems/kth-ancestor-of-a-tree-node/","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"cf_gym_102644f","judge":"CF Gym","title":"Min Path","url":"https://codeforces.com/gym/102644/problem/F","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"cf_edu_289392b","judge":"Codeforces","title":"Number of Connected Components on Segments","url":"https://codeforces.com/edu/course/2/lesson/7/3/practice/contest/289392/problem/B","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"uva_614","judge":"UVa","title":"Parentheses Balance","url":"https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=614","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"spoj_acmceg2c","judge":"SPOJ","title":"Pick the candies","url":"https://vjudge.net/problem/SPOJ-ACMCEG2C","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"spoj_ptri","judge":"SPOJ","title":"primes triangle (I)","url":"https://www.spoj.com/problems/PTRI/","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"gym_381668b","judge":"CF Gym","title":"priority queue maximum","url":"https://vjudge.net/problem/Gym-381668B","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"sdff","judge":"Other","title":"sdfsf","url":"sdfdf","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"sdsd","judge":"Other","title":"sds","url":"sds","difficulty":1,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"shortest routes ii","judge":"Other","title":"Shortest Routes II","url":"Shortest Routes II","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"codechef_cow3e","judge":"CodeChef","title":"SIMPLE MODIFICATION","url":"https://www.codechef.com/problems/COW3E","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"k","judge":"Vjudge","title":"Sum Digits","url":"https://vjudge.net/contest/556835#problem/K","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"uva_100","judge":"UVa","title":"The 3n + 1 problem","url":"https://vjudge.net/problem/UVA-100","difficulty":1,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"uva_10708","judge":"UVa","title":"Cheetah","url":"https://vjudge.net/problem/UVA-10708","difficulty":2,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"codeforces_919e","judge":"Codeforces","title":"Congruence Equation","url":"https://codeforces.com/problemset/problem/919/E","difficulty":2,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"codeforces_102644c","judge":"CF Gym","title":"Fibonacci","url":"https://codeforces.com/problemset/gymProblem/102644/C","difficulty":2,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"dmoj_fibonacci","judge":"DMOJ","title":"Fibonacci 2D","url":"https://dmoj.uclv.edu.cu/problem/fibonacci","difficulty":2,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"moocast","judge":"Other","title":"https://usaco.org/index.php?page=viewproblem2&cpid=669","url":"Moocast","difficulty":2,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"tree upshot","judge":"Other","title":"https://www.codechef.com/LTIME101B/problems/TREUPS","url":"Tree Upshot","difficulty":2,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"monsters","judge":"Other","title":"Monsters","url":"Monsters","difficulty":2,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"usaco_896","judge":"USACO","title":"Mountain View","url":"https://usaco.org/index.php?page=viewproblem2&cpid=896","difficulty":2,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"usaco_787","judge":"USACO","title":"Rental Service","url":"https://usaco.org/index.php?page=viewproblem2&cpid=787","difficulty":2,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"sdsdsds","judge":"Other","title":"sdsd","url":"sdsdsds","difficulty":2,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"cf_edu_289391j","judge":"USACO","title":"Wormhole Sort","url":"https://usaco.org/index.php?page=viewproblem2&cpid=992","difficulty":2,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"wormhole sort","judge":"Other","title":"Wormhole Sort","url":"Wormhole Sort","difficulty":2,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"wewew","judge":"Other","title":"wwesd","url":"wewew","difficulty":2,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"joi18_commuter_pass","judge":"oj.uz","title":"Commuter Pass","url":"https://oj.uz/problem/view/JOI18_commuter_pass","difficulty":3,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"codechef_cntgrp","judge":"CodeChef","title":"Counting Graphs","url":"https://www.codechef.com/LTIME87A/problems-old/CNTGRP","difficulty":3,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"cses_2168","judge":"CSES","title":"Nested Ranges Check","url":"https://cses.fi/problemset/task/2168","difficulty":3,"starred":true,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"dsfdsf","judge":"Other","title":"sdfsd","url":"dsfdsf","difficulty":3,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"codeforces_1149e","judge":"Codeforces","title":"Election Promises","url":"https://codeforces.com/contest/1149/problem/E","difficulty":4,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"sdfsdf","judge":"Other","title":"423","url":"dsfdsf","difficulty":null,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"dsf","judge":"Other","title":"dsf","url":"dfs","difficulty":null,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"codeforces_1a","judge":"Codeforces","title":"dsfdfs","url":"dsfdf","difficulty":null,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":true},{"id":"codeforces_1b","judge":"Codeforces","title":"dsfdfs","url":"dsfdf","difficulty":null,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false},{"id":"wer","judge":"Other","title":"fgdfg","url":"fgdfgf","difficulty":null,"starred":false,"topic":"uncategorized","topics":["uncategorized"],"solved":false}]}